Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.......
=====================================================================
Generated by BenchKit 2-2270
Executing tool marcie
Input is SafeBus-PT-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r260su-blw3-143374349300100
=====================================================================

--------------------
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 1433799751585

Model: SafeBus-PT-03
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
A model checker for Generalized Stochastic Petri nets

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 57 NrTr: 91 NrArc: 541)

net check time: 0m0sec

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

init dd package: 0m2sec


RS generation: 0m0sec


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



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

checking: AG [sum(RMC_3, RMC_2, RMC_1)<=sum(RMC_3, RMC_2, RMC_1)]
normalized: ~ [E [true U ~ [sum(RMC_3, RMC_2, RMC_1)<=sum(RMC_3, RMC_2, RMC_1)]]]

abstracting: (sum(RMC_3, RMC_2, RMC_1)<=sum(RMC_3, RMC_2, RMC_1)) states: 4,650 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [[~ [[3<=sum(RMC_3, RMC_2, RMC_1) & S_tout<=sum(AMC_3_3, AMC_2_3, AMC_1_3, AMC_3_2, AMC_2_2, AMC_1_2, AMC_3_1, AMC_2_1, AMC_1_1)]] | sum(AMC_3_3, AMC_2_3, AMC_1_3, AMC_3_2, AMC_2_2, AMC_1_2, AMC_3_1, AMC_2_1, AMC_1_1)<=sum(Cpt1_3, Cpt1_2, Cpt1_1)]]
normalized: ~ [E [true U ~ [[sum(AMC_3_3, AMC_2_3, AMC_1_3, AMC_3_2, AMC_2_2, AMC_1_2, AMC_3_1, AMC_2_1, AMC_1_1)<=sum(Cpt1_3, Cpt1_2, Cpt1_1) | ~ [[3<=sum(RMC_3, RMC_2, RMC_1) & S_tout<=sum(AMC_3_3, AMC_2_3, AMC_1_3, AMC_3_2, AMC_2_2, AMC_1_2, AMC_3_1, AMC_2_1, AMC_1_1)]]]]]]

abstracting: (S_tout<=sum(AMC_3_3, AMC_2_3, AMC_1_3, AMC_3_2, AMC_2_2, AMC_1_2, AMC_3_1, AMC_2_1, AMC_1_1)) states: 3,387 (3)
abstracting: (3<=sum(RMC_3, RMC_2, RMC_1)) states: 0
abstracting: (sum(AMC_3_3, AMC_2_3, AMC_1_3, AMC_3_2, AMC_2_2, AMC_1_2, AMC_3_1, AMC_2_1, AMC_1_1)<=sum(Cpt1_3, Cpt1_2, Cpt1_1)) states: 3,822 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [~ [[[sum(FMC_3, FMC_2, FMC_1)<=sum(FMC_3, FMC_2, FMC_1) | 2<=sum(loop_em_3, loop_em_2, loop_em_1)] & 1<=sum(Cpt1_3, Cpt1_2, Cpt1_1)]]]
normalized: E [true U ~ [[1<=sum(Cpt1_3, Cpt1_2, Cpt1_1) & [sum(FMC_3, FMC_2, FMC_1)<=sum(FMC_3, FMC_2, FMC_1) | 2<=sum(loop_em_3, loop_em_2, loop_em_1)]]]]

abstracting: (2<=sum(loop_em_3, loop_em_2, loop_em_1)) states: 180
abstracting: (sum(FMC_3, FMC_2, FMC_1)<=sum(FMC_3, FMC_2, FMC_1)) states: 4,650 (3)
abstracting: (1<=sum(Cpt1_3, Cpt1_2, Cpt1_1)) states: 4,650 (3)
-> the formula is FALSE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: AG [sum(cable_used_3, cable_used_2, cable_used_1)<=sum(Cpt1_3, Cpt1_2, Cpt1_1)]
normalized: ~ [E [true U ~ [sum(cable_used_3, cable_used_2, cable_used_1)<=sum(Cpt1_3, Cpt1_2, Cpt1_1)]]]

abstracting: (sum(cable_used_3, cable_used_2, cable_used_1)<=sum(Cpt1_3, Cpt1_2, Cpt1_1)) states: 4,650 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [[3<=sum(wait_msg_3, wait_msg_2, wait_msg_1) & [2<=S_tout | [sum(wait_msg_3, wait_msg_2, wait_msg_1)<=sum(MSG_3, MSG_2, MSG_1) & 2<=cable_free]]]]
normalized: E [true U [3<=sum(wait_msg_3, wait_msg_2, wait_msg_1) & [2<=S_tout | [sum(wait_msg_3, wait_msg_2, wait_msg_1)<=sum(MSG_3, MSG_2, MSG_1) & 2<=cable_free]]]]

abstracting: (2<=cable_free) states: 0
abstracting: (sum(wait_msg_3, wait_msg_2, wait_msg_1)<=sum(MSG_3, MSG_2, MSG_1)) states: 3,336 (3)
abstracting: (2<=S_tout) states: 0
abstracting: (3<=sum(wait_msg_3, wait_msg_2, wait_msg_1)) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [3<=S_tout]
normalized: E [true U 3<=S_tout]

abstracting: (3<=S_tout) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[[~ [3<=sum(MSG_3, MSG_2, MSG_1)] | ~ [1<=sum(cable_used_3, cable_used_2, cable_used_1)]] | [[sum(wait_msg_3, wait_msg_2, wait_msg_1)<=T_out & 2<=FMCb] & sum(msgl_3, msgl_2, msgl_1)<=sum(PMC_3, PMC_2, PMC_1)]]]
normalized: ~ [E [true U ~ [[[sum(msgl_3, msgl_2, msgl_1)<=sum(PMC_3, PMC_2, PMC_1) & [sum(wait_msg_3, wait_msg_2, wait_msg_1)<=T_out & 2<=FMCb]] | [~ [1<=sum(cable_used_3, cable_used_2, cable_used_1)] | ~ [3<=sum(MSG_3, MSG_2, MSG_1)]]]]]]

abstracting: (3<=sum(MSG_3, MSG_2, MSG_1)) states: 0
abstracting: (1<=sum(cable_used_3, cable_used_2, cable_used_1)) states: 3,960 (3)
abstracting: (2<=FMCb) states: 0
abstracting: (sum(wait_msg_3, wait_msg_2, wait_msg_1)<=T_out) states: 3,192 (3)
abstracting: (sum(msgl_3, msgl_2, msgl_1)<=sum(PMC_3, PMC_2, PMC_1)) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [[sum(listen_3, listen_2, listen_1)<=sum(cable_used_3, cable_used_2, cable_used_1) & [[2<=sum(RMC_3, RMC_2, RMC_1) & cable_free<=sum(RMC_3, RMC_2, RMC_1)] & 1<=sum(loop_em_3, loop_em_2, loop_em_1)]]]
normalized: E [true U [sum(listen_3, listen_2, listen_1)<=sum(cable_used_3, cable_used_2, cable_used_1) & [1<=sum(loop_em_3, loop_em_2, loop_em_1) & [2<=sum(RMC_3, RMC_2, RMC_1) & cable_free<=sum(RMC_3, RMC_2, RMC_1)]]]]

abstracting: (cable_free<=sum(RMC_3, RMC_2, RMC_1)) states: 4,230 (3)
abstracting: (2<=sum(RMC_3, RMC_2, RMC_1)) states: 180
abstracting: (1<=sum(loop_em_3, loop_em_2, loop_em_1)) states: 1,602 (3)
abstracting: (sum(listen_3, listen_2, listen_1)<=sum(cable_used_3, cable_used_2, cable_used_1)) states: 3,978 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [sum(msgl_3, msgl_2, msgl_1)<=S_tout]
normalized: E [true U sum(msgl_3, msgl_2, msgl_1)<=S_tout]

abstracting: (sum(msgl_3, msgl_2, msgl_1)<=S_tout) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[~ [~ [1<=sum(Cpt2_3, Cpt2_2, Cpt2_1)]] | ~ [[sum(FMC_3, FMC_2, FMC_1)<=T_out | 1<=sum(listen_3, listen_2, listen_1)]]]]
normalized: ~ [E [true U ~ [[1<=sum(Cpt2_3, Cpt2_2, Cpt2_1) | ~ [[sum(FMC_3, FMC_2, FMC_1)<=T_out | 1<=sum(listen_3, listen_2, listen_1)]]]]]]

abstracting: (1<=sum(listen_3, listen_2, listen_1)) states: 2,022 (3)
abstracting: (sum(FMC_3, FMC_2, FMC_1)<=T_out) states: 3,498 (3)
abstracting: (1<=sum(Cpt2_3, Cpt2_2, Cpt2_1)) states: 4,650 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [1<=sum(msgl_3, msgl_2, msgl_1)]
normalized: ~ [E [true U ~ [1<=sum(msgl_3, msgl_2, msgl_1)]]]

abstracting: (1<=sum(msgl_3, msgl_2, msgl_1)) states: 4,650 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [[~ [~ [1<=sum(wait_cable_3, wait_cable_2, wait_cable_1)]] | sum(Cpt1_3, Cpt1_2, Cpt1_1)<=sum(Cpt2_3, Cpt2_2, Cpt2_1)]]
normalized: ~ [E [true U ~ [[1<=sum(wait_cable_3, wait_cable_2, wait_cable_1) | sum(Cpt1_3, Cpt1_2, Cpt1_1)<=sum(Cpt2_3, Cpt2_2, Cpt2_1)]]]]

abstracting: (sum(Cpt1_3, Cpt1_2, Cpt1_1)<=sum(Cpt2_3, Cpt2_2, Cpt2_1)) states: 4,650 (3)
abstracting: (1<=sum(wait_cable_3, wait_cable_2, wait_cable_1)) states: 3,564 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [~ [~ [~ [2<=sum(Cpt2_3, Cpt2_2, Cpt2_1)]]]]
normalized: ~ [E [true U 2<=sum(Cpt2_3, Cpt2_2, Cpt2_1)]]

abstracting: (2<=sum(Cpt2_3, Cpt2_2, Cpt2_1)) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [[[[sum(loop_em_3, loop_em_2, loop_em_1)<=T_out & sum(loop_em_3, loop_em_2, loop_em_1)<=sum(MSG_3, MSG_2, MSG_1)] | ACK<=FMCb] | [3<=sum(wait_cable_3, wait_cable_2, wait_cable_1) | [FMCb<=sum(Cpt2_3, Cpt2_2, Cpt2_1) | FMCb<=sum(wait_msg_3, wait_msg_2, wait_msg_1)]]]]
normalized: ~ [E [true U ~ [[[3<=sum(wait_cable_3, wait_cable_2, wait_cable_1) | [FMCb<=sum(Cpt2_3, Cpt2_2, Cpt2_1) | FMCb<=sum(wait_msg_3, wait_msg_2, wait_msg_1)]] | [ACK<=FMCb | [sum(loop_em_3, loop_em_2, loop_em_1)<=T_out & sum(loop_em_3, loop_em_2, loop_em_1)<=sum(MSG_3, MSG_2, MSG_1)]]]]]]

abstracting: (sum(loop_em_3, loop_em_2, loop_em_1)<=sum(MSG_3, MSG_2, MSG_1)) states: 3,336 (3)
abstracting: (sum(loop_em_3, loop_em_2, loop_em_1)<=T_out) states: 3,192 (3)
abstracting: (ACK<=FMCb) states: 4,650 (3)
abstracting: (FMCb<=sum(wait_msg_3, wait_msg_2, wait_msg_1)) states: 2,394 (3)
abstracting: (FMCb<=sum(Cpt2_3, Cpt2_2, Cpt2_1)) states: 4,650 (3)
abstracting: (3<=sum(wait_cable_3, wait_cable_2, wait_cable_1)) states: 378
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [[[[2<=sum(wait_cable_3, wait_cable_2, wait_cable_1) & 1<=sum(FMC_3, FMC_2, FMC_1)] | [sum(msgl_3, msgl_2, msgl_1)<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1) | ACK<=sum(Cpt1_3, Cpt1_2, Cpt1_1)]] & [[sum(FMC_3, FMC_2, FMC_1)<=sum(Cpt1_3, Cpt1_2, Cpt1_1) | sum(listen_3, listen_2, listen_1)<=T_out] | [FMCb<=FMCb & 1<=sum(wait_cable_3, wait_cable_2, wait_cable_1)]]]]
normalized: ~ [E [true U ~ [[[[sum(FMC_3, FMC_2, FMC_1)<=sum(Cpt1_3, Cpt1_2, Cpt1_1) | sum(listen_3, listen_2, listen_1)<=T_out] | [FMCb<=FMCb & 1<=sum(wait_cable_3, wait_cable_2, wait_cable_1)]] & [[sum(msgl_3, msgl_2, msgl_1)<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1) | ACK<=sum(Cpt1_3, Cpt1_2, Cpt1_1)] | [2<=sum(wait_cable_3, wait_cable_2, wait_cable_1) & 1<=sum(FMC_3, FMC_2, FMC_1)]]]]]]

abstracting: (1<=sum(FMC_3, FMC_2, FMC_1)) states: 1,152 (3)
abstracting: (2<=sum(wait_cable_3, wait_cable_2, wait_cable_1)) states: 1,692 (3)
abstracting: (ACK<=sum(Cpt1_3, Cpt1_2, Cpt1_1)) states: 4,650 (3)
abstracting: (sum(msgl_3, msgl_2, msgl_1)<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)) states: 0
abstracting: (1<=sum(wait_cable_3, wait_cable_2, wait_cable_1)) states: 3,564 (3)
abstracting: (FMCb<=FMCb) states: 4,650 (3)
abstracting: (sum(listen_3, listen_2, listen_1)<=T_out) states: 2,772 (3)
abstracting: (sum(FMC_3, FMC_2, FMC_1)<=sum(Cpt1_3, Cpt1_2, Cpt1_1)) states: 4,650 (3)
-> the formula is TRUE

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

MC time: 0m0sec


Total processing time: 0m4sec


BK_STOP 1433799756200

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

check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m0sec

758 1444 1810 2125 2465 3451 4323 4447 4431 5211 5875 6130 5946 5670
iterations count:14073 (154), effective:602 (6)

initing FirstDep: 0m0sec

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="SafeBus-PT-03"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/user/u8/hulinhub/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-03.tgz
mv SafeBus-PT-03 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is SafeBus-PT-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 r260su-blw3-143374349300100"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 ;