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 DatabaseWithMutex-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r017kn-qhx2-146347851100169
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463616950399


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=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: DatabaseWithMutex_PT_02
(NrP: 38 NrTr: 32 NrArc: 88)

net check time: 0m 0.000sec

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

init dd package: 0m18.673sec


RS generation: 0m 0.005sec


-> reachability set: #nodes 138 (1.4e+02) #states 153



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

checking: AG [~ [2<=sum(all_active_2, all_active_1)]]
normalized: ~ [E [true U 2<=sum(all_active_2, all_active_1)]]

abstracting: (2<=sum(all_active_2, all_active_1)) states: 1
-> the formula is FALSE

FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.215sec

checking: EF [1<=sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)]
normalized: E [true U 1<=sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)]

abstracting: (1<=sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)) states: 34
-> the formula is TRUE

FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.201sec

checking: EF [~ [1<=sum(Acknowledge_1_1, Acknowledge_2_1, Acknowledge_1_2, Acknowledge_2_2)]]
normalized: E [true U ~ [1<=sum(Acknowledge_1_1, Acknowledge_2_1, Acknowledge_1_2, Acknowledge_2_2)]]

abstracting: (1<=sum(Acknowledge_1_1, Acknowledge_2_1, Acknowledge_1_2, Acknowledge_2_2)) states: 34
-> the formula is TRUE

FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.194sec

checking: AG [sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2)<=sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)]
normalized: ~ [E [true U ~ [sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2)<=sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)]]]

abstracting: (sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2)<=sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)) states: 41
-> the formula is FALSE

FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.198sec

checking: AG [[3<=sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1) & ~ [2<=sum(Acknowledge_1_1, Acknowledge_2_1, Acknowledge_1_2, Acknowledge_2_2)]]]
normalized: ~ [E [true U ~ [[3<=sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1) & ~ [2<=sum(Acknowledge_1_1, Acknowledge_2_1, Acknowledge_1_2, Acknowledge_2_2)]]]]]

abstracting: (2<=sum(Acknowledge_1_1, Acknowledge_2_1, Acknowledge_1_2, Acknowledge_2_2)) states: 2
abstracting: (3<=sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)) states: 0
-> the formula is FALSE

FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.389sec

checking: EF [~ [~ [~ [sum(Acknowledge_1_1, Acknowledge_2_1, Acknowledge_1_2, Acknowledge_2_2)<=sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)]]]]
normalized: E [true U ~ [sum(Acknowledge_1_1, Acknowledge_2_1, Acknowledge_1_2, Acknowledge_2_2)<=sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)]]

abstracting: (sum(Acknowledge_1_1, Acknowledge_2_1, Acknowledge_1_2, Acknowledge_2_2)<=sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)) states: 127
-> the formula is TRUE

FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.202sec

checking: AG [[~ [2<=sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2)] | ~ [[3<=sum(all_active_2, all_active_1) | 2<=sum(MesBuffReply_1_1, MesBuffReply_2_2, MesBuffReply_1_2, MesBuffReply_2_1)]]]]
normalized: ~ [E [true U ~ [[~ [[3<=sum(all_active_2, all_active_1) | 2<=sum(MesBuffReply_1_1, MesBuffReply_2_2, MesBuffReply_1_2, MesBuffReply_2_1)]] | ~ [2<=sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2)]]]]]

abstracting: (2<=sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2)) states: 50
abstracting: (2<=sum(MesBuffReply_1_1, MesBuffReply_2_2, MesBuffReply_1_2, MesBuffReply_2_1)) states: 2
abstracting: (3<=sum(all_active_2, all_active_1)) states: 0
-> the formula is FALSE

FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.581sec

checking: EF [[~ [~ [1<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)]] & sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)<=sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)]]
normalized: E [true U [1<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2) & sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)<=sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)]]

abstracting: (sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)<=sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)) states: 105
abstracting: (1<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)) states: 34
-> the formula is TRUE

FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.398sec

checking: AG [[[2<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2) | ~ [sum(all_passive_1, all_passive_2)<=sum(RecBuff_2_2, RecBuff_1_2, RecBuff_2_1, RecBuff_1_1)]] | ~ [3<=sum(all_active_2, all_active_1)]]]
normalized: ~ [E [true U ~ [[[2<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2) | ~ [sum(all_passive_1, all_passive_2)<=sum(RecBuff_2_2, RecBuff_1_2, RecBuff_2_1, RecBuff_1_1)]] | ~ [3<=sum(all_active_2, all_active_1)]]]]]

abstracting: (3<=sum(all_active_2, all_active_1)) states: 0
abstracting: (sum(all_passive_1, all_passive_2)<=sum(RecBuff_2_2, RecBuff_1_2, RecBuff_2_1, RecBuff_1_1)) states: 8
abstracting: (2<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)) states: 2
-> the formula is TRUE

FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.580sec

checking: AG [[~ [1<=sum(MesBuffReply_1_1, MesBuffReply_2_2, MesBuffReply_1_2, MesBuffReply_2_1)] | ~ [[3<=sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1) | 2<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)]]]]
normalized: ~ [E [true U ~ [[~ [[3<=sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1) | 2<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)]] | ~ [1<=sum(MesBuffReply_1_1, MesBuffReply_2_2, MesBuffReply_1_2, MesBuffReply_2_1)]]]]]

abstracting: (1<=sum(MesBuffReply_1_1, MesBuffReply_2_2, MesBuffReply_1_2, MesBuffReply_2_1)) states: 34
abstracting: (2<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)) states: 2
abstracting: (3<=sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)) states: 0
-> the formula is TRUE

FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.590sec

checking: EF [[~ [sum(Acknowledge_1_1, Acknowledge_2_1, Acknowledge_1_2, Acknowledge_2_2)<=sum(RecBuff_2_2, RecBuff_1_2, RecBuff_2_1, RecBuff_1_1)] & sum(Mutex_1, Mutex_2)<=sum(MesBuffReply_1_1, MesBuffReply_2_2, MesBuffReply_1_2, MesBuffReply_2_1)]]
normalized: E [true U [sum(Mutex_1, Mutex_2)<=sum(MesBuffReply_1_1, MesBuffReply_2_2, MesBuffReply_1_2, MesBuffReply_2_1) & ~ [sum(Acknowledge_1_1, Acknowledge_2_1, Acknowledge_1_2, Acknowledge_2_2)<=sum(RecBuff_2_2, RecBuff_1_2, RecBuff_2_1, RecBuff_1_1)]]]

abstracting: (sum(Acknowledge_1_1, Acknowledge_2_1, Acknowledge_1_2, Acknowledge_2_2)<=sum(RecBuff_2_2, RecBuff_1_2, RecBuff_2_1, RecBuff_1_1)) states: 123
abstracting: (sum(Mutex_1, Mutex_2)<=sum(MesBuffReply_1_1, MesBuffReply_2_2, MesBuffReply_1_2, MesBuffReply_2_1)) states: 84
-> the formula is TRUE

FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.396sec

checking: EF [[[2<=sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2) & ~ [1<=sum(all_active_2, all_active_1)]] | [sum(all_active_2, all_active_1)<=sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1) & ~ [1<=sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)]]]]
normalized: E [true U [[sum(all_active_2, all_active_1)<=sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1) & ~ [1<=sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)]] | [2<=sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2) & ~ [1<=sum(all_active_2, all_active_1)]]]]

abstracting: (1<=sum(all_active_2, all_active_1)) states: 29
abstracting: (2<=sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2)) states: 50
abstracting: (1<=sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)) states: 56
abstracting: (sum(all_active_2, all_active_1)<=sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)) states: 128
-> the formula is TRUE

FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.639sec

checking: AG [[~ [[2<=sum(Acknowledge_1_1, Acknowledge_2_1, Acknowledge_1_2, Acknowledge_2_2) & 2<=sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)]] & [sum(Mutex_1, Mutex_2)<=sum(MesBuffReply_1_1, MesBuffReply_2_2, MesBuffReply_1_2, MesBuffReply_2_1) | sum(Acknowledge_1_1, Acknowledge_2_1, Acknowledge_1_2, Acknowledge_2_2)<=sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)]]]
normalized: ~ [E [true U ~ [[[sum(Mutex_1, Mutex_2)<=sum(MesBuffReply_1_1, MesBuffReply_2_2, MesBuffReply_1_2, MesBuffReply_2_1) | sum(Acknowledge_1_1, Acknowledge_2_1, Acknowledge_1_2, Acknowledge_2_2)<=sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)] & ~ [[2<=sum(Acknowledge_1_1, Acknowledge_2_1, Acknowledge_1_2, Acknowledge_2_2) & 2<=sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)]]]]]]

abstracting: (2<=sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)) states: 2
abstracting: (2<=sum(Acknowledge_1_1, Acknowledge_2_1, Acknowledge_1_2, Acknowledge_2_2)) states: 2
abstracting: (sum(Acknowledge_1_1, Acknowledge_2_1, Acknowledge_1_2, Acknowledge_2_2)<=sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)) states: 123
abstracting: (sum(Mutex_1, Mutex_2)<=sum(MesBuffReply_1_1, MesBuffReply_2_2, MesBuffReply_1_2, MesBuffReply_2_1)) states: 84
-> the formula is FALSE

FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.661sec

checking: AG [[sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2) & [[2<=sum(all_active_2, all_active_1) & sum(MesBuffReply_1_1, MesBuffReply_2_2, MesBuffReply_1_2, MesBuffReply_2_1)<=sum(RecBuff_2_2, RecBuff_1_2, RecBuff_2_1, RecBuff_1_1)] | 1<=sum(Message_1_1, Message_2_1, Message_1_2, Message_2_2)]]]
normalized: ~ [E [true U ~ [[sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2) & [1<=sum(Message_1_1, Message_2_1, Message_1_2, Message_2_2) | [2<=sum(all_active_2, all_active_1) & sum(MesBuffReply_1_1, MesBuffReply_2_2, MesBuffReply_1_2, MesBuffReply_2_1)<=sum(RecBuff_2_2, RecBuff_1_2, RecBuff_2_1, RecBuff_1_1)]]]]]]

abstracting: (sum(MesBuffReply_1_1, MesBuffReply_2_2, MesBuffReply_1_2, MesBuffReply_2_1)<=sum(RecBuff_2_2, RecBuff_1_2, RecBuff_2_1, RecBuff_1_1)) states: 123
abstracting: (2<=sum(all_active_2, all_active_1)) states: 1
abstracting: (1<=sum(Message_1_1, Message_2_1, Message_1_2, Message_2_2)) states: 34
abstracting: (sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)) states: 105
-> the formula is FALSE

FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.545sec

checking: AG [[~ [sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)] & [[sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2)<=sum(MesBuffReply_1_1, MesBuffReply_2_2, MesBuffReply_1_2, MesBuffReply_2_1) | 2<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)] & 3<=sum(Message_1_1, Message_2_1, Message_1_2, Message_2_2)]]]
normalized: ~ [E [true U ~ [[~ [sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)] & [3<=sum(Message_1_1, Message_2_1, Message_1_2, Message_2_2) & [sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2)<=sum(MesBuffReply_1_1, MesBuffReply_2_2, MesBuffReply_1_2, MesBuffReply_2_1) | 2<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)]]]]]]

abstracting: (2<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)) states: 2
abstracting: (sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2)<=sum(MesBuffReply_1_1, MesBuffReply_2_2, MesBuffReply_1_2, MesBuffReply_2_1)) states: 41
abstracting: (3<=sum(Message_1_1, Message_2_1, Message_1_2, Message_2_2)) states: 0
abstracting: (sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)) states: 153
-> the formula is FALSE

FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.481sec

checking: EF [[[[1<=sum(Message_1_1, Message_2_1, Message_1_2, Message_2_2) | sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2)<=sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2)] | ~ [1<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)]] | [[sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)<=sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1) & sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)<=sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)] & 2<=sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2)]]]
normalized: E [true U [[[1<=sum(Message_1_1, Message_2_1, Message_1_2, Message_2_2) | sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2)<=sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2)] | ~ [1<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)]] | [2<=sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2) & [sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)<=sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1) & sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)<=sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)]]]]

abstracting: (sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)<=sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)) states: 105
abstracting: (sum(updating_2_2, updating_1_2, updating_1_1, updating_2_1)<=sum(WaitMutex_2_1, WaitMutex_1_2, WaitMutex_2_2, WaitMutex_1_1)) states: 127
abstracting: (2<=sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2)) states: 50
abstracting: (1<=sum(Modify_1_2, Modify_1_1, Modify_2_1, Modify_2_2)) states: 34
abstracting: (sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2)<=sum(Active_2_1, Active_1_1, Active_2_2, Active_1_2)) states: 153
abstracting: (1<=sum(Message_1_1, Message_2_1, Message_1_2, Message_2_2)) states: 34
-> the formula is TRUE

FORMULA DatabaseWithMutex-COL-02-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.775sec


Total processing time: 0m29.652sec


BK_STOP 1463616980107

--------------------
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.005sec


iterations count:164 (5), effective:28 (0)

initing FirstDep: 0m 0.001sec


iterations count:253 (7), effective:40 (1)

iterations count:182 (5), effective:26 (0)

iterations count:69 (2), effective:4 (0)

iterations count:83 (2), effective:12 (0)

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

iterations count:256 (8), effective:42 (1)

iterations count:259 (8), effective:46 (1)

iterations count:288 (9), effective:47 (1)

iterations count:264 (8), effective:45 (1)

iterations count:208 (6), effective:33 (1)

iterations count:198 (6), effective:35 (1)

iterations count:100 (3), effective:15 (0)

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

iterations count:32 (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="DatabaseWithMutex-PT-02"
export BK_EXAMINATION="ReachabilityCardinality"
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/DatabaseWithMutex-PT-02.tgz
mv DatabaseWithMutex-PT-02 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 DatabaseWithMutex-PT-02, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r017kn-qhx2-146347851100169"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;