About the Execution of MARCIE for S_SafeBus-COL-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2229.200 | 5071.00 | 4999.00 | 30.30 | FFFFFTFFTFFTTFTT | normal |
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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r141-csrt-149443424000183
=====================================================================
--------------------
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-CTLCardinality-0
FORMULA_NAME SafeBus-COL-03-CTLCardinality-1
FORMULA_NAME SafeBus-COL-03-CTLCardinality-10
FORMULA_NAME SafeBus-COL-03-CTLCardinality-11
FORMULA_NAME SafeBus-COL-03-CTLCardinality-12
FORMULA_NAME SafeBus-COL-03-CTLCardinality-13
FORMULA_NAME SafeBus-COL-03-CTLCardinality-14
FORMULA_NAME SafeBus-COL-03-CTLCardinality-15
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2
FORMULA_NAME SafeBus-COL-03-CTLCardinality-3
FORMULA_NAME SafeBus-COL-03-CTLCardinality-4
FORMULA_NAME SafeBus-COL-03-CTLCardinality-5
FORMULA_NAME SafeBus-COL-03-CTLCardinality-6
FORMULA_NAME SafeBus-COL-03-CTLCardinality-7
FORMULA_NAME SafeBus-COL-03-CTLCardinality-8
FORMULA_NAME SafeBus-COL-03-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1495085144019
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=CTLCardinality.xml --memory=6
parse successfull
net created successfully
Unfolding complete |P|=60|T|=97|A|=568
Time for unfolding: 0m 1.769sec
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.275sec
RS generation: 0m 0.067sec
-> reachability set: #nodes 1021 (1.0e+03) #states 4,650 (3)
starting MCC model checker
--------------------------
checking: AF [EG [1<=FMCb_dot]]
normalized: ~ [EG [~ [EG [1<=FMCb_dot]]]]
abstracting: (1<=FMCb_dot)
states: 3,498 (3)
..........10:821..........20:0.
EG iterations: 21
EG iterations: 0
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.108sec
checking: EF [[~ [[3<=T_out_dot | 2<=cable_free_dot]] & 2<=ACK_dot]]
normalized: E [true U [~ [[3<=T_out_dot | 2<=cable_free_dot]] & 2<=ACK_dot]]
abstracting: (2<=ACK_dot)
states: 0
abstracting: (2<=cable_free_dot)
states: 0
abstracting: (3<=T_out_dot)
states: 0
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: A [EF [2<=sum(MSG_It3, MSG_It2, MSG_It1)] U EX [1<=S_tout_dot]]
normalized: [~ [EG [~ [EX [1<=S_tout_dot]]]] & ~ [E [~ [EX [1<=S_tout_dot]] U [~ [E [true U 2<=sum(MSG_It3, MSG_It2, MSG_It1)]] & ~ [EX [1<=S_tout_dot]]]]]]
abstracting: (1<=S_tout_dot)
states: 2,559 (3)
.abstracting: (2<=sum(MSG_It3, MSG_It2, MSG_It1))
states: 0
abstracting: (1<=S_tout_dot)
states: 2,559 (3)
.abstracting: (1<=S_tout_dot)
states: 2,559 (3)
...........10:0.
EG iterations: 11
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.090sec
checking: [EX [EG [1<=R_tout_dot]] & ~ [~ [S_tout_dot<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)]]]
normalized: [S_tout_dot<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1) & EX [EG [1<=R_tout_dot]]]
abstracting: (1<=R_tout_dot)
states: 2,091 (3)
.
EG iterations: 1
.abstracting: (S_tout_dot<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1))
states: 4,650 (3)
-> the formula is TRUE
FORMULA SafeBus-COL-03-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.027sec
checking: E [EF [3<=sum(wait_cable_It3, wait_cable_It2, wait_cable_It1)] U AX [3<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)]]
normalized: E [E [true U 3<=sum(wait_cable_It3, wait_cable_It2, wait_cable_It1)] U ~ [EX [~ [3<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)]]]]
abstracting: (3<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1))
states: 0
.abstracting: (3<=sum(wait_cable_It3, wait_cable_It2, wait_cable_It1))
states: 378
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.105sec
checking: A [EF [sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=ACK_dot] U AX [FMCb_dot<=sum(FMC_It3, FMC_It2, FMC_It1)]]
normalized: [~ [E [EX [~ [FMCb_dot<=sum(FMC_It3, FMC_It2, FMC_It1)]] U [~ [E [true U sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=ACK_dot]] & EX [~ [FMCb_dot<=sum(FMC_It3, FMC_It2, FMC_It1)]]]]] & ~ [EG [EX [~ [FMCb_dot<=sum(FMC_It3, FMC_It2, FMC_It1)]]]]]
abstracting: (FMCb_dot<=sum(FMC_It3, FMC_It2, FMC_It1))
states: 1,152 (3)
..
EG iterations: 1
abstracting: (FMCb_dot<=sum(FMC_It3, FMC_It2, FMC_It1))
states: 1,152 (3)
.abstracting: (sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=ACK_dot)
states: 3,336 (3)
abstracting: (FMCb_dot<=sum(FMC_It3, FMC_It2, FMC_It1))
states: 1,152 (3)
.-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.058sec
checking: ~ [EG [~ [[sum(msgl_It3, msgl_It2, msgl_It1)<=sum(RMC_It3, RMC_It2, RMC_It1) & 1<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)]]]]
normalized: ~ [EG [~ [[sum(msgl_It3, msgl_It2, msgl_It1)<=sum(RMC_It3, RMC_It2, RMC_It1) & 1<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)]]]]
abstracting: (1<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1))
states: 4,650 (3)
abstracting: (sum(msgl_It3, msgl_It2, msgl_It1)<=sum(RMC_It3, RMC_It2, RMC_It1))
states: 0
EG iterations: 0
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.037sec
checking: ~ [AF [EG [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(MSG_It3, MSG_It2, MSG_It1)]]]
normalized: EG [~ [EG [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(MSG_It3, MSG_It2, MSG_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(MSG_It3, MSG_It2, MSG_It1))
states: 3,246 (3)
..........10:194...
EG iterations: 13
EG iterations: 0
-> the formula is TRUE
FORMULA SafeBus-COL-03-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.083sec
checking: [3<=sum(PMC_It3, PMC_It2, PMC_It1) | AF [EG [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)]]]
normalized: [3<=sum(PMC_It3, PMC_It2, PMC_It1) | ~ [EG [~ [EG [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)]]]]]
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
.
EG iterations: 1
EG iterations: 0
abstracting: (3<=sum(PMC_It3, PMC_It2, PMC_It1))
states: 0
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.038sec
checking: EG [EF [[2<=sum(MSG_It3, MSG_It2, MSG_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)<=cable_free_dot]]]
normalized: EG [E [true U [2<=sum(MSG_It3, MSG_It2, MSG_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)<=cable_free_dot]]]
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)<=cable_free_dot)
states: 2,526 (3)
abstracting: (2<=sum(MSG_It3, MSG_It2, MSG_It1))
states: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: ~ [AF [[3<=sum(wait_msg_It3, wait_msg_It2, wait_msg_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) | 3<=cable_free_dot]]]]
normalized: EG [~ [[3<=sum(wait_msg_It3, wait_msg_It2, wait_msg_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) | 3<=cable_free_dot]]]]
abstracting: (3<=cable_free_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: (3<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1))
states: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA SafeBus-COL-03-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.057sec
checking: EF [A [1<=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) U sum(msgl_It3, msgl_It2, msgl_It1)<=sum(PMC_It3, PMC_It2, PMC_It1)]]
normalized: E [true U [~ [E [~ [sum(msgl_It3, msgl_It2, msgl_It1)<=sum(PMC_It3, PMC_It2, PMC_It1)] U [~ [sum(msgl_It3, msgl_It2, msgl_It1)<=sum(PMC_It3, PMC_It2, PMC_It1)] & ~ [1<=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)]]]] & ~ [EG [~ [sum(msgl_It3, msgl_It2, msgl_It1)<=sum(PMC_It3, PMC_It2, PMC_It1)]]]]]
abstracting: (sum(msgl_It3, msgl_It2, msgl_It1)<=sum(PMC_It3, PMC_It2, PMC_It1))
states: 0
EG iterations: 0
abstracting: (1<=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: 2,340 (3)
abstracting: (sum(msgl_It3, msgl_It2, msgl_It1)<=sum(PMC_It3, PMC_It2, PMC_It1))
states: 0
abstracting: (sum(msgl_It3, msgl_It2, msgl_It1)<=sum(PMC_It3, PMC_It2, PMC_It1))
states: 0
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.068sec
checking: EG [[[[sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=sum(PMC_It3, PMC_It2, PMC_It1) | 3<=sum(listen_It3, listen_It2, listen_It1)] & 1<=sum(listen_It3, listen_It2, listen_It1)] | [1<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1) | ~ [T_out_dot<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)]]]]
normalized: EG [[[1<=sum(listen_It3, listen_It2, listen_It1) & [sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=sum(PMC_It3, PMC_It2, PMC_It1) | 3<=sum(listen_It3, listen_It2, listen_It1)]] | [1<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1) | ~ [T_out_dot<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)]]]]
abstracting: (T_out_dot<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1))
states: 4,650 (3)
abstracting: (1<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1))
states: 4,650 (3)
abstracting: (3<=sum(listen_It3, listen_It2, listen_It1))
states: 24
abstracting: (sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=sum(PMC_It3, PMC_It2, PMC_It1))
states: 3,192 (3)
abstracting: (1<=sum(listen_It3, listen_It2, listen_It1))
states: 2,022 (3)
EG iterations: 0
-> the formula is TRUE
FORMULA SafeBus-COL-03-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.119sec
checking: ~ [~ [A [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(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) U sum(listen_It3, listen_It2, listen_It1)<=sum(MSG_It3, MSG_It2, MSG_It1)]]]
normalized: [~ [EG [~ [sum(listen_It3, listen_It2, listen_It1)<=sum(MSG_It3, MSG_It2, MSG_It1)]]] & ~ [E [~ [sum(listen_It3, listen_It2, listen_It1)<=sum(MSG_It3, MSG_It2, MSG_It1)] U [~ [sum(listen_It3, listen_It2, listen_It1)<=sum(MSG_It3, MSG_It2, MSG_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(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: (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(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,650 (3)
abstracting: (sum(listen_It3, listen_It2, listen_It1)<=sum(MSG_It3, MSG_It2, MSG_It1))
states: 2,916 (3)
abstracting: (sum(listen_It3, listen_It2, listen_It1)<=sum(MSG_It3, MSG_It2, MSG_It1))
states: 2,916 (3)
abstracting: (sum(listen_It3, listen_It2, listen_It1)<=sum(MSG_It3, MSG_It2, MSG_It1))
states: 2,916 (3)
.........
EG iterations: 9
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.080sec
checking: [AG [~ [[3<=sum(cable_used_It3, cable_used_It2, cable_used_It1) & 2<=sum(listen_It3, listen_It2, listen_It1)]]] | [[EG [2<=T_out_dot] & [~ [3<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)] & ~ [R_tout_dot<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)]]] & [sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)<=sum(PMC_It3, PMC_It2, PMC_It1) | ~ [[3<=sum(RMC_It3, RMC_It2, RMC_It1) | 2<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)]]]]]
normalized: [[[sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)<=sum(PMC_It3, PMC_It2, PMC_It1) | ~ [[3<=sum(RMC_It3, RMC_It2, RMC_It1) | 2<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)]]] & [[~ [R_tout_dot<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)] & ~ [3<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)]] & EG [2<=T_out_dot]]] | ~ [E [true U [3<=sum(cable_used_It3, cable_used_It2, cable_used_It1) & 2<=sum(listen_It3, listen_It2, listen_It1)]]]]
abstracting: (2<=sum(listen_It3, listen_It2, listen_It1))
states: 366
abstracting: (3<=sum(cable_used_It3, cable_used_It2, cable_used_It1))
states: 0
abstracting: (2<=T_out_dot)
states: 0
.
EG iterations: 1
abstracting: (3<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1))
states: 0
abstracting: (R_tout_dot<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1))
states: 4,650 (3)
abstracting: (2<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1))
states: 0
abstracting: (3<=sum(RMC_It3, RMC_It2, RMC_It1))
states: 0
abstracting: (sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)<=sum(PMC_It3, PMC_It2, PMC_It1))
states: 468
-> the formula is TRUE
FORMULA SafeBus-COL-03-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.140sec
checking: [[EG [~ [sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=sum(msgl_It3, msgl_It2, msgl_It1)]] & ~ [AG [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)]]] | [AX [[sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1) & sum(cable_used_It3, cable_used_It2, cable_used_It1)<=FMCb_dot]] & [[[3<=R_tout_dot | 1<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)] | [sum(listen_It3, listen_It2, listen_It1)<=sum(wait_cable_It3, wait_cable_It2, wait_cable_It1) | sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)]] & EG [sum(PMC_It3, PMC_It2, PMC_It1)<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)]]]]
normalized: [[[EG [sum(PMC_It3, PMC_It2, PMC_It1)<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)] & [[sum(listen_It3, listen_It2, listen_It1)<=sum(wait_cable_It3, wait_cable_It2, wait_cable_It1) | sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)] | [3<=R_tout_dot | 1<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)]]] & ~ [EX [~ [[sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1) & sum(cable_used_It3, cable_used_It2, cable_used_It1)<=FMCb_dot]]]]] | [E [true U ~ [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)]] & EG [~ [sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=sum(msgl_It3, msgl_It2, msgl_It1)]]]]
abstracting: (sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=sum(msgl_It3, msgl_It2, msgl_It1))
states: 4,650 (3)
.
EG iterations: 1
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: (sum(cable_used_It3, cable_used_It2, cable_used_It1)<=FMCb_dot)
states: 3,498 (3)
abstracting: (sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1))
states: 4,650 (3)
.abstracting: (1<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1))
states: 4,650 (3)
abstracting: (3<=R_tout_dot)
states: 0
abstracting: (sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1))
states: 4,650 (3)
abstracting: (sum(listen_It3, listen_It2, listen_It1)<=sum(wait_cable_It3, wait_cable_It2, wait_cable_It1))
states: 3,780 (3)
abstracting: (sum(PMC_It3, PMC_It2, PMC_It1)<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1))
states: 4,650 (3)
EG iterations: 0
-> the formula is TRUE
FORMULA SafeBus-COL-03-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.159sec
totally nodes used: 482226(4.8e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 526389 1165392 1691781
used/not used/entry size/cache size: 981911 66126953 16 1024MB
basic ops cache: hits/miss/sum: 216921 647585 864506
used/not used/entry size/cache size: 1448949 15328267 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 7336 7336
used/not used/entry size/cache size: 25 8388583 12 96MB
state nr cache: hits/miss/sum: 4313 6910 11223
used/not used/entry size/cache size: 6893 2090259 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 66628308
1 478892
2 1658
3 6
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.039sec
BK_STOP 1495085149090
--------------------
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................................
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="CTLCardinality"
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 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 r141-csrt-149443424000183"
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 '
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 ;