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.r159-smll-167819445200057.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 gold2022
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 r159-smll-167819445200057
=====================================================================

--------------------
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 1678465770051

Running Version 202205111006
[2023-03-10 16:29:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 16:29:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:29:33] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-03-10 16:29:33] [INFO ] Transformed 110 places.
[2023-03-10 16:29:33] [INFO ] Transformed 98 transitions.
[2023-03-10 16:29:33] [INFO ] Parsed PT model containing 110 places and 98 transitions in 367 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 98 rows 110 cols
[2023-03-10 16:29:33] [INFO ] Computed 14 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 334 resets, run finished after 53 ms. (steps per millisecond=188 ) 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 287 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 46 ms. (steps per millisecond=217 ) 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 282 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
// Phase 1: matrix 98 rows 110 cols
[2023-03-10 16:29:33] [INFO ] Computed 14 place invariants in 8 ms
[2023-03-10 16:29:34] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2023-03-10 16:29:34] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 12 ms returned sat
[2023-03-10 16:29:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:34] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2023-03-10 16:29:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-10 16:29:34] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-10 16:29:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:34] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-03-10 16:29:34] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 5 ms to minimize.
[2023-03-10 16:29:34] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2023-03-10 16:29:34] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2023-03-10 16:29:35] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 3 ms to minimize.
[2023-03-10 16:29:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 647 ms
[2023-03-10 16:29:35] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-10 16:29:35] [INFO ] Added : 90 causal constraints over 18 iterations in 525 ms. Result :sat
Minimization took 95 ms.
[2023-03-10 16:29:35] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-10 16:29:35] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-10 16:29:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:35] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-10 16:29:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-10 16:29:35] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 8 ms returned sat
[2023-03-10 16:29:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:36] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-10 16:29:36] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2023-03-10 16:29:36] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2023-03-10 16:29:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2023-03-10 16:29:36] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-10 16:29:36] [INFO ] Added : 89 causal constraints over 18 iterations in 311 ms. Result :sat
Minimization took 38 ms.
[2023-03-10 16:29:36] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-10 16:29:36] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-10 16:29:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:36] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-10 16:29:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-10 16:29:36] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2023-03-10 16:29:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:36] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-10 16:29:36] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 1 ms to minimize.
[2023-03-10 16:29:37] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2023-03-10 16:29:37] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 1 ms to minimize.
[2023-03-10 16:29:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 305 ms
[2023-03-10 16:29:37] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-10 16:29:37] [INFO ] Added : 95 causal constraints over 19 iterations in 367 ms. Result :sat
Minimization took 67 ms.
[2023-03-10 16:29:37] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-10 16:29:37] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2023-03-10 16:29:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:37] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2023-03-10 16:29:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-10 16:29:37] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-10 16:29:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:37] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-03-10 16:29:37] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2023-03-10 16:29:38] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2023-03-10 16:29:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2023-03-10 16:29:38] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-10 16:29:38] [INFO ] Added : 92 causal constraints over 19 iterations in 389 ms. Result :sat
Minimization took 65 ms.
[2023-03-10 16:29:38] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-10 16:29:38] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned unsat
[2023-03-10 16:29:38] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-10 16:29:38] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-10 16:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:38] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-10 16:29:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-10 16:29:38] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-10 16:29:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:38] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-10 16:29:38] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2023-03-10 16:29:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-10 16:29:38] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-10 16:29:39] [INFO ] Added : 93 causal constraints over 19 iterations in 401 ms. Result :sat
Minimization took 74 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 SAFETY 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.4 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 1 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 1 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 76 ms. Remains 53 /110 variables (removed 57) and now considering 46/98 (removed 52) transitions.
Finished structural reductions, in 1 iterations. Remains : 53/110 places, 46/98 transitions.
// Phase 1: matrix 46 rows 53 cols
[2023-03-10 16:29:39] [INFO ] Computed 11 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 127985 resets, run finished after 1462 ms. (steps per millisecond=683 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 84644 resets, run finished after 1033 ms. (steps per millisecond=968 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 84857 resets, run finished after 965 ms. (steps per millisecond=1036 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 84557 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 84849 resets, run finished after 711 ms. (steps per millisecond=1406 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 84745 resets, run finished after 702 ms. (steps per millisecond=1424 ) properties (out of 5) seen :8
// Phase 1: matrix 46 rows 53 cols
[2023-03-10 16:29:45] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-10 16:29:45] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 16:29:45] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 10 ms returned sat
[2023-03-10 16:29:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:45] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-10 16:29:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:45] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-10 16:29:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:45] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-10 16:29:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:29:45] [INFO ] [Nat]Added 6 Read/Feed constraints in 8 ms returned sat
[2023-03-10 16:29:45] [INFO ] Computed and/alt/rep : 45/175/45 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-10 16:29:45] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2023-03-10 16:29:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-10 16:29:45] [INFO ] Added : 39 causal constraints over 9 iterations in 182 ms. Result :sat
Minimization took 39 ms.
[2023-03-10 16:29:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 16:29:46] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2023-03-10 16:29:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:46] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-10 16:29:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:46] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-10 16:29:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:46] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-10 16:29:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 7 ms returned sat
[2023-03-10 16:29:46] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2023-03-10 16:29:46] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2023-03-10 16:29:46] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-10 16:29:46] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-10 16:29:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 175 ms
[2023-03-10 16:29:46] [INFO ] Computed and/alt/rep : 45/175/45 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-10 16:29:46] [INFO ] Added : 21 causal constraints over 5 iterations in 71 ms. Result :sat
Minimization took 28 ms.
[2023-03-10 16:29:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:46] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-10 16:29:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:46] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-10 16:29:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 16:29:46] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-10 16:29:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:46] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-10 16:29:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-10 16:29:46] [INFO ] Computed and/alt/rep : 45/175/45 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-10 16:29:46] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2023-03-10 16:29:46] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2023-03-10 16:29:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2023-03-10 16:29:46] [INFO ] Added : 36 causal constraints over 8 iterations in 182 ms. Result :sat
Minimization took 24 ms.
[2023-03-10 16:29:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:46] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-10 16:29:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:46] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-10 16:29:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 16:29:46] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-10 16:29:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:46] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-10 16:29:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-10 16:29:47] [INFO ] Computed and/alt/rep : 45/175/45 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-10 16:29:47] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2023-03-10 16:29:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-10 16:29:47] [INFO ] Added : 42 causal constraints over 9 iterations in 197 ms. Result :sat
Minimization took 47 ms.
[2023-03-10 16:29:47] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 16:29:47] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-10 16:29:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:47] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-10 16:29:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:47] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-10 16:29:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:47] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-10 16:29:47] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-10 16:29:47] [INFO ] Computed and/alt/rep : 45/175/45 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-10 16:29:47] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2023-03-10 16:29:47] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2023-03-10 16:29:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2023-03-10 16:29:47] [INFO ] Added : 40 causal constraints over 9 iterations in 247 ms. Result :sat
Minimization took 46 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 SAFETY mode, iteration 0 : 53/53 places, 46/46 transitions.
Applied a total of 0 rules in 5 ms. Remains 53 /53 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 46/46 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 53/53 places, 46/46 transitions.
Applied a total of 0 rules in 5 ms. Remains 53 /53 variables (removed 0) and now considering 46/46 (removed 0) transitions.
// Phase 1: matrix 46 rows 53 cols
[2023-03-10 16:29:47] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-10 16:29:48] [INFO ] Implicit Places using invariants in 99 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in SAFETY 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 8 ms. Remains 51 /52 variables (removed 1) and now considering 45/46 (removed 1) transitions.
// Phase 1: matrix 45 rows 51 cols
[2023-03-10 16:29:48] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-10 16:29:48] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 45 rows 51 cols
[2023-03-10 16:29:48] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-10 16:29:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:29:48] [INFO ] Implicit Places using invariants and state equation in 124 ms returned [17, 22]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 212 ms to find 2 implicit places.
Starting structural reductions in SAFETY 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 8 ms. Remains 48 /49 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 48 cols
[2023-03-10 16:29:48] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-10 16:29:48] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 44 rows 48 cols
[2023-03-10 16:29:48] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-10 16:29:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:29:48] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 48/53 places, 44/46 transitions.
Finished structural reductions, in 3 iterations. Remains : 48/53 places, 44/46 transitions.
// Phase 1: matrix 44 rows 48 cols
[2023-03-10 16:29:48] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144294 resets, run finished after 1012 ms. (steps per millisecond=988 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 91353 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 91186 resets, run finished after 995 ms. (steps per millisecond=1005 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 91394 resets, run finished after 598 ms. (steps per millisecond=1672 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 91155 resets, run finished after 794 ms. (steps per millisecond=1259 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 91450 resets, run finished after 611 ms. (steps per millisecond=1636 ) properties (out of 5) seen :8
// Phase 1: matrix 44 rows 48 cols
[2023-03-10 16:29:53] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-10 16:29:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:53] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 16:29:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:53] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-10 16:29:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 16:29:53] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 16:29:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:53] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-10 16:29:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:29:53] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2023-03-10 16:29:53] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-10 16:29:53] [INFO ] Added : 35 causal constraints over 7 iterations in 67 ms. Result :sat
Minimization took 1919 ms.
[2023-03-10 16:29:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 16:29:55] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-10 16:29:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:55] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-10 16:29:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 16:29:55] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-10 16:29:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:55] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-10 16:29:55] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-10 16:29:55] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2023-03-10 16:29:55] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2023-03-10 16:29:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-10 16:29:55] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-10 16:29:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 162 ms
[2023-03-10 16:29:55] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-10 16:29:55] [INFO ] Added : 18 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 22 ms.
[2023-03-10 16:29:55] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:55] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 16:29:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:55] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-10 16:29:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:55] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 16:29:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:55] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-10 16:29:55] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-10 16:29:55] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-10 16:29:55] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2023-03-10 16:29:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-10 16:29:55] [INFO ] Added : 40 causal constraints over 8 iterations in 153 ms. Result :sat
Minimization took 39 ms.
[2023-03-10 16:29:56] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:56] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 16:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:56] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-10 16:29:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 16:29:56] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 16:29:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:56] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-10 16:29:56] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-10 16:29:56] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-10 16:29:56] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2023-03-10 16:29:56] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2023-03-10 16:29:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2023-03-10 16:29:56] [INFO ] Added : 40 causal constraints over 9 iterations in 182 ms. Result :sat
Minimization took 26 ms.
[2023-03-10 16:29:56] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:56] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-10 16:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:56] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-10 16:29:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:56] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 16:29:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:56] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-10 16:29:56] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-10 16:29:56] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-10 16:29:56] [INFO ] Added : 38 causal constraints over 8 iterations in 79 ms. Result :sat
Minimization took 23 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 SAFETY mode, iteration 0 : 48/48 places, 44/44 transitions.
Applied a total of 0 rules in 7 ms. Remains 48 /48 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 44/44 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 48/48 places, 44/44 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 44/44 (removed 0) transitions.
// Phase 1: matrix 44 rows 48 cols
[2023-03-10 16:29:56] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-10 16:29:56] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 44 rows 48 cols
[2023-03-10 16:29:56] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-10 16:29:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:29:56] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-10 16:29:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 44 rows 48 cols
[2023-03-10 16:29:56] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-10 16:29:56] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 44/44 transitions.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-00
// Phase 1: matrix 44 rows 48 cols
[2023-03-10 16:29:56] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1425 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 890 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :2
// Phase 1: matrix 44 rows 48 cols
[2023-03-10 16:29:56] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-10 16:29:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:57] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 16:29:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:57] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-10 16:29:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:57] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 16:29:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:57] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-10 16:29:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:29:57] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-10 16:29:57] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-10 16:29:57] [INFO ] Added : 35 causal constraints over 7 iterations in 61 ms. Result :sat
Minimization took 1867 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 SAFETY 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.1 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 1 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 17 ms. Remains 40 /48 variables (removed 8) and now considering 37/44 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/48 places, 37/44 transitions.
// Phase 1: matrix 37 rows 40 cols
[2023-03-10 16:29:59] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 143931 resets, run finished after 876 ms. (steps per millisecond=1141 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 91185 resets, run finished after 567 ms. (steps per millisecond=1763 ) properties (out of 1) seen :4
// Phase 1: matrix 37 rows 40 cols
[2023-03-10 16:30:00] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:00] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 16:30:00] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-10 16:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:00] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-10 16:30:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:00] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-10 16:30:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:00] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-10 16:30:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:00] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-10 16:30:00] [INFO ] Computed and/alt/rep : 36/155/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-10 16:30:00] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2023-03-10 16:30:00] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2023-03-10 16:30:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-10 16:30:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 128 ms
[2023-03-10 16:30:00] [INFO ] Added : 33 causal constraints over 8 iterations in 227 ms. Result :sat
Minimization took 34 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 SAFETY mode, iteration 0 : 40/40 places, 37/37 transitions.
Applied a total of 0 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 37/37 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 37/37 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 37/37 (removed 0) transitions.
// Phase 1: matrix 37 rows 40 cols
[2023-03-10 16:30:00] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:00] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 37 rows 40 cols
[2023-03-10 16:30:00] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:01] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-10 16:30:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 37 rows 40 cols
[2023-03-10 16:30:01] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:01] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 37/37 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-00 in 4266 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-01
// Phase 1: matrix 44 rows 48 cols
[2023-03-10 16:30:01] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 929 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :3
// Phase 1: matrix 44 rows 48 cols
[2023-03-10 16:30:01] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-10 16:30:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:01] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-10 16:30:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:01] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-10 16:30:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:01] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-10 16:30:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:01] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-10 16:30:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:01] [INFO ] [Nat]Added 6 Read/Feed constraints in 11 ms returned sat
[2023-03-10 16:30:01] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2023-03-10 16:30:01] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-10 16:30:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2023-03-10 16:30:01] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-10 16:30:01] [INFO ] Added : 32 causal constraints over 7 iterations in 98 ms. Result :sat
Minimization took 31 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 SAFETY 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 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 15 ms. Remains 38 /48 variables (removed 10) and now considering 36/44 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 38/48 places, 36/44 transitions.
// Phase 1: matrix 36 rows 38 cols
[2023-03-10 16:30:01] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144352 resets, run finished after 1008 ms. (steps per millisecond=992 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 91203 resets, run finished after 567 ms. (steps per millisecond=1763 ) properties (out of 1) seen :4
// Phase 1: matrix 36 rows 38 cols
[2023-03-10 16:30:03] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:03] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:03] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-10 16:30:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:03] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-10 16:30:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 16:30:03] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-10 16:30:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:03] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-10 16:30:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:03] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-10 16:30:03] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 6 ms to minimize.
[2023-03-10 16:30:03] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2023-03-10 16:30:03] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-10 16:30:03] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2023-03-10 16:30:03] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2023-03-10 16:30:03] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2023-03-10 16:30:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 216 ms
[2023-03-10 16:30:03] [INFO ] Computed and/alt/rep : 35/162/35 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 16:30:03] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2023-03-10 16:30:03] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-10 16:30:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2023-03-10 16:30:03] [INFO ] Added : 23 causal constraints over 6 iterations in 147 ms. Result :sat
Minimization took 44 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 SAFETY mode, iteration 0 : 38/38 places, 36/36 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 36/36 transitions.
Starting structural reductions in SAFETY 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.
// Phase 1: matrix 36 rows 38 cols
[2023-03-10 16:30:03] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:03] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 36 rows 38 cols
[2023-03-10 16:30:03] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:03] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-10 16:30:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 36 rows 38 cols
[2023-03-10 16:30:03] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-10 16:30:03] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 36/36 transitions.
// Phase 1: matrix 36 rows 38 cols
[2023-03-10 16:30:03] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144285 resets, run finished after 1066 ms. (steps per millisecond=938 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 91373 resets, run finished after 581 ms. (steps per millisecond=1721 ) properties (out of 1) seen :4
// Phase 1: matrix 36 rows 38 cols
[2023-03-10 16:30:05] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-10 16:30:05] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:05] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-10 16:30:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:05] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-10 16:30:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:05] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-10 16:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:05] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-10 16:30:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:05] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-10 16:30:05] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2023-03-10 16:30:05] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2023-03-10 16:30:05] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-10 16:30:05] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2023-03-10 16:30:05] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2023-03-10 16:30:05] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 6 ms to minimize.
[2023-03-10 16:30:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 193 ms
[2023-03-10 16:30:05] [INFO ] Computed and/alt/rep : 35/162/35 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 16:30:06] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2023-03-10 16:30:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-10 16:30:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2023-03-10 16:30:06] [INFO ] Added : 23 causal constraints over 6 iterations in 129 ms. Result :sat
Minimization took 26 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 SAFETY 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 1 iterations. Remains : 38/38 places, 36/36 transitions.
Starting structural reductions in SAFETY 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.
// Phase 1: matrix 36 rows 38 cols
[2023-03-10 16:30:06] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:06] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 36 rows 38 cols
[2023-03-10 16:30:06] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:06] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-10 16:30:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 36 rows 38 cols
[2023-03-10 16:30:06] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:06] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 36/36 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-01 in 5134 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-05
// Phase 1: matrix 44 rows 48 cols
[2023-03-10 16:30:06] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1450 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 44 rows 48 cols
[2023-03-10 16:30:06] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-10 16:30:06] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:06] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-10 16:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:06] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-10 16:30:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:06] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 16:30:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:06] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-10 16:30:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:06] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-10 16:30:06] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-10 16:30:06] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
[2023-03-10 16:30:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-10 16:30:06] [INFO ] Added : 40 causal constraints over 8 iterations in 155 ms. Result :sat
Minimization took 40 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 SAFETY 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 11 ms. Remains 42 /48 variables (removed 6) and now considering 39/44 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 42/48 places, 39/44 transitions.
// Phase 1: matrix 39 rows 42 cols
[2023-03-10 16:30:06] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144485 resets, run finished after 797 ms. (steps per millisecond=1254 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91358 resets, run finished after 576 ms. (steps per millisecond=1736 ) properties (out of 1) seen :0
// Phase 1: matrix 39 rows 42 cols
[2023-03-10 16:30:08] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-10 16:30:08] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:08] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 16:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:08] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-10 16:30:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 16:30:08] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 16:30:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:08] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-10 16:30:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:08] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-10 16:30:08] [INFO ] Computed and/alt/rep : 38/165/38 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-10 16:30:08] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2023-03-10 16:30:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-10 16:30:08] [INFO ] Added : 37 causal constraints over 8 iterations in 104 ms. Result :sat
Minimization took 40 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 SAFETY mode, iteration 0 : 42/42 places, 39/39 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 42/42 places, 39/39 transitions.
Starting structural reductions in SAFETY 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.
// Phase 1: matrix 39 rows 42 cols
[2023-03-10 16:30:08] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-10 16:30:08] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 39 rows 42 cols
[2023-03-10 16:30:08] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-10 16:30:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:08] [INFO ] Implicit Places using invariants and state equation in 133 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 200 ms to find 1 implicit places.
Starting structural reductions in SAFETY 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-10 16:30:08] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:08] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 39 rows 41 cols
[2023-03-10 16:30:08] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:08] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 41/42 places, 39/39 transitions.
Finished structural reductions, in 2 iterations. Remains : 41/42 places, 39/39 transitions.
// Phase 1: matrix 39 rows 41 cols
[2023-03-10 16:30:08] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144134 resets, run finished after 1021 ms. (steps per millisecond=979 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91321 resets, run finished after 571 ms. (steps per millisecond=1751 ) properties (out of 1) seen :0
// Phase 1: matrix 39 rows 41 cols
[2023-03-10 16:30:10] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 16:30:10] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-10 16:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:10] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-10 16:30:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 16:30:10] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:30:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:10] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-10 16:30:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:10] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2023-03-10 16:30:10] [INFO ] Computed and/alt/rep : 38/166/38 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 16:30:10] [INFO ] Added : 37 causal constraints over 8 iterations in 63 ms. Result :sat
Minimization took 26 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 SAFETY mode, iteration 0 : 41/41 places, 39/39 transitions.
Applied a total of 0 rules in 9 ms. Remains 41 /41 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 39/39 transitions.
Starting structural reductions in SAFETY 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.
// Phase 1: matrix 39 rows 41 cols
[2023-03-10 16:30:10] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-10 16:30:10] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 39 rows 41 cols
[2023-03-10 16:30:10] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:10] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-10 16:30:10] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 39 rows 41 cols
[2023-03-10 16:30:10] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-10 16:30:10] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 39/39 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-05 in 4461 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-07
// Phase 1: matrix 44 rows 48 cols
[2023-03-10 16:30:10] [INFO ] Computed 8 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
// Phase 1: matrix 44 rows 48 cols
[2023-03-10 16:30:10] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-10 16:30:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 16:30:10] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 16:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:10] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-10 16:30:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 16:30:10] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 16:30:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:10] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-10 16:30:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:10] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-10 16:30:10] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-10 16:30:11] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2023-03-10 16:30:11] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2023-03-10 16:30:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2023-03-10 16:30:11] [INFO ] Added : 40 causal constraints over 9 iterations in 147 ms. Result :sat
Minimization took 26 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 SAFETY 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.1 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 1 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 12 ms. Remains 41 /48 variables (removed 7) and now considering 39/44 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 41/48 places, 39/44 transitions.
// Phase 1: matrix 39 rows 41 cols
[2023-03-10 16:30:11] [INFO ] Computed 7 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 144115 resets, run finished after 798 ms. (steps per millisecond=1253 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91112 resets, run finished after 642 ms. (steps per millisecond=1557 ) properties (out of 1) seen :0
// Phase 1: matrix 39 rows 41 cols
[2023-03-10 16:30:12] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 16:30:12] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:30:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:12] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-10 16:30:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 16:30:12] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:30:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:12] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-10 16:30:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:12] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2023-03-10 16:30:12] [INFO ] Computed and/alt/rep : 38/161/38 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 16:30:12] [INFO ] Added : 30 causal constraints over 6 iterations in 48 ms. Result :sat
Minimization took 18 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 SAFETY 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 1 iterations. Remains : 41/41 places, 39/39 transitions.
Starting structural reductions in SAFETY 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.
// Phase 1: matrix 39 rows 41 cols
[2023-03-10 16:30:12] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:12] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 39 rows 41 cols
[2023-03-10 16:30:12] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:12] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-10 16:30:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 39 rows 41 cols
[2023-03-10 16:30:12] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:13] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 39/39 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-07 in 2227 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-10
// Phase 1: matrix 44 rows 48 cols
[2023-03-10 16:30:13] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1453 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 930 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 44 rows 48 cols
[2023-03-10 16:30:13] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-10 16:30:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:13] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 16:30:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:13] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-10 16:30:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 16:30:13] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 16:30:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:13] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-10 16:30:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:13] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2023-03-10 16:30:13] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-10 16:30:13] [INFO ] Added : 38 causal constraints over 8 iterations in 97 ms. Result :sat
Minimization took 36 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 SAFETY 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 1 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 19 ms. Remains 39 /48 variables (removed 9) and now considering 37/44 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 39/48 places, 37/44 transitions.
// Phase 1: matrix 37 rows 39 cols
[2023-03-10 16:30:13] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144463 resets, run finished after 1131 ms. (steps per millisecond=884 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91338 resets, run finished after 574 ms. (steps per millisecond=1742 ) properties (out of 1) seen :0
// Phase 1: matrix 37 rows 39 cols
[2023-03-10 16:30:15] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:15] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 16:30:15] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-10 16:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:15] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-10 16:30:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:15] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-10 16:30:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:15] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-10 16:30:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:15] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-10 16:30:15] [INFO ] Computed and/alt/rep : 36/163/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-10 16:30:15] [INFO ] Added : 31 causal constraints over 7 iterations in 60 ms. Result :sat
Minimization took 21 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 SAFETY 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 1 iterations. Remains : 39/39 places, 37/37 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 39/39 places, 37/37 transitions.
Applied a total of 0 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 37/37 (removed 0) transitions.
// Phase 1: matrix 37 rows 39 cols
[2023-03-10 16:30:15] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:15] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 37 rows 39 cols
[2023-03-10 16:30:15] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 16:30:15] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-10 16:30:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 37 rows 39 cols
[2023-03-10 16:30:15] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-10 16:30:15] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 37/37 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-10 in 2496 ms.
[2023-03-10 16:30:15] [INFO ] Flatten gal took : 66 ms
[2023-03-10 16:30:15] [INFO ] Applying decomposition
[2023-03-10 16:30:15] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7833914543527420357.txt' '-o' '/tmp/graph7833914543527420357.bin' '-w' '/tmp/graph7833914543527420357.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7833914543527420357.bin' '-l' '-1' '-v' '-w' '/tmp/graph7833914543527420357.weights' '-q' '0' '-e' '0.001'
[2023-03-10 16:30:16] [INFO ] Decomposing Gal with order
[2023-03-10 16:30:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 16:30:16] [INFO ] Removed a total of 13 redundant transitions.
[2023-03-10 16:30:16] [INFO ] Flatten gal took : 94 ms
[2023-03-10 16:30:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2023-03-10 16:30:16] [INFO ] Time to serialize gal into /tmp/UpperBounds16875830697260243300.gal : 8 ms
[2023-03-10 16:30:16] [INFO ] Time to serialize properties into /tmp/UpperBounds7114472296659903255.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16875830697260243300.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7114472296659903255.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds7114472296659903255.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1210,0.140363,5360,362,203,3211,1305,205,4951,73,4899,0
Total reachable state count : 1210

Verifying 5 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 16
Bounds property DoubleExponent-PT-002-UpperBounds-00 :0 <= i4.u7.p109 <= 16
FORMULA DoubleExponent-PT-002-UpperBounds-00 16 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-002-UpperBounds-00,0,0.149466,5360,1,0,3211,1305,286,4951,103,4899,633
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DoubleExponent-PT-002-UpperBounds-01 :0 <= i4.u4.p59 <= 4
FORMULA DoubleExponent-PT-002-UpperBounds-01 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-002-UpperBounds-01,0,0.154601,5360,1,0,3211,1305,303,4951,114,4899,774
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-002-UpperBounds-05 :0 <= i6.u8.p71 <= 1
FORMULA DoubleExponent-PT-002-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-002-UpperBounds-05,0,0.156434,5360,1,0,3211,1305,328,4951,121,4899,913
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-002-UpperBounds-07 :0 <= u1.p107 <= 1
FORMULA DoubleExponent-PT-002-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-002-UpperBounds-07,0,0.156786,5360,1,0,3211,1305,346,4951,126,4899,928
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-002-UpperBounds-10 :0 <= i6.u11.p87 <= 1
FORMULA DoubleExponent-PT-002-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-002-UpperBounds-10,0,0.157321,5360,1,0,3211,1305,368,4951,126,4899,965
Total runtime 43919 ms.

BK_STOP 1678465816659

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="gold2022"
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 gold2022"
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 r159-smll-167819445200057"
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 ;