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 S_ParamProductionCell-PT-2, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r204st-blw3-143341204400034
=====================================================================

--------------------
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 ParamProductionCell-PT-2-ReachabilityBounds-0
FORMULA_NAME ParamProductionCell-PT-2-ReachabilityBounds-1
FORMULA_NAME ParamProductionCell-PT-2-ReachabilityBounds-10
FORMULA_NAME ParamProductionCell-PT-2-ReachabilityBounds-11
FORMULA_NAME ParamProductionCell-PT-2-ReachabilityBounds-12
FORMULA_NAME ParamProductionCell-PT-2-ReachabilityBounds-13
FORMULA_NAME ParamProductionCell-PT-2-ReachabilityBounds-14
FORMULA_NAME ParamProductionCell-PT-2-ReachabilityBounds-15
FORMULA_NAME ParamProductionCell-PT-2-ReachabilityBounds-2
FORMULA_NAME ParamProductionCell-PT-2-ReachabilityBounds-3
FORMULA_NAME ParamProductionCell-PT-2-ReachabilityBounds-4
FORMULA_NAME ParamProductionCell-PT-2-ReachabilityBounds-5
FORMULA_NAME ParamProductionCell-PT-2-ReachabilityBounds-6
FORMULA_NAME ParamProductionCell-PT-2-ReachabilityBounds-7
FORMULA_NAME ParamProductionCell-PT-2-ReachabilityBounds-8
FORMULA_NAME ParamProductionCell-PT-2-ReachabilityBounds-9

=== Now, execution of the tool begins

BK_START 1433630787257

Model: S_ParamProductionCell-PT-2
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=ReachabilityBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 231 NrTr: 202 NrArc: 846)

net check time: 0m0sec

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

init dd package: 0m2sec


RS generation: 0m3sec


-> reachability set: #nodes 33876 (3.4e+04) #states 349,874 (5)



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

checking: [[maxVal(table_ready_for_unloading)<=2 & maxVal(A2U_extended)<=1] & maxVal(TL_out)<=2]
normalized: [maxVal(TL_out)<=2 & [maxVal(table_ready_for_unloading)<=2 & maxVal(A2U_extended)<=1]]

abstracting: (1<=1) states: 349,874 (5)
abstracting: (1<=2) states: 349,874 (5)
abstracting: (1<=2) states: 349,874 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityBounds-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(A1L_rot1_in)<=1
normalized: maxVal(A1L_rot1_in)<=1

abstracting: (1<=1) states: 349,874 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityBounds-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(press_up)<=3 & [[[[[maxVal(A2U_rot2_rs)<=2 & maxVal(crane_lower)<=3] & [maxVal(arm1_magnet_off)<=2 & maxVal(A1U_rot2_rs)<=2]] & [[maxVal(A1L_rot3_run)<=3 & maxVal(A2U_rot3_rs)<=2] & [maxVal(arm1_having_swivel_1)<=3 & maxVal(arm1_waiting_for_swivel_1)<=2]]] & maxVal(arm1_waiting_for_swivel_1)<=1] & [maxVal(crane_store_free)<=2 & maxVal(CU_lift_run)<=1]]]
normalized: [maxVal(press_up)<=3 & [[maxVal(arm1_waiting_for_swivel_1)<=1 & [[[maxVal(A1L_rot3_run)<=3 & maxVal(A2U_rot3_rs)<=2] & [maxVal(arm1_having_swivel_1)<=3 & maxVal(arm1_waiting_for_swivel_1)<=2]] & [[maxVal(A2U_rot2_rs)<=2 & maxVal(crane_lower)<=3] & [maxVal(arm1_magnet_off)<=2 & maxVal(A1U_rot2_rs)<=2]]]] & [maxVal(crane_store_free)<=2 & maxVal(CU_lift_run)<=1]]]

abstracting: (1<=1) states: 349,874 (5)
abstracting: (1<=2) states: 349,874 (5)
abstracting: (1<=2) states: 349,874 (5)
abstracting: (1<=2) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=2) states: 349,874 (5)
abstracting: (1<=2) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=2) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=1) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityBounds-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(A1L_ext_run)<=2 & maxVal(PL_lower_run)<=2]
normalized: [maxVal(A1L_ext_run)<=2 & maxVal(PL_lower_run)<=2]

abstracting: (1<=2) states: 349,874 (5)
abstracting: (1<=2) states: 349,874 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityBounds-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(press_up)<=1 & maxVal(crane_to_belt2)<=3]
normalized: [maxVal(press_up)<=1 & maxVal(crane_to_belt2)<=3]

abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=1) states: 349,874 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityBounds-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(deposit_belt_idle)<=1 & maxVal(CU_out)<=3]
normalized: [maxVal(deposit_belt_idle)<=1 & maxVal(CU_out)<=3]

abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=1) states: 349,874 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityBounds-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(A2U_in)<=3
normalized: maxVal(A2U_in)<=3

abstracting: (1<=3) states: 349,874 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityBounds-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(crane_lower)<=3 & [[[[[maxVal(DB_at_end)<=1 & maxVal(robot_left)<=3] & [maxVal(arm1_having_swivel_1)<=2 & maxVal(arm1_having_swivel_2)<=2]] & [maxVal(crane_lift)<=1 & [maxVal(arm2_magnet_on)<=3 & maxVal(A1U_ret_run)<=3]]] & [maxVal(A1U_extendet)<=2 & maxVal(TL_in)<=3]] & maxVal(A1L_ret_run)<=3]]
normalized: [maxVal(crane_lower)<=3 & [maxVal(A1L_ret_run)<=3 & [[maxVal(A1U_extendet)<=2 & maxVal(TL_in)<=3] & [[[maxVal(DB_at_end)<=1 & maxVal(robot_left)<=3] & [maxVal(arm1_having_swivel_1)<=2 & maxVal(arm1_having_swivel_2)<=2]] & [maxVal(crane_lift)<=1 & [maxVal(arm2_magnet_on)<=3 & maxVal(A1U_ret_run)<=3]]]]]]

abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=1) states: 349,874 (5)
abstracting: (1<=2) states: 349,874 (5)
abstracting: (1<=2) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=1) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=2) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityBounds-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(feed_belt_empty)<=3 & [maxVal(CU_out)<=3 & [maxVal(ch_A1P_full)<=3 & [maxVal(FB_in)<=3 & maxVal(table_ready_for_loading)<=3]]]] & maxVal(A1L_ext_rs)<=3]
normalized: [maxVal(A1L_ext_rs)<=3 & [maxVal(feed_belt_empty)<=3 & [maxVal(CU_out)<=3 & [maxVal(ch_A1P_full)<=3 & [maxVal(FB_in)<=3 & maxVal(table_ready_for_loading)<=3]]]]]

abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityBounds-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(TU_rot_run)<=2
normalized: maxVal(TU_rot_run)<=2

abstracting: (1<=2) states: 349,874 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityBounds-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(A1L_loaded)<=1 & [maxVal(FB_deliver_run)<=2 & [maxVal(arm1_waiting_for_swivel_2)<=3 & [[maxVal(CL_lift_rs)<=1 & maxVal(crane_storing)<=2] & [[maxVal(ch_TA1_full)<=1 & maxVal(ch_FT_full)<=3] & [maxVal(arm2_waiting_for_swivel_2)<=3 & maxVal(forge_run)<=1]]]]]]
normalized: [maxVal(A1L_loaded)<=1 & [maxVal(FB_deliver_run)<=2 & [maxVal(arm1_waiting_for_swivel_2)<=3 & [[[maxVal(ch_TA1_full)<=1 & maxVal(ch_FT_full)<=3] & [maxVal(arm2_waiting_for_swivel_2)<=3 & maxVal(forge_run)<=1]] & [maxVal(CL_lift_rs)<=1 & maxVal(crane_storing)<=2]]]]]

abstracting: (1<=2) states: 349,874 (5)
abstracting: (1<=1) states: 349,874 (5)
abstracting: (1<=1) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=1) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=2) states: 349,874 (5)
abstracting: (1<=1) states: 349,874 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityBounds-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(press_down)<=2 & maxVal(A1L_rotated)<=2]
normalized: [maxVal(press_down)<=2 & maxVal(A1L_rotated)<=2]

abstracting: (1<=2) states: 349,874 (5)
abstracting: (1<=2) states: 349,874 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityBounds-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(arm2_forward)<=1
normalized: maxVal(arm2_forward)<=1

abstracting: (1<=1) states: 349,874 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityBounds-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(A1U_rot1_run)<=2
normalized: maxVal(A1U_rot1_run)<=2

abstracting: (1<=2) states: 349,874 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityBounds-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(table_load_angle)<=3 & maxVal(TU_rot_run)<=2] & maxVal(A1L_rot2_rs)<=3]
normalized: [maxVal(A1L_rot2_rs)<=3 & [maxVal(table_load_angle)<=3 & maxVal(TU_rot_run)<=2]]

abstracting: (1<=2) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
abstracting: (1<=3) states: 349,874 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityBounds-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(A2L_ret_rs)<=2
normalized: maxVal(A2L_ret_rs)<=2

abstracting: (1<=2) states: 349,874 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityBounds-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m10sec


BK_STOP 1433630797771

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

1263 3249 8936 18616 22767 26159 28074 31114 32438 35213 34106 34092
iterations count:12683 (62), effective:526 (2)

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