MCC'2023- Execution of r135-smll-167819414400461

About the Execution of LoLa+red for DoubleExponent-PT-003

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
371.516	84118.00	114763.00	821.60	2 1 256 1 1 1 1 1 1 1 1 1 1 1 1 1	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r135-smll-167819414400461.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
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 r135-smll-167819414400461
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 50K Mar 5 18:22 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 1678329470194

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 02:37:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 02:37:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 02:37:53] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-09 02:37:53] [INFO ] Transformed 163 places.
[2023-03-09 02:37:53] [INFO ] Transformed 148 transitions.
[2023-03-09 02:37:53] [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.
// Phase 1: matrix 148 rows 163 cols
[2023-03-09 02:37:53] [INFO ] Computed 19 place invariants in 30 ms
Incomplete random walk after 10000 steps, including 323 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :8
FORMULA DoubleExponent-PT-003-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 292 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :3
FORMULA DoubleExponent-PT-003-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :1
[2023-03-09 02:37:54] [INFO ] Invariant cache hit.
[2023-03-09 02:37:54] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2023-03-09 02:37:54] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2023-03-09 02:37:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:37:54] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-09 02:37:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:37:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-09 02:37:54] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2023-03-09 02:37:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:37:54] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2023-03-09 02:37:54] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 5 ms to minimize.
[2023-03-09 02:37:55] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 1 ms to minimize.
[2023-03-09 02:37:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2023-03-09 02:37:55] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 28 ms.
[2023-03-09 02:37:55] [INFO ] Added : 100 causal constraints over 20 iterations in 579 ms. Result :sat
Minimization took 62 ms.
[2023-03-09 02:37:55] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-09 02:37:55] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2023-03-09 02:37:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:37:55] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-03-09 02:37:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:37:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-09 02:37:56] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2023-03-09 02:37:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:37:56] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2023-03-09 02:37:56] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 1 ms to minimize.
[2023-03-09 02:37:56] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
[2023-03-09 02:37:56] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 1 ms to minimize.
[2023-03-09 02:37:56] [INFO ] Deduced a trap composed of 68 places in 145 ms of which 1 ms to minimize.
[2023-03-09 02:37:56] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 1 ms to minimize.
[2023-03-09 02:37:57] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 1 ms to minimize.
[2023-03-09 02:37:57] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 0 ms to minimize.
[2023-03-09 02:37:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 906 ms
[2023-03-09 02:37:57] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-09 02:37:57] [INFO ] Added : 133 causal constraints over 27 iterations in 786 ms. Result :sat
Minimization took 135 ms.
[2023-03-09 02:37:58] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-09 02:37:58] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-09 02:37:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:37:58] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-09 02:37:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:37:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-09 02:37:58] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-09 02:37:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:37:58] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-09 02:37:58] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 1 ms to minimize.
[2023-03-09 02:37:58] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 1 ms to minimize.
[2023-03-09 02:37:58] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 1 ms to minimize.
[2023-03-09 02:37:58] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 1 ms to minimize.
[2023-03-09 02:37:58] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 0 ms to minimize.
[2023-03-09 02:37:59] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 1 ms to minimize.
[2023-03-09 02:37:59] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
[2023-03-09 02:37:59] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 1 ms to minimize.
[2023-03-09 02:37:59] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 1 ms to minimize.
[2023-03-09 02:37:59] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 1 ms to minimize.
[2023-03-09 02:37:59] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 1 ms to minimize.
[2023-03-09 02:37:59] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 1 ms to minimize.
[2023-03-09 02:37:59] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 2 ms to minimize.
[2023-03-09 02:38:00] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 1 ms to minimize.
[2023-03-09 02:38:00] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 1 ms to minimize.
[2023-03-09 02:38:00] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1788 ms
[2023-03-09 02:38:00] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-09 02:38:00] [INFO ] Added : 112 causal constraints over 23 iterations in 621 ms. Result :sat
Minimization took 90 ms.
[2023-03-09 02:38:00] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-09 02:38:00] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned unsat
[2023-03-09 02:38:01] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-09 02:38:01] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2023-03-09 02:38:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:01] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-03-09 02:38:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-09 02:38:01] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2023-03-09 02:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:01] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2023-03-09 02:38:01] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-09 02:38:02] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 1 ms to minimize.
[2023-03-09 02:38:02] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 0 ms to minimize.
[2023-03-09 02:38:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 248 ms
[2023-03-09 02:38:02] [INFO ] Added : 143 causal constraints over 30 iterations in 1079 ms. Result :sat
Minimization took 114 ms.
[2023-03-09 02:38:02] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-09 02:38:02] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2023-03-09 02:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:02] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2023-03-09 02:38:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-09 02:38:02] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2023-03-09 02:38:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:02] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-09 02:38:03] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2023-03-09 02:38:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-09 02:38:03] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-09 02:38:03] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2023-03-09 02:38:03] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 0 ms to minimize.
[2023-03-09 02:38:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2023-03-09 02:38:03] [INFO ] Added : 142 causal constraints over 29 iterations in 831 ms. Result :sat
Minimization took 132 ms.
[2023-03-09 02:38:04] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-09 02:38:04] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2023-03-09 02:38:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:04] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2023-03-09 02:38:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-09 02:38:04] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2023-03-09 02:38:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:04] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2023-03-09 02:38:04] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 0 ms to minimize.
[2023-03-09 02:38:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-09 02:38:04] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-09 02:38:04] [INFO ] Added : 101 causal constraints over 21 iterations in 358 ms. Result :sat
Minimization took 59 ms.
[2023-03-09 02:38:04] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-09 02:38:04] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2023-03-09 02:38:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:05] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-09 02:38:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-09 02:38:05] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2023-03-09 02:38:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:05] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-09 02:38:05] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2023-03-09 02:38:05] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 0 ms to minimize.
[2023-03-09 02:38:05] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 1 ms to minimize.
[2023-03-09 02:38:05] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 2 ms to minimize.
[2023-03-09 02:38:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 346 ms
[2023-03-09 02:38:05] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 19 ms.
[2023-03-09 02:38:06] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 4 ms to minimize.
[2023-03-09 02:38:06] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 1 ms to minimize.
[2023-03-09 02:38:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2023-03-09 02:38:06] [INFO ] Added : 145 causal constraints over 30 iterations in 1115 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : [1, -1, 44, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 1, 0, 0, 0, 0]
FORMULA DoubleExponent-PT-003-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 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 158 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 157 transition count 115
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 67 place count 126 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 125 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 125 transition count 107
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 82 place count 118 transition count 107
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 142 place count 88 transition count 77
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 150 place count 84 transition count 77
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 155 place count 84 transition count 72
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 160 place count 79 transition count 72
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 172 place count 79 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 173 place count 78 transition count 71
Applied a total of 173 rules in 105 ms. Remains 78 /163 variables (removed 85) and now considering 71/148 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 78/163 places, 71/148 transitions.
// Phase 1: matrix 71 rows 78 cols
[2023-03-09 02:38:07] [INFO ] Computed 15 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 128385 resets, run finished after 1381 ms. (steps per millisecond=724 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84840 resets, run finished after 812 ms. (steps per millisecond=1231 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84858 resets, run finished after 888 ms. (steps per millisecond=1126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84945 resets, run finished after 740 ms. (steps per millisecond=1351 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85030 resets, run finished after 729 ms. (steps per millisecond=1371 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84362 resets, run finished after 728 ms. (steps per millisecond=1373 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84643 resets, run finished after 726 ms. (steps per millisecond=1377 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84868 resets, run finished after 727 ms. (steps per millisecond=1375 ) properties (out of 7) seen :0
[2023-03-09 02:38:14] [INFO ] Invariant cache hit.
[2023-03-09 02:38:14] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:38:14] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-09 02:38:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:14] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-09 02:38:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:38:14] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 8 ms returned sat
[2023-03-09 02:38:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:14] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-09 02:38:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 02:38:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-09 02:38:14] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 8 ms.
[2023-03-09 02:38:14] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2023-03-09 02:38:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-09 02:38:14] [INFO ] Added : 67 causal constraints over 14 iterations in 252 ms. Result :sat
Minimization took 139 ms.
[2023-03-09 02:38:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:38:15] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-09 02:38:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:15] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-09 02:38:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:38:15] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 8 ms returned sat
[2023-03-09 02:38:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:15] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-09 02:38:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2023-03-09 02:38:15] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 10 ms.
[2023-03-09 02:38:15] [INFO ] Added : 46 causal constraints over 10 iterations in 182 ms. Result :sat
Minimization took 92 ms.
[2023-03-09 02:38:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:38:15] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 8 ms returned sat
[2023-03-09 02:38:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:15] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-09 02:38:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 02:38:15] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-09 02:38:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:15] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-09 02:38:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-09 02:38:15] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 8 ms.
[2023-03-09 02:38:16] [INFO ] Added : 47 causal constraints over 10 iterations in 179 ms. Result :sat
Minimization took 61 ms.
[2023-03-09 02:38:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 02:38:16] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-09 02:38:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:16] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-09 02:38:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:38:16] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-09 02:38:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:16] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-09 02:38:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-09 02:38:16] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 9 ms.
[2023-03-09 02:38:16] [INFO ] Added : 65 causal constraints over 14 iterations in 286 ms. Result :sat
Minimization took 92 ms.
[2023-03-09 02:38:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 02:38:16] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-09 02:38:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:16] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-09 02:38:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 02:38:16] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 8 ms returned sat
[2023-03-09 02:38:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:16] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-09 02:38:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2023-03-09 02:38:16] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 10 ms.
[2023-03-09 02:38:17] [INFO ] Added : 66 causal constraints over 14 iterations in 294 ms. Result :sat
Minimization took 102 ms.
[2023-03-09 02:38:17] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 02:38:17] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-09 02:38:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:17] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-09 02:38:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 02:38:17] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-09 02:38:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:17] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-09 02:38:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-09 02:38:17] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 9 ms.
[2023-03-09 02:38:17] [INFO ] Added : 68 causal constraints over 14 iterations in 309 ms. Result :sat
Minimization took 90 ms.
[2023-03-09 02:38:18] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 02:38:18] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 8 ms returned sat
[2023-03-09 02:38:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:18] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-09 02:38:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:38:18] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 8 ms returned sat
[2023-03-09 02:38:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:18] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-09 02:38:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2023-03-09 02:38:18] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 10 ms.
[2023-03-09 02:38:18] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2023-03-09 02:38:18] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2023-03-09 02:38:18] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2023-03-09 02:38:18] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2023-03-09 02:38:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 266 ms
[2023-03-09 02:38:18] [INFO ] Added : 66 causal constraints over 14 iterations in 590 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : [1, -1, 44, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 71/71 transitions.
Applied a total of 0 rules in 7 ms. Remains 78 /78 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 78/78 places, 71/71 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 71/71 transitions.
Applied a total of 0 rules in 7 ms. Remains 78 /78 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2023-03-09 02:38:19] [INFO ] Invariant cache hit.
[2023-03-09 02:38:19] [INFO ] Implicit Places using invariants in 173 ms returned [23, 43, 48]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 177 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 75/78 places, 71/71 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 73 transition count 69
Applied a total of 4 rules in 14 ms. Remains 73 /75 variables (removed 2) and now considering 69/71 (removed 2) transitions.
// Phase 1: matrix 69 rows 73 cols
[2023-03-09 02:38:19] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-09 02:38:19] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-09 02:38:19] [INFO ] Invariant cache hit.
[2023-03-09 02:38:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 02:38:19] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 73/78 places, 69/71 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 600 ms. Remains : 73/78 places, 69/71 transitions.
[2023-03-09 02:38:19] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144299 resets, run finished after 1335 ms. (steps per millisecond=749 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91386 resets, run finished after 911 ms. (steps per millisecond=1097 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91731 resets, run finished after 696 ms. (steps per millisecond=1436 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91366 resets, run finished after 711 ms. (steps per millisecond=1406 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91229 resets, run finished after 662 ms. (steps per millisecond=1510 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91583 resets, run finished after 869 ms. (steps per millisecond=1150 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91253 resets, run finished after 653 ms. (steps per millisecond=1531 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91477 resets, run finished after 670 ms. (steps per millisecond=1492 ) properties (out of 7) seen :0
[2023-03-09 02:38:26] [INFO ] Invariant cache hit.
[2023-03-09 02:38:26] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-09 02:38:26] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:26] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-09 02:38:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 02:38:26] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:26] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-09 02:38:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 02:38:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2023-03-09 02:38:26] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 9 ms.
[2023-03-09 02:38:26] [INFO ] Added : 36 causal constraints over 8 iterations in 135 ms. Result :sat
Minimization took 54 ms.
[2023-03-09 02:38:26] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 02:38:26] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:26] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-09 02:38:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 02:38:26] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:27] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-09 02:38:27] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-09 02:38:27] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 10 ms.
[2023-03-09 02:38:27] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2023-03-09 02:38:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-09 02:38:27] [INFO ] Added : 42 causal constraints over 9 iterations in 236 ms. Result :sat
Minimization took 89 ms.
[2023-03-09 02:38:27] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 02:38:27] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:27] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-09 02:38:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 02:38:27] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-09 02:38:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:27] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-09 02:38:27] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-09 02:38:27] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 10 ms.
[2023-03-09 02:38:27] [INFO ] Added : 39 causal constraints over 8 iterations in 146 ms. Result :sat
Minimization took 48 ms.
[2023-03-09 02:38:27] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 02:38:27] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:27] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-09 02:38:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 02:38:27] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-09 02:38:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:27] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-09 02:38:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2023-03-09 02:38:28] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 9 ms.
[2023-03-09 02:38:28] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2023-03-09 02:38:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-09 02:38:28] [INFO ] Added : 58 causal constraints over 13 iterations in 313 ms. Result :sat
Minimization took 68 ms.
[2023-03-09 02:38:28] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-09 02:38:28] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:28] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-09 02:38:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 02:38:28] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:28] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-09 02:38:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 14 ms returned sat
[2023-03-09 02:38:28] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 10 ms.
[2023-03-09 02:38:28] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2023-03-09 02:38:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-09 02:38:28] [INFO ] Added : 58 causal constraints over 13 iterations in 320 ms. Result :sat
Minimization took 71 ms.
[2023-03-09 02:38:29] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 02:38:29] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:29] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-09 02:38:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 02:38:29] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:29] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-09 02:38:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-09 02:38:29] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 10 ms.
[2023-03-09 02:38:29] [INFO ] Added : 39 causal constraints over 8 iterations in 146 ms. Result :sat
Minimization took 51 ms.
[2023-03-09 02:38:29] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 02:38:29] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:29] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-09 02:38:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 02:38:29] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:29] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-09 02:38:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-09 02:38:29] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 10 ms.
[2023-03-09 02:38:29] [INFO ] Added : 63 causal constraints over 13 iterations in 270 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [1, -1, 44, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 69/69 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 73/73 places, 69/69 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 69/69 transitions.
Applied a total of 0 rules in 8 ms. Remains 73 /73 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-09 02:38:30] [INFO ] Invariant cache hit.
[2023-03-09 02:38:30] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-09 02:38:30] [INFO ] Invariant cache hit.
[2023-03-09 02:38:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 02:38:30] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-09 02:38:30] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 02:38:30] [INFO ] Invariant cache hit.
[2023-03-09 02:38:30] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 362 ms. Remains : 73/73 places, 69/69 transitions.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-01
[2023-03-09 02:38:30] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1427 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-09 02:38:30] [INFO ] Invariant cache hit.
[2023-03-09 02:38:30] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 02:38:30] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:30] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-09 02:38:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 02:38:30] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-09 02:38:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:30] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-09 02:38:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 02:38:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-09 02:38:30] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 10 ms.
[2023-03-09 02:38:30] [INFO ] Added : 36 causal constraints over 8 iterations in 142 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 69/69 transitions.
Graph (complete) has 231 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 72 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 70 transition count 67
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 70 transition count 65
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 9 place count 68 transition count 65
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 2 with 2 rules applied. Total rules applied 11 place count 67 transition count 64
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 67 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 66 transition count 63
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 66 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 65 transition count 62
Applied a total of 15 rules in 32 ms. Remains 65 /73 variables (removed 8) and now considering 62/69 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 65/73 places, 62/69 transitions.
// Phase 1: matrix 62 rows 65 cols
[2023-03-09 02:38:31] [INFO ] Computed 12 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 144161 resets, run finished after 1147 ms. (steps per millisecond=871 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91600 resets, run finished after 583 ms. (steps per millisecond=1715 ) properties (out of 1) seen :0
[2023-03-09 02:38:32] [INFO ] Invariant cache hit.
[2023-03-09 02:38:32] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-09 02:38:32] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-09 02:38:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:32] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-09 02:38:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 02:38:32] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-09 02:38:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:32] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-09 02:38:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:38:33] [INFO ] [Nat]Added 10 Read/Feed constraints in 8 ms returned sat
[2023-03-09 02:38:33] [INFO ] Computed and/alt/rep : 60/300/60 causal constraints (skipped 1 transitions) in 8 ms.
[2023-03-09 02:38:33] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2023-03-09 02:38:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-09 02:38:33] [INFO ] Added : 49 causal constraints over 11 iterations in 259 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 62/62 transitions.
Applied a total of 0 rules in 5 ms. Remains 65 /65 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 65/65 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 62/62 transitions.
Applied a total of 0 rules in 6 ms. Remains 65 /65 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-09 02:38:33] [INFO ] Invariant cache hit.
[2023-03-09 02:38:33] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-09 02:38:33] [INFO ] Invariant cache hit.
[2023-03-09 02:38:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:38:33] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-09 02:38:33] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 02:38:33] [INFO ] Invariant cache hit.
[2023-03-09 02:38:33] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 503 ms. Remains : 65/65 places, 62/62 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-01 in 3332 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-02
// Phase 1: matrix 69 rows 73 cols
[2023-03-09 02:38:33] [INFO ] Computed 12 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 1451 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 892 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-09 02:38:33] [INFO ] Invariant cache hit.
[2023-03-09 02:38:33] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 02:38:33] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-09 02:38:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:34] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-09 02:38:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 02:38:34] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-09 02:38:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:34] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-09 02:38:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 02:38:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-09 02:38:34] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 10 ms.
[2023-03-09 02:38:34] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2023-03-09 02:38:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-09 02:38:34] [INFO ] Added : 42 causal constraints over 9 iterations in 231 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 69/69 transitions.
Drop transitions 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 73 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 71 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 71 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 70 transition count 66
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 2 with 2 rules applied. Total rules applied 8 place count 69 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 69 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 68 transition count 64
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 68 transition count 60
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 18 place count 64 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 19 place count 64 transition count 60
Applied a total of 19 rules in 31 ms. Remains 64 /73 variables (removed 9) and now considering 60/69 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 64/73 places, 60/69 transitions.
// Phase 1: matrix 60 rows 64 cols
[2023-03-09 02:38:34] [INFO ] Computed 12 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 144282 resets, run finished after 1190 ms. (steps per millisecond=840 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91570 resets, run finished after 589 ms. (steps per millisecond=1697 ) properties (out of 1) seen :0
[2023-03-09 02:38:36] [INFO ] Invariant cache hit.
[2023-03-09 02:38:36] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-09 02:38:36] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-09 02:38:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:36] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-09 02:38:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 02:38:36] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-09 02:38:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:36] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-09 02:38:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:38:36] [INFO ] [Nat]Added 10 Read/Feed constraints in 8 ms returned sat
[2023-03-09 02:38:36] [INFO ] Computed and/alt/rep : 55/282/55 causal constraints (skipped 4 transitions) in 9 ms.
[2023-03-09 02:38:36] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2023-03-09 02:38:36] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2023-03-09 02:38:36] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2023-03-09 02:38:36] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2023-03-09 02:38:36] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2023-03-09 02:38:36] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2023-03-09 02:38:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 382 ms
[2023-03-09 02:38:36] [INFO ] Added : 41 causal constraints over 10 iterations in 544 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 60/60 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 64/64 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 60/60 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-09 02:38:37] [INFO ] Invariant cache hit.
[2023-03-09 02:38:37] [INFO ] Implicit Places using invariants in 134 ms returned [55, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 135 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/64 places, 60/60 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 59
Applied a total of 2 rules in 9 ms. Remains 61 /62 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 61 cols
[2023-03-09 02:38:37] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-09 02:38:37] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-09 02:38:37] [INFO ] Invariant cache hit.
[2023-03-09 02:38:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:38:37] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 61/64 places, 59/60 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 481 ms. Remains : 61/64 places, 59/60 transitions.
[2023-03-09 02:38:37] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144430 resets, run finished after 1262 ms. (steps per millisecond=792 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91424 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties (out of 1) seen :0
[2023-03-09 02:38:39] [INFO ] Invariant cache hit.
[2023-03-09 02:38:39] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-09 02:38:39] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-09 02:38:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:39] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-09 02:38:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-09 02:38:39] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-09 02:38:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:39] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-09 02:38:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:38:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2023-03-09 02:38:39] [INFO ] Computed and/alt/rep : 56/297/56 causal constraints (skipped 2 transitions) in 6 ms.
[2023-03-09 02:38:39] [INFO ] Added : 47 causal constraints over 11 iterations in 122 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 61/61 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2023-03-09 02:38:39] [INFO ] Invariant cache hit.
[2023-03-09 02:38:40] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-09 02:38:40] [INFO ] Invariant cache hit.
[2023-03-09 02:38:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:38:40] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-09 02:38:40] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 02:38:40] [INFO ] Invariant cache hit.
[2023-03-09 02:38:40] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431 ms. Remains : 61/61 places, 59/59 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-02 in 6524 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-03
// Phase 1: matrix 69 rows 73 cols
[2023-03-09 02:38:40] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1413 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 934 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-09 02:38:40] [INFO ] Invariant cache hit.
[2023-03-09 02:38:40] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 02:38:40] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:40] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-09 02:38:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 02:38:40] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:40] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-09 02:38:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 02:38:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-09 02:38:40] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 10 ms.
[2023-03-09 02:38:40] [INFO ] Added : 39 causal constraints over 8 iterations in 147 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 69/69 transitions.
Graph (complete) has 231 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 72 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 70 transition count 67
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 70 transition count 65
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 9 place count 68 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 68 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 67 transition count 64
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 14 place count 67 transition count 61
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 17 place count 64 transition count 61
Applied a total of 17 rules in 22 ms. Remains 64 /73 variables (removed 9) and now considering 61/69 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 64/73 places, 61/69 transitions.
// Phase 1: matrix 61 rows 64 cols
[2023-03-09 02:38:40] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 143798 resets, run finished after 1031 ms. (steps per millisecond=969 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91255 resets, run finished after 601 ms. (steps per millisecond=1663 ) properties (out of 1) seen :0
[2023-03-09 02:38:42] [INFO ] Invariant cache hit.
[2023-03-09 02:38:42] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 02:38:42] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-09 02:38:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:42] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-09 02:38:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-09 02:38:42] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-09 02:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:42] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-09 02:38:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:38:42] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2023-03-09 02:38:42] [INFO ] Computed and/alt/rep : 58/291/58 causal constraints (skipped 2 transitions) in 5 ms.
[2023-03-09 02:38:42] [INFO ] Added : 34 causal constraints over 7 iterations in 76 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 64/64 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-09 02:38:42] [INFO ] Invariant cache hit.
[2023-03-09 02:38:42] [INFO ] Implicit Places using invariants in 61 ms returned [55, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 62 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/64 places, 61/61 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 60
Applied a total of 2 rules in 4 ms. Remains 61 /62 variables (removed 1) and now considering 60/61 (removed 1) transitions.
// Phase 1: matrix 60 rows 61 cols
[2023-03-09 02:38:42] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-09 02:38:42] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-09 02:38:42] [INFO ] Invariant cache hit.
[2023-03-09 02:38:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:38:43] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 61/64 places, 60/61 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 395 ms. Remains : 61/64 places, 60/61 transitions.
[2023-03-09 02:38:43] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144206 resets, run finished after 1123 ms. (steps per millisecond=890 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91577 resets, run finished after 603 ms. (steps per millisecond=1658 ) properties (out of 1) seen :0
[2023-03-09 02:38:44] [INFO ] Invariant cache hit.
[2023-03-09 02:38:44] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-09 02:38:44] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-09 02:38:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:44] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-09 02:38:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-09 02:38:45] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-09 02:38:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:45] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-09 02:38:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:38:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2023-03-09 02:38:45] [INFO ] Computed and/alt/rep : 58/296/58 causal constraints (skipped 1 transitions) in 6 ms.
[2023-03-09 02:38:45] [INFO ] Added : 37 causal constraints over 8 iterations in 84 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 61/61 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-09 02:38:45] [INFO ] Invariant cache hit.
[2023-03-09 02:38:45] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-09 02:38:45] [INFO ] Invariant cache hit.
[2023-03-09 02:38:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:38:45] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-09 02:38:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 02:38:45] [INFO ] Invariant cache hit.
[2023-03-09 02:38:45] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 61/61 places, 60/60 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-03 in 5123 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-09
// Phase 1: matrix 69 rows 73 cols
[2023-03-09 02:38:45] [INFO ] Computed 12 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 1428 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-09 02:38:45] [INFO ] Invariant cache hit.
[2023-03-09 02:38:45] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 02:38:45] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:45] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-09 02:38:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 02:38:45] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:45] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-09 02:38:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 02:38:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2023-03-09 02:38:45] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 10 ms.
[2023-03-09 02:38:46] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2023-03-09 02:38:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-09 02:38:46] [INFO ] Added : 58 causal constraints over 13 iterations in 301 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 69/69 transitions.
Graph (complete) has 231 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 68
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 71 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 70 transition count 67
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 5 place count 70 transition count 65
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9 place count 68 transition count 65
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 3 with 2 rules applied. Total rules applied 11 place count 67 transition count 64
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 67 transition count 60
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 19 place count 63 transition count 60
Applied a total of 19 rules in 16 ms. Remains 63 /73 variables (removed 10) and now considering 60/69 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 63/73 places, 60/69 transitions.
// Phase 1: matrix 60 rows 63 cols
[2023-03-09 02:38:46] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 144147 resets, run finished after 1115 ms. (steps per millisecond=896 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91168 resets, run finished after 601 ms. (steps per millisecond=1663 ) properties (out of 1) seen :0
[2023-03-09 02:38:47] [INFO ] Invariant cache hit.
[2023-03-09 02:38:47] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 02:38:47] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-09 02:38:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:48] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-09 02:38:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 02:38:48] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-09 02:38:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:48] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-09 02:38:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:38:48] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2023-03-09 02:38:48] [INFO ] Computed and/alt/rep : 56/295/56 causal constraints (skipped 3 transitions) in 6 ms.
[2023-03-09 02:38:48] [INFO ] Added : 54 causal constraints over 12 iterations in 132 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 63/63 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-09 02:38:48] [INFO ] Invariant cache hit.
[2023-03-09 02:38:48] [INFO ] Implicit Places using invariants in 79 ms returned [54, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/63 places, 60/60 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 59
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 59
Applied a total of 2 rules in 5 ms. Remains 60 /61 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-09 02:38:48] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-09 02:38:48] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-09 02:38:48] [INFO ] Invariant cache hit.
[2023-03-09 02:38:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:38:48] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 60/63 places, 59/60 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 447 ms. Remains : 60/63 places, 59/60 transitions.
[2023-03-09 02:38:48] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 143976 resets, run finished after 1112 ms. (steps per millisecond=899 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91257 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 1) seen :0
[2023-03-09 02:38:50] [INFO ] Invariant cache hit.
[2023-03-09 02:38:50] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-09 02:38:50] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-09 02:38:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:50] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-09 02:38:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-09 02:38:50] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-09 02:38:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:50] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-09 02:38:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:38:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2023-03-09 02:38:50] [INFO ] Computed and/alt/rep : 57/309/57 causal constraints (skipped 1 transitions) in 6 ms.
[2023-03-09 02:38:50] [INFO ] Added : 54 causal constraints over 12 iterations in 148 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 60/60 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2023-03-09 02:38:50] [INFO ] Invariant cache hit.
[2023-03-09 02:38:50] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-09 02:38:50] [INFO ] Invariant cache hit.
[2023-03-09 02:38:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:38:51] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-09 02:38:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 02:38:51] [INFO ] Invariant cache hit.
[2023-03-09 02:38:51] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 408 ms. Remains : 60/60 places, 59/59 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-09 in 5671 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-10
// Phase 1: matrix 69 rows 73 cols
[2023-03-09 02:38:51] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1409 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 914 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-09 02:38:51] [INFO ] Invariant cache hit.
[2023-03-09 02:38:51] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 02:38:51] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-09 02:38:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:51] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-09 02:38:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 02:38:51] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:51] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-09 02:38:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 02:38:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 15 ms returned sat
[2023-03-09 02:38:51] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 10 ms.
[2023-03-09 02:38:51] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2023-03-09 02:38:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-09 02:38:51] [INFO ] Added : 58 causal constraints over 13 iterations in 320 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 69/69 transitions.
Graph (complete) has 231 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 71 transition count 68
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 71 transition count 66
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 7 place count 69 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 68 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 68 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 67 transition count 64
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 67 transition count 60
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 19 place count 63 transition count 60
Applied a total of 19 rules in 19 ms. Remains 63 /73 variables (removed 10) and now considering 60/69 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 63/73 places, 60/69 transitions.
// Phase 1: matrix 60 rows 63 cols
[2023-03-09 02:38:51] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144215 resets, run finished after 1024 ms. (steps per millisecond=976 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91222 resets, run finished after 735 ms. (steps per millisecond=1360 ) properties (out of 1) seen :0
[2023-03-09 02:38:53] [INFO ] Invariant cache hit.
[2023-03-09 02:38:53] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 02:38:53] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:53] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-09 02:38:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 02:38:53] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:53] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-09 02:38:53] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 02:38:53] [INFO ] [Nat]Added 9 Read/Feed constraints in 9 ms returned sat
[2023-03-09 02:38:53] [INFO ] Computed and/alt/rep : 55/284/55 causal constraints (skipped 4 transitions) in 8 ms.
[2023-03-09 02:38:54] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2023-03-09 02:38:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-09 02:38:54] [INFO ] Added : 41 causal constraints over 9 iterations in 222 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 63/63 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-09 02:38:54] [INFO ] Invariant cache hit.
[2023-03-09 02:38:54] [INFO ] Implicit Places using invariants in 130 ms returned [54, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 131 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/63 places, 60/60 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 59
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 59
Applied a total of 2 rules in 10 ms. Remains 60 /61 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-09 02:38:54] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-09 02:38:54] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-09 02:38:54] [INFO ] Invariant cache hit.
[2023-03-09 02:38:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 02:38:54] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 60/63 places, 59/60 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 486 ms. Remains : 60/63 places, 59/60 transitions.
[2023-03-09 02:38:54] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 143744 resets, run finished after 1338 ms. (steps per millisecond=747 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91657 resets, run finished after 603 ms. (steps per millisecond=1658 ) properties (out of 1) seen :0
[2023-03-09 02:38:56] [INFO ] Invariant cache hit.
[2023-03-09 02:38:56] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-09 02:38:56] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-09 02:38:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:56] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 02:38:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-09 02:38:56] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-09 02:38:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:56] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-09 02:38:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 02:38:56] [INFO ] [Nat]Added 9 Read/Feed constraints in 6 ms returned sat
[2023-03-09 02:38:56] [INFO ] Computed and/alt/rep : 55/290/55 causal constraints (skipped 3 transitions) in 6 ms.
[2023-03-09 02:38:57] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2023-03-09 02:38:57] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 3 ms to minimize.
[2023-03-09 02:38:57] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2023-03-09 02:38:57] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-03-09 02:38:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 242 ms
[2023-03-09 02:38:57] [INFO ] Added : 51 causal constraints over 13 iterations in 480 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 60/60 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2023-03-09 02:38:57] [INFO ] Invariant cache hit.
[2023-03-09 02:38:57] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-09 02:38:57] [INFO ] Invariant cache hit.
[2023-03-09 02:38:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 02:38:57] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-09 02:38:57] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 02:38:57] [INFO ] Invariant cache hit.
[2023-03-09 02:38:57] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 455 ms. Remains : 60/60 places, 59/59 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-10 in 6614 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-13
// Phase 1: matrix 69 rows 73 cols
[2023-03-09 02:38:57] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1405 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-09 02:38:57] [INFO ] Invariant cache hit.
[2023-03-09 02:38:57] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 02:38:57] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:57] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-09 02:38:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 02:38:58] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:38:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:58] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-09 02:38:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 02:38:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-09 02:38:58] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 14 ms.
[2023-03-09 02:38:58] [INFO ] Added : 39 causal constraints over 8 iterations in 147 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 69/69 transitions.
Graph (complete) has 231 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 71 transition count 68
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 71 transition count 66
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 7 place count 69 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 68 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 68 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 67 transition count 64
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 67 transition count 60
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 19 place count 63 transition count 60
Applied a total of 19 rules in 18 ms. Remains 63 /73 variables (removed 10) and now considering 60/69 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 63/73 places, 60/69 transitions.
// Phase 1: matrix 60 rows 63 cols
[2023-03-09 02:38:58] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144244 resets, run finished after 1078 ms. (steps per millisecond=927 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91609 resets, run finished after 798 ms. (steps per millisecond=1253 ) properties (out of 1) seen :0
[2023-03-09 02:39:00] [INFO ] Invariant cache hit.
[2023-03-09 02:39:00] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-09 02:39:00] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-09 02:39:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:39:00] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-09 02:39:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:39:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 02:39:00] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-09 02:39:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:39:00] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-09 02:39:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 02:39:00] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2023-03-09 02:39:00] [INFO ] Computed and/alt/rep : 53/269/53 causal constraints (skipped 6 transitions) in 10 ms.
[2023-03-09 02:39:00] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2023-03-09 02:39:00] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2023-03-09 02:39:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2023-03-09 02:39:00] [INFO ] Added : 50 causal constraints over 10 iterations in 215 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 63/63 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-09 02:39:00] [INFO ] Invariant cache hit.
[2023-03-09 02:39:00] [INFO ] Implicit Places using invariants in 73 ms returned [53, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 74 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/63 places, 60/60 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 59
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 59
Applied a total of 2 rules in 4 ms. Remains 60 /61 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-09 02:39:00] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-09 02:39:00] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-09 02:39:00] [INFO ] Invariant cache hit.
[2023-03-09 02:39:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 02:39:00] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 60/63 places, 59/60 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 330 ms. Remains : 60/63 places, 59/60 transitions.
[2023-03-09 02:39:00] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144522 resets, run finished after 1225 ms. (steps per millisecond=816 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91545 resets, run finished after 600 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-09 02:39:02] [INFO ] Invariant cache hit.
[2023-03-09 02:39:02] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-09 02:39:02] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-09 02:39:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:39:02] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-09 02:39:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:39:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-09 02:39:02] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-09 02:39:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:39:02] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-09 02:39:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 02:39:02] [INFO ] [Nat]Added 9 Read/Feed constraints in 4 ms returned sat
[2023-03-09 02:39:02] [INFO ] Computed and/alt/rep : 54/284/54 causal constraints (skipped 4 transitions) in 5 ms.
[2023-03-09 02:39:03] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2023-03-09 02:39:03] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2023-03-09 02:39:03] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2023-03-09 02:39:03] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2023-03-09 02:39:03] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 2 ms to minimize.
[2023-03-09 02:39:03] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2023-03-09 02:39:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 235 ms
[2023-03-09 02:39:03] [INFO ] Added : 48 causal constraints over 10 iterations in 352 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 60/60 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2023-03-09 02:39:03] [INFO ] Invariant cache hit.
[2023-03-09 02:39:03] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-09 02:39:03] [INFO ] Invariant cache hit.
[2023-03-09 02:39:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 02:39:03] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-09 02:39:03] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 02:39:03] [INFO ] Invariant cache hit.
[2023-03-09 02:39:03] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 359 ms. Remains : 60/60 places, 59/59 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-13 in 5859 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-14
// Phase 1: matrix 69 rows 73 cols
[2023-03-09 02:39:03] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-09 02:39:03] [INFO ] Invariant cache hit.
[2023-03-09 02:39:03] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 02:39:03] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:39:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:39:03] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-09 02:39:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:39:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 02:39:03] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-09 02:39:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:39:03] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-09 02:39:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 02:39:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-09 02:39:03] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 8 ms.
[2023-03-09 02:39:04] [INFO ] Added : 63 causal constraints over 13 iterations in 277 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 69/69 transitions.
Graph (complete) has 231 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 72 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 70 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 70 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 69 transition count 66
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 2 with 2 rules applied. Total rules applied 9 place count 68 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 68 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 67 transition count 64
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 67 transition count 60
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 19 place count 63 transition count 60
Applied a total of 19 rules in 18 ms. Remains 63 /73 variables (removed 10) and now considering 60/69 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 63/73 places, 60/69 transitions.
// Phase 1: matrix 60 rows 63 cols
[2023-03-09 02:39:04] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 144187 resets, run finished after 1066 ms. (steps per millisecond=938 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91376 resets, run finished after 605 ms. (steps per millisecond=1652 ) properties (out of 1) seen :0
[2023-03-09 02:39:06] [INFO ] Invariant cache hit.
[2023-03-09 02:39:06] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 02:39:06] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-09 02:39:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:39:06] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-09 02:39:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:39:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-09 02:39:06] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-09 02:39:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:39:06] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-09 02:39:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:39:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 11 ms returned sat
[2023-03-09 02:39:06] [INFO ] Computed and/alt/rep : 55/278/55 causal constraints (skipped 4 transitions) in 5 ms.
[2023-03-09 02:39:06] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2023-03-09 02:39:06] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2023-03-09 02:39:06] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2023-03-09 02:39:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 121 ms
[2023-03-09 02:39:06] [INFO ] Added : 41 causal constraints over 9 iterations in 223 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 63/63 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-09 02:39:06] [INFO ] Invariant cache hit.
[2023-03-09 02:39:06] [INFO ] Implicit Places using invariants in 131 ms returned [54, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 132 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/63 places, 60/60 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 59
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 59
Applied a total of 2 rules in 5 ms. Remains 60 /61 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-09 02:39:06] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-09 02:39:06] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-09 02:39:06] [INFO ] Invariant cache hit.
[2023-03-09 02:39:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:39:06] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 60/63 places, 59/60 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 491 ms. Remains : 60/63 places, 59/60 transitions.
[2023-03-09 02:39:06] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144063 resets, run finished after 1018 ms. (steps per millisecond=982 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91449 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 1) seen :0
[2023-03-09 02:39:08] [INFO ] Invariant cache hit.
[2023-03-09 02:39:08] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-09 02:39:08] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-09 02:39:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:39:08] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-09 02:39:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:39:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-09 02:39:08] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-09 02:39:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:39:08] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-09 02:39:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:39:08] [INFO ] [Nat]Added 10 Read/Feed constraints in 8 ms returned sat
[2023-03-09 02:39:08] [INFO ] Computed and/alt/rep : 56/293/56 causal constraints (skipped 2 transitions) in 5 ms.
[2023-03-09 02:39:08] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2023-03-09 02:39:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-09 02:39:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2023-03-09 02:39:08] [INFO ] Added : 56 causal constraints over 12 iterations in 275 ms. Result :sat
Minimization took 111 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 60/60 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2023-03-09 02:39:09] [INFO ] Invariant cache hit.
[2023-03-09 02:39:09] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-09 02:39:09] [INFO ] Invariant cache hit.
[2023-03-09 02:39:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 02:39:09] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-09 02:39:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 02:39:09] [INFO ] Invariant cache hit.
[2023-03-09 02:39:09] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 440 ms. Remains : 60/60 places, 59/59 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-14 in 5909 ms.
[2023-03-09 02:39:09] [INFO ] Flatten gal took : 72 ms
[2023-03-09 02:39:09] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-09 02:39:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 73 places, 69 transitions and 308 arcs took 2 ms.
Total runtime 76444 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DoubleExponent-PT-003
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
Upper Bounds

FORMULA DoubleExponent-PT-003-UpperBounds-09 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-UpperBounds-02 256 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-UpperBounds-03 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-UpperBounds-01 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678329554312

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 24 (type EXCL) for 9 DoubleExponent-PT-003-UpperBounds-09
lola: time limit : 360 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 22 (type FNDP) for 9 DoubleExponent-PT-003-UpperBounds-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 23 (type EQUN) for 9 DoubleExponent-PT-003-UpperBounds-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type FNDP) for 0 DoubleExponent-PT-003-UpperBounds-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
sara: try reading problem file /home/mcc/execution/374/UpperBounds-23.sara.
sara: place or transition ordering is non-deterministic
lola: REPORT NUM
lola: FINISHED task # 24 (type EXCL) for DoubleExponent-PT-003-UpperBounds-09
lola: markings : 45627
lola: fired transitions : 45626
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 22 (type FNDP) for DoubleExponent-PT-003-UpperBounds-09 (obsolete)
lola: CANCELED task # 23 (type EQUN) for DoubleExponent-PT-003-UpperBounds-09 (obsolete)
lola: LAUNCH task # 27 (type EXCL) for 3 DoubleExponent-PT-003-UpperBounds-02
lola: time limit : 400 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 34 (type FNDP) for 6 DoubleExponent-PT-003-UpperBounds-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 35 (type EQUN) for 6 DoubleExponent-PT-003-UpperBounds-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1073741824
sara: try reading problem file /home/mcc/execution/374/UpperBounds-35.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 14)
sara: warning, failure of lp_solve (at job 156)
lola: REPORT NUM
lola: FINISHED task # 27 (type EXCL) for DoubleExponent-PT-003-UpperBounds-02
lola: markings : 758750
lola: fired transitions : 758749
lola: time used : 3.000000
lola: memory pages used : 3
lola: LAUNCH task # 38 (type EXCL) for 12 DoubleExponent-PT-003-UpperBounds-10
lola: time limit : 449 sec
lola: memory limit: 32 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 38 (type EXCL) for DoubleExponent-PT-003-UpperBounds-10
lola: markings : 45628
lola: fired transitions : 45627
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 32 (type EXCL) for 15 DoubleExponent-PT-003-UpperBounds-13
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 32 (type EXCL) for DoubleExponent-PT-003-UpperBounds-13
lola: markings : 250
lola: fired transitions : 249
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 41 (type EXCL) for 18 DoubleExponent-PT-003-UpperBounds-14
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 41 (type EXCL) for DoubleExponent-PT-003-UpperBounds-14
lola: markings : 593
lola: fired transitions : 592
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 36 (type EXCL) for 6 DoubleExponent-PT-003-UpperBounds-03
lola: time limit : 1798 sec
lola: memory limit: 32 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 36 (type EXCL) for DoubleExponent-PT-003-UpperBounds-03
lola: markings : 1097
lola: fired transitions : 1096
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 34 (type FNDP) for DoubleExponent-PT-003-UpperBounds-03 (obsolete)
lola: CANCELED task # 35 (type EQUN) for DoubleExponent-PT-003-UpperBounds-03 (obsolete)
lola: LAUNCH task # 30 (type EXCL) for 0 DoubleExponent-PT-003-UpperBounds-01
lola: time limit : 3597 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 29 (type EQUN) for 0 DoubleExponent-PT-003-UpperBounds-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 30 (type EXCL) for DoubleExponent-PT-003-UpperBounds-01
lola: markings : 250
lola: fired transitions : 249
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 28 (type FNDP) for DoubleExponent-PT-003-UpperBounds-01 (obsolete)
lola: CANCELED task # 29 (type EQUN) for DoubleExponent-PT-003-UpperBounds-01 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-003-UpperBounds-01: BOUND 1 state space
DoubleExponent-PT-003-UpperBounds-02: BOUND 256 state space
DoubleExponent-PT-003-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-003-UpperBounds-09: BOUND 1 state space
DoubleExponent-PT-003-UpperBounds-10: BOUND 1 state space
DoubleExponent-PT-003-UpperBounds-13: BOUND 1 state space
DoubleExponent-PT-003-UpperBounds-14: BOUND 1 state space

Time elapsed: 3 secs. Pages in use: 3

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="lolaxred"
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-5348"
echo " Executing tool lolaxred"
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 r135-smll-167819414400461"
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 ;