MCC'2023- Execution of r137-smll-167819418500453

About the Execution of LTSMin+red for DoubleExponent-PT-002

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
344.315	37824.00	52614.00	508.80	16 4 1 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.r137-smll-167819418500453.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 ltsminxred
Input is DoubleExponent-PT-002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418500453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.7K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 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:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 13:32 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 33K 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-002-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678856540471

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 05:02:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-15 05:02:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 05:02:23] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-15 05:02:23] [INFO ] Transformed 110 places.
[2023-03-15 05:02:23] [INFO ] Transformed 98 transitions.
[2023-03-15 05:02:23] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 98 rows 110 cols
[2023-03-15 05:02:23] [INFO ] Computed 14 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 346 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :8
FORMULA DoubleExponent-PT-002-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :7
FORMULA DoubleExponent-PT-002-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
[2023-03-15 05:02:23] [INFO ] Invariant cache hit.
[2023-03-15 05:02:23] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2023-03-15 05:02:23] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-15 05:02:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:23] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-15 05:02:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-15 05:02:23] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-15 05:02:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:23] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-15 05:02:24] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 4 ms to minimize.
[2023-03-15 05:02:24] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2023-03-15 05:02:24] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2023-03-15 05:02:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 459 ms
[2023-03-15 05:02:24] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-15 05:02:24] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 2 ms to minimize.
[2023-03-15 05:02:24] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2023-03-15 05:02:24] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2023-03-15 05:02:25] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 2 ms to minimize.
[2023-03-15 05:02:25] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2023-03-15 05:02:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 401 ms
[2023-03-15 05:02:25] [INFO ] Added : 94 causal constraints over 19 iterations in 799 ms. Result :sat
Minimization took 80 ms.
[2023-03-15 05:02:25] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-15 05:02:25] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 05:02:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:25] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-15 05:02:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-15 05:02:25] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 05:02:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:25] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-15 05:02:25] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2023-03-15 05:02:25] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2023-03-15 05:02:25] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2023-03-15 05:02:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 189 ms
[2023-03-15 05:02:25] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-15 05:02:25] [INFO ] Added : 88 causal constraints over 18 iterations in 244 ms. Result :sat
Minimization took 58 ms.
[2023-03-15 05:02:26] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-15 05:02:26] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 05:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:26] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-15 05:02:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-15 05:02:26] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 05:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:26] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-15 05:02:26] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 0 ms to minimize.
[2023-03-15 05:02:26] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2023-03-15 05:02:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2023-03-15 05:02:26] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-15 05:02:26] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2023-03-15 05:02:26] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 0 ms to minimize.
[2023-03-15 05:02:26] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 0 ms to minimize.
[2023-03-15 05:02:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 217 ms
[2023-03-15 05:02:26] [INFO ] Added : 94 causal constraints over 19 iterations in 512 ms. Result :sat
Minimization took 56 ms.
[2023-03-15 05:02:27] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-15 05:02:27] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 8 ms returned sat
[2023-03-15 05:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:27] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-15 05:02:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-15 05:02:27] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 05:02:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:27] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-15 05:02:27] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2023-03-15 05:02:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-15 05:02:27] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-15 05:02:27] [INFO ] Added : 90 causal constraints over 18 iterations in 271 ms. Result :sat
Minimization took 38 ms.
[2023-03-15 05:02:27] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-15 05:02:27] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned unsat
[2023-03-15 05:02:27] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-15 05:02:27] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 05:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:27] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-15 05:02:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-15 05:02:27] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:27] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-15 05:02:27] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2023-03-15 05:02:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-15 05:02:27] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-15 05:02:28] [INFO ] Added : 91 causal constraints over 19 iterations in 244 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, 12, 1, 1, 1] Max seen :[2, 2, 0, 0, 1, 0]
FORMULA DoubleExponent-PT-002-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 107 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 107 transition count 80
Reduce places removed 18 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 89 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 87 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 41 place count 87 transition count 73
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 51 place count 82 transition count 73
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 93 place count 61 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 97 place count 59 transition count 52
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 102 place count 59 transition count 47
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 107 place count 54 transition count 47
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 115 place count 54 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 53 transition count 46
Applied a total of 116 rules in 64 ms. Remains 53 /110 variables (removed 57) and now considering 46/98 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 53/110 places, 46/98 transitions.
// Phase 1: matrix 46 rows 53 cols
[2023-03-15 05:02:28] [INFO ] Computed 11 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 128178 resets, run finished after 1131 ms. (steps per millisecond=884 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 84595 resets, run finished after 820 ms. (steps per millisecond=1219 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 84745 resets, run finished after 1063 ms. (steps per millisecond=940 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 84833 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 84519 resets, run finished after 738 ms. (steps per millisecond=1355 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 84502 resets, run finished after 705 ms. (steps per millisecond=1418 ) properties (out of 5) seen :8
[2023-03-15 05:02:33] [INFO ] Invariant cache hit.
[2023-03-15 05:02:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:33] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 05:02:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:33] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-15 05:02:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:02:33] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:33] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-15 05:02:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:33] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-15 05:02:33] [INFO ] Computed and/alt/rep : 45/175/45 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 05:02:33] [INFO ] Added : 39 causal constraints over 9 iterations in 85 ms. Result :sat
Minimization took 22 ms.
[2023-03-15 05:02:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:33] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:34] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-15 05:02:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:02:34] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-15 05:02:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:34] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-15 05:02:34] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-15 05:02:34] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2023-03-15 05:02:34] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2023-03-15 05:02:34] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-15 05:02:34] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-15 05:02:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 157 ms
[2023-03-15 05:02:34] [INFO ] Computed and/alt/rep : 45/175/45 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 05:02:34] [INFO ] Added : 31 causal constraints over 7 iterations in 72 ms. Result :sat
Minimization took 23 ms.
[2023-03-15 05:02:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:02:34] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:34] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-15 05:02:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:34] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-15 05:02:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:34] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-15 05:02:34] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-15 05:02:34] [INFO ] Computed and/alt/rep : 45/175/45 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 05:02:34] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2023-03-15 05:02:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-15 05:02:34] [INFO ] Added : 42 causal constraints over 9 iterations in 135 ms. Result :sat
Minimization took 30 ms.
[2023-03-15 05:02:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:02:34] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:34] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-15 05:02:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:34] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:34] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-15 05:02:34] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-15 05:02:34] [INFO ] Computed and/alt/rep : 45/175/45 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 05:02:34] [INFO ] Added : 38 causal constraints over 8 iterations in 74 ms. Result :sat
Minimization took 28 ms.
[2023-03-15 05:02:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:02:34] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2023-03-15 05:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:34] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-15 05:02:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:02:34] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-15 05:02:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:34] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-15 05:02:34] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-15 05:02:34] [INFO ] Computed and/alt/rep : 45/175/45 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-15 05:02:35] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2023-03-15 05:02:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-15 05:02:35] [INFO ] Added : 40 causal constraints over 9 iterations in 134 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, 12, 1, 1] Max seen :[4, 4, 0, 0, 0]
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 46/46 transitions.
Applied a total of 0 rules in 4 ms. Remains 53 /53 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 53/53 places, 46/46 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-03-15 05:02:35] [INFO ] Invariant cache hit.
[2023-03-15 05:02:35] [INFO ] Implicit Places using invariants in 71 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 52/53 places, 46/46 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 45
Applied a total of 2 rules in 7 ms. Remains 51 /52 variables (removed 1) and now considering 45/46 (removed 1) transitions.
// Phase 1: matrix 45 rows 51 cols
[2023-03-15 05:02:35] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-15 05:02:35] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-15 05:02:35] [INFO ] Invariant cache hit.
[2023-03-15 05:02:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:35] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [17, 22]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 207 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 49/53 places, 45/46 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 49 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 44
Applied a total of 2 rules in 7 ms. Remains 48 /49 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 48 cols
[2023-03-15 05:02:35] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-15 05:02:35] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-15 05:02:35] [INFO ] Invariant cache hit.
[2023-03-15 05:02:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:35] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 48/53 places, 44/46 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 463 ms. Remains : 48/53 places, 44/46 transitions.
[2023-03-15 05:02:35] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144257 resets, run finished after 880 ms. (steps per millisecond=1136 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 91395 resets, run finished after 632 ms. (steps per millisecond=1582 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 91609 resets, run finished after 627 ms. (steps per millisecond=1594 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 91592 resets, run finished after 627 ms. (steps per millisecond=1594 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 91155 resets, run finished after 629 ms. (steps per millisecond=1589 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 91272 resets, run finished after 682 ms. (steps per millisecond=1466 ) properties (out of 5) seen :8
[2023-03-15 05:02:39] [INFO ] Invariant cache hit.
[2023-03-15 05:02:39] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:39] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 8 ms returned sat
[2023-03-15 05:02:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:39] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-15 05:02:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:39] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:39] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-15 05:02:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:39] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-15 05:02:39] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 05:02:40] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2023-03-15 05:02:40] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2023-03-15 05:02:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2023-03-15 05:02:40] [INFO ] Added : 36 causal constraints over 8 iterations in 149 ms. Result :sat
Minimization took 46 ms.
[2023-03-15 05:02:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:40] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-15 05:02:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:40] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-15 05:02:40] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2023-03-15 05:02:40] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2023-03-15 05:02:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-15 05:02:40] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-15 05:02:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 153 ms
[2023-03-15 05:02:40] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 05:02:40] [INFO ] Added : 18 causal constraints over 4 iterations in 54 ms. Result :sat
Minimization took 15 ms.
[2023-03-15 05:02:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:40] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-15 05:02:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:40] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-15 05:02:40] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 05:02:40] [INFO ] Added : 32 causal constraints over 7 iterations in 65 ms. Result :sat
Minimization took 21 ms.
[2023-03-15 05:02:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:40] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-15 05:02:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:40] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-15 05:02:40] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 05:02:40] [INFO ] Added : 32 causal constraints over 7 iterations in 65 ms. Result :sat
Minimization took 22 ms.
[2023-03-15 05:02:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:40] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-15 05:02:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:40] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-15 05:02:40] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-15 05:02:41] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 05:02:41] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2023-03-15 05:02:41] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2023-03-15 05:02:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2023-03-15 05:02:41] [INFO ] Added : 37 causal constraints over 8 iterations in 149 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, 12, 1, 1] Max seen :[4, 4, 0, 0, 0]
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 44/44 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 48/48 places, 44/44 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 44/44 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2023-03-15 05:02:41] [INFO ] Invariant cache hit.
[2023-03-15 05:02:41] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-15 05:02:41] [INFO ] Invariant cache hit.
[2023-03-15 05:02:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:41] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-15 05:02:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:02:41] [INFO ] Invariant cache hit.
[2023-03-15 05:02:41] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 48/48 places, 44/44 transitions.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-00
[2023-03-15 05:02:41] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :2
[2023-03-15 05:02:41] [INFO ] Invariant cache hit.
[2023-03-15 05:02:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:41] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:41] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-15 05:02:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:02:41] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:41] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-15 05:02:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:41] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-15 05:02:41] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 05:02:41] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2023-03-15 05:02:41] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2023-03-15 05:02:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
[2023-03-15 05:02:41] [INFO ] Added : 36 causal constraints over 8 iterations in 145 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 44/44 transitions.
Graph (complete) has 142 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 4 rules applied. Total rules applied 5 place count 45 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 44 transition count 41
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 44 transition count 39
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 10 place count 42 transition count 39
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 42 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 40 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 40 transition count 37
Applied a total of 15 rules in 12 ms. Remains 40 /48 variables (removed 8) and now considering 37/44 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 40/48 places, 37/44 transitions.
// Phase 1: matrix 37 rows 40 cols
[2023-03-15 05:02:41] [INFO ] Computed 7 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 144284 resets, run finished after 826 ms. (steps per millisecond=1210 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 91593 resets, run finished after 592 ms. (steps per millisecond=1689 ) properties (out of 1) seen :4
[2023-03-15 05:02:43] [INFO ] Invariant cache hit.
[2023-03-15 05:02:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:43] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-15 05:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:43] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-15 05:02:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 05:02:43] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-15 05:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:43] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-15 05:02:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:43] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-15 05:02:43] [INFO ] Computed and/alt/rep : 36/155/36 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 05:02:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2023-03-15 05:02:43] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2023-03-15 05:02:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2023-03-15 05:02:43] [INFO ] Added : 30 causal constraints over 6 iterations in 138 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 37/37 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 40/40 places, 37/37 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 37/37 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2023-03-15 05:02:43] [INFO ] Invariant cache hit.
[2023-03-15 05:02:43] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-15 05:02:43] [INFO ] Invariant cache hit.
[2023-03-15 05:02:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:43] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-15 05:02:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 05:02:43] [INFO ] Invariant cache hit.
[2023-03-15 05:02:43] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 40/40 places, 37/37 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-00 in 2335 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-01
// Phase 1: matrix 44 rows 48 cols
[2023-03-15 05:02:43] [INFO ] Computed 8 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1442 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2023-03-15 05:02:43] [INFO ] Invariant cache hit.
[2023-03-15 05:02:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:43] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:43] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-15 05:02:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:43] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:43] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-15 05:02:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:43] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-15 05:02:43] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2023-03-15 05:02:44] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-15 05:02:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2023-03-15 05:02:44] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 05:02:44] [INFO ] Added : 32 causal constraints over 7 iterations in 66 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 44/44 transitions.
Graph (complete) has 142 edges and 48 vertex of which 45 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 44 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 43 transition count 41
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 43 transition count 39
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 10 place count 41 transition count 39
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 12 place count 40 transition count 38
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 40 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 38 transition count 36
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 38 transition count 36
Applied a total of 17 rules in 14 ms. Remains 38 /48 variables (removed 10) and now considering 36/44 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 38/48 places, 36/44 transitions.
// Phase 1: matrix 36 rows 38 cols
[2023-03-15 05:02:44] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 144300 resets, run finished after 832 ms. (steps per millisecond=1201 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 91403 resets, run finished after 600 ms. (steps per millisecond=1666 ) properties (out of 1) seen :4
[2023-03-15 05:02:45] [INFO ] Invariant cache hit.
[2023-03-15 05:02:45] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-15 05:02:45] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-15 05:02:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:45] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-15 05:02:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 05:02:45] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-15 05:02:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:45] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-15 05:02:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:45] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-15 05:02:45] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2023-03-15 05:02:45] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2023-03-15 05:02:45] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2023-03-15 05:02:45] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2023-03-15 05:02:45] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-15 05:02:45] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2023-03-15 05:02:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 205 ms
[2023-03-15 05:02:45] [INFO ] Computed and/alt/rep : 35/162/35 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 05:02:45] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2023-03-15 05:02:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-15 05:02:45] [INFO ] Added : 33 causal constraints over 8 iterations in 109 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 36/36 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 38/38 places, 36/36 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 36/36 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2023-03-15 05:02:46] [INFO ] Invariant cache hit.
[2023-03-15 05:02:46] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-15 05:02:46] [INFO ] Invariant cache hit.
[2023-03-15 05:02:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:46] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-15 05:02:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 05:02:46] [INFO ] Invariant cache hit.
[2023-03-15 05:02:46] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 38/38 places, 36/36 transitions.
[2023-03-15 05:02:46] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144476 resets, run finished after 835 ms. (steps per millisecond=1197 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 91718 resets, run finished after 594 ms. (steps per millisecond=1683 ) properties (out of 1) seen :4
[2023-03-15 05:02:47] [INFO ] Invariant cache hit.
[2023-03-15 05:02:47] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 05:02:47] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-15 05:02:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:47] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 05:02:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:47] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-15 05:02:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:47] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-15 05:02:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:47] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-15 05:02:47] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2023-03-15 05:02:47] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2023-03-15 05:02:47] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2023-03-15 05:02:47] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2023-03-15 05:02:47] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2023-03-15 05:02:48] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2023-03-15 05:02:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 206 ms
[2023-03-15 05:02:48] [INFO ] Computed and/alt/rep : 35/162/35 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 05:02:48] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2023-03-15 05:02:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-15 05:02:48] [INFO ] Added : 33 causal constraints over 8 iterations in 115 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 36/36 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 38/38 places, 36/36 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 36/36 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2023-03-15 05:02:48] [INFO ] Invariant cache hit.
[2023-03-15 05:02:48] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-15 05:02:48] [INFO ] Invariant cache hit.
[2023-03-15 05:02:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:48] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-15 05:02:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 05:02:48] [INFO ] Invariant cache hit.
[2023-03-15 05:02:48] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 38/38 places, 36/36 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-01 in 4583 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-05
// Phase 1: matrix 44 rows 48 cols
[2023-03-15 05:02:48] [INFO ] Computed 8 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 1479 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 929 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-15 05:02:48] [INFO ] Invariant cache hit.
[2023-03-15 05:02:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:48] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:48] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-15 05:02:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:02:48] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:48] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-15 05:02:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:48] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-15 05:02:48] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 05:02:48] [INFO ] Added : 32 causal constraints over 7 iterations in 63 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 44/44 transitions.
Graph (complete) has 142 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 46 transition count 43
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 46 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 45 transition count 42
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 45 transition count 39
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 11 place count 42 transition count 39
Applied a total of 11 rules in 12 ms. Remains 42 /48 variables (removed 6) and now considering 39/44 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 42/48 places, 39/44 transitions.
// Phase 1: matrix 39 rows 42 cols
[2023-03-15 05:02:48] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144163 resets, run finished after 826 ms. (steps per millisecond=1210 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91353 resets, run finished after 593 ms. (steps per millisecond=1686 ) properties (out of 1) seen :0
[2023-03-15 05:02:50] [INFO ] Invariant cache hit.
[2023-03-15 05:02:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:50] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:50] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-15 05:02:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:02:50] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:50] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-15 05:02:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:50] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-15 05:02:50] [INFO ] Computed and/alt/rep : 38/165/38 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 05:02:50] [INFO ] Added : 33 causal constraints over 7 iterations in 59 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 42/42 places, 39/39 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2023-03-15 05:02:50] [INFO ] Invariant cache hit.
[2023-03-15 05:02:50] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-15 05:02:50] [INFO ] Invariant cache hit.
[2023-03-15 05:02:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:50] [INFO ] Implicit Places using invariants and state equation in 85 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 139 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 41/42 places, 39/39 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 41 transition count 39
Applied a total of 1 rules in 5 ms. Remains 41 /41 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 41 cols
[2023-03-15 05:02:50] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-15 05:02:50] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-15 05:02:50] [INFO ] Invariant cache hit.
[2023-03-15 05:02:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:50] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 41/42 places, 39/39 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 313 ms. Remains : 41/42 places, 39/39 transitions.
[2023-03-15 05:02:50] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144210 resets, run finished after 831 ms. (steps per millisecond=1203 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91390 resets, run finished after 590 ms. (steps per millisecond=1694 ) properties (out of 1) seen :0
[2023-03-15 05:02:52] [INFO ] Invariant cache hit.
[2023-03-15 05:02:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:02:52] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-15 05:02:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-15 05:02:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:02:52] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-15 05:02:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:52] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-15 05:02:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:52] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2023-03-15 05:02:52] [INFO ] Computed and/alt/rep : 38/166/38 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 05:02:52] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2023-03-15 05:02:52] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2023-03-15 05:02:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2023-03-15 05:02:52] [INFO ] Added : 34 causal constraints over 7 iterations in 129 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 39/39 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 41/41 places, 39/39 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2023-03-15 05:02:52] [INFO ] Invariant cache hit.
[2023-03-15 05:02:52] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-15 05:02:52] [INFO ] Invariant cache hit.
[2023-03-15 05:02:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:52] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-15 05:02:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 05:02:52] [INFO ] Invariant cache hit.
[2023-03-15 05:02:52] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 41/41 places, 39/39 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-05 in 4108 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-07
// Phase 1: matrix 44 rows 48 cols
[2023-03-15 05:02:52] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1471 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 922 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-15 05:02:52] [INFO ] Invariant cache hit.
[2023-03-15 05:02:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:02:52] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 05:02:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:52] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-15 05:02:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:52] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:52] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-15 05:02:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:52] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-15 05:02:52] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 05:02:52] [INFO ] Added : 32 causal constraints over 7 iterations in 59 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 44/44 transitions.
Graph (complete) has 142 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 45 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 44 transition count 42
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 44 transition count 41
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 43 transition count 41
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 42 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 42 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 41 transition count 39
Applied a total of 11 rules in 9 ms. Remains 41 /48 variables (removed 7) and now considering 39/44 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 41/48 places, 39/44 transitions.
// Phase 1: matrix 39 rows 41 cols
[2023-03-15 05:02:52] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 144394 resets, run finished after 831 ms. (steps per millisecond=1203 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 90890 resets, run finished after 596 ms. (steps per millisecond=1677 ) properties (out of 1) seen :0
[2023-03-15 05:02:54] [INFO ] Invariant cache hit.
[2023-03-15 05:02:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:54] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:54] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-15 05:02:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:02:54] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-15 05:02:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:54] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-15 05:02:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:54] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-15 05:02:54] [INFO ] Computed and/alt/rep : 38/161/38 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 05:02:54] [INFO ] Added : 36 causal constraints over 8 iterations in 65 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 41/41 places, 39/39 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2023-03-15 05:02:54] [INFO ] Invariant cache hit.
[2023-03-15 05:02:54] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-15 05:02:54] [INFO ] Invariant cache hit.
[2023-03-15 05:02:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:54] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-15 05:02:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 05:02:54] [INFO ] Invariant cache hit.
[2023-03-15 05:02:54] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 41/41 places, 39/39 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-07 in 2113 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-10
// Phase 1: matrix 44 rows 48 cols
[2023-03-15 05:02:54] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1461 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-15 05:02:54] [INFO ] Invariant cache hit.
[2023-03-15 05:02:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:02:54] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 05:02:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:54] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-15 05:02:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:02:54] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:02:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:54] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-15 05:02:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:54] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-15 05:02:54] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 05:02:54] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2023-03-15 05:02:54] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2023-03-15 05:02:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
[2023-03-15 05:02:54] [INFO ] Added : 37 causal constraints over 8 iterations in 144 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 44/44 transitions.
Graph (complete) has 142 edges and 48 vertex of which 45 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 4 rules applied. Total rules applied 5 place count 44 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 43 transition count 41
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 43 transition count 39
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 10 place count 41 transition count 39
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 12 place count 40 transition count 38
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 40 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 39 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 39 transition count 37
Applied a total of 15 rules in 11 ms. Remains 39 /48 variables (removed 9) and now considering 37/44 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 39/48 places, 37/44 transitions.
// Phase 1: matrix 37 rows 39 cols
[2023-03-15 05:02:54] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144132 resets, run finished after 830 ms. (steps per millisecond=1204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91664 resets, run finished after 589 ms. (steps per millisecond=1697 ) properties (out of 1) seen :0
[2023-03-15 05:02:56] [INFO ] Invariant cache hit.
[2023-03-15 05:02:56] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 05:02:56] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-15 05:02:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:56] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-15 05:02:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:02:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 05:02:56] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-15 05:02:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:02:56] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-15 05:02:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:56] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2023-03-15 05:02:56] [INFO ] Computed and/alt/rep : 36/163/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 05:02:56] [INFO ] Added : 28 causal constraints over 6 iterations in 51 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 37/37 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 39/39 places, 37/37 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 37/37 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2023-03-15 05:02:56] [INFO ] Invariant cache hit.
[2023-03-15 05:02:56] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-15 05:02:56] [INFO ] Invariant cache hit.
[2023-03-15 05:02:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:02:56] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-15 05:02:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:02:56] [INFO ] Invariant cache hit.
[2023-03-15 05:02:56] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 39/39 places, 37/37 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-10 in 2156 ms.
[2023-03-15 05:02:57] [INFO ] Flatten gal took : 41 ms
[2023-03-15 05:02:57] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-15 05:02:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 44 transitions and 192 arcs took 1 ms.
Total runtime 34072 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/949/ub_0_ --maxsum=/tmp/949/ub_1_ --maxsum=/tmp/949/ub_2_ --maxsum=/tmp/949/ub_3_ --maxsum=/tmp/949/ub_4_
FORMULA DoubleExponent-PT-002-UpperBounds-00 16 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-UpperBounds-01 4 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678856578295

--------------------
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
mcc2023
ub formula name DoubleExponent-PT-002-UpperBounds-00
ub formula formula --maxsum=/tmp/949/ub_0_
ub formula name DoubleExponent-PT-002-UpperBounds-01
ub formula formula --maxsum=/tmp/949/ub_1_
ub formula name DoubleExponent-PT-002-UpperBounds-05
ub formula formula --maxsum=/tmp/949/ub_2_
ub formula name DoubleExponent-PT-002-UpperBounds-07
ub formula formula --maxsum=/tmp/949/ub_3_
ub formula name DoubleExponent-PT-002-UpperBounds-10
ub formula formula --maxsum=/tmp/949/ub_4_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 48 places, 44 transitions and 192 arcs
pnml2lts-sym: Petri net DoubleExponent_PT_002 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 44->44 groups
pnml2lts-sym: Regrouping took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state vector length is 48; there are 44 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: Exploration took 3533 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.080 real 0.270 user 0.050 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 1210 states, 1566 nodes
pnml2lts-sym: Maximum sum of /tmp/949/ub_0_ is: 16
pnml2lts-sym: Maximum sum of /tmp/949/ub_1_ is: 4
pnml2lts-sym: Maximum sum of /tmp/949/ub_2_ is: 1
pnml2lts-sym: Maximum sum of /tmp/949/ub_3_ is: 1
pnml2lts-sym: Maximum sum of /tmp/949/ub_4_ is: 1
pnml2lts-sym: group_next: 669 nodes total
pnml2lts-sym: group_explored: 994 nodes, 1157 short vectors total
pnml2lts-sym: max token count: 16

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DoubleExponent-PT-002, 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 r137-smll-167819418500453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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