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-2270
Executing tool marcie
Input is S_Philosophers-PT-000005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r204st-blw3-143341204900561
=====================================================================

--------------------
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 Philosophers-COL-000005-CTLCardinality-0
FORMULA_NAME Philosophers-COL-000005-CTLCardinality-1
FORMULA_NAME Philosophers-COL-000005-CTLCardinality-10
FORMULA_NAME Philosophers-COL-000005-CTLCardinality-11
FORMULA_NAME Philosophers-COL-000005-CTLCardinality-12
FORMULA_NAME Philosophers-COL-000005-CTLCardinality-13
FORMULA_NAME Philosophers-COL-000005-CTLCardinality-14
FORMULA_NAME Philosophers-COL-000005-CTLCardinality-15
FORMULA_NAME Philosophers-COL-000005-CTLCardinality-2
FORMULA_NAME Philosophers-COL-000005-CTLCardinality-3
FORMULA_NAME Philosophers-COL-000005-CTLCardinality-4
FORMULA_NAME Philosophers-COL-000005-CTLCardinality-5
FORMULA_NAME Philosophers-COL-000005-CTLCardinality-6
FORMULA_NAME Philosophers-COL-000005-CTLCardinality-7
FORMULA_NAME Philosophers-COL-000005-CTLCardinality-8
FORMULA_NAME Philosophers-COL-000005-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1433658123614

Model: S_Philosophers-PT-000005
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: 25 NrTr: 25 NrArc: 80)

net check time: 0m0sec

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

init dd package: 0m3sec


RS generation: 0m0sec


-> reachability set: #nodes 110 (1.1e+02) #states 243



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

checking: [A [1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) U [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) & 1<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]] & ~ [~ [AF [1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]]]]
normalized: [[~ [EG [~ [[sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) & 1<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]]] & ~ [E [~ [1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)] U [~ [1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)] & ~ [[sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) & 1<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]]]]] & ~ [EG [~ [1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]]]]

abstracting: (1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)) states: 120
....
EG iterations: 4
abstracting: (1<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)) states: 241
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)) states: 188
abstracting: (1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)) states: 120
abstracting: (1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)) states: 120
abstracting: (1<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)) states: 241
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)) states: 188
...
EG iterations: 3
-> the formula is FALSE

FORMULA Philosophers-COL-000005-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [[~ [[sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) | sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]] & ~ [[sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) | sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]]]]
normalized: EG [[~ [[sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) | sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]] & ~ [[sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) | sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]]

abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)) states: 77
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)) states: 243
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)) states: 127
abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)) states: 123
.
EG iterations: 1
-> the formula is FALSE

FORMULA Philosophers-COL-000005-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [~ [~ [3<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]] | 3<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]
normalized: [3<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) | 3<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]

abstracting: (3<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)) states: 86
abstracting: (3<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)) states: 51
-> the formula is TRUE

FORMULA Philosophers-COL-000005-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: E [[~ [3<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)] & [3<=sum(Think_5, Think_4, Think_3, Think_2, Think_1) & sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]] U 3<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]
normalized: E [[~ [3<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)] & [3<=sum(Think_5, Think_4, Think_3, Think_2, Think_1) & sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]] U 3<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]

abstracting: (3<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)) states: 0
abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)) states: 32
abstracting: (3<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)) states: 86
abstracting: (3<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)) states: 26
-> the formula is FALSE

FORMULA Philosophers-COL-000005-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [2<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]
normalized: EG [2<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]

abstracting: (2<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)) states: 76
.
EG iterations: 1
-> the formula is FALSE

FORMULA Philosophers-COL-000005-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [EG [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] & [~ [EX [1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]] & A [2<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) U 2<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]]
normalized: [EG [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] & [[~ [E [~ [2<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)] U [~ [2<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] & ~ [2<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]] & ~ [EG [~ [2<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]]] & ~ [EX [1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]]]]

abstracting: (1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)) states: 120
.abstracting: (2<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)) states: 196
...
EG iterations: 3
abstracting: (2<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)) states: 76
abstracting: (2<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)) states: 196
abstracting: (2<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)) states: 76
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)) states: 243

EG iterations: 0
-> the formula is FALSE

FORMULA Philosophers-COL-000005-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [[AF [2<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)] | EF [[sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1) | sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]]
normalized: ~ [[E [true U [sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1) | sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]] | ~ [EG [~ [2<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]]]]]

abstracting: (2<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)) states: 76
.
EG iterations: 1
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)) states: 147
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)) states: 207
-> the formula is FALSE

FORMULA Philosophers-COL-000005-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: A [~ [[3<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) & 1<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]] U AX [1<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]
normalized: [~ [E [[3<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) & 1<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] U [[3<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) & 1<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] & EX [~ [1<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]]] & ~ [EG [EX [~ [1<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]]]

abstracting: (1<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)) states: 161
..
EG iterations: 1
abstracting: (1<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)) states: 161
.abstracting: (1<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)) states: 241
abstracting: (3<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)) states: 26
abstracting: (1<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)) states: 241
abstracting: (3<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)) states: 26
-> the formula is FALSE

FORMULA Philosophers-COL-000005-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[AG [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)] & ~ [[sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) | 1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]]] & EF [[sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1) & 2<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]] | sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]
normalized: [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1) | [E [true U [sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1) & 2<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]] & [~ [[sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) | 1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]] & ~ [E [true U ~ [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]]]]]]

abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)) states: 87
abstracting: (1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)) states: 120
abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)) states: 32
abstracting: (2<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)) states: 76
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)) states: 207
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)) states: 243
-> the formula is TRUE

FORMULA Philosophers-COL-000005-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [E [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) U sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]]
normalized: ~ [E [true U ~ [E [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) U sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]]]]

abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)) states: 243
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)) states: 243
-> the formula is TRUE

FORMULA Philosophers-COL-000005-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)
normalized: sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)

abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)) states: 127
-> the formula is TRUE

FORMULA Philosophers-COL-000005-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[~ [sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)] & 3<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] & sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]]
normalized: ~ [E [true U ~ [[sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) & [3<=sum(Think_5, Think_4, Think_3, Think_2, Think_1) & ~ [sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]]]]]]

abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)) states: 182
abstracting: (3<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)) states: 86
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)) states: 188
-> the formula is FALSE

FORMULA Philosophers-COL-000005-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: 1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)
normalized: 1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)

abstracting: (1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)) states: 120
-> the formula is FALSE

FORMULA Philosophers-COL-000005-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [[[[sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) & sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)] | ~ [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]] & AG [2<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]]]
normalized: EG [[~ [E [true U ~ [2<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]]] & [[sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) & sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)] | ~ [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]]]

abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)) states: 207
abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)) states: 32
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)) states: 243
abstracting: (2<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)) states: 76
.
EG iterations: 1
-> the formula is FALSE

FORMULA Philosophers-COL-000005-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [~ [E [3<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) U 3<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]] | A [[sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) & 1<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)] U ~ [3<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]]]
normalized: [[~ [EG [3<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]] & ~ [E [~ [[sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) & 1<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]] U [3<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) & ~ [[sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) & 1<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]]]]]] | ~ [E [3<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) U 3<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]]]

abstracting: (3<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)) states: 0
abstracting: (3<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)) states: 0
abstracting: (1<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)) states: 161
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)) states: 112
abstracting: (3<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)) states: 26
abstracting: (1<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)) states: 161
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)) states: 112
abstracting: (3<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)) states: 26
.
EG iterations: 1
-> the formula is TRUE

FORMULA Philosophers-COL-000005-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AX [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]
normalized: ~ [EX [~ [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]

abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)) states: 112
.-> the formula is FALSE

FORMULA Philosophers-COL-000005-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m5sec


BK_STOP 1433658128818

--------------------
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:108 (4), effective:15 (0)

initing FirstDep: 0m0sec


iterations count:88 (3), effective:10 (0)

iterations count:109 (4), effective:17 (0)

iterations count:140 (5), effective:18 (0)

iterations count:95 (3), effective:11 (0)

iterations count:231 (9), effective:34 (1)

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

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

iterations count:139 (5), effective:17 (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_Philosophers-PT-000005"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/user/u8/hulinhub/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_Philosophers-PT-000005.tgz
mv S_Philosophers-PT-000005 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is S_Philosophers-PT-000005, 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 r204st-blw3-143341204900561"
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 ;