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-2265
Executing tool marcie
Input is ParamProductionCell-PT-0, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r064kn-blw3-143254880200008
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432724912942

Model: ParamProductionCell-PT-0
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: 198 NrTr: 176 NrArc: 730)

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 14351 (1.4e+04) #states 2,776,936 (6)



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

checking: [[maxVal(A2L_rot3_rs)<=1 & maxVal(press_at_lower_pos)<=3] & maxVal(arm1_release_ext)<=2]
normalized: [maxVal(arm1_release_ext)<=2 & [maxVal(A2L_rot3_rs)<=1 & maxVal(press_at_lower_pos)<=3]]

abstracting: (1<=3) states: 2,776,936 (6)
abstracting: (1<=1) states: 2,776,936 (6)
abstracting: (1<=2) states: 2,776,936 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: [maxVal(arm1_pick_up_angle)<=1 & maxVal(ch_DC_full)<=1]
normalized: [maxVal(arm1_pick_up_angle)<=1 & maxVal(ch_DC_full)<=1]

abstracting: (1<=1) states: 2,776,936 (6)
abstracting: (1<=1) states: 2,776,936 (6)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (1<=3) states: 2,776,936 (6)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (1<=2) states: 2,776,936 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: [[[[maxVal(PL_lower_run)<=2 & [maxVal(A2U_in)<=3 & maxVal(table_unload_angle)<=3]] & maxVal(A2L_rot3_rs)<=1] & maxVal(A1L_rot3_in)<=3] & [[maxVal(ch_FT_free)<=2 & [[[maxVal(A2U_rotated)<=3 & maxVal(ch_FT_full)<=3] & [maxVal(deposit_belt_occupied)<=2 & maxVal(PU_lower_rs)<=3]] & maxVal(arm1_pick_up_angle)<=1]] & maxVal(A2U_out)<=3]]
normalized: [[maxVal(A2U_out)<=3 & [maxVal(ch_FT_free)<=2 & [maxVal(arm1_pick_up_angle)<=1 & [[maxVal(A2U_rotated)<=3 & maxVal(ch_FT_full)<=3] & [maxVal(deposit_belt_occupied)<=2 & maxVal(PU_lower_rs)<=3]]]]] & [maxVal(A1L_rot3_in)<=3 & [maxVal(A2L_rot3_rs)<=1 & [maxVal(PL_lower_run)<=2 & [maxVal(A2U_in)<=3 & maxVal(table_unload_angle)<=3]]]]]

abstracting: (1<=3) states: 2,776,936 (6)
abstracting: (1<=3) states: 2,776,936 (6)
abstracting: (1<=2) states: 2,776,936 (6)
abstracting: (1<=1) states: 2,776,936 (6)
abstracting: (1<=3) states: 2,776,936 (6)
abstracting: (1<=3) states: 2,776,936 (6)
abstracting: (1<=2) states: 2,776,936 (6)
abstracting: (1<=3) states: 2,776,936 (6)
abstracting: (1<=3) states: 2,776,936 (6)
abstracting: (1<=1) states: 2,776,936 (6)
abstracting: (1<=2) states: 2,776,936 (6)
abstracting: (1<=3) states: 2,776,936 (6)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (1<=1) states: 2,776,936 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: [maxVal(PL_lower_rs)<=2 & maxVal(TL_lower_rs)<=1]
normalized: [maxVal(PL_lower_rs)<=2 & maxVal(TL_lower_rs)<=1]

abstracting: (1<=1) states: 2,776,936 (6)
abstracting: (1<=2) states: 2,776,936 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: [[[[[[maxVal(press_at_lower_pos)<=3 & maxVal(PL_lower_rs)<=2] & maxVal(ch_FT_free)<=2] & [[maxVal(A2U_rot3_in)<=1 & maxVal(press_stop)<=2] & [maxVal(belt1_light_barrier_false)<=2 & maxVal(A2L_extended)<=3]]] & maxVal(ch_PA2_free)<=2] & maxVal(A1U_ext_run)<=1] & maxVal(blank_forged)<=1]
normalized: [maxVal(blank_forged)<=1 & [maxVal(A1U_ext_run)<=1 & [maxVal(ch_PA2_free)<=2 & [[[maxVal(belt1_light_barrier_false)<=2 & maxVal(A2L_extended)<=3] & [maxVal(A2U_rot3_in)<=1 & maxVal(press_stop)<=2]] & [maxVal(ch_FT_free)<=2 & [maxVal(press_at_lower_pos)<=3 & maxVal(PL_lower_rs)<=2]]]]]]

abstracting: (1<=2) states: 2,776,936 (6)
abstracting: (1<=3) states: 2,776,936 (6)
abstracting: (1<=2) states: 2,776,936 (6)
abstracting: (1<=2) states: 2,776,936 (6)
abstracting: (1<=1) states: 2,776,936 (6)
abstracting: (1<=3) states: 2,776,936 (6)
abstracting: (1<=2) states: 2,776,936 (6)
abstracting: (1<=2) states: 2,776,936 (6)
abstracting: (1<=1) states: 2,776,936 (6)
abstracting: (1<=1) states: 2,776,936 (6)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (1<=3) states: 2,776,936 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: [[maxVal(FB_out)<=3 & maxVal(forge_run)<=1] & maxVal(belt2_light_barrier_false)<=2]
normalized: [maxVal(belt2_light_barrier_false)<=2 & [maxVal(FB_out)<=3 & maxVal(forge_run)<=1]]

abstracting: (1<=1) states: 2,776,936 (6)
abstracting: (1<=3) states: 2,776,936 (6)
abstracting: (1<=2) states: 2,776,936 (6)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (1<=3) states: 2,776,936 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: [maxVal(A1L_rot3_rs)<=1 & [[maxVal(TL_rot_rs)<=1 & [maxVal(ch_DC_full)<=3 & [maxVal(TL_rot_run)<=1 & maxVal(A1L_ext_rs)<=1]]] & maxVal(deposit_belt_idle)<=3]]
normalized: [maxVal(A1L_rot3_rs)<=1 & [maxVal(deposit_belt_idle)<=3 & [maxVal(TL_rot_rs)<=1 & [maxVal(ch_DC_full)<=3 & [maxVal(TL_rot_run)<=1 & maxVal(A1L_ext_rs)<=1]]]]]

abstracting: (1<=1) states: 2,776,936 (6)
abstracting: (1<=1) states: 2,776,936 (6)
abstracting: (1<=3) states: 2,776,936 (6)
abstracting: (1<=1) states: 2,776,936 (6)
abstracting: (1<=3) states: 2,776,936 (6)
abstracting: (1<=1) states: 2,776,936 (6)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (1<=1) states: 2,776,936 (6)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (1<=1) states: 2,776,936 (6)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (1<=1) states: 2,776,936 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: [[maxVal(A2L_rot2_in)<=2 & maxVal(ch_A2D_free)<=1] & [maxVal(arm1_forward)<=1 & maxVal(A2L_rot1_in)<=1]]
normalized: [[maxVal(arm1_forward)<=1 & maxVal(A2L_rot1_in)<=1] & [maxVal(A2L_rot2_in)<=2 & maxVal(ch_A2D_free)<=1]]

abstracting: (1<=1) states: 2,776,936 (6)
abstracting: (1<=2) states: 2,776,936 (6)
abstracting: (1<=1) states: 2,776,936 (6)
abstracting: (1<=1) states: 2,776,936 (6)
-> the formula is TRUE

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

MC time: 0m0sec


Total processing time: 0m8sec


BK_STOP 1432724921501

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

1110 2462 4320 5974 7898 9368 11426 12423 12737 14206 14576 16278 15618 15366 16389 15347 15728 15417 16046 14555 14613
iterations count:21333 (121), effective:1085 (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="ParamProductionCell-PT-0"
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/ParamProductionCell-PT-0.tgz
mv ParamProductionCell-PT-0 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is ParamProductionCell-PT-0, 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 r064kn-blw3-143254880200008"
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 ;