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-165472292600058.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-d0m07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292600058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.6K Jun 7 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 7 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 7 17:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 17:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 5.7K Jun 7 17:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Jun 7 17:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 7 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Jun 7 17:10 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 119K 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-d0m07-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654744962079

Running Version 0
[2022-06-09 03:22:43] [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:22:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:22:43] [INFO ] Load time of PNML (sax parser for PT used): 259 ms
[2022-06-09 03:22:43] [INFO ] Transformed 553 places.
[2022-06-09 03:22:43] [INFO ] Transformed 150 transitions.
[2022-06-09 03:22:43] [INFO ] Parsed PT model containing 553 places and 150 transitions in 300 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 150 rows 109 cols
[2022-06-09 03:22:43] [INFO ] Computed 6 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 1044 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 974 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
// Phase 1: matrix 150 rows 109 cols
[2022-06-09 03:22:44] [INFO ] Computed 6 place invariants in 4 ms
[2022-06-09 03:22:44] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 03:22:44] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 03:22:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:44] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2022-06-09 03:22:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 03:22:44] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:44] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-06-09 03:22:44] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-06-09 03:22:44] [INFO ] [Nat]Added 74 Read/Feed constraints in 18 ms returned sat
[2022-06-09 03:22:44] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 3 ms to minimize.
[2022-06-09 03:22:44] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2022-06-09 03:22:44] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2022-06-09 03:22:44] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2022-06-09 03:22:44] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2022-06-09 03:22:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 327 ms
[2022-06-09 03:22:44] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 17 ms.
[2022-06-09 03:22:44] [INFO ] Added : 31 causal constraints over 7 iterations in 141 ms. Result :sat
Minimization took 33 ms.
[2022-06-09 03:22:44] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 03:22:44] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-09 03:22:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:44] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2022-06-09 03:22:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 03:22:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-09 03:22:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:45] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-06-09 03:22:45] [INFO ] [Nat]Added 74 Read/Feed constraints in 15 ms returned sat
[2022-06-09 03:22:45] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2022-06-09 03:22:45] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2022-06-09 03:22:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2022-06-09 03:22:45] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 14 ms.
[2022-06-09 03:22:45] [INFO ] Added : 34 causal constraints over 7 iterations in 104 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : [6, 55] Max seen :[0, 1]
Incomplete Parikh walk after 28400 steps, including 5518 resets, run finished after 53 ms. (steps per millisecond=535 ) properties (out of 2) seen :2 could not realise parikh vector
Incomplete Parikh walk after 32800 steps, including 6153 resets, run finished after 58 ms. (steps per millisecond=565 ) properties (out of 2) seen :1 could not realise parikh vector
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 101 transition count 137
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 37 place count 78 transition count 96
Iterating global reduction 1 with 23 rules applied. Total rules applied 60 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 78 transition count 95
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 73 place count 66 transition count 83
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 63 transition count 75
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 96 place count 61 transition count 71
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 100 place count 59 transition count 69
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 104 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 105 place count 58 transition count 66
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 108 place count 58 transition count 64
Applied a total of 108 rules in 39 ms. Remains 58 /109 variables (removed 51) and now considering 64/150 (removed 86) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/109 places, 64/150 transitions.
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 03:22:45] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229161 resets, run finished after 623 ms. (steps per millisecond=1605 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000000 steps, including 101789 resets, run finished after 496 ms. (steps per millisecond=2016 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 101899 resets, run finished after 307 ms. (steps per millisecond=3257 ) properties (out of 2) seen :2
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 03:22:46] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:22:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:46] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2022-06-09 03:22:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:46] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 03:22:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:47] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 03:22:47] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 03:22:47] [INFO ] [Nat]Added 19 Read/Feed constraints in 4 ms returned sat
[2022-06-09 03:22:47] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2022-06-09 03:22:47] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2022-06-09 03:22:47] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2022-06-09 03:22:47] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2022-06-09 03:22:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 139 ms
[2022-06-09 03:22:47] [INFO ] Computed and/alt/rep : 19/35/19 causal constraints (skipped 44 transitions) in 5 ms.
[2022-06-09 03:22:47] [INFO ] Added : 19 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [1, 55] Max seen :[1, 1]
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 13000 steps, including 2127 resets, run finished after 16 ms. (steps per millisecond=812 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 64/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 57 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 63
Applied a total of 2 rules in 6 ms. Remains 57 /58 variables (removed 1) and now considering 63/64 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/58 places, 63/64 transitions.
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:47] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 229626 resets, run finished after 581 ms. (steps per millisecond=1721 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 101803 resets, run finished after 312 ms. (steps per millisecond=3205 ) properties (out of 1) seen :1
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:48] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 03:22:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:48] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-09 03:22:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:48] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-09 03:22:48] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 03:22:48] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:22:48] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2022-06-09 03:22:48] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2022-06-09 03:22:48] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2022-06-09 03:22:48] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2022-06-09 03:22:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 107 ms
[2022-06-09 03:22:48] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 7 ms.
[2022-06-09 03:22:48] [INFO ] Added : 18 causal constraints over 4 iterations in 37 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [55] Max seen :[1]
Incomplete Parikh walk after 13000 steps, including 2020 resets, run finished after 17 ms. (steps per millisecond=764 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 7 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:48] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:48] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:22:48] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 03:22:48] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2022-06-09 03:22:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:48] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
Starting property specific reduction for DBSingleClientW-PT-d0m07-UpperBounds-06
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:48] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2302 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1032 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:48] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:22:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:48] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-06-09 03:22:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:48] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-09 03:22:48] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 03:22:48] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:22:48] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 5 ms.
[2022-06-09 03:22:48] [INFO ] Added : 18 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 13000 steps, including 2162 resets, run finished after 14 ms. (steps per millisecond=928 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:48] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229403 resets, run finished after 561 ms. (steps per millisecond=1782 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 101816 resets, run finished after 308 ms. (steps per millisecond=3246 ) properties (out of 1) seen :1
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:22:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:49] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:22:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:49] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:22:49] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 03:22:49] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:22:49] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2022-06-09 03:22:49] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2022-06-09 03:22:49] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2022-06-09 03:22:49] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2022-06-09 03:22:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 103 ms
[2022-06-09 03:22:49] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 5 ms.
[2022-06-09 03:22:49] [INFO ] Added : 18 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 13000 steps, including 2077 resets, run finished after 16 ms. (steps per millisecond=812 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:49] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:49] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 03:22:49] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2022-06-09 03:22:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:50] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:50] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229090 resets, run finished after 565 ms. (steps per millisecond=1769 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 101737 resets, run finished after 293 ms. (steps per millisecond=3412 ) properties (out of 1) seen :1
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:50] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-09 03:22:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:50] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-09 03:22:50] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 03:22:50] [INFO ] [Nat]Added 19 Read/Feed constraints in 4 ms returned sat
[2022-06-09 03:22:50] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2022-06-09 03:22:50] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2022-06-09 03:22:51] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
[2022-06-09 03:22:51] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2022-06-09 03:22:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 114 ms
[2022-06-09 03:22:51] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 9 ms.
[2022-06-09 03:22:51] [INFO ] Added : 18 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 13000 steps, including 2016 resets, run finished after 15 ms. (steps per millisecond=866 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:51] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:22:51] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:51] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:22:51] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 03:22:51] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-06-09 03:22:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:51] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m07-UpperBounds-06 in 2720 ms.
[2022-06-09 03:22:51] [INFO ] Flatten gal took : 32 ms
[2022-06-09 03:22:51] [INFO ] Applying decomposition
[2022-06-09 03:22:51] [INFO ] Flatten gal took : 9 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/graph17312979454334174455.txt, -o, /tmp/graph17312979454334174455.bin, -w, /tmp/graph17312979454334174455.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/graph17312979454334174455.bin, -l, -1, -v, -w, /tmp/graph17312979454334174455.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:22:51] [INFO ] Decomposing Gal with order
[2022-06-09 03:22:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:22:51] [INFO ] Removed a total of 63 redundant transitions.
[2022-06-09 03:22:51] [INFO ] Flatten gal took : 37 ms
[2022-06-09 03:22:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 7 ms.
[2022-06-09 03:22:51] [INFO ] Time to serialize gal into /tmp/UpperBounds10313379342136532570.gal : 4 ms
[2022-06-09 03:22:51] [INFO ] Time to serialize properties into /tmp/UpperBounds14253100788848228618.prop : 1 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/UpperBounds10313379342136532570.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14253100788848228618.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/UpperBounds10313379342136532570.gal -t CGAL -reachable-file /tmp/UpperBounds14253100788848228618.prop --nowitness
Loading property file /tmp/UpperBounds14253100788848228618.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,570032,0.41685,17092,992,338,19439,1700,253,52640,61,17139,0
Total reachable state count : 570032

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property DBSingleClientW-PT-d0m07-UpperBounds-06 :0 <= u8.l122 <= 2
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-06 2 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-d0m07-UpperBounds-06,0,0.469468,17092,1,0,19439,1700,328,52640,83,17139,753
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1654744973058

--------------------
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-d0m07"
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-d0m07, 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-165472292600058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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