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.r127-tall-167814504300053.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is DES-PT-10b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-tall-167814504300053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 79K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-10b-UpperBounds-00
FORMULA_NAME DES-PT-10b-UpperBounds-01
FORMULA_NAME DES-PT-10b-UpperBounds-02
FORMULA_NAME DES-PT-10b-UpperBounds-03
FORMULA_NAME DES-PT-10b-UpperBounds-04
FORMULA_NAME DES-PT-10b-UpperBounds-05
FORMULA_NAME DES-PT-10b-UpperBounds-06
FORMULA_NAME DES-PT-10b-UpperBounds-07
FORMULA_NAME DES-PT-10b-UpperBounds-08
FORMULA_NAME DES-PT-10b-UpperBounds-09
FORMULA_NAME DES-PT-10b-UpperBounds-10
FORMULA_NAME DES-PT-10b-UpperBounds-11
FORMULA_NAME DES-PT-10b-UpperBounds-12
FORMULA_NAME DES-PT-10b-UpperBounds-13
FORMULA_NAME DES-PT-10b-UpperBounds-14
FORMULA_NAME DES-PT-10b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678174672628

Running Version 202205111006
[2023-03-07 07:37:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-07 07:37:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 07:37:54] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2023-03-07 07:37:54] [INFO ] Transformed 320 places.
[2023-03-07 07:37:54] [INFO ] Transformed 271 transitions.
[2023-03-07 07:37:54] [INFO ] Found NUPN structural information;
[2023-03-07 07:37:54] [INFO ] Parsed PT model containing 320 places and 271 transitions in 297 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 271 rows 320 cols
[2023-03-07 07:37:54] [INFO ] Computed 65 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 81 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :14
FORMULA DES-PT-10b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
// Phase 1: matrix 271 rows 320 cols
[2023-03-07 07:37:54] [INFO ] Computed 65 place invariants in 6 ms
[2023-03-07 07:37:54] [INFO ] [Real]Absence check using 39 positive place invariants in 17 ms returned sat
[2023-03-07 07:37:54] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-07 07:37:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:37:54] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2023-03-07 07:37:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:37:54] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2023-03-07 07:37:54] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 67 ms returned sat
[2023-03-07 07:37:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:37:55] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2023-03-07 07:37:55] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 5 ms to minimize.
[2023-03-07 07:37:55] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 1 ms to minimize.
[2023-03-07 07:37:55] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2023-03-07 07:37:55] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2023-03-07 07:37:55] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2023-03-07 07:37:55] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2023-03-07 07:37:55] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2023-03-07 07:37:55] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2023-03-07 07:37:56] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2023-03-07 07:37:56] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 0 ms to minimize.
[2023-03-07 07:37:56] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 0 ms to minimize.
[2023-03-07 07:37:56] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 0 ms to minimize.
[2023-03-07 07:37:56] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1252 ms
[2023-03-07 07:37:56] [INFO ] Computed and/alt/rep : 265/485/265 causal constraints (skipped 5 transitions) in 16 ms.
[2023-03-07 07:37:57] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 0 ms to minimize.
[2023-03-07 07:37:57] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2023-03-07 07:37:57] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2023-03-07 07:37:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 316 ms
[2023-03-07 07:37:57] [INFO ] Added : 230 causal constraints over 47 iterations in 1686 ms. Result :sat
Minimization took 102 ms.
[2023-03-07 07:37:58] [INFO ] [Real]Absence check using 39 positive place invariants in 19 ms returned sat
[2023-03-07 07:37:58] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 9 ms returned sat
[2023-03-07 07:37:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:37:58] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-03-07 07:37:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:37:58] [INFO ] [Nat]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-07 07:37:58] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 22 ms returned sat
[2023-03-07 07:37:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:37:58] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-07 07:37:58] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2023-03-07 07:37:58] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 0 ms to minimize.
[2023-03-07 07:37:58] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2023-03-07 07:37:58] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2023-03-07 07:37:58] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 0 ms to minimize.
[2023-03-07 07:37:59] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2023-03-07 07:37:59] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2023-03-07 07:37:59] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2023-03-07 07:37:59] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 0 ms to minimize.
[2023-03-07 07:37:59] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 839 ms
[2023-03-07 07:37:59] [INFO ] Computed and/alt/rep : 265/485/265 causal constraints (skipped 5 transitions) in 17 ms.
[2023-03-07 07:38:00] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 0 ms to minimize.
[2023-03-07 07:38:00] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2023-03-07 07:38:00] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2023-03-07 07:38:00] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2023-03-07 07:38:01] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2023-03-07 07:38:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 443 ms
[2023-03-07 07:38:01] [INFO ] Added : 253 causal constraints over 52 iterations in 1850 ms. Result :sat
Minimization took 145 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 320/320 places, 271/271 transitions.
Graph (complete) has 621 edges and 320 vertex of which 309 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 309 transition count 243
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 288 transition count 243
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 288 transition count 234
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 279 transition count 234
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 260 transition count 215
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 260 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 260 transition count 214
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 259 transition count 214
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 244 transition count 199
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 244 transition count 199
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 244 transition count 184
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 242 transition count 183
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 242 transition count 180
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 239 transition count 180
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 162 transition count 103
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 4 with 4 rules applied. Total rules applied 315 place count 160 transition count 105
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 160 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 159 transition count 104
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 159 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 158 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 157 transition count 103
Applied a total of 320 rules in 125 ms. Remains 157 /320 variables (removed 163) and now considering 103/271 (removed 168) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/320 places, 103/271 transitions.
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:01] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47813 resets, run finished after 1740 ms. (steps per millisecond=574 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9301 resets, run finished after 860 ms. (steps per millisecond=1162 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9172 resets, run finished after 785 ms. (steps per millisecond=1273 ) properties (out of 2) seen :0
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:05] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-07 07:38:05] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-07 07:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:05] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-07 07:38:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 111 ms returned sat
[2023-03-07 07:38:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:05] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-07 07:38:05] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 6 ms.
[2023-03-07 07:38:05] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2023-03-07 07:38:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-07 07:38:05] [INFO ] Added : 75 causal constraints over 15 iterations in 212 ms. Result :sat
Minimization took 30 ms.
[2023-03-07 07:38:05] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-07 07:38:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 4 ms returned sat
[2023-03-07 07:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:05] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-07 07:38:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-07 07:38:06] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 55 ms returned sat
[2023-03-07 07:38:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:06] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-07 07:38:06] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-07 07:38:06] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2023-03-07 07:38:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-07 07:38:06] [INFO ] Added : 81 causal constraints over 17 iterations in 212 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 10 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/157 places, 103/103 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 10 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:06] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-07 07:38:06] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:06] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-07 07:38:06] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-07 07:38:06] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:06] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-07 07:38:06] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 157/157 places, 103/103 transitions.
Starting property specific reduction for DES-PT-10b-UpperBounds-05
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:06] [INFO ] Computed 60 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 482 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:06] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-07 07:38:06] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:06] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-07 07:38:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:06] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-07 07:38:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 111 ms returned sat
[2023-03-07 07:38:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:07] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-07 07:38:07] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 6 ms.
[2023-03-07 07:38:07] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2023-03-07 07:38:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-07 07:38:07] [INFO ] Added : 75 causal constraints over 15 iterations in 174 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/157 places, 103/103 transitions.
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:07] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 47765 resets, run finished after 1676 ms. (steps per millisecond=596 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9156 resets, run finished after 783 ms. (steps per millisecond=1277 ) properties (out of 1) seen :0
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:09] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-07 07:38:09] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-07 07:38:09] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-07 07:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:10] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-07 07:38:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 110 ms returned sat
[2023-03-07 07:38:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:10] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-07 07:38:10] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 6 ms.
[2023-03-07 07:38:10] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2023-03-07 07:38:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-07 07:38:10] [INFO ] Added : 75 causal constraints over 15 iterations in 205 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/157 places, 103/103 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:10] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-07 07:38:10] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:10] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-07 07:38:10] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-07 07:38:10] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:10] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-07 07:38:10] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 157/157 places, 103/103 transitions.
Ending property specific reduction for DES-PT-10b-UpperBounds-05 in 3987 ms.
Starting property specific reduction for DES-PT-10b-UpperBounds-07
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:10] [INFO ] Computed 60 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 476 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:10] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-07 07:38:10] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:10] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-07 07:38:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:10] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-07 07:38:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 52 ms returned sat
[2023-03-07 07:38:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:11] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-07 07:38:11] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 6 ms.
[2023-03-07 07:38:11] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2023-03-07 07:38:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-07 07:38:11] [INFO ] Added : 81 causal constraints over 17 iterations in 204 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/157 places, 103/103 transitions.
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:11] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 47796 resets, run finished after 1624 ms. (steps per millisecond=615 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9064 resets, run finished after 760 ms. (steps per millisecond=1315 ) properties (out of 1) seen :0
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:13] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-07 07:38:13] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 4 ms returned sat
[2023-03-07 07:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:13] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-07 07:38:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:14] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 53 ms returned sat
[2023-03-07 07:38:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:14] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-07 07:38:14] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 6 ms.
[2023-03-07 07:38:14] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2023-03-07 07:38:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-07 07:38:14] [INFO ] Added : 81 causal constraints over 17 iterations in 236 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/157 places, 103/103 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:14] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-07 07:38:14] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:14] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-07 07:38:14] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-07 07:38:14] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 103 rows 157 cols
[2023-03-07 07:38:14] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-07 07:38:14] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 157/157 places, 103/103 transitions.
Ending property specific reduction for DES-PT-10b-UpperBounds-07 in 3880 ms.
[2023-03-07 07:38:14] [INFO ] Flatten gal took : 44 ms
[2023-03-07 07:38:14] [INFO ] Applying decomposition
[2023-03-07 07:38:14] [INFO ] Flatten gal took : 13 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/graph8856498687835545671.txt' '-o' '/tmp/graph8856498687835545671.bin' '-w' '/tmp/graph8856498687835545671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8856498687835545671.bin' '-l' '-1' '-v' '-w' '/tmp/graph8856498687835545671.weights' '-q' '0' '-e' '0.001'
[2023-03-07 07:38:15] [INFO ] Decomposing Gal with order
[2023-03-07 07:38:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-07 07:38:15] [INFO ] Removed a total of 50 redundant transitions.
[2023-03-07 07:38:15] [INFO ] Flatten gal took : 52 ms
[2023-03-07 07:38:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 6 ms.
[2023-03-07 07:38:15] [INFO ] Time to serialize gal into /tmp/UpperBounds14001996204972014920.gal : 5 ms
[2023-03-07 07:38:15] [INFO ] Time to serialize properties into /tmp/UpperBounds10112401433069977953.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14001996204972014920.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10112401433069977953.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...276
Loading property file /tmp/UpperBounds10112401433069977953.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,1.91634e+12,1.33288,59632,12046,512,170499,1425,281,115492,148,6228,0
Total reachable state count : 1916344938808

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-10b-UpperBounds-05 :0 <= u49.p20 <= 1
FORMULA DES-PT-10b-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
DES-PT-10b-UpperBounds-05,0,1.47669,59888,1,0,170499,1934,463,115492,196,12383,1596
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-10b-UpperBounds-07 :0 <= i1.u2.p40 <= 1
FORMULA DES-PT-10b-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-10b-UpperBounds-07,0,1.53691,59888,1,0,170499,1980,511,115492,196,13073,1706
Total runtime 22931 ms.

BK_STOP 1678174696741

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is DES-PT-10b, 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 r127-tall-167814504300053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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