Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool marcie
Input is S_SafeBus-COL-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r141-csrt-149443424000187
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495085149680

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

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Unfolding complete |P|=60|T|=97|A|=568
Time for unfolding: 0m 1.523sec

Net: SafeBus_COL_03
(NrP: 60 NrTr: 97 NrArc: 568)

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

net check time: 0m 0.000sec

init dd package: 0m 1.321sec


RS generation: 0m 0.070sec


-> reachability set: #nodes 1021 (1.0e+03) #states 4,650 (3)



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

checking: AG [~ [3<=FMCb_dot]]
normalized: ~ [E [true U 3<=FMCb_dot]]

abstracting: (3<=FMCb_dot)
states: 0
-> the formula is TRUE

FORMULA SafeBus-COL-03-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [~ [~ [3<=S_tout_dot]]]]
normalized: ~ [E [true U 3<=S_tout_dot]]

abstracting: (3<=S_tout_dot)
states: 0
-> the formula is TRUE

FORMULA SafeBus-COL-03-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [2<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)]]
normalized: ~ [E [true U 2<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)]]

abstracting: (2<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1))
states: 0
-> the formula is TRUE

FORMULA SafeBus-COL-03-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [~ [~ [[3<=FMCb_dot & 1<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)]]]]
normalized: E [true U [3<=FMCb_dot & 1<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)]]

abstracting: (1<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1))
states: 1,602 (3)
abstracting: (3<=FMCb_dot)
states: 0
-> the formula is FALSE

FORMULA SafeBus-COL-03-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AG [[~ [[2<=FMCb_dot & 2<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)]] | ~ [~ [S_tout_dot<=sum(FMC_It3, FMC_It2, FMC_It1)]]]]
normalized: ~ [E [true U ~ [[~ [[2<=FMCb_dot & 2<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)]] | S_tout_dot<=sum(FMC_It3, FMC_It2, FMC_It1)]]]]

abstracting: (S_tout_dot<=sum(FMC_It3, FMC_It2, FMC_It1))
states: 2,667 (3)
abstracting: (2<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1))
states: 180
abstracting: (2<=FMCb_dot)
states: 0
-> the formula is TRUE

FORMULA SafeBus-COL-03-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: AG [[[~ [sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)] | [3<=FMCb_dot & sum(PMC_It3, PMC_It2, PMC_It1)<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)]] | ~ [2<=S_tout_dot]]]
normalized: ~ [E [true U ~ [[[[3<=FMCb_dot & sum(PMC_It3, PMC_It2, PMC_It1)<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)] | ~ [sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)]] | ~ [2<=S_tout_dot]]]]]

abstracting: (2<=S_tout_dot)
states: 0
abstracting: (sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1))
states: 4,650 (3)
abstracting: (sum(PMC_It3, PMC_It2, PMC_It1)<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1))
states: 4,650 (3)
abstracting: (3<=FMCb_dot)
states: 0
-> the formula is TRUE

FORMULA SafeBus-COL-03-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: EF [[sum(PMC_It3, PMC_It2, PMC_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1) & [3<=sum(FMC_It3, FMC_It2, FMC_It1) & [S_tout_dot<=cable_free_dot | 2<=sum(loop_em_It3, loop_em_It2, loop_em_It1)]]]]
normalized: E [true U [sum(PMC_It3, PMC_It2, PMC_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1) & [3<=sum(FMC_It3, FMC_It2, FMC_It1) & [S_tout_dot<=cable_free_dot | 2<=sum(loop_em_It3, loop_em_It2, loop_em_It1)]]]]

abstracting: (2<=sum(loop_em_It3, loop_em_It2, loop_em_It1))
states: 180
abstracting: (S_tout_dot<=cable_free_dot)
states: 2,436 (3)
abstracting: (3<=sum(FMC_It3, FMC_It2, FMC_It1))
states: 0
abstracting: (sum(PMC_It3, PMC_It2, PMC_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1))
states: 4,650 (3)
-> the formula is FALSE

FORMULA SafeBus-COL-03-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.062sec

checking: EF [[~ [~ [3<=FMCb_dot]] & [[S_tout_dot<=ACK_dot | 2<=sum(wait_cable_It3, wait_cable_It2, wait_cable_It1)] & [sum(loop_em_It3, loop_em_It2, loop_em_It1)<=sum(FMC_It3, FMC_It2, FMC_It1) & 2<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)]]]]
normalized: E [true U [3<=FMCb_dot & [[S_tout_dot<=ACK_dot | 2<=sum(wait_cable_It3, wait_cable_It2, wait_cable_It1)] & [sum(loop_em_It3, loop_em_It2, loop_em_It1)<=sum(FMC_It3, FMC_It2, FMC_It1) & 2<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)]]]]

abstracting: (2<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1))
states: 0
abstracting: (sum(loop_em_It3, loop_em_It2, loop_em_It1)<=sum(FMC_It3, FMC_It2, FMC_It1))
states: 3,372 (3)
abstracting: (2<=sum(wait_cable_It3, wait_cable_It2, wait_cable_It1))
states: 1,692 (3)
abstracting: (S_tout_dot<=ACK_dot)
states: 2,559 (3)
abstracting: (3<=FMCb_dot)
states: 0
-> the formula is FALSE

FORMULA SafeBus-COL-03-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: EF [[[[cable_free_dot<=R_tout_dot & 3<=T_out_dot] & 3<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)] & [sum(wait_cable_It3, wait_cable_It2, wait_cable_It1)<=sum(loop_em_It3, loop_em_It2, loop_em_It1) | [1<=cable_free_dot | 3<=sum(PMC_It3, PMC_It2, PMC_It1)]]]]
normalized: E [true U [[3<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1) & [cable_free_dot<=R_tout_dot & 3<=T_out_dot]] & [sum(wait_cable_It3, wait_cable_It2, wait_cable_It1)<=sum(loop_em_It3, loop_em_It2, loop_em_It1) | [1<=cable_free_dot | 3<=sum(PMC_It3, PMC_It2, PMC_It1)]]]]

abstracting: (3<=sum(PMC_It3, PMC_It2, PMC_It1))
states: 0
abstracting: (1<=cable_free_dot)
states: 690
abstracting: (sum(wait_cable_It3, wait_cable_It2, wait_cable_It1)<=sum(loop_em_It3, loop_em_It2, loop_em_It1))
states: 1,824 (3)
abstracting: (3<=T_out_dot)
states: 0
abstracting: (cable_free_dot<=R_tout_dot)
states: 4,305 (3)
abstracting: (3<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1))
states: 0
-> the formula is FALSE

FORMULA SafeBus-COL-03-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.061sec

checking: EF [[[[3<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1) & 2<=FMCb_dot] & 2<=sum(loop_em_It3, loop_em_It2, loop_em_It1)] | [[sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=T_out_dot | sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=S_tout_dot] & 3<=S_tout_dot]]]
normalized: E [true U [[3<=S_tout_dot & [sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=T_out_dot | sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=S_tout_dot]] | [2<=sum(loop_em_It3, loop_em_It2, loop_em_It1) & [3<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1) & 2<=FMCb_dot]]]]

abstracting: (2<=FMCb_dot)
states: 0
abstracting: (3<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1))
states: 144
abstracting: (2<=sum(loop_em_It3, loop_em_It2, loop_em_It1))
states: 180
abstracting: (sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=S_tout_dot)
states: 3,831 (3)
abstracting: (sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=T_out_dot)
states: 468
abstracting: (3<=S_tout_dot)
states: 0
-> the formula is FALSE

FORMULA SafeBus-COL-03-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.061sec

checking: EF [~ [[[R_tout_dot<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1) | 3<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)] | ~ [sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=S_tout_dot]]]]
normalized: E [true U ~ [[[R_tout_dot<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1) | 3<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)] | ~ [sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=S_tout_dot]]]]

abstracting: (sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=S_tout_dot)
states: 2,559 (3)
abstracting: (3<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1))
states: 0
abstracting: (R_tout_dot<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1))
states: 3,675 (3)
-> the formula is FALSE

FORMULA SafeBus-COL-03-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.064sec

checking: EF [[~ [sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)] & [[1<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1) & 2<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)] & ~ [sum(MSG_It3, MSG_It2, MSG_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)]]]]
normalized: E [true U [[[1<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1) & 2<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)] & ~ [sum(MSG_It3, MSG_It2, MSG_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)]] & ~ [sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)]]]

abstracting: (sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1))
states: 4,650 (3)
abstracting: (sum(MSG_It3, MSG_It2, MSG_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1))
states: 4,650 (3)
abstracting: (2<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1))
states: 828
abstracting: (1<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1))
states: 1,602 (3)
-> the formula is FALSE

FORMULA SafeBus-COL-03-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: AG [[sum(PMC_It3, PMC_It2, PMC_It1)<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1) | [[sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1) & T_out_dot<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)] | 2<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)]]]
normalized: ~ [E [true U ~ [[sum(PMC_It3, PMC_It2, PMC_It1)<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1) | [2<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1) | [sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1) & T_out_dot<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)]]]]]]

abstracting: (T_out_dot<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1))
states: 4,362 (3)
abstracting: (sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1))
states: 4,650 (3)
abstracting: (2<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1))
states: 180
abstracting: (sum(PMC_It3, PMC_It2, PMC_It1)<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1))
states: 4,344 (3)
-> the formula is TRUE

FORMULA SafeBus-COL-03-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.044sec

checking: AG [[~ [~ [sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)<=sum(msgl_It3, msgl_It2, msgl_It1)]] & [[2<=T_out_dot | 3<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)] | [1<=T_out_dot | 1<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)]]]]
normalized: ~ [E [true U ~ [[sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)<=sum(msgl_It3, msgl_It2, msgl_It1) & [[1<=T_out_dot | 1<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)] | [2<=T_out_dot | 3<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)]]]]]]

abstracting: (3<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1))
states: 144
abstracting: (2<=T_out_dot)
states: 0
abstracting: (1<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1))
states: 4,650 (3)
abstracting: (1<=T_out_dot)
states: 468
abstracting: (sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)<=sum(msgl_It3, msgl_It2, msgl_It1))
states: 4,650 (3)
-> the formula is TRUE

FORMULA SafeBus-COL-03-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: EF [[[~ [sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)<=sum(RMC_It3, RMC_It2, RMC_It1)] & [3<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1) & 3<=sum(wait_cable_It3, wait_cable_It2, wait_cable_It1)]] | [[3<=sum(MSG_It3, MSG_It2, MSG_It1) | 2<=sum(MSG_It3, MSG_It2, MSG_It1)] | [1<=cable_free_dot & 2<=sum(PMC_It3, PMC_It2, PMC_It1)]]]]
normalized: E [true U [[[1<=cable_free_dot & 2<=sum(PMC_It3, PMC_It2, PMC_It1)] | [3<=sum(MSG_It3, MSG_It2, MSG_It1) | 2<=sum(MSG_It3, MSG_It2, MSG_It1)]] | [[3<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1) & 3<=sum(wait_cable_It3, wait_cable_It2, wait_cable_It1)] & ~ [sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)<=sum(RMC_It3, RMC_It2, RMC_It1)]]]]

abstracting: (sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)<=sum(RMC_It3, RMC_It2, RMC_It1))
states: 3,120 (3)
abstracting: (3<=sum(wait_cable_It3, wait_cable_It2, wait_cable_It1))
states: 378
abstracting: (3<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1))
states: 0
abstracting: (2<=sum(MSG_It3, MSG_It2, MSG_It1))
states: 0
abstracting: (3<=sum(MSG_It3, MSG_It2, MSG_It1))
states: 0
abstracting: (2<=sum(PMC_It3, PMC_It2, PMC_It1))
states: 0
abstracting: (1<=cable_free_dot)
states: 690
-> the formula is FALSE

FORMULA SafeBus-COL-03-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.121sec

checking: AG [[[[1<=sum(loop_em_It3, loop_em_It2, loop_em_It1) & 2<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)] | [sum(loop_em_It3, loop_em_It2, loop_em_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1) | sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)<=sum(listen_It3, listen_It2, listen_It1)]] & [2<=sum(msgl_It3, msgl_It2, msgl_It1) | ~ [sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)<=sum(listen_It3, listen_It2, listen_It1)]]]]
normalized: ~ [E [true U ~ [[[2<=sum(msgl_It3, msgl_It2, msgl_It1) | ~ [sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)<=sum(listen_It3, listen_It2, listen_It1)]] & [[sum(loop_em_It3, loop_em_It2, loop_em_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1) | sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)<=sum(listen_It3, listen_It2, listen_It1)] | [1<=sum(loop_em_It3, loop_em_It2, loop_em_It1) & 2<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)]]]]]]

abstracting: (2<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1))
states: 828
abstracting: (1<=sum(loop_em_It3, loop_em_It2, loop_em_It1))
states: 1,602 (3)
abstracting: (sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)<=sum(listen_It3, listen_It2, listen_It1))
states: 2,850 (3)
abstracting: (sum(loop_em_It3, loop_em_It2, loop_em_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1))
states: 4,470 (3)
abstracting: (sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)<=sum(listen_It3, listen_It2, listen_It1))
states: 2,850 (3)
abstracting: (2<=sum(msgl_It3, msgl_It2, msgl_It1))
states: 4,650 (3)
-> the formula is FALSE

FORMULA SafeBus-COL-03-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.163sec

totally nodes used: 117948(1.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 166813 426471 593284
used/not used/entry size/cache size: 358205 66750659 16 1024MB
basic ops cache: hits/miss/sum: 75491 257975 333466
used/not used/entry size/cache size: 470675 16306541 12 192MB
unary ops cache: hits/miss/sum: 0 55 55
used/not used/entry size/cache size: 55 8388553 8 64MB
abstract ops cache: hits/miss/sum: 0 56109 56109
used/not used/entry size/cache size: 58 8388550 12 96MB
state nr cache: hits/miss/sum: 5325 8219 13544
used/not used/entry size/cache size: 8214 2088938 32 64MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66991014
1 117752
2 98
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.457sec


BK_STOP 1495085154174

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

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
wait_ack_It1_It1
wait_ack_It2_It2
wait_ack_It3_It3

The net has transition(s) that can never fire:
I_reemit_2_2
I_reemit_1_1
I_reemit_0_0
I_free_0_0
I_free_1_1
I_free_2_2

check for constant places
msgl_It1
msgl_It2
msgl_It3
found 3 constant places
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

.........10 1021.........................10 1021

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_SafeBus-COL-03"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_SafeBus-COL-03.tgz
mv S_SafeBus-COL-03 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is S_SafeBus-COL-03, 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 r141-csrt-149443424000187"
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 ;