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-2265
Executing tool marcie
Input is DrinkVendingMachine-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r036kn-qhx2-143214464100093
=====================================================================

--------------------
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 1432543845127

Model: DrinkVendingMachine-PT-02
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 24 NrTr: 72 NrArc: 440)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m12sec


RS generation: 0m0sec


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



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

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

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

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

MC time: 0m0sec

checking: ~ [[[[sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1) & ~ [2<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)]] | EF [1<=sum(theProducts_2, theProducts_1)]] & [[1<=sum(productSlots_2, productSlots_1) | [sum(optionSlots_2, optionSlots_1)<=sum(theProducts_2, theProducts_1) | sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)]] & AG [sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)]]]]
normalized: ~ [[[[1<=sum(productSlots_2, productSlots_1) | [sum(optionSlots_2, optionSlots_1)<=sum(theProducts_2, theProducts_1) | sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)]] & ~ [E [true U ~ [sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)]]]] & [[sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1) & ~ [2<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)]] | E [true U 1<=sum(theProducts_2, theProducts_1)]]]]

abstracting: (1<=sum(theProducts_2, theProducts_1)) states: 768
abstracting: (2<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)) states: 912
abstracting: (sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1)) states: 768
abstracting: (sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)) states: 1,024 (3)
abstracting: (sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)) states: 1,024 (3)
abstracting: (sum(optionSlots_2, optionSlots_1)<=sum(theProducts_2, theProducts_1)) states: 704
abstracting: (1<=sum(productSlots_2, productSlots_1)) states: 768
-> the formula is FALSE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [EX [AG [sum(theProducts_2, theProducts_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)]] & [AG [~ [3<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)]] | EX [[sum(theProducts_2, theProducts_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1) & 2<=sum(optionSlots_2, optionSlots_1)]]]]
normalized: [[~ [E [true U 3<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)]] | EX [[sum(theProducts_2, theProducts_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1) & 2<=sum(optionSlots_2, optionSlots_1)]]] & EX [~ [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)]]]]]

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: (2<=sum(optionSlots_2, optionSlots_1)) states: 256
abstracting: (sum(theProducts_2, theProducts_1)<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)) states: 988
.abstracting: (3<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)) states: 1,008 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [sum(theProducts_2, theProducts_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_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)]]]

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 TRUE

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

MC time: 0m0sec

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

abstracting: (sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_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-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

abstracting: (sum(theOptions_2, theOptions_1)<=sum(theOptions_2, theOptions_1)) states: 1,024 (3)
-> the formula is TRUE

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

MC time: 0m0sec

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

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(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(productSlots_2, productSlots_1)) states: 4
-> the formula is FALSE

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

MC time: 0m0sec

checking: ~ [E [sum(theOptions_2, theOptions_1)<=sum(theProducts_2, theProducts_1) U [3<=sum(optionSlots_2, optionSlots_1) & 2<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)]]]
normalized: ~ [E [sum(theOptions_2, theOptions_1)<=sum(theProducts_2, theProducts_1) U [3<=sum(optionSlots_2, optionSlots_1) & 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)
abstracting: (3<=sum(optionSlots_2, optionSlots_1)) states: 0
abstracting: (sum(theOptions_2, theOptions_1)<=sum(theProducts_2, theProducts_1)) states: 704
-> the formula is TRUE

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

MC time: 0m0sec

checking: [[EG [1<=sum(theProducts_2, theProducts_1)] | [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) | 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)<=sum(optionSlots_2, optionSlots_1) & sum(theOptions_2, theOptions_1)<=sum(theProducts_2, theProducts_1)]]]] & [~ [[sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(theOptions_2, theOptions_1) | ~ [sum(theOptions_2, theOptions_1)<=sum(theOptions_2, theOptions_1)]]] | [~ [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(optionSlots_2, optionSlots_1) & sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(theProducts_2, theProducts_1)]]]]]
normalized: [[[~ [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(optionSlots_2, optionSlots_1) & 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(theOptions_2, theOptions_1) | ~ [sum(theOptions_2, theOptions_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(theProducts_2, theProducts_1)<=sum(optionSlots_2, optionSlots_1) & sum(theOptions_2, theOptions_1)<=sum(theProducts_2, theProducts_1)] | [sum(optionSlots_2, optionSlots_1)<=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)]]] | EG [1<=sum(theProducts_2, theProducts_1)]]]

abstracting: (1<=sum(theProducts_2, theProducts_1)) states: 768
.
EG iterations: 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: (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(theOptions_2, theOptions_1)<=sum(theProducts_2, theProducts_1)) states: 704
abstracting: (sum(theProducts_2, theProducts_1)<=sum(optionSlots_2, optionSlots_1)) states: 704
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(theOptions_2, theOptions_1)<=sum(theOptions_2, theOptions_1)) states: 1,024 (3)
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
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: (sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(optionSlots_2, optionSlots_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-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AF [[AX [3<=sum(productSlots_2, productSlots_1)] | ~ [1<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)]]]
normalized: ~ [EG [~ [[~ [1<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)] | ~ [EX [~ [3<=sum(productSlots_2, productSlots_1)]]]]]]]

abstracting: (3<=sum(productSlots_2, productSlots_1)) states: 0
.abstracting: (1<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)) states: 1,024 (3)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: [~ [[~ [[2<=sum(optionSlots_2, optionSlots_1) | 3<=sum(optionSlots_2, optionSlots_1)]] & [[sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(productSlots_2, productSlots_1) & sum(optionSlots_2, optionSlots_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)] | [sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(optionSlots_2, optionSlots_1) & 3<=sum(theProducts_2, theProducts_1)]]]] & ~ [[sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1) & 1<=sum(theOptions_2, theOptions_1)]]]
normalized: [~ [[sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1) & 1<=sum(theOptions_2, theOptions_1)]] & ~ [[~ [[2<=sum(optionSlots_2, optionSlots_1) | 3<=sum(optionSlots_2, optionSlots_1)]] & [[sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(productSlots_2, productSlots_1) & sum(optionSlots_2, optionSlots_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)] | [sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(optionSlots_2, optionSlots_1) & 3<=sum(theProducts_2, theProducts_1)]]]]]

abstracting: (3<=sum(theProducts_2, theProducts_1)) states: 0
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
abstracting: (sum(optionSlots_2, optionSlots_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)) states: 1,024 (3)
abstracting: (sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(productSlots_2, productSlots_1)) states: 4
abstracting: (3<=sum(optionSlots_2, optionSlots_1)) states: 0
abstracting: (2<=sum(optionSlots_2, optionSlots_1)) states: 256
abstracting: (1<=sum(theOptions_2, theOptions_1)) states: 768
abstracting: (sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1)) states: 768
-> the formula is FALSE

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

MC time: 0m0sec

checking: [[EG [sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)] & sum(optionSlots_2, optionSlots_1)<=sum(optionSlots_2, optionSlots_1)] & [~ [[~ [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)] | [3<=sum(theProducts_2, theProducts_1) & sum(productSlots_2, productSlots_1)<=sum(theOptions_2, theOptions_1)]]] & EX [[sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(optionSlots_2, optionSlots_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)]]]]
normalized: [[sum(optionSlots_2, optionSlots_1)<=sum(optionSlots_2, optionSlots_1) & EG [sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)]] & [EX [[sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=sum(optionSlots_2, optionSlots_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(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)] | [3<=sum(theProducts_2, theProducts_1) & sum(productSlots_2, productSlots_1)<=sum(theOptions_2, theOptions_1)]]]]]

abstracting: (sum(productSlots_2, productSlots_1)<=sum(theOptions_2, theOptions_1)) states: 704
abstracting: (3<=sum(theProducts_2, theProducts_1)) states: 0
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(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)) states: 352
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(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)) states: 1,024 (3)

EG iterations: 0
abstracting: (sum(optionSlots_2, optionSlots_1)<=sum(optionSlots_2, optionSlots_1)) states: 1,024 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: [EX [EF [1<=sum(theProducts_2, theProducts_1)]] & A [[1<=sum(theProducts_2, theProducts_1) & sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1)] U [1<=sum(theOptions_2, theOptions_1) | 1<=sum(productSlots_2, productSlots_1)]]]
normalized: [[~ [E [~ [[1<=sum(theProducts_2, theProducts_1) & sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1)]] U [~ [[1<=sum(theProducts_2, theProducts_1) & sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1)]] & ~ [[1<=sum(theOptions_2, theOptions_1) | 1<=sum(productSlots_2, productSlots_1)]]]]] & ~ [EG [~ [[1<=sum(theOptions_2, theOptions_1) | 1<=sum(productSlots_2, productSlots_1)]]]]] & EX [E [true U 1<=sum(theProducts_2, theProducts_1)]]]

abstracting: (1<=sum(theProducts_2, theProducts_1)) states: 768
.abstracting: (1<=sum(productSlots_2, productSlots_1)) states: 768
abstracting: (1<=sum(theOptions_2, theOptions_1)) states: 768
........
EG iterations: 8
abstracting: (1<=sum(productSlots_2, productSlots_1)) states: 768
abstracting: (1<=sum(theOptions_2, theOptions_1)) states: 768
abstracting: (sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1)) states: 768
abstracting: (1<=sum(theProducts_2, theProducts_1)) states: 768
abstracting: (sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1)) states: 768
abstracting: (1<=sum(theProducts_2, theProducts_1)) states: 768
-> the formula is TRUE

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

MC time: 0m0sec

checking: [[AX [~ [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)]] | EG [[3<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) | sum(theOptions_2, theOptions_1)<=sum(theProducts_2, theProducts_1)]]] | AF [[[sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1) | 3<=sum(theProducts_2, theProducts_1)] & [sum(optionSlots_2, optionSlots_1)<=sum(theOptions_2, theOptions_1) | 3<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)]]]]
normalized: [~ [EG [~ [[[sum(optionSlots_2, optionSlots_1)<=sum(theOptions_2, theOptions_1) | 3<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)] & [sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1) | 3<=sum(theProducts_2, theProducts_1)]]]]] | [~ [EX [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)]] | EG [[3<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) | sum(theOptions_2, theOptions_1)<=sum(theProducts_2, theProducts_1)]]]]

abstracting: (sum(theOptions_2, theOptions_1)<=sum(theProducts_2, theProducts_1)) states: 704
abstracting: (3<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)) states: 1,008 (3)
.
EG iterations: 1
abstracting: (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)) states: 352
.abstracting: (3<=sum(theProducts_2, theProducts_1)) states: 0
abstracting: (sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_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(optionSlots_2, optionSlots_1)<=sum(theOptions_2, theOptions_1)) states: 768
.........
EG iterations: 9
-> the formula is TRUE

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

MC time: 0m0sec


Total processing time: 0m15sec


BK_STOP 1432543860803

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

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: 0m0sec


iterations count:328 (4), effective:28 (0)

initing FirstDep: 0m0sec


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

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

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

iterations count:104 (1), effective:6 (0)

iterations count:74 (1), effective:2 (0)

iterations count:75 (1), effective:1 (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="DrinkVendingMachine-PT-02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/fko/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/DrinkVendingMachine-PT-02.tgz
mv DrinkVendingMachine-PT-02 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is 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 r036kn-qhx2-143214464100093"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 ;