Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 5.2K Jun 7 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Jun 7 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 7 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 7.2K Jun 7 17:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 7 17:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 7 17:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 17:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 432K Jun 6 12:11 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 DBSingleClientW-PT-d1m05-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654745091976

Running Version 0
[2022-06-09 03:24: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]
[2022-06-09 03:24:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:24:53] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2022-06-09 03:24:53] [INFO ] Transformed 1440 places.
[2022-06-09 03:24:53] [INFO ] Transformed 672 transitions.
[2022-06-09 03:24:53] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 143 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 03:24:53] [INFO ] Computed 6 place invariants in 45 ms
Incomplete random walk after 10000 steps, including 2277 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1001 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 972 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 03:24:54] [INFO ] Computed 6 place invariants in 21 ms
[2022-06-09 03:24:54] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2022-06-09 03:24:54] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2022-06-09 03:24:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:24:54] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2022-06-09 03:24:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:24:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 03:24:54] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2022-06-09 03:24:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:24:54] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2022-06-09 03:24:54] [INFO ] State equation strengthened by 418 read => feed constraints.
[2022-06-09 03:24:55] [INFO ] [Nat]Added 418 Read/Feed constraints in 244 ms returned sat
[2022-06-09 03:24:55] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 20 ms to minimize.
[2022-06-09 03:24:55] [INFO ] Deduced a trap composed of 115 places in 199 ms of which 1 ms to minimize.
[2022-06-09 03:24:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 560 ms
[2022-06-09 03:24:55] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 135 ms.
[2022-06-09 03:24:56] [INFO ] Added : 116 causal constraints over 24 iterations in 1273 ms. Result :sat
Minimization took 817 ms.
[2022-06-09 03:24:57] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-09 03:24:57] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-09 03:24:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:24:58] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2022-06-09 03:24:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:24:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-09 03:24:58] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-09 03:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:24:58] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2022-06-09 03:24:58] [INFO ] [Nat]Added 418 Read/Feed constraints in 222 ms returned sat
[2022-06-09 03:24:58] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 2 ms to minimize.
[2022-06-09 03:24:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2022-06-09 03:24:58] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 84 ms.
[2022-06-09 03:24:59] [INFO ] Added : 112 causal constraints over 23 iterations in 1094 ms. Result :sat
Minimization took 714 ms.
Current structural bounds on expressions (after SMT) : [7, 5] Max seen :[0, 0]
Incomplete Parikh walk after 76000 steps, including 15064 resets, run finished after 395 ms. (steps per millisecond=192 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 40300 steps, including 7398 resets, run finished after 199 ms. (steps per millisecond=202 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 347 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 185 place count 229 transition count 327
Iterating global reduction 1 with 96 rules applied. Total rules applied 281 place count 229 transition count 327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 285 place count 229 transition count 323
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 358 place count 156 transition count 250
Iterating global reduction 2 with 73 rules applied. Total rules applied 431 place count 156 transition count 250
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 436 place count 156 transition count 245
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 477 place count 115 transition count 180
Iterating global reduction 3 with 41 rules applied. Total rules applied 518 place count 115 transition count 180
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 542 place count 115 transition count 156
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 552 place count 105 transition count 139
Iterating global reduction 4 with 10 rules applied. Total rules applied 562 place count 105 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 563 place count 105 transition count 138
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 571 place count 97 transition count 130
Iterating global reduction 5 with 8 rules applied. Total rules applied 579 place count 97 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 582 place count 97 transition count 127
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 588 place count 91 transition count 121
Iterating global reduction 6 with 6 rules applied. Total rules applied 594 place count 91 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 597 place count 91 transition count 118
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 598 place count 90 transition count 116
Iterating global reduction 7 with 1 rules applied. Total rules applied 599 place count 90 transition count 116
Applied a total of 599 rules in 104 ms. Remains 90 /347 variables (removed 257) and now considering 116/672 (removed 556) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/347 places, 116/672 transitions.
// Phase 1: matrix 116 rows 90 cols
[2022-06-09 03:25:01] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229428 resets, run finished after 980 ms. (steps per millisecond=1020 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98661 resets, run finished after 509 ms. (steps per millisecond=1964 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98834 resets, run finished after 469 ms. (steps per millisecond=2132 ) properties (out of 2) seen :0
// Phase 1: matrix 116 rows 90 cols
[2022-06-09 03:25:03] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:25:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:03] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-09 03:25:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:25:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:25:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:03] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-09 03:25:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-09 03:25:03] [INFO ] [Nat]Added 38 Read/Feed constraints in 9 ms returned sat
[2022-06-09 03:25:03] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2022-06-09 03:25:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2022-06-09 03:25:03] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 84 transitions) in 10 ms.
[2022-06-09 03:25:03] [INFO ] Added : 29 causal constraints over 6 iterations in 95 ms. Result :sat
Minimization took 26 ms.
[2022-06-09 03:25:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:03] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-09 03:25:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:25:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:25:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:03] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-09 03:25:03] [INFO ] [Nat]Added 38 Read/Feed constraints in 8 ms returned sat
[2022-06-09 03:25:03] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2022-06-09 03:25:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2022-06-09 03:25:03] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 84 transitions) in 9 ms.
[2022-06-09 03:25:03] [INFO ] Added : 28 causal constraints over 6 iterations in 86 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [7, 5] Max seen :[0, 0]
Incomplete Parikh walk after 20700 steps, including 3514 resets, run finished after 31 ms. (steps per millisecond=667 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 22000 steps, including 3767 resets, run finished after 37 ms. (steps per millisecond=594 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 90/90 places, 116/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 90 /90 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 116/116 transitions.
Starting structural reductions, iteration 0 : 90/90 places, 116/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 90 /90 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 90 cols
[2022-06-09 03:25:03] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:25:03] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 116 rows 90 cols
[2022-06-09 03:25:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:25:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-09 03:25:04] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2022-06-09 03:25:04] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 116 rows 90 cols
[2022-06-09 03:25:04] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 03:25:04] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 116/116 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-00
// Phase 1: matrix 116 rows 90 cols
[2022-06-09 03:25:04] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2318 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 973 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 116 rows 90 cols
[2022-06-09 03:25:04] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:25:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:25:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:04] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-09 03:25:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:25:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:25:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:04] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-09 03:25:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-09 03:25:04] [INFO ] [Nat]Added 38 Read/Feed constraints in 16 ms returned sat
[2022-06-09 03:25:04] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2022-06-09 03:25:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2022-06-09 03:25:04] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 84 transitions) in 10 ms.
[2022-06-09 03:25:04] [INFO ] Added : 29 causal constraints over 6 iterations in 80 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 22000 steps, including 3800 resets, run finished after 28 ms. (steps per millisecond=785 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 90/90 places, 116/116 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 88 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 88 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 87 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 87 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 86 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 85 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 85 transition count 104
Applied a total of 10 rules in 13 ms. Remains 85 /90 variables (removed 5) and now considering 104/116 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/90 places, 104/116 transitions.
// Phase 1: matrix 104 rows 85 cols
[2022-06-09 03:25:04] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229743 resets, run finished after 885 ms. (steps per millisecond=1129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98324 resets, run finished after 394 ms. (steps per millisecond=2538 ) properties (out of 1) seen :0
// Phase 1: matrix 104 rows 85 cols
[2022-06-09 03:25:05] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:25:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:25:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:05] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-06-09 03:25:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:25:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:25:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:05] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-09 03:25:05] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 03:25:05] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2022-06-09 03:25:05] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2022-06-09 03:25:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-06-09 03:25:05] [INFO ] Computed and/alt/rep : 30/65/30 causal constraints (skipped 73 transitions) in 6 ms.
[2022-06-09 03:25:06] [INFO ] Added : 27 causal constraints over 6 iterations in 64 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 18700 steps, including 3178 resets, run finished after 25 ms. (steps per millisecond=748 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 104/104 transitions.
Starting structural reductions, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 85 cols
[2022-06-09 03:25:06] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:25:06] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 104 rows 85 cols
[2022-06-09 03:25:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:25:06] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 03:25:06] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2022-06-09 03:25:06] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 104 rows 85 cols
[2022-06-09 03:25:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:25:06] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 104/104 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-00 in 2170 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-15
// Phase 1: matrix 116 rows 90 cols
[2022-06-09 03:25:06] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1007 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 116 rows 90 cols
[2022-06-09 03:25:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:25:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:25:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:06] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-09 03:25:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:25:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:25:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:06] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-09 03:25:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-09 03:25:06] [INFO ] [Nat]Added 38 Read/Feed constraints in 8 ms returned sat
[2022-06-09 03:25:06] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2022-06-09 03:25:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2022-06-09 03:25:06] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 84 transitions) in 8 ms.
[2022-06-09 03:25:06] [INFO ] Added : 28 causal constraints over 6 iterations in 71 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 20700 steps, including 3507 resets, run finished after 26 ms. (steps per millisecond=796 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 90/90 places, 116/116 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 89 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 88 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 87 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 87 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 87 transition count 111
Applied a total of 8 rules in 10 ms. Remains 87 /90 variables (removed 3) and now considering 111/116 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/90 places, 111/116 transitions.
// Phase 1: matrix 111 rows 87 cols
[2022-06-09 03:25:06] [INFO ] Computed 2 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 229612 resets, run finished after 889 ms. (steps per millisecond=1124 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 99642 resets, run finished after 401 ms. (steps per millisecond=2493 ) properties (out of 1) seen :0
// Phase 1: matrix 111 rows 87 cols
[2022-06-09 03:25:07] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 03:25:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:25:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:07] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 03:25:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:25:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:25:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:08] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-09 03:25:08] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 03:25:08] [INFO ] [Nat]Added 36 Read/Feed constraints in 18 ms returned sat
[2022-06-09 03:25:08] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2022-06-09 03:25:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2022-06-09 03:25:08] [INFO ] Computed and/alt/rep : 30/66/30 causal constraints (skipped 80 transitions) in 9 ms.
[2022-06-09 03:25:08] [INFO ] Added : 28 causal constraints over 6 iterations in 78 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 22700 steps, including 3996 resets, run finished after 34 ms. (steps per millisecond=667 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 87/87 places, 111/111 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 111/111 transitions.
Starting structural reductions, iteration 0 : 87/87 places, 111/111 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 87 cols
[2022-06-09 03:25:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:25:08] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 111 rows 87 cols
[2022-06-09 03:25:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:25:08] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 03:25:08] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2022-06-09 03:25:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 111 rows 87 cols
[2022-06-09 03:25:08] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 03:25:08] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 111/111 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-15 in 2202 ms.
[2022-06-09 03:25:08] [INFO ] Flatten gal took : 44 ms
[2022-06-09 03:25:08] [INFO ] Applying decomposition
[2022-06-09 03:25:08] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11539713096706744265.txt, -o, /tmp/graph11539713096706744265.bin, -w, /tmp/graph11539713096706744265.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11539713096706744265.bin, -l, -1, -v, -w, /tmp/graph11539713096706744265.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:25:08] [INFO ] Decomposing Gal with order
[2022-06-09 03:25:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:25:08] [INFO ] Removed a total of 116 redundant transitions.
[2022-06-09 03:25:08] [INFO ] Flatten gal took : 42 ms
[2022-06-09 03:25:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 9 ms.
[2022-06-09 03:25:08] [INFO ] Time to serialize gal into /tmp/UpperBounds2548591476308902600.gal : 6 ms
[2022-06-09 03:25:08] [INFO ] Time to serialize properties into /tmp/UpperBounds9206103788472610851.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds2548591476308902600.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds9206103788472610851.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds2548591476308902600.gal -t CGAL -reachable-file /tmp/UpperBounds9206103788472610851.prop --nowitness
Loading property file /tmp/UpperBounds9206103788472610851.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,77203,0.364855,16452,868,467,17369,4580,342,56269,111,22637,0
Total reachable state count : 77203

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m05-UpperBounds-00 :0 <= i5.u15.p102 <= 1
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-00 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
DBSingleClientW-PT-d1m05-UpperBounds-00,0,0.38432,16452,1,0,17369,4580,444,56269,134,22637,860
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m05-UpperBounds-15 :0 <= i0.u0.l449 <= 1
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-15 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
DBSingleClientW-PT-d1m05-UpperBounds-15,0,0.389305,16452,1,0,17369,4580,473,56269,147,22637,1189

BK_STOP 1654745110323

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is DBSingleClientW-PT-d1m05, 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 r323-tall-165472292600073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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