Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260109900173.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r078-tall-165260109900173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 13:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 13:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 33K May 10 09:33 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 1652638301866

Running Version 202205111006
[2022-05-15 18:11:42] [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]
[2022-05-15 18:11:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 18:11:43] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2022-05-15 18:11:43] [INFO ] Transformed 110 places.
[2022-05-15 18:11:43] [INFO ] Transformed 98 transitions.
[2022-05-15 18:11:43] [INFO ] Parsed PT model containing 110 places and 98 transitions in 162 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 98 rows 110 cols
[2022-05-15 18:11:43] [INFO ] Computed 14 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 333 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :10
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-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10000 steps, including 295 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :11
FORMULA DoubleExponent-PT-002-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 296 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :4
// Phase 1: matrix 98 rows 110 cols
[2022-05-15 18:11:43] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 18:11:43] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2022-05-15 18:11:43] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2022-05-15 18:11:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:43] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-15 18:11:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:11:43] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-15 18:11:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:43] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-05-15 18:11:43] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 5 ms to minimize.
[2022-05-15 18:11:43] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2022-05-15 18:11:43] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2022-05-15 18:11:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 172 ms
[2022-05-15 18:11:43] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-15 18:11:44] [INFO ] Added : 94 causal constraints over 19 iterations in 245 ms. Result :sat
Minimization took 50 ms.
[2022-05-15 18:11:44] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 18:11:44] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:44] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-15 18:11:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:11:44] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:44] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-05-15 18:11:44] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2022-05-15 18:11:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2022-05-15 18:11:44] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-15 18:11:44] [INFO ] Added : 96 causal constraints over 20 iterations in 202 ms. Result :sat
Minimization took 28 ms.
[2022-05-15 18:11:44] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 18:11:44] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:44] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-15 18:11:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 18:11:44] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:44] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-05-15 18:11:44] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2022-05-15 18:11:44] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2022-05-15 18:11:44] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2022-05-15 18:11:44] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2022-05-15 18:11:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 223 ms
[2022-05-15 18:11:44] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-15 18:11:45] [INFO ] Added : 90 causal constraints over 18 iterations in 196 ms. Result :sat
Minimization took 218 ms.
[2022-05-15 18:11:45] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 18:11:45] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2022-05-15 18:11:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:45] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-15 18:11:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 18:11:45] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-15 18:11:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:45] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-05-15 18:11:45] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-15 18:11:45] [INFO ] Added : 93 causal constraints over 19 iterations in 221 ms. Result :sat
Minimization took 33 ms.
[2022-05-15 18:11:45] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:11:45] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:45] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-05-15 18:11:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-15 18:11:45] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:45] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-05-15 18:11:45] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2022-05-15 18:11:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2022-05-15 18:11:45] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-15 18:11:46] [INFO ] Added : 88 causal constraints over 18 iterations in 197 ms. Result :sat
Minimization took 29 ms.
[2022-05-15 18:11:46] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 18:11:46] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:46] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2022-05-15 18:11:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 18:11:46] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-15 18:11:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:46] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-05-15 18:11:46] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2022-05-15 18:11:46] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2022-05-15 18:11:46] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2022-05-15 18:11:46] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2022-05-15 18:11:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 181 ms
[2022-05-15 18:11:46] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-15 18:11:46] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 0 ms to minimize.
[2022-05-15 18:11:46] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2022-05-15 18:11:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2022-05-15 18:11:46] [INFO ] Added : 86 causal constraints over 18 iterations in 322 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, -1, 1, 1, -1] Max seen :[1, 0, 2, 0, 0, 4]
Support contains 6 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.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 107 transition count 79
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 88 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 86 transition count 77
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 43 place count 86 transition count 72
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 53 place count 81 transition count 72
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 89 place count 63 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 61 transition count 54
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 98 place count 61 transition count 49
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 103 place count 56 transition count 49
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 111 place count 56 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 55 transition count 48
Applied a total of 112 rules in 38 ms. Remains 55 /110 variables (removed 55) and now considering 48/98 (removed 50) transitions.
Finished structural reductions, in 1 iterations. Remains : 55/110 places, 48/98 transitions.
// Phase 1: matrix 48 rows 55 cols
[2022-05-15 18:11:47] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 112742 resets, run finished after 715 ms. (steps per millisecond=1398 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000001 steps, including 77547 resets, run finished after 488 ms. (steps per millisecond=2049 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 77568 resets, run finished after 463 ms. (steps per millisecond=2159 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000000 steps, including 77720 resets, run finished after 465 ms. (steps per millisecond=2150 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 77834 resets, run finished after 462 ms. (steps per millisecond=2164 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 77840 resets, run finished after 489 ms. (steps per millisecond=2044 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 77628 resets, run finished after 433 ms. (steps per millisecond=2309 ) properties (out of 6) seen :12
// Phase 1: matrix 48 rows 55 cols
[2022-05-15 18:11:50] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-15 18:11:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:50] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:50] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-15 18:11:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:50] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-15 18:11:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:50] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-15 18:11:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 18:11:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2022-05-15 18:11:50] [INFO ] Computed and/alt/rep : 47/179/47 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 18:11:50] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2022-05-15 18:11:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-05-15 18:11:50] [INFO ] Added : 41 causal constraints over 9 iterations in 102 ms. Result :sat
Minimization took 27 ms.
[2022-05-15 18:11:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:50] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:50] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-15 18:11:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:51] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-15 18:11:51] [INFO ] Computed and/alt/rep : 47/179/47 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-15 18:11:51] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2022-05-15 18:11:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2022-05-15 18:11:51] [INFO ] Added : 46 causal constraints over 10 iterations in 110 ms. Result :sat
Minimization took 24 ms.
[2022-05-15 18:11:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:51] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-15 18:11:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:51] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-15 18:11:51] [INFO ] Computed and/alt/rep : 47/179/47 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-15 18:11:51] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2022-05-15 18:11:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2022-05-15 18:11:51] [INFO ] Added : 40 causal constraints over 8 iterations in 102 ms. Result :sat
Minimization took 19 ms.
[2022-05-15 18:11:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:51] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-15 18:11:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:51] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2022-05-15 18:11:51] [INFO ] Computed and/alt/rep : 47/179/47 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-15 18:11:51] [INFO ] Added : 40 causal constraints over 8 iterations in 58 ms. Result :sat
Minimization took 19 ms.
[2022-05-15 18:11:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:51] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-15 18:11:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:51] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-15 18:11:51] [INFO ] Computed and/alt/rep : 47/179/47 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-15 18:11:51] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2022-05-15 18:11:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2022-05-15 18:11:51] [INFO ] Added : 44 causal constraints over 9 iterations in 100 ms. Result :sat
Minimization took 21 ms.
[2022-05-15 18:11:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:51] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-15 18:11:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:51] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-15 18:11:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2022-05-15 18:11:51] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2022-05-15 18:11:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-05-15 18:11:51] [INFO ] Computed and/alt/rep : 47/179/47 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 18:11:51] [INFO ] Added : 40 causal constraints over 8 iterations in 61 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, -1, 1, 1, -1] Max seen :[4, 0, 4, 0, 0, 4]
Support contains 6 out of 55 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 55/55 places, 48/48 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 55 cols
[2022-05-15 18:11:52] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-15 18:11:52] [INFO ] Implicit Places using invariants in 53 ms returned [34, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 59 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 53/55 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 52 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 52 transition count 47
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 52 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 51 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 46
Applied a total of 5 rules in 10 ms. Remains 51 /53 variables (removed 2) and now considering 46/48 (removed 2) transitions.
// Phase 1: matrix 46 rows 51 cols
[2022-05-15 18:11:52] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-15 18:11:52] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 46 rows 51 cols
[2022-05-15 18:11:52] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-15 18:11:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 18:11:52] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [17, 22]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 102 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 49/55 places, 46/48 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 45
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 45
Applied a total of 2 rules in 6 ms. Remains 48 /49 variables (removed 1) and now considering 45/46 (removed 1) transitions.
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:11:52] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-15 18:11:52] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:11:52] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:11:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 18:11:52] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 48/55 places, 45/48 transitions.
Finished structural reductions, in 3 iterations. Remains : 48/55 places, 45/48 transitions.
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:11:52] [INFO ] Computed 7 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 125030 resets, run finished after 589 ms. (steps per millisecond=1697 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 83240 resets, run finished after 418 ms. (steps per millisecond=2392 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 83315 resets, run finished after 419 ms. (steps per millisecond=2386 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 83258 resets, run finished after 419 ms. (steps per millisecond=2386 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 83245 resets, run finished after 426 ms. (steps per millisecond=2347 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 82923 resets, run finished after 431 ms. (steps per millisecond=2320 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 82966 resets, run finished after 421 ms. (steps per millisecond=2375 ) properties (out of 6) seen :12
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:11:55] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-15 18:11:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:55] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 0 ms returned sat
[2022-05-15 18:11:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:55] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-15 18:11:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 18:11:55] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:11:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:55] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-15 18:11:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 18:11:55] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2022-05-15 18:11:55] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-15 18:11:55] [INFO ] Added : 39 causal constraints over 9 iterations in 56 ms. Result :sat
Minimization took 23 ms.
[2022-05-15 18:11:55] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 18:11:55] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:11:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:55] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-15 18:11:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:55] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:11:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:55] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-15 18:11:55] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2022-05-15 18:11:55] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-15 18:11:55] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2022-05-15 18:11:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2022-05-15 18:11:55] [INFO ] Added : 36 causal constraints over 8 iterations in 89 ms. Result :sat
Minimization took 17 ms.
[2022-05-15 18:11:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:55] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:11:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:55] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-15 18:11:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:55] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:11:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:55] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-15 18:11:55] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2022-05-15 18:11:55] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-15 18:11:55] [INFO ] Added : 39 causal constraints over 8 iterations in 57 ms. Result :sat
Minimization took 50 ms.
[2022-05-15 18:11:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:56] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-15 18:11:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:56] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-15 18:11:56] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2022-05-15 18:11:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-05-15 18:11:56] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 18:11:56] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2022-05-15 18:11:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-05-15 18:11:56] [INFO ] Added : 36 causal constraints over 8 iterations in 85 ms. Result :sat
Minimization took 16 ms.
[2022-05-15 18:11:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 4 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:56] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-15 18:11:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 8 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:56] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-15 18:11:56] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-15 18:11:56] [INFO ] Added : 37 causal constraints over 8 iterations in 46 ms. Result :sat
Minimization took 19 ms.
[2022-05-15 18:11:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:56] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-15 18:11:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:56] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2022-05-15 18:11:56] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2022-05-15 18:11:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-05-15 18:11:56] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-15 18:11:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-15 18:11:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-05-15 18:11:56] [INFO ] Added : 34 causal constraints over 8 iterations in 88 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, -1, 1, 1, -1] Max seen :[4, 0, 4, 0, 0, 4]
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 48/48 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 45/45 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 48/48 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:11:56] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:11:56] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:11:56] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:11:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 18:11:56] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2022-05-15 18:11:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:11:56] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:11:56] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 45/45 transitions.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-01
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:11:56] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1220 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 816 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:11:56] [INFO ] Computed 7 place invariants in 5 ms
[2022-05-15 18:11:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:56] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-15 18:11:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-15 18:11:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:56] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-15 18:11:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 18:11:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2022-05-15 18:11:57] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-15 18:11:57] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2022-05-15 18:11:57] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2022-05-15 18:11:57] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2022-05-15 18:11:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 101 ms
[2022-05-15 18:11:57] [INFO ] Added : 41 causal constraints over 9 iterations in 155 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 48/48 places, 45/45 transitions.
Graph (complete) has 140 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 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 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 4 place count 44 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 42 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 10 place count 41 transition count 40
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 41 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 40 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 40 transition count 39
Applied a total of 13 rules in 8 ms. Remains 40 /48 variables (removed 8) and now considering 39/45 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/48 places, 39/45 transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:11:57] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156003 resets, run finished after 562 ms. (steps per millisecond=1779 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 96020 resets, run finished after 418 ms. (steps per millisecond=2392 ) properties (out of 1) seen :4
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:11:58] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:11:58] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:58] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-15 18:11:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:58] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-15 18:11:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 18:11:58] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 18:11:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:58] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-15 18:11:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 18:11:58] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2022-05-15 18:11:58] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2022-05-15 18:11:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-05-15 18:11:58] [INFO ] Computed and/alt/rep : 37/179/37 causal constraints (skipped 1 transitions) in 3 ms.
[2022-05-15 18:11:58] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2022-05-15 18:11:58] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2022-05-15 18:11:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 60 ms
[2022-05-15 18:11:58] [INFO ] Added : 34 causal constraints over 8 iterations in 109 ms. Result :sat
Minimization took 17 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, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:11:58] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:11:58] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:11:58] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:11:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 18:11:58] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2022-05-15 18:11:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:11:58] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-15 18:11:58] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:11:58] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 155818 resets, run finished after 567 ms. (steps per millisecond=1763 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 95893 resets, run finished after 405 ms. (steps per millisecond=2469 ) properties (out of 1) seen :3
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:11:59] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-15 18:11:59] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:59] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 18:11:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:59] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-15 18:11:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:11:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 18:11:59] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-15 18:11:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:11:59] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-15 18:11:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 18:11:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2022-05-15 18:11:59] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2022-05-15 18:11:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-15 18:11:59] [INFO ] Computed and/alt/rep : 37/179/37 causal constraints (skipped 1 transitions) in 6 ms.
[2022-05-15 18:11:59] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2022-05-15 18:11:59] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2022-05-15 18:11:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2022-05-15 18:11:59] [INFO ] Added : 34 causal constraints over 8 iterations in 117 ms. Result :sat
Minimization took 15 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, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:11:59] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:11:59] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:11:59] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:11:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 18:11:59] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2022-05-15 18:11:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:11:59] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:00] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-01 in 3116 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-05
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:12:00] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1247 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:12:00] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-15 18:12:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:12:00] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:12:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:00] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-15 18:12:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:12:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:12:00] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:12:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:00] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-15 18:12:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 18:12:00] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2022-05-15 18:12:00] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-15 18:12:00] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 5 ms to minimize.
[2022-05-15 18:12:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2022-05-15 18:12:00] [INFO ] Added : 36 causal constraints over 8 iterations in 85 ms. Result :sat
Minimization took 18 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, 45/45 transitions.
Graph (complete) has 140 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
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 47 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 46 transition count 44
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 11 place count 42 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 13 place count 41 transition count 40
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 41 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 40 transition count 39
Applied a total of 15 rules in 6 ms. Remains 40 /48 variables (removed 8) and now considering 39/45 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/48 places, 39/45 transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:12:00] [INFO ] Computed 7 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 156339 resets, run finished after 678 ms. (steps per millisecond=1474 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96234 resets, run finished after 412 ms. (steps per millisecond=2427 ) properties (out of 1) seen :0
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:12:01] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-15 18:12:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:12:01] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:12:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:01] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-15 18:12:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:12:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:12:01] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:12:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:01] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-15 18:12:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-15 18:12:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2022-05-15 18:12:01] [INFO ] Computed and/alt/rep : 37/182/37 causal constraints (skipped 1 transitions) in 2 ms.
[2022-05-15 18:12:01] [INFO ] Added : 32 causal constraints over 7 iterations in 42 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:12:01] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:01] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:12:01] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-15 18:12:01] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2022-05-15 18:12:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:12:01] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:01] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-05 in 1615 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-06
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:12:01] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1266 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 806 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :3
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:12:01] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:12:01] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 6 ms returned sat
[2022-05-15 18:12:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:01] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-15 18:12:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:12:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:12:01] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:12:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:01] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-15 18:12:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 18:12:01] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2022-05-15 18:12:01] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-15 18:12:01] [INFO ] Added : 39 causal constraints over 8 iterations in 48 ms. Result :sat
Minimization took 49 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, 45/45 transitions.
Graph (complete) has 140 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 46 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 42 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 41 transition count 39
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 41 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 40 transition count 38
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 38
Applied a total of 15 rules in 7 ms. Remains 40 /48 variables (removed 8) and now considering 38/45 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/48 places, 38/45 transitions.
// Phase 1: matrix 38 rows 40 cols
[2022-05-15 18:12:01] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 155992 resets, run finished after 566 ms. (steps per millisecond=1766 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 96085 resets, run finished after 395 ms. (steps per millisecond=2531 ) properties (out of 1) seen :4
// Phase 1: matrix 38 rows 40 cols
[2022-05-15 18:12:02] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:02] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 18:12:02] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-15 18:12:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:02] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-15 18:12:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:12:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 18:12:02] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-15 18:12:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:02] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-15 18:12:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-15 18:12:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2022-05-15 18:12:02] [INFO ] Computed and/alt/rep : 36/170/36 causal constraints (skipped 1 transitions) in 2 ms.
[2022-05-15 18:12:02] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2022-05-15 18:12:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-05-15 18:12:02] [INFO ] Added : 28 causal constraints over 6 iterations in 78 ms. Result :sat
Minimization took 16 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, 38/38 transitions.
Applied a total of 0 rules in 6 ms. Remains 40 /40 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 38/38 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 38/38 transitions.
Applied a total of 0 rules in 5 ms. Remains 40 /40 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 40 cols
[2022-05-15 18:12:03] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:03] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 38 rows 40 cols
[2022-05-15 18:12:03] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-15 18:12:03] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2022-05-15 18:12:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 38 rows 40 cols
[2022-05-15 18:12:03] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:03] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 38/38 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-06 in 1530 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-09
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:12:03] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1244 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:12:03] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:12:03] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:12:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:03] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-15 18:12:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:12:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:12:03] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:12:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:03] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-15 18:12:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 18:12:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2022-05-15 18:12:03] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2022-05-15 18:12:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2022-05-15 18:12:03] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-15 18:12:03] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2022-05-15 18:12:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-05-15 18:12:03] [INFO ] Added : 36 causal constraints over 8 iterations in 97 ms. Result :sat
Minimization took 18 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, 45/45 transitions.
Graph (complete) has 140 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 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 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 4 place count 44 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 41 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 39
Applied a total of 12 rules in 5 ms. Remains 40 /48 variables (removed 8) and now considering 39/45 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/48 places, 39/45 transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:12:03] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 155996 resets, run finished after 569 ms. (steps per millisecond=1757 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95979 resets, run finished after 406 ms. (steps per millisecond=2463 ) properties (out of 1) seen :0
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:12:04] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:04] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 18:12:04] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-15 18:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:04] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-15 18:12:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:12:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 18:12:04] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 18:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:04] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-15 18:12:04] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:12:04] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-15 18:12:04] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2022-05-15 18:12:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2022-05-15 18:12:04] [INFO ] Computed and/alt/rep : 37/178/37 causal constraints (skipped 1 transitions) in 3 ms.
[2022-05-15 18:12:04] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2022-05-15 18:12:04] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2022-05-15 18:12:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2022-05-15 18:12:04] [INFO ] Added : 33 causal constraints over 8 iterations in 131 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:12:04] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:04] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:12:04] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:04] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:12:04] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2022-05-15 18:12:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:12:04] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-15 18:12:04] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-09 in 1662 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-11
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:12:04] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1270 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:12:04] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:12:04] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:04] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-15 18:12:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:12:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:12:04] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:04] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-15 18:12:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 18:12:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-15 18:12:04] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-15 18:12:04] [INFO ] Added : 37 causal constraints over 8 iterations in 47 ms. Result :sat
Minimization took 20 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, 45/45 transitions.
Graph (complete) has 140 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 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 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 4 place count 44 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 41 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 39
Applied a total of 12 rules in 5 ms. Remains 40 /48 variables (removed 8) and now considering 39/45 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/48 places, 39/45 transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:12:05] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156508 resets, run finished after 553 ms. (steps per millisecond=1808 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95978 resets, run finished after 402 ms. (steps per millisecond=2487 ) properties (out of 1) seen :0
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:12:05] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:05] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 18:12:05] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 18:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:05] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-15 18:12:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:12:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 18:12:06] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-15 18:12:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:06] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-15 18:12:06] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:12:06] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-15 18:12:06] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2022-05-15 18:12:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2022-05-15 18:12:06] [INFO ] Computed and/alt/rep : 37/174/37 causal constraints (skipped 1 transitions) in 3 ms.
[2022-05-15 18:12:06] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2022-05-15 18:12:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-05-15 18:12:06] [INFO ] Added : 32 causal constraints over 7 iterations in 76 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:12:06] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:06] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:12:06] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-15 18:12:06] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:12:06] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2022-05-15 18:12:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-15 18:12:06] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-15 18:12:06] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-11 in 1502 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-13
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:12:06] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1241 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :4
// Phase 1: matrix 45 rows 48 cols
[2022-05-15 18:12:06] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:12:06] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:06] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-15 18:12:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:12:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:12:06] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:12:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:06] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-15 18:12:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 18:12:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2022-05-15 18:12:06] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2022-05-15 18:12:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-05-15 18:12:06] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-15 18:12:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-15 18:12:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-05-15 18:12:06] [INFO ] Added : 34 causal constraints over 8 iterations in 98 ms. Result :sat
Minimization took 13 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, 45/45 transitions.
Graph (complete) has 140 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 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 43
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 10 place count 41 transition count 39
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 41 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 40 transition count 38
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 40 transition count 38
Applied a total of 13 rules in 6 ms. Remains 40 /48 variables (removed 8) and now considering 38/45 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/48 places, 38/45 transitions.
// Phase 1: matrix 38 rows 40 cols
[2022-05-15 18:12:06] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 125152 resets, run finished after 522 ms. (steps per millisecond=1915 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 83308 resets, run finished after 396 ms. (steps per millisecond=2525 ) properties (out of 1) seen :4
// Phase 1: matrix 38 rows 40 cols
[2022-05-15 18:12:07] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 18:12:07] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 18:12:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:07] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-15 18:12:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:12:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 18:12:07] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 18:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:12:07] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-15 18:12:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 18:12:07] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2022-05-15 18:12:07] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2022-05-15 18:12:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2022-05-15 18:12:07] [INFO ] Computed and/alt/rep : 37/166/37 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-15 18:12:07] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2022-05-15 18:12:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-05-15 18:12:07] [INFO ] Added : 25 causal constraints over 7 iterations in 78 ms. Result :sat
Minimization took 24 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, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 38/38 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 40 cols
[2022-05-15 18:12:07] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-15 18:12:07] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 38 rows 40 cols
[2022-05-15 18:12:07] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 18:12:07] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2022-05-15 18:12:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 38 rows 40 cols
[2022-05-15 18:12:07] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 18:12:07] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 38/38 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-13 in 1519 ms.
[2022-05-15 18:12:07] [INFO ] Flatten gal took : 26 ms
[2022-05-15 18:12:08] [INFO ] Applying decomposition
[2022-05-15 18:12:08] [INFO ] Flatten gal took : 7 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/graph13404876669352035464.txt' '-o' '/tmp/graph13404876669352035464.bin' '-w' '/tmp/graph13404876669352035464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13404876669352035464.bin' '-l' '-1' '-v' '-w' '/tmp/graph13404876669352035464.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:12:08] [INFO ] Decomposing Gal with order
[2022-05-15 18:12:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:12:08] [INFO ] Removed a total of 15 redundant transitions.
[2022-05-15 18:12:08] [INFO ] Flatten gal took : 37 ms
[2022-05-15 18:12:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2022-05-15 18:12:08] [INFO ] Time to serialize gal into /tmp/UpperBounds1143832788302920186.gal : 3 ms
[2022-05-15 18:12:08] [INFO ] Time to serialize properties into /tmp/UpperBounds7654718579082690281.prop : 0 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/UpperBounds1143832788302920186.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7654718579082690281.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...274
Loading property file /tmp/UpperBounds7654718579082690281.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,1265,0.152089,9056,692,244,8162,1078,213,22493,86,3039,0
Total reachable state count : 1265

Verifying 6 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DoubleExponent-PT-002-UpperBounds-01 :0 <= i5.u9.p60 <= 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.168839,9056,1,0,8162,1078,286,22493,106,3039,657
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-002-UpperBounds-05 :0 <= i1.u3.p96 <= 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.176604,9056,1,0,8162,1086,311,22493,111,4640,945
Min sum of variable value : 0
Maximum sum along a path : 16
Bounds property DoubleExponent-PT-002-UpperBounds-06 :0 <= i3.u1.p108 <= 16
FORMULA DoubleExponent-PT-002-UpperBounds-06 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-06,0,0.177208,9056,1,0,8162,1114,326,22493,133,4738,1019
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-002-UpperBounds-09 :0 <= i5.u9.p93 <= 1
FORMULA DoubleExponent-PT-002-UpperBounds-09 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-09,0,0.177862,9056,1,0,8162,1130,345,22493,133,4809,1286
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-002-UpperBounds-11 :0 <= i5.u10.p94 <= 1
FORMULA DoubleExponent-PT-002-UpperBounds-11 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-11,0,0.178443,9056,1,0,8162,1132,363,22493,135,4832,1476
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DoubleExponent-PT-002-UpperBounds-13 :0 <= i5.u8.p55 <= 4
FORMULA DoubleExponent-PT-002-UpperBounds-13 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-13,0,0.184941,9056,1,0,8162,1405,380,22493,149,6080,1873
Total runtime 25348 ms.

BK_STOP 1652638328398

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ 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="itstools"
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-4028"
echo " Executing tool itstools"
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 r078-tall-165260109900173"
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 ;