Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
........
=====================================================================
Generated by BenchKit 2-3254
Executing tool marcie
Input is S_DrinkVendingMachine-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101-blw3-149441598800219
=====================================================================

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-0
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-1
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-10
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-11
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-12
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-13
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-14
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-15
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-2
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-3
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-4
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-5
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-6
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-7
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-8
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494871391327

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
A model checker for Generalized Stochastic Petri nets

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6

parse successfull
net created successfully

Net: DrinkVendingMachine_PT_02
(NrP: 24 NrTr: 72 NrArc: 440)

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

net check time: 0m 0.000sec

init dd package: 0m 1.202sec

parse successfull
net created successfully

Net: DrinkVendingMachine_PT_02
(NrP: 24 NrTr: 72 NrArc: 440)

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

net check time: 0m 0.000sec

init dd package: 0m 3.937sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 34 (3.4e+01) #states 1,024 (3)



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

checking: AG [EF [3<=sum(theOptions_2, theOptions_1)]]
normalized: ~ [E [true U ~ [E [true U 3<=sum(theOptions_2, theOptions_1)]]]]

abstracting: (3<=sum(theOptions_2, theOptions_1))
states: 0
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-02-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: ~ [EX [AG [2<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)]]]
normalized: ~ [EX [~ [E [true U ~ [2<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)]]]]]

abstracting: (2<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1))
states: 1,024 (3)
.-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-02-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: ~ [EF [[3<=sum(theOptions_2, theOptions_1) & [sum(theOptions_2, theOptions_1)<=sum(optionSlots_2, optionSlots_1) & 2<=sum(theOptions_2, theOptions_1)]]]]
normalized: ~ [E [true U [[sum(theOptions_2, theOptions_1)<=sum(optionSlots_2, optionSlots_1) & 2<=sum(theOptions_2, theOptions_1)] & 3<=sum(theOptions_2, theOptions_1)]]]

abstracting: (3<=sum(theOptions_2, theOptions_1))
states: 0
abstracting: (2<=sum(theOptions_2, theOptions_1))
states: 256
abstracting: (sum(theOptions_2, theOptions_1)<=sum(optionSlots_2, optionSlots_1))
states: 768
-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-02-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.071sec

checking: EF [[3<=sum(optionSlots_2, optionSlots_1) & 1<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)]]
normalized: E [true U [3<=sum(optionSlots_2, optionSlots_1) & 1<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)]]

abstracting: (1<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1))
states: 1,008 (3)
abstracting: (3<=sum(optionSlots_2, optionSlots_1))
states: 0
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-02-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.076sec

checking: EF [EF [sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(theOptions_2, theOptions_1)]]
normalized: E [true U E [true U sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(theOptions_2, theOptions_1)]]

abstracting: (sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(theOptions_2, theOptions_1))
states: 4
-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-02-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: AG [AF [sum(theOptions_2, theOptions_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)]]
normalized: ~ [E [true U EG [~ [sum(theOptions_2, theOptions_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)]]]]

abstracting: (sum(theOptions_2, theOptions_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1))
states: 988
.
EG iterations: 1
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-02-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

checking: sum(productSlots_2, productSlots_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)
normalized: sum(productSlots_2, productSlots_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)

abstracting: (sum(productSlots_2, productSlots_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1))
states: 988
-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-02-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: AG [AX [[1<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) | sum(theOptions_2, theOptions_1)<=sum(productSlots_2, productSlots_1)]]]
normalized: ~ [E [true U EX [~ [[1<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) | sum(theOptions_2, theOptions_1)<=sum(productSlots_2, productSlots_1)]]]]]

abstracting: (sum(theOptions_2, theOptions_1)<=sum(productSlots_2, productSlots_1))
states: 704
abstracting: (1<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1))
states: 1,024 (3)
.-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-02-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.072sec

checking: AG [AF [[sum(theOptions_2, theOptions_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) | 2<=sum(theProducts_2, theProducts_1)]]]
normalized: ~ [E [true U EG [~ [[sum(theOptions_2, theOptions_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) | 2<=sum(theProducts_2, theProducts_1)]]]]]

abstracting: (2<=sum(theProducts_2, theProducts_1))
states: 256
abstracting: (sum(theOptions_2, theOptions_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1))
states: 1,024 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-02-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.070sec

checking: ~ [AF [[sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(optionSlots_2, optionSlots_1) & 2<=sum(optionSlots_2, optionSlots_1)]]]
normalized: EG [~ [[sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(optionSlots_2, optionSlots_1) & 2<=sum(optionSlots_2, optionSlots_1)]]]

abstracting: (2<=sum(optionSlots_2, optionSlots_1))
states: 256
abstracting: (sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(optionSlots_2, optionSlots_1))
states: 4
.
EG iterations: 1
-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-02-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.067sec

checking: AG [[AF [sum(theOptions_2, theOptions_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)] | sum(theProducts_2, theProducts_1)<=sum(optionSlots_2, optionSlots_1)]]
normalized: ~ [E [true U ~ [[~ [EG [~ [sum(theOptions_2, theOptions_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)]]] | sum(theProducts_2, theProducts_1)<=sum(optionSlots_2, optionSlots_1)]]]]

abstracting: (sum(theProducts_2, theProducts_1)<=sum(optionSlots_2, optionSlots_1))
states: 704
abstracting: (sum(theOptions_2, theOptions_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1))
states: 1,024 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-02-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: EF [[sum(theProducts_2, theProducts_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) & ~ [[sum(theProducts_2, theProducts_1)<=sum(theProducts_2, theProducts_1) | 2<=sum(theOptions_2, theOptions_1)]]]]
normalized: E [true U [sum(theProducts_2, theProducts_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) & ~ [[sum(theProducts_2, theProducts_1)<=sum(theProducts_2, theProducts_1) | 2<=sum(theOptions_2, theOptions_1)]]]]

abstracting: (2<=sum(theOptions_2, theOptions_1))
states: 256
abstracting: (sum(theProducts_2, theProducts_1)<=sum(theProducts_2, theProducts_1))
states: 1,024 (3)
abstracting: (sum(theProducts_2, theProducts_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1))
states: 1,024 (3)
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-02-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: E [[1<=sum(theOptions_2, theOptions_1) | [2<=sum(theOptions_2, theOptions_1) | sum(theProducts_2, theProducts_1)<=sum(theOptions_2, theOptions_1)]] U [[3<=sum(optionSlots_2, optionSlots_1) & 1<=sum(theProducts_2, theProducts_1)] | ~ [sum(productSlots_2, productSlots_1)<=sum(productSlots_2, productSlots_1)]]]
normalized: E [[1<=sum(theOptions_2, theOptions_1) | [2<=sum(theOptions_2, theOptions_1) | sum(theProducts_2, theProducts_1)<=sum(theOptions_2, theOptions_1)]] U [~ [sum(productSlots_2, productSlots_1)<=sum(productSlots_2, productSlots_1)] | [3<=sum(optionSlots_2, optionSlots_1) & 1<=sum(theProducts_2, theProducts_1)]]]

abstracting: (1<=sum(theProducts_2, theProducts_1))
states: 768
abstracting: (3<=sum(optionSlots_2, optionSlots_1))
states: 0
abstracting: (sum(productSlots_2, productSlots_1)<=sum(productSlots_2, productSlots_1))
states: 1,024 (3)
abstracting: (sum(theProducts_2, theProducts_1)<=sum(theOptions_2, theOptions_1))
states: 704
abstracting: (2<=sum(theOptions_2, theOptions_1))
states: 256
abstracting: (1<=sum(theOptions_2, theOptions_1))
states: 768
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-02-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.108sec

checking: EF [EF [[3<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1) & sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(theProducts_2, theProducts_1)]]]
normalized: E [true U E [true U [3<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1) & sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(theProducts_2, theProducts_1)]]]

abstracting: (sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(theProducts_2, theProducts_1))
states: 4
abstracting: (3<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1))
states: 672
-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-02-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.079sec

checking: [EF [~ [[sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) | sum(optionSlots_2, optionSlots_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)]]] & E [[sum(productSlots_2, productSlots_1)<=sum(productSlots_2, productSlots_1) | 3<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)] U [sum(theOptions_2, theOptions_1)<=sum(optionSlots_2, optionSlots_1) | sum(theProducts_2, theProducts_1)<=sum(theOptions_2, theOptions_1)]]]
normalized: [E [[sum(productSlots_2, productSlots_1)<=sum(productSlots_2, productSlots_1) | 3<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)] U [sum(theOptions_2, theOptions_1)<=sum(optionSlots_2, optionSlots_1) | sum(theProducts_2, theProducts_1)<=sum(theOptions_2, theOptions_1)]] & E [true U ~ [[sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) | sum(optionSlots_2, optionSlots_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)]]]]

abstracting: (sum(optionSlots_2, optionSlots_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1))
states: 988
abstracting: (sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1))
states: 912
abstracting: (sum(theProducts_2, theProducts_1)<=sum(theOptions_2, theOptions_1))
states: 704
abstracting: (sum(theOptions_2, theOptions_1)<=sum(optionSlots_2, optionSlots_1))
states: 768
abstracting: (3<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1))
states: 672
abstracting: (sum(productSlots_2, productSlots_1)<=sum(productSlots_2, productSlots_1))
states: 1,024 (3)
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-02-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.085sec

checking: [[[[[3<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) & sum(theProducts_2, theProducts_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)] & [sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(theProducts_2, theProducts_1) & sum(theOptions_2, theOptions_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)]] & ~ [2<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)]] & [AX [sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(optionSlots_2, optionSlots_1)] & AG [sum(theProducts_2, theProducts_1)<=sum(theProducts_2, theProducts_1)]]] & [[AX [sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(theProducts_2, theProducts_1)] | ~ [[3<=sum(optionSlots_2, optionSlots_1) & sum(theOptions_2, theOptions_1)<=sum(theProducts_2, theProducts_1)]]] | E [sum(productSlots_2, productSlots_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) U sum(theProducts_2, theProducts_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)]]]
normalized: [[E [sum(productSlots_2, productSlots_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) U sum(theProducts_2, theProducts_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)] | [~ [[3<=sum(optionSlots_2, optionSlots_1) & sum(theOptions_2, theOptions_1)<=sum(theProducts_2, theProducts_1)]] | ~ [EX [~ [sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(theProducts_2, theProducts_1)]]]]] & [[~ [E [true U ~ [sum(theProducts_2, theProducts_1)<=sum(theProducts_2, theProducts_1)]]] & ~ [EX [~ [sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(optionSlots_2, optionSlots_1)]]]] & [~ [2<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)] & [[sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(theProducts_2, theProducts_1) & sum(theOptions_2, theOptions_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)] & [3<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) & sum(theProducts_2, theProducts_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)]]]]]

abstracting: (sum(theProducts_2, theProducts_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1))
states: 1,024 (3)
abstracting: (3<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1))
states: 1,008 (3)
abstracting: (sum(theOptions_2, theOptions_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1))
states: 988
abstracting: (sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(theProducts_2, theProducts_1))
states: 148
abstracting: (2<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1))
states: 1,024 (3)
abstracting: (sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(optionSlots_2, optionSlots_1))
states: 148
.abstracting: (sum(theProducts_2, theProducts_1)<=sum(theProducts_2, theProducts_1))
states: 1,024 (3)
abstracting: (sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(theProducts_2, theProducts_1))
states: 148
.abstracting: (sum(theOptions_2, theOptions_1)<=sum(theProducts_2, theProducts_1))
states: 704
abstracting: (3<=sum(optionSlots_2, optionSlots_1))
states: 0
abstracting: (sum(theProducts_2, theProducts_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1))
states: 1,024 (3)
abstracting: (sum(productSlots_2, productSlots_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1))
states: 1,024 (3)
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-02-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.181sec

totally nodes used: 3904 (3.9e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2682 13511 16193
used/not used/entry size/cache size: 15082 67093782 16 1024MB
basic ops cache: hits/miss/sum: 1365 3731 5096
used/not used/entry size/cache size: 7370 16769846 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 24845 24845
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 186 572 758
used/not used/entry size/cache size: 572 8388036 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67104972
1 3880
2 12
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 8.144sec


BK_STOP 1494871399566

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

check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok

ptnet_zbdd.cc:66: Boundedness exception: net maybe not 1-bounded!

check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:285 (3), effective:26 (0)

initing FirstDep: 0m 0.000sec


iterations count:72 (1), effective:0 (0)

iterations count:270 (3), effective:23 (0)

iterations count:72 (1), effective:0 (0)

iterations count:94 (1), effective:7 (0)

iterations count:275 (3), effective:23 (0)

iterations count:72 (1), effective:0 (0)

iterations count:72 (1), effective:0 (0)

iterations count:72 (1), effective:0 (0)

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="S_DrinkVendingMachine-PT-02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/S_DrinkVendingMachine-PT-02.tgz
mv S_DrinkVendingMachine-PT-02 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is S_DrinkVendingMachine-PT-02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r101-blw3-149441598800219"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;