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-2979
Executing tool marcie
Input is S_ParamProductionCell-PT-2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444131001132
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464951868627


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: ParamProductionCell_PT_2
(NrP: 231 NrTr: 202 NrArc: 846)

net check time: 0m 0.000sec

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

init dd package: 0m 3.923sec


RS generation: 0m 0.898sec


-> reachability set: #nodes 9847 (9.8e+03) #states 349,874 (5)



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

checking: EF [2<=A2L_ret_rs]
normalized: E [true U 2<=A2L_ret_rs]

abstracting: (2<=A2L_ret_rs) states: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [1<=belt2_light_barrier_false]
normalized: ~ [E [true U ~ [1<=belt2_light_barrier_false]]]

abstracting: (1<=belt2_light_barrier_false) states: 324,482 (5)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.301sec

checking: AG [TL_rot_rs<=arm1_release_ext]
normalized: ~ [E [true U ~ [TL_rot_rs<=arm1_release_ext]]]

abstracting: (TL_rot_rs<=arm1_release_ext) states: 323,358 (5)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.756sec

checking: EF [~ [[~ [3<=A1U_in] | 3<=blank_forged]]]
normalized: E [true U ~ [[3<=blank_forged | ~ [3<=A1U_in]]]]

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

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [~ [[1<=CU_lift_rs & 3<=A1L_out]]]]
normalized: E [true U [1<=CU_lift_rs & 3<=A1L_out]]

abstracting: (3<=A1L_out) states: 0
abstracting: (1<=CU_lift_rs) states: 6,684 (3)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [~ [PU_lower_rs<=crane_storing]]
normalized: E [true U ~ [PU_lower_rs<=crane_storing]]

abstracting: (PU_lower_rs<=crane_storing) states: 343,968 (5)
-> the formula is TRUE

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

MC time: 0m 0.310sec

checking: AG [A1U_ret_rs<=A2L_rot1_in]
normalized: ~ [E [true U ~ [A1U_ret_rs<=A2L_rot1_in]]]

abstracting: (A1U_ret_rs<=A2L_rot1_in) states: 348,448 (5)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.126sec

checking: EF [[3<=ch_FT_full & ~ [[robot_stop<=arm2_stop | 1<=A2U_ext_rs]]]]
normalized: E [true U [3<=ch_FT_full & ~ [[robot_stop<=arm2_stop | 1<=A2U_ext_rs]]]]

abstracting: (1<=A2U_ext_rs) states: 4,345 (3)
abstracting: (robot_stop<=arm2_stop) states: 315,356 (5)
abstracting: (3<=ch_FT_full) states: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AG [[[[3<=A2L_rot2_in & 2<=table_stop_h] | ~ [2<=A2U_rot2_run]] | ~ [[2<=table_ready_for_loading | 3<=ch_CF_free]]]]
normalized: ~ [E [true U ~ [[[~ [2<=A2U_rot2_run] | [3<=A2L_rot2_in & 2<=table_stop_h]] | ~ [[2<=table_ready_for_loading | 3<=ch_CF_free]]]]]]

abstracting: (3<=ch_CF_free) states: 0
abstracting: (2<=table_ready_for_loading) states: 0
abstracting: (2<=table_stop_h) states: 0
abstracting: (3<=A2L_rot2_in) states: 0
abstracting: (2<=A2U_rot2_run) states: 0
-> the formula is TRUE

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

MC time: 0m 0.010sec

checking: EF [[[belt1_light_barrier_true<=arm2_pick_up_angle & [1<=press_up | 2<=CU_lower_rs]] & [~ [2<=PU_out] | 3<=crane_to_belt2]]]
normalized: E [true U [[belt1_light_barrier_true<=arm2_pick_up_angle & [1<=press_up | 2<=CU_lower_rs]] & [3<=crane_to_belt2 | ~ [2<=PU_out]]]]

abstracting: (2<=PU_out) states: 0
abstracting: (3<=crane_to_belt2) states: 0
abstracting: (2<=CU_lower_rs) states: 0
abstracting: (1<=press_up) states: 93,240 (4)
abstracting: (belt1_light_barrier_true<=arm2_pick_up_angle) states: 346,298 (5)
-> the formula is TRUE

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

MC time: 0m 0.098sec

checking: EF [[[A1U_ret_run<=A2U_rot2_rs | [1<=A1L_ext_run | press_ready_for_loading<=arm1_retract_ext]] & 3<=CU_ready_to_ungrasp]]
normalized: E [true U [3<=CU_ready_to_ungrasp & [A1U_ret_run<=A2U_rot2_rs | [1<=A1L_ext_run | press_ready_for_loading<=arm1_retract_ext]]]]

abstracting: (press_ready_for_loading<=arm1_retract_ext) states: 342,104 (5)
abstracting: (1<=A1L_ext_run) states: 1,832 (3)
abstracting: (A1U_ret_run<=A2U_rot2_rs) states: 347,022 (5)
abstracting: (3<=CU_ready_to_ungrasp) states: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AG [[A2L_ret_rs<=ch_FT_free | ~ [[A1U_ext_run<=A2U_unloaded | press_ready_for_unloading<=FB_deliver_run]]]]
normalized: ~ [E [true U ~ [[A2L_ret_rs<=ch_FT_free | ~ [[A1U_ext_run<=A2U_unloaded | press_ready_for_unloading<=FB_deliver_run]]]]]]

abstracting: (press_ready_for_unloading<=FB_deliver_run) states: 280,852 (5)
abstracting: (A1U_ext_run<=A2U_unloaded) states: 347,022 (5)
abstracting: (A2L_ret_rs<=ch_FT_free) states: 348,588 (5)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.252sec

checking: EF [[~ [[A2L_rot2_in<=arm2_waiting_for_swivel_1 | 2<=A2L_in]] | [[2<=arm2_waiting_for_swivel_1 & 1<=crane_to_belt1] & A2L_rot2_rs<=ch_TA1_full]]]
normalized: E [true U [[A2L_rot2_rs<=ch_TA1_full & [2<=arm2_waiting_for_swivel_1 & 1<=crane_to_belt1]] | ~ [[A2L_rot2_in<=arm2_waiting_for_swivel_1 | 2<=A2L_in]]]]

abstracting: (2<=A2L_in) states: 0
abstracting: (A2L_rot2_in<=arm2_waiting_for_swivel_1) states: 348,510 (5)
abstracting: (1<=crane_to_belt1) states: 32,544 (4)
abstracting: (2<=arm2_waiting_for_swivel_1) states: 0
abstracting: (A2L_rot2_rs<=ch_TA1_full) states: 348,514 (5)
-> the formula is TRUE

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

MC time: 0m 0.261sec

checking: AG [[[[arm2_magnet_off<=arm1_forward | A1U_rot2_rs<=A2L_ext_run] | [2<=crane_above_deposit_belt | 2<=PL_lower_rs]] | A2L_ext_rs<=A1L_loaded]]
normalized: ~ [E [true U ~ [[A2L_ext_rs<=A1L_loaded | [[arm2_magnet_off<=arm1_forward | A1U_rot2_rs<=A2L_ext_run] | [2<=crane_above_deposit_belt | 2<=PL_lower_rs]]]]]]

abstracting: (2<=PL_lower_rs) states: 0
abstracting: (2<=crane_above_deposit_belt) states: 0
abstracting: (A1U_rot2_rs<=A2L_ext_run) states: 349,808 (5)
abstracting: (arm2_magnet_off<=arm1_forward) states: 86,367 (4)
abstracting: (A2L_ext_rs<=A1L_loaded) states: 348,466 (5)
-> the formula is TRUE

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

MC time: 0m 0.023sec

checking: AG [[[[1<=arm2_stop & DB_trans_rs<=A1U_ext_rs] | ~ [1<=table_right]] & [A1U_rot3_run<=A1L_ext_rs | ~ [A1L_ext_run<=A2L_rot2_rs]]]]
normalized: ~ [E [true U ~ [[[A1U_rot3_run<=A1L_ext_rs | ~ [A1L_ext_run<=A2L_rot2_rs]] & [~ [1<=table_right] | [1<=arm2_stop & DB_trans_rs<=A1U_ext_rs]]]]]]

abstracting: (DB_trans_rs<=A1U_ext_rs) states: 343,548 (5)
abstracting: (1<=arm2_stop) states: 315,356 (5)
abstracting: (1<=table_right) states: 88,620 (4)
abstracting: (A1L_ext_run<=A2L_rot2_rs) states: 348,042 (5)
abstracting: (A1U_rot3_run<=A1L_ext_rs) states: 347,154 (5)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.466sec

checking: EF [[[[DB_in<=DB_at_end & 2<=TU_out] | [3<=A2L_rot3_run & A2L_rot3_rs<=PU_lower_rs]] & [[arm2_having_swivel_2<=ch_TA1_full | TU_lift_rs<=A1U_ret_run] | [TU_in<=blank_forged | 3<=A1L_ext_rs]]]]
normalized: E [true U [[[arm2_having_swivel_2<=ch_TA1_full | TU_lift_rs<=A1U_ret_run] | [TU_in<=blank_forged | 3<=A1L_ext_rs]] & [[3<=A2L_rot3_run & A2L_rot3_rs<=PU_lower_rs] | [DB_in<=DB_at_end & 2<=TU_out]]]]

abstracting: (2<=TU_out) states: 0
abstracting: (DB_in<=DB_at_end) states: 343,526 (5)
abstracting: (A2L_rot3_rs<=PU_lower_rs) states: 348,510 (5)
abstracting: (3<=A2L_rot3_run) states: 0
abstracting: (3<=A1L_ext_rs) states: 0
abstracting: (TU_in<=blank_forged) states: 347,486 (5)
abstracting: (TU_lift_rs<=A1U_ret_run) states: 347,478 (5)
abstracting: (arm2_having_swivel_2<=ch_TA1_full) states: 285,013 (5)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec


Total processing time: 0m12.650sec


BK_STOP 1464951881315

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

check for maximal unmarked siphon
ok
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: 0m 0.000sec

1280 3447 5010 6665 8582 9773 10084 10592 10126
iterations count:9476 (46), effective:675 (3)

initing FirstDep: 0m 0.000sec

6706 7636 8054 10049 11214
iterations count:5339 (26), effective:326 (1)
9006 9376 10139 10555 10483
iterations count:5847 (28), effective:400 (1)
4258 5543 7052 9314 9928
iterations count:5283 (26), effective:316 (1)
2425 4349 6155 8189 9191
iterations count:5236 (25), effective:314 (1)
7224 8243 9791 9872 9869
iterations count:5262 (26), effective:316 (1)
1292 4081 5932 6685 8715 9982
iterations count:6188 (30), effective:385 (1)
2261 3941 4835 7770 8885 9847
iterations count:6042 (29), effective:356 (1)
6860 7977 8703 9342 9746 10636 10015 11038
iterations count:8364 (41), effective:505 (2)

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="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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-2979"
echo " Executing tool marcie"
echo " Input is S_ParamProductionCell-PT-2, 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 r185kn-smll-146444131001132"
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 ;