Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r522-tall-167987247100229.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is EisenbergMcGuire-PT-04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247100229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 11K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 255K Mar 31 16:48 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 EisenbergMcGuire-PT-04-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680820816834

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-04
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 22:40:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-06 22:40:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:40:18] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-04-06 22:40:18] [INFO ] Transformed 196 places.
[2023-04-06 22:40:18] [INFO ] Transformed 448 transitions.
[2023-04-06 22:40:18] [INFO ] Found NUPN structural information;
[2023-04-06 22:40:18] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
FORMULA EisenbergMcGuire-PT-04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 284 out of 448 initially.
// Phase 1: matrix 284 rows 196 cols
[2023-04-06 22:40:18] [INFO ] Computed 13 invariants in 19 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :9
FORMULA EisenbergMcGuire-PT-04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :0
[2023-04-06 22:40:18] [INFO ] Flow matrix only has 284 transitions (discarded 164 similar events)
// Phase 1: matrix 284 rows 196 cols
[2023-04-06 22:40:18] [INFO ] Computed 13 invariants in 13 ms
[2023-04-06 22:40:18] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2023-04-06 22:40:18] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-06 22:40:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:18] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2023-04-06 22:40:19] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:40:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-04-06 22:40:19] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-06 22:40:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:19] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-04-06 22:40:19] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-04-06 22:40:19] [INFO ] [Nat]Added 112 Read/Feed constraints in 12 ms returned sat
[2023-04-06 22:40:19] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 24 ms.
[2023-04-06 22:40:19] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 3 ms to minimize.
[2023-04-06 22:40:20] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2023-04-06 22:40:20] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2023-04-06 22:40:20] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 3 ms to minimize.
[2023-04-06 22:40:20] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2023-04-06 22:40:20] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 0 ms to minimize.
[2023-04-06 22:40:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 667 ms
[2023-04-06 22:40:20] [INFO ] Added : 149 causal constraints over 31 iterations in 1466 ms. Result :sat
Minimization took 73 ms.
[2023-04-06 22:40:20] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-06 22:40:20] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 10 ms returned sat
[2023-04-06 22:40:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:20] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-04-06 22:40:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:40:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-04-06 22:40:20] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:20] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-04-06 22:40:20] [INFO ] [Nat]Added 112 Read/Feed constraints in 17 ms returned sat
[2023-04-06 22:40:21] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2023-04-06 22:40:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-04-06 22:40:21] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2023-04-06 22:40:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 178 ms
[2023-04-06 22:40:21] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 32 ms.
[2023-04-06 22:40:21] [INFO ] Added : 101 causal constraints over 21 iterations in 461 ms. Result :sat
Minimization took 59 ms.
[2023-04-06 22:40:21] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-06 22:40:21] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 3 ms returned sat
[2023-04-06 22:40:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:21] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-04-06 22:40:21] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:40:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-04-06 22:40:21] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-06 22:40:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:21] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-04-06 22:40:21] [INFO ] [Nat]Added 112 Read/Feed constraints in 10 ms returned sat
[2023-04-06 22:40:21] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 0 ms to minimize.
[2023-04-06 22:40:22] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:40:22] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2023-04-06 22:40:22] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-06 22:40:22] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-06 22:40:22] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 0 ms to minimize.
[2023-04-06 22:40:22] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 0 ms to minimize.
[2023-04-06 22:40:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 467 ms
[2023-04-06 22:40:22] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 17 ms.
[2023-04-06 22:40:23] [INFO ] Added : 159 causal constraints over 32 iterations in 738 ms. Result :sat
Minimization took 82 ms.
[2023-04-06 22:40:23] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-06 22:40:23] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:23] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-04-06 22:40:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:40:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-06 22:40:23] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:23] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-04-06 22:40:23] [INFO ] [Nat]Added 112 Read/Feed constraints in 22 ms returned sat
[2023-04-06 22:40:23] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-06 22:40:23] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-04-06 22:40:23] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2023-04-06 22:40:23] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2023-04-06 22:40:23] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2023-04-06 22:40:23] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2023-04-06 22:40:23] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2023-04-06 22:40:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-04-06 22:40:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 482 ms
[2023-04-06 22:40:23] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 20 ms.
[2023-04-06 22:40:24] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2023-04-06 22:40:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-04-06 22:40:24] [INFO ] Added : 173 causal constraints over 36 iterations in 870 ms. Result :sat
Minimization took 84 ms.
[2023-04-06 22:40:24] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-06 22:40:24] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-06 22:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:25] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-04-06 22:40:25] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:40:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2023-04-06 22:40:25] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-06 22:40:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:25] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-04-06 22:40:25] [INFO ] [Nat]Added 112 Read/Feed constraints in 8 ms returned sat
[2023-04-06 22:40:25] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2023-04-06 22:40:25] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-04-06 22:40:25] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
[2023-04-06 22:40:25] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-06 22:40:25] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2023-04-06 22:40:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 310 ms
[2023-04-06 22:40:25] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 21 ms.
[2023-04-06 22:40:26] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 22:40:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-04-06 22:40:26] [INFO ] Added : 143 causal constraints over 29 iterations in 762 ms. Result :sat
Minimization took 68 ms.
[2023-04-06 22:40:26] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2023-04-06 22:40:26] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:26] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-04-06 22:40:26] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:40:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-04-06 22:40:26] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:26] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-04-06 22:40:26] [INFO ] [Nat]Added 112 Read/Feed constraints in 9 ms returned sat
[2023-04-06 22:40:26] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:40:26] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-06 22:40:26] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2023-04-06 22:40:26] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
[2023-04-06 22:40:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 278 ms
[2023-04-06 22:40:26] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 22 ms.
[2023-04-06 22:40:27] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 0 ms to minimize.
[2023-04-06 22:40:27] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 0 ms to minimize.
[2023-04-06 22:40:28] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
[2023-04-06 22:40:28] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-06 22:40:28] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2023-04-06 22:40:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 490 ms
[2023-04-06 22:40:28] [INFO ] Added : 209 causal constraints over 43 iterations in 1564 ms. Result :sat
Minimization took 118 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 448/448 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 196 transition count 444
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 192 transition count 444
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 192 transition count 393
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 141 transition count 393
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 122 place count 129 transition count 345
Iterating global reduction 2 with 12 rules applied. Total rules applied 134 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 158 place count 117 transition count 333
Applied a total of 158 rules in 61 ms. Remains 117 /196 variables (removed 79) and now considering 333/448 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 117/196 places, 333/448 transitions.
Normalized transition count is 169 out of 333 initially.
// Phase 1: matrix 169 rows 117 cols
[2023-04-06 22:40:28] [INFO ] Computed 13 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 973 ms. (steps per millisecond=1027 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=2873 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=3154 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=2824 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=3105 ) properties (out of 4) seen :0
[2023-04-06 22:40:31] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2023-04-06 22:40:31] [INFO ] Computed 13 invariants in 3 ms
[2023-04-06 22:40:31] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 22:40:31] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:31] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-04-06 22:40:31] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:40:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 22:40:31] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:31] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-04-06 22:40:31] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:40:31] [INFO ] [Nat]Added 76 Read/Feed constraints in 6 ms returned sat
[2023-04-06 22:40:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-04-06 22:40:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-04-06 22:40:31] [INFO ] Computed and/alt/rep : 166/497/130 causal constraints (skipped 35 transitions) in 14 ms.
[2023-04-06 22:40:31] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-04-06 22:40:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-04-06 22:40:31] [INFO ] Added : 40 causal constraints over 9 iterations in 162 ms. Result :sat
Minimization took 25 ms.
[2023-04-06 22:40:31] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 22:40:31] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:31] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-04-06 22:40:31] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:40:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 22:40:31] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:31] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-04-06 22:40:31] [INFO ] [Nat]Added 76 Read/Feed constraints in 7 ms returned sat
[2023-04-06 22:40:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-04-06 22:40:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-04-06 22:40:31] [INFO ] Computed and/alt/rep : 166/497/130 causal constraints (skipped 35 transitions) in 11 ms.
[2023-04-06 22:40:31] [INFO ] Added : 17 causal constraints over 4 iterations in 61 ms. Result :sat
Minimization took 21 ms.
[2023-04-06 22:40:31] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 22:40:31] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-06 22:40:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:31] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-04-06 22:40:31] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:40:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-06 22:40:31] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:31] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-04-06 22:40:31] [INFO ] [Nat]Added 76 Read/Feed constraints in 6 ms returned sat
[2023-04-06 22:40:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-04-06 22:40:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-06 22:40:31] [INFO ] Computed and/alt/rep : 166/497/130 causal constraints (skipped 35 transitions) in 10 ms.
[2023-04-06 22:40:32] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2023-04-06 22:40:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-04-06 22:40:32] [INFO ] Added : 45 causal constraints over 9 iterations in 185 ms. Result :sat
Minimization took 30 ms.
[2023-04-06 22:40:32] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-06 22:40:32] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:32] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-04-06 22:40:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:40:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 22:40:32] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:32] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-04-06 22:40:32] [INFO ] [Nat]Added 76 Read/Feed constraints in 9 ms returned sat
[2023-04-06 22:40:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-04-06 22:40:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-04-06 22:40:32] [INFO ] Computed and/alt/rep : 166/497/130 causal constraints (skipped 35 transitions) in 11 ms.
[2023-04-06 22:40:32] [INFO ] Added : 36 causal constraints over 8 iterations in 101 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Applied a total of 0 rules in 13 ms. Remains 117 /117 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 117/117 places, 333/333 transitions.
Normalized transition count is 169 out of 333 initially.
// Phase 1: matrix 169 rows 117 cols
[2023-04-06 22:40:32] [INFO ] Computed 13 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 900 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=3164 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 315 ms. (steps per millisecond=3174 ) properties (out of 2) seen :0
[2023-04-06 22:40:34] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2023-04-06 22:40:34] [INFO ] Computed 13 invariants in 3 ms
[2023-04-06 22:40:34] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-06 22:40:34] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-06 22:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:34] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-04-06 22:40:34] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:40:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 22:40:34] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:34] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-04-06 22:40:34] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:40:34] [INFO ] [Nat]Added 76 Read/Feed constraints in 6 ms returned sat
[2023-04-06 22:40:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-04-06 22:40:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-04-06 22:40:34] [INFO ] Computed and/alt/rep : 166/497/130 causal constraints (skipped 35 transitions) in 9 ms.
[2023-04-06 22:40:34] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2023-04-06 22:40:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-04-06 22:40:34] [INFO ] Added : 45 causal constraints over 9 iterations in 189 ms. Result :sat
Minimization took 28 ms.
[2023-04-06 22:40:34] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 22:40:34] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-06 22:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:34] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-04-06 22:40:34] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:40:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 22:40:34] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:34] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-04-06 22:40:34] [INFO ] [Nat]Added 76 Read/Feed constraints in 7 ms returned sat
[2023-04-06 22:40:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-04-06 22:40:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-04-06 22:40:34] [INFO ] Computed and/alt/rep : 166/497/130 causal constraints (skipped 35 transitions) in 10 ms.
[2023-04-06 22:40:34] [INFO ] Added : 36 causal constraints over 8 iterations in 97 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Applied a total of 0 rules in 10 ms. Remains 117 /117 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 117/117 places, 333/333 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Applied a total of 0 rules in 9 ms. Remains 117 /117 variables (removed 0) and now considering 333/333 (removed 0) transitions.
[2023-04-06 22:40:34] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-06 22:40:34] [INFO ] Invariant cache hit.
[2023-04-06 22:40:34] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-04-06 22:40:34] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-06 22:40:34] [INFO ] Invariant cache hit.
[2023-04-06 22:40:34] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:40:35] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-04-06 22:40:35] [INFO ] Redundant transitions in 23 ms returned []
[2023-04-06 22:40:35] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-06 22:40:35] [INFO ] Invariant cache hit.
[2023-04-06 22:40:35] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 442 ms. Remains : 117/117 places, 333/333 transitions.
Starting property specific reduction for EisenbergMcGuire-PT-04-UpperBounds-09
Normalized transition count is 169 out of 333 initially.
// Phase 1: matrix 169 rows 117 cols
[2023-04-06 22:40:35] [INFO ] Computed 13 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
[2023-04-06 22:40:35] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2023-04-06 22:40:35] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 22:40:35] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 22:40:35] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:35] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-04-06 22:40:35] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:40:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 22:40:35] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-06 22:40:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:35] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-04-06 22:40:35] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:40:35] [INFO ] [Nat]Added 76 Read/Feed constraints in 7 ms returned sat
[2023-04-06 22:40:35] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-04-06 22:40:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-04-06 22:40:35] [INFO ] Computed and/alt/rep : 166/497/130 causal constraints (skipped 35 transitions) in 9 ms.
[2023-04-06 22:40:35] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2023-04-06 22:40:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-04-06 22:40:35] [INFO ] Added : 45 causal constraints over 9 iterations in 183 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 117 transition count 332
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 332
Applied a total of 2 rules in 10 ms. Remains 116 /117 variables (removed 1) and now considering 332/333 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 116/117 places, 332/333 transitions.
Normalized transition count is 168 out of 332 initially.
// Phase 1: matrix 168 rows 116 cols
[2023-04-06 22:40:35] [INFO ] Computed 13 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 905 ms. (steps per millisecond=1104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=3095 ) properties (out of 1) seen :0
[2023-04-06 22:40:36] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
// Phase 1: matrix 168 rows 116 cols
[2023-04-06 22:40:36] [INFO ] Computed 13 invariants in 3 ms
[2023-04-06 22:40:36] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-06 22:40:36] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:36] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-04-06 22:40:36] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:40:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-06 22:40:37] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-06 22:40:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:37] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-04-06 22:40:37] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:40:37] [INFO ] [Nat]Added 76 Read/Feed constraints in 6 ms returned sat
[2023-04-06 22:40:37] [INFO ] Computed and/alt/rep : 165/496/129 causal constraints (skipped 35 transitions) in 10 ms.
[2023-04-06 22:40:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-04-06 22:40:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-04-06 22:40:37] [INFO ] Added : 35 causal constraints over 7 iterations in 134 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 332/332 transitions.
Applied a total of 0 rules in 8 ms. Remains 116 /116 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 116/116 places, 332/332 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 332/332 transitions.
Applied a total of 0 rules in 7 ms. Remains 116 /116 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-04-06 22:40:37] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2023-04-06 22:40:37] [INFO ] Invariant cache hit.
[2023-04-06 22:40:37] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-04-06 22:40:37] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2023-04-06 22:40:37] [INFO ] Invariant cache hit.
[2023-04-06 22:40:37] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:40:37] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-04-06 22:40:37] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-06 22:40:37] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2023-04-06 22:40:37] [INFO ] Invariant cache hit.
[2023-04-06 22:40:37] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 427 ms. Remains : 116/116 places, 332/332 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-04-UpperBounds-09 in 2466 ms.
Starting property specific reduction for EisenbergMcGuire-PT-04-UpperBounds-10
Normalized transition count is 169 out of 333 initially.
// Phase 1: matrix 169 rows 117 cols
[2023-04-06 22:40:37] [INFO ] Computed 13 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
[2023-04-06 22:40:37] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2023-04-06 22:40:37] [INFO ] Computed 13 invariants in 0 ms
[2023-04-06 22:40:37] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-06 22:40:37] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:37] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-04-06 22:40:37] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:40:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-06 22:40:37] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:37] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-04-06 22:40:37] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:40:37] [INFO ] [Nat]Added 76 Read/Feed constraints in 8 ms returned sat
[2023-04-06 22:40:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-04-06 22:40:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-04-06 22:40:37] [INFO ] Computed and/alt/rep : 166/497/130 causal constraints (skipped 35 transitions) in 13 ms.
[2023-04-06 22:40:37] [INFO ] Added : 36 causal constraints over 8 iterations in 111 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Applied a total of 0 rules in 6 ms. Remains 117 /117 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 117/117 places, 333/333 transitions.
Normalized transition count is 169 out of 333 initially.
// Phase 1: matrix 169 rows 117 cols
[2023-04-06 22:40:38] [INFO ] Computed 13 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 899 ms. (steps per millisecond=1112 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 326 ms. (steps per millisecond=3067 ) properties (out of 1) seen :0
[2023-04-06 22:40:39] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2023-04-06 22:40:39] [INFO ] Computed 13 invariants in 2 ms
[2023-04-06 22:40:39] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 22:40:39] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:40:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:39] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-04-06 22:40:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:40:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 22:40:39] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 3 ms returned sat
[2023-04-06 22:40:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:40:39] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-04-06 22:40:39] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:40:39] [INFO ] [Nat]Added 76 Read/Feed constraints in 7 ms returned sat
[2023-04-06 22:40:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-04-06 22:40:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-04-06 22:40:39] [INFO ] Computed and/alt/rep : 166/497/130 causal constraints (skipped 35 transitions) in 10 ms.
[2023-04-06 22:40:39] [INFO ] Added : 36 causal constraints over 8 iterations in 100 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Applied a total of 0 rules in 6 ms. Remains 117 /117 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 117/117 places, 333/333 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Applied a total of 0 rules in 5 ms. Remains 117 /117 variables (removed 0) and now considering 333/333 (removed 0) transitions.
[2023-04-06 22:40:39] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-06 22:40:39] [INFO ] Invariant cache hit.
[2023-04-06 22:40:39] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-04-06 22:40:39] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-06 22:40:39] [INFO ] Invariant cache hit.
[2023-04-06 22:40:39] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:40:39] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-04-06 22:40:39] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-06 22:40:39] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-06 22:40:39] [INFO ] Invariant cache hit.
[2023-04-06 22:40:40] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 424 ms. Remains : 117/117 places, 333/333 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-04-UpperBounds-10 in 2392 ms.
[2023-04-06 22:40:40] [INFO ] Flatten gal took : 56 ms
[2023-04-06 22:40:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-04-06 22:40:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 117 places, 333 transitions and 1626 arcs took 2 ms.
Total runtime 21999 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: EisenbergMcGuire_PT_04
(NrP: 117 NrTr: 333 NrArc: 1626)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.004sec

net check time: 0m 0.000sec

init dd package: 0m 2.728sec


RS generation: 0m13.005sec


-> reachability set: #nodes 81088 (8.1e+04) #states 145,507 (5)



starting MCC model checker
--------------------------

checking: place_bound(p97)
normalized: place_bound(p97)

-> the formula is 1

FORMULA EisenbergMcGuire-PT-04-UpperBounds-09 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p40)
normalized: place_bound(p40)

-> the formula is 1

FORMULA EisenbergMcGuire-PT-04-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 606467 (6.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 13384684 55119226 68503910
used/not used/entry size/cache size: 37305580 29803284 16 1024MB
basic ops cache: hits/miss/sum: 36238 228868 265106
used/not used/entry size/cache size: 334548 16442668 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 13320 81098 94418
used/not used/entry size/cache size: 80795 8307813 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66580471
1 461852
2 56531
3 8697
4 1120
5 176
6 17
7 0
8 0
9 0
>= 10 0

Total processing time: 0m17.687sec


BK_STOP 1680820859134

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

39906 73199 82961
iterations count:334551 (1004), effective:3040 (9)

initing FirstDep: 0m 0.000sec

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is EisenbergMcGuire-PT-04, 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 r522-tall-167987247100229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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