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-2979
Executing tool marcie
Input is PhilosophersDyn-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r089kn-ebro-146369093800462
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464114919882


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: PhilosophersDyn_PT_03
(NrP: 30 NrTr: 84 NrArc: 564)

net check time: 0m 0.000sec

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

init dd package: 0m 7.608sec


RS generation: 0m 0.037sec


-> reachability set: #nodes 448 (4.5e+02) #states 325



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

checking: 3<=sum(Forks_3, Forks_2, Forks_1)
normalized: 3<=sum(Forks_3, Forks_2, Forks_1)

abstracting: (3<=sum(Forks_3, Forks_2, Forks_1)) states: 0
-> the formula is FALSE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.065sec

checking: AF [~ [EF [3<=sum(Outside_1, Outside_2, Outside_3)]]]
normalized: ~ [EG [E [true U 3<=sum(Outside_1, Outside_2, Outside_3)]]]

abstracting: (3<=sum(Outside_1, Outside_2, Outside_3)) states: 1
..
EG iterations: 2
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.066sec

checking: EF [AX [[sum(Think_1, Think_2, Think_3)<=sum(HasLeft_1, HasLeft_3, HasLeft_2) | 2<=sum(Think_1, Think_2, Think_3)]]]
normalized: E [true U ~ [EX [~ [[sum(Think_1, Think_2, Think_3)<=sum(HasLeft_1, HasLeft_3, HasLeft_2) | 2<=sum(Think_1, Think_2, Think_3)]]]]]

abstracting: (2<=sum(Think_1, Think_2, Think_3)) states: 63
abstracting: (sum(Think_1, Think_2, Think_3)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)) states: 178
.-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.161sec

checking: AF [[~ [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasRight_3, HasRight_1, HasRight_2)] & EF [sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2)]]]
normalized: ~ [EG [~ [[E [true U sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2)] & ~ [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasRight_3, HasRight_1, HasRight_2)]]]]]

abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasRight_3, HasRight_1, HasRight_2)) states: 130
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2)) states: 243
...
EG iterations: 3
-> the formula is FALSE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.160sec

checking: sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(HasRight_3, HasRight_1, HasRight_2)
normalized: sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(HasRight_3, HasRight_1, HasRight_2)

abstracting: (sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(HasRight_3, HasRight_1, HasRight_2)) states: 7
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.067sec

checking: [E [~ [sum(Think_1, Think_2, Think_3)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)] U 1<=sum(HasRight_3, HasRight_1, HasRight_2)] | EF [AX [3<=sum(HasRight_3, HasRight_1, HasRight_2)]]]
normalized: [E [true U ~ [EX [~ [3<=sum(HasRight_3, HasRight_1, HasRight_2)]]]] | E [~ [sum(Think_1, Think_2, Think_3)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)] U 1<=sum(HasRight_3, HasRight_1, HasRight_2)]]

abstracting: (1<=sum(HasRight_3, HasRight_1, HasRight_2)) states: 138
abstracting: (sum(Think_1, Think_2, Think_3)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)) states: 178
abstracting: (3<=sum(HasRight_3, HasRight_1, HasRight_2)) states: 0
.-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.249sec

checking: [~ [E [3<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2) U 1<=sum(Think_1, Think_2, Think_3)]] | EF [AF [sum(Forks_3, Forks_2, Forks_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]]]
normalized: [~ [E [3<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2) U 1<=sum(Think_1, Think_2, Think_3)]] | E [true U ~ [EG [~ [sum(Forks_3, Forks_2, Forks_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]]]]]

abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)) states: 265
.....
EG iterations: 5
abstracting: (1<=sum(Think_1, Think_2, Think_3)) states: 213
abstracting: (3<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)) states: 204
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.223sec

checking: E [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) U [~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Think_1, Think_2, Think_3)] | [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) | 2<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]]
normalized: E [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) U [[sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) | 2<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)] | ~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Think_1, Think_2, Think_3)]]]

abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Think_1, Think_2, Think_3)) states: 265
abstracting: (2<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 120
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 271
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)) states: 313
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.269sec

checking: ~ [[EG [~ [1<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]] & [EF [2<=sum(Think_1, Think_2, Think_3)] & [[sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2) | sum(Think_1, Think_2, Think_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)] | 1<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]]]]
normalized: ~ [[EG [~ [1<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]] & [E [true U 2<=sum(Think_1, Think_2, Think_3)] & [1<=sum(WaitRight_3, WaitRight_2, WaitRight_1) | [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2) | sum(Think_1, Think_2, Think_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]]]]

abstracting: (sum(Think_1, Think_2, Think_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 232
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)) states: 325
abstracting: (1<=sum(WaitRight_3, WaitRight_2, WaitRight_1)) states: 255
abstracting: (2<=sum(Think_1, Think_2, Think_3)) states: 63
abstracting: (1<=sum(HasLeft_1, HasLeft_3, HasLeft_2)) states: 138
.
EG iterations: 1
-> the formula is FALSE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.351sec

checking: [~ [[~ [~ [sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Think_1, Think_2, Think_3)]] | sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]] & 1<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]
normalized: [1<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2) & ~ [[sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Think_1, Think_2, Think_3) | sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]]]

abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)) states: 325
abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Think_1, Think_2, Think_3)) states: 265
abstracting: (1<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)) states: 324
-> the formula is FALSE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.199sec

checking: [~ [[[3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) & ~ [1<=sum(Outside_1, Outside_2, Outside_3)]] | sum(Think_1, Think_2, Think_3)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]] & EF [~ [[3<=sum(Think_1, Think_2, Think_3) & sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Outside_1, Outside_2, Outside_3)]]]]
normalized: [E [true U ~ [[3<=sum(Think_1, Think_2, Think_3) & sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Outside_1, Outside_2, Outside_3)]]] & ~ [[sum(Think_1, Think_2, Think_3)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2) | [3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) & ~ [1<=sum(Outside_1, Outside_2, Outside_3)]]]]]

abstracting: (1<=sum(Outside_1, Outside_2, Outside_3)) states: 121
abstracting: (3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 24
abstracting: (sum(Think_1, Think_2, Think_3)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)) states: 325
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Outside_1, Outside_2, Outside_3)) states: 127
abstracting: (3<=sum(Think_1, Think_2, Think_3)) states: 6
-> the formula is FALSE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.322sec

checking: [A [[1<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) & sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)] U [1<=sum(Think_1, Think_2, Think_3) | sum(Think_1, Think_2, Think_3)<=sum(HasRight_3, HasRight_1, HasRight_2)]] | ~ [[AF [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Think_1, Think_2, Think_3)] | ~ [~ [sum(Outside_1, Outside_2, Outside_3)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]]]]]
normalized: [[~ [E [~ [[1<=sum(Think_1, Think_2, Think_3) | sum(Think_1, Think_2, Think_3)<=sum(HasRight_3, HasRight_1, HasRight_2)]] U [~ [[1<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) & sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]] & ~ [[1<=sum(Think_1, Think_2, Think_3) | sum(Think_1, Think_2, Think_3)<=sum(HasRight_3, HasRight_1, HasRight_2)]]]]] & ~ [EG [~ [[1<=sum(Think_1, Think_2, Think_3) | sum(Think_1, Think_2, Think_3)<=sum(HasRight_3, HasRight_1, HasRight_2)]]]]] | ~ [[sum(Outside_1, Outside_2, Outside_3)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2) | ~ [EG [~ [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Think_1, Think_2, Think_3)]]]]]]

abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Think_1, Think_2, Think_3)) states: 172
...
EG iterations: 3
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)) states: 306
abstracting: (sum(Think_1, Think_2, Think_3)<=sum(HasRight_3, HasRight_1, HasRight_2)) states: 178
abstracting: (1<=sum(Think_1, Think_2, Think_3)) states: 213
.
EG iterations: 1
abstracting: (sum(Think_1, Think_2, Think_3)<=sum(HasRight_3, HasRight_1, HasRight_2)) states: 178
abstracting: (1<=sum(Think_1, Think_2, Think_3)) states: 213
abstracting: (sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)) states: 7
abstracting: (1<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 255
abstracting: (sum(Think_1, Think_2, Think_3)<=sum(HasRight_3, HasRight_1, HasRight_2)) states: 178
abstracting: (1<=sum(Think_1, Think_2, Think_3)) states: 213
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.659sec

checking: AF [[[[sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Forks_3, Forks_2, Forks_1) | sum(Forks_3, Forks_2, Forks_1)<=sum(Forks_3, Forks_2, Forks_1)] | sum(Forks_3, Forks_2, Forks_1)<=sum(Outside_1, Outside_2, Outside_3)] | [[3<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2) & 1<=sum(WaitRight_3, WaitRight_2, WaitRight_1)] | [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) & sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Outside_1, Outside_2, Outside_3)]]]]
normalized: ~ [EG [~ [[[[sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) & sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Outside_1, Outside_2, Outside_3)] | [3<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2) & 1<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]] | [sum(Forks_3, Forks_2, Forks_1)<=sum(Outside_1, Outside_2, Outside_3) | [sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Forks_3, Forks_2, Forks_1) | sum(Forks_3, Forks_2, Forks_1)<=sum(Forks_3, Forks_2, Forks_1)]]]]]]

abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(Forks_3, Forks_2, Forks_1)) states: 325
abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Forks_3, Forks_2, Forks_1)) states: 247
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(Outside_1, Outside_2, Outside_3)) states: 169
abstracting: (1<=sum(WaitRight_3, WaitRight_2, WaitRight_1)) states: 255
abstracting: (3<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)) states: 204
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Outside_1, Outside_2, Outside_3)) states: 127
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 235
.
EG iterations: 1
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.437sec

checking: [[[~ [[2<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) & 3<=sum(Forks_3, Forks_2, Forks_1)]] | AX [sum(Forks_3, Forks_2, Forks_1)<=sum(Think_1, Think_2, Think_3)]] & ~ [[~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)] | [1<=sum(Outside_1, Outside_2, Outside_3) & 3<=sum(Forks_3, Forks_2, Forks_1)]]]] | [1<=sum(WaitRight_3, WaitRight_2, WaitRight_1) & [~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Forks_3, Forks_2, Forks_1)] & AF [sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(Outside_1, Outside_2, Outside_3)]]]]
normalized: [[1<=sum(WaitRight_3, WaitRight_2, WaitRight_1) & [~ [EG [~ [sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(Outside_1, Outside_2, Outside_3)]]] & ~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Forks_3, Forks_2, Forks_1)]]] | [~ [[[1<=sum(Outside_1, Outside_2, Outside_3) & 3<=sum(Forks_3, Forks_2, Forks_1)] | ~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]]] & [~ [EX [~ [sum(Forks_3, Forks_2, Forks_1)<=sum(Think_1, Think_2, Think_3)]]] | ~ [[2<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) & 3<=sum(Forks_3, Forks_2, Forks_1)]]]]]

abstracting: (3<=sum(Forks_3, Forks_2, Forks_1)) states: 0
abstracting: (2<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 120
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(Think_1, Think_2, Think_3)) states: 247
.abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)) states: 313
abstracting: (3<=sum(Forks_3, Forks_2, Forks_1)) states: 0
abstracting: (1<=sum(Outside_1, Outside_2, Outside_3)) states: 121
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Forks_3, Forks_2, Forks_1)) states: 247
abstracting: (sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(Outside_1, Outside_2, Outside_3)) states: 19
.
EG iterations: 1
abstracting: (1<=sum(WaitRight_3, WaitRight_2, WaitRight_1)) states: 255
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.580sec

checking: [[sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2) | [[[sum(Forks_3, Forks_2, Forks_1)<=sum(Think_1, Think_2, Think_3) | 3<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)] | [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) & sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]] | [1<=sum(Outside_1, Outside_2, Outside_3) & [3<=sum(Outside_1, Outside_2, Outside_3) & sum(Outside_1, Outside_2, Outside_3)<=sum(Outside_1, Outside_2, Outside_3)]]]] | [EX [~ [3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]] & ~ [~ [sum(Forks_3, Forks_2, Forks_1)<=sum(HasRight_3, HasRight_1, HasRight_2)]]]]
normalized: [[sum(Forks_3, Forks_2, Forks_1)<=sum(HasRight_3, HasRight_1, HasRight_2) & EX [~ [3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]] | [sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2) | [[1<=sum(Outside_1, Outside_2, Outside_3) & [3<=sum(Outside_1, Outside_2, Outside_3) & sum(Outside_1, Outside_2, Outside_3)<=sum(Outside_1, Outside_2, Outside_3)]] | [[sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) & sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)] | [sum(Forks_3, Forks_2, Forks_1)<=sum(Think_1, Think_2, Think_3) | 3<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]]]]]

abstracting: (3<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)) states: 204
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(Think_1, Think_2, Think_3)) states: 247
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)) states: 313
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 325
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(Outside_1, Outside_2, Outside_3)) states: 325
abstracting: (3<=sum(Outside_1, Outside_2, Outside_3)) states: 1
abstracting: (1<=sum(Outside_1, Outside_2, Outside_3)) states: 121
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2)) states: 243
abstracting: (3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 24
.abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(HasRight_3, HasRight_1, HasRight_2)) states: 175
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.665sec

checking: [~ [~ [sum(Forks_3, Forks_2, Forks_1)<=sum(Think_1, Think_2, Think_3)]] & [[[[sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasRight_3, HasRight_1, HasRight_2) | sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)] & [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2) & sum(Outside_1, Outside_2, Outside_3)<=sum(Forks_3, Forks_2, Forks_1)]] & EF [3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]] | [[[2<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) | 2<=sum(WaitRight_3, WaitRight_2, WaitRight_1)] | sum(Forks_3, Forks_2, Forks_1)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)] & AF [3<=sum(Outside_1, Outside_2, Outside_3)]]]]
normalized: [sum(Forks_3, Forks_2, Forks_1)<=sum(Think_1, Think_2, Think_3) & [[~ [EG [~ [3<=sum(Outside_1, Outside_2, Outside_3)]]] & [sum(Forks_3, Forks_2, Forks_1)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2) | [2<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) | 2<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]]] | [E [true U 3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)] & [[sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2) & sum(Outside_1, Outside_2, Outside_3)<=sum(Forks_3, Forks_2, Forks_1)] & [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasRight_3, HasRight_1, HasRight_2) | sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]]]]

abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 235
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasRight_3, HasRight_1, HasRight_2)) states: 130
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(Forks_3, Forks_2, Forks_1)) states: 264
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)) states: 325
abstracting: (3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 24
abstracting: (2<=sum(WaitRight_3, WaitRight_2, WaitRight_1)) states: 120
abstracting: (2<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 120
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)) states: 325
abstracting: (3<=sum(Outside_1, Outside_2, Outside_3)) states: 1
.
EG iterations: 1
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(Think_1, Think_2, Think_3)) states: 247
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.739sec


Total processing time: 0m16.222sec


BK_STOP 1464114936152

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

check for maximal unmarked siphon
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

291
iterations count:1658 (19), effective:60 (0)

initing FirstDep: 0m 0.000sec


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

iterations count:458 (5), effective:17 (0)

iterations count:477 (5), effective:13 (0)

iterations count:472 (5), effective:13 (0)
471
iterations count:1364 (16), effective:51 (0)

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

iterations count:652 (7), effective:17 (0)

iterations count:250 (2), effective:6 (0)

iterations count:868 (10), effective:26 (0)

iterations count:85 (1), effective:1 (0)
414
iterations count:1026 (12), effective:30 (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="PhilosophersDyn-PT-03"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is PhilosophersDyn-PT-03, 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 r089kn-ebro-146369093800462"
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 ;