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-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r204st-blw3-143341204500061
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433630817530

Model: S_ParamProductionCell-PT-4
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: 231 NrTr: 202 NrArc: 846)

net check time: 0m0sec

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

init dd package: 0m3sec


RS generation: 0m10sec


-> reachability set: #nodes 91520 (9.2e+04) #states 2,409,739 (6)



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

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

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

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

MC time: 0m0sec

checking: AG [[A1U_rot3_rs<=CU_ready_to_transport | [[press_ready_for_loading<=A2L_ret_run & ch_DC_full<=A2U_ret_run] & press_at_middle_pos<=arm1_waiting_for_swivel_1]]]
normalized: ~ [E [true U ~ [[A1U_rot3_rs<=CU_ready_to_transport | [press_at_middle_pos<=arm1_waiting_for_swivel_1 & [press_ready_for_loading<=A2L_ret_run & ch_DC_full<=A2U_ret_run]]]]]]

abstracting: (ch_DC_full<=A2U_ret_run) states: 2,077,555 (6)
abstracting: (press_ready_for_loading<=A2L_ret_run) states: 1,898,208 (6)
abstracting: (press_at_middle_pos<=arm1_waiting_for_swivel_1) states: 1,397,340 (6)
abstracting: (A1U_rot3_rs<=CU_ready_to_transport) states: 2,404,325 (6)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-4-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m2sec

checking: EF [~ [[[3<=PL_out & 3<=CL_lower_rs] | [A1L_loaded<=A1L_ret_rs | 2<=crane_store_free]]]]
normalized: E [true U ~ [[[A1L_loaded<=A1L_ret_rs | 2<=crane_store_free] | [3<=PL_out & 3<=CL_lower_rs]]]]

abstracting: (3<=CL_lower_rs) states: 0
abstracting: (3<=PL_out) states: 0
abstracting: (2<=crane_store_free) states: 0
abstracting: (A1L_loaded<=A1L_ret_rs) states: 2,400,025 (6)
-> the formula is TRUE

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

MC time: 0m5sec

checking: EF [~ [[[A1U_extendet<=arm1_magnet_on | 2<=A2U_rot1_in] & [arm1_release_ext<=CL_lower_run | 2<=feed_belt_idle]]]]
normalized: E [true U ~ [[[arm1_release_ext<=CL_lower_run | 2<=feed_belt_idle] & [A1U_extendet<=arm1_magnet_on | 2<=A2U_rot1_in]]]]

abstracting: (2<=A2U_rot1_in) states: 0
abstracting: (A1U_extendet<=arm1_magnet_on) states: 2,409,739 (6)
abstracting: (2<=feed_belt_idle) states: 0
abstracting: (arm1_release_ext<=CL_lower_run) states: 2,351,479 (6)
-> the formula is TRUE

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

MC time: 0m2sec

checking: AG [~ [[[arm1_pick_up_angle<=crane_to_belt1 & 1<=table_unload_angle] & [3<=TL_lower_run & CU_lift_rs<=table_at_load_angle]]]]
normalized: ~ [E [true U [[arm1_pick_up_angle<=crane_to_belt1 & 1<=table_unload_angle] & [3<=TL_lower_run & CU_lift_rs<=table_at_load_angle]]]]

abstracting: (CU_lift_rs<=table_at_load_angle) states: 2,348,373 (6)
abstracting: (3<=TL_lower_run) states: 0
abstracting: (1<=table_unload_angle) states: 1,210,938 (6)
abstracting: (arm1_pick_up_angle<=crane_to_belt1) states: 1,873,631 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [ch_CF_free<=CU_lower_rs]
normalized: ~ [E [true U ~ [ch_CF_free<=CU_lower_rs]]]

abstracting: (ch_CF_free<=CU_lower_rs) states: 2,060,349 (6)
-> the formula is FALSE

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

MC time: 0m14sec

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

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

FORMULA ParamProductionCell-PT-4-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[~ [[press_ready_for_loading<=TU_lift_run | A2U_rot2_run<=arm2_stop]] & ~ [3<=A2U_rot2_rs]]]
normalized: E [true U [~ [3<=A2U_rot2_rs] & ~ [[press_ready_for_loading<=TU_lift_run | A2U_rot2_run<=arm2_stop]]]]

abstracting: (A2U_rot2_run<=arm2_stop) states: 2,409,739 (6)
abstracting: (press_ready_for_loading<=TU_lift_run) states: 1,939,324 (6)
abstracting: (3<=A2U_rot2_rs) states: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-4-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13sec

checking: EF [[[~ [2<=crane_above_feed_belt] & [2<=arm2_backward | 1<=A1L_rotated]] & [[crane_to_belt2<=arm1_having_swivel_2 | table_ready_for_loading<=ch_FT_full] | 3<=CL_lower_run]]]
normalized: E [true U [[3<=CL_lower_run | [crane_to_belt2<=arm1_having_swivel_2 | table_ready_for_loading<=ch_FT_full]] & [[2<=arm2_backward | 1<=A1L_rotated] & ~ [2<=crane_above_feed_belt]]]]

abstracting: (2<=crane_above_feed_belt) states: 0
abstracting: (1<=A1L_rotated) states: 9,714 (3)
abstracting: (2<=arm2_backward) states: 0
abstracting: (table_ready_for_loading<=ch_FT_full) states: 2,149,268 (6)
abstracting: (crane_to_belt2<=arm1_having_swivel_2) states: 2,229,637 (6)
abstracting: (3<=CL_lower_run) states: 0
-> the formula is TRUE

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

MC time: 0m23sec

checking: AG [A1U_rotated<=DB_out]
normalized: ~ [E [true U ~ [A1U_rotated<=DB_out]]]

abstracting: (A1U_rotated<=DB_out) states: 2,397,839 (6)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-4-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m28sec

checking: AG [~ [[arm2_forward<=CL_trans_run & ~ [belt1_light_barrier_true<=table_unload_angle]]]]
normalized: ~ [E [true U [arm2_forward<=CL_trans_run & ~ [belt1_light_barrier_true<=table_unload_angle]]]]

abstracting: (belt1_light_barrier_true<=table_unload_angle) states: 2,336,511 (6)
abstracting: (arm2_forward<=CL_trans_run) states: 2,284,507 (6)
-> the formula is FALSE

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

MC time: 0m5sec

checking: AG [[ch_DC_free<=arm2_having_swivel_1 | [[2<=crane_storing | CU_out<=CU_out] & [1<=belt1_light_barrier_false & 3<=A1L_ext_run]]]]
normalized: ~ [E [true U ~ [[ch_DC_free<=arm2_having_swivel_1 | [[2<=crane_storing | CU_out<=CU_out] & [1<=belt1_light_barrier_false & 3<=A1L_ext_run]]]]]]

abstracting: (3<=A1L_ext_run) states: 0
abstracting: (1<=belt1_light_barrier_false) states: 2,336,511 (6)
abstracting: (CU_out<=CU_out) states: 2,409,739 (6)
abstracting: (2<=crane_storing) states: 0
abstracting: (ch_DC_free<=arm2_having_swivel_1) states: 2,049,452 (6)
-> the formula is FALSE

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

MC time: 0m28sec

checking: EF [1<=CU_unloaded]
normalized: E [true U 1<=CU_unloaded]

abstracting: (1<=CU_unloaded) states: 64,071 (4)
-> the formula is TRUE

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

MC time: 0m3sec

checking: AG [A2U_ext_rs<=table_upward]
normalized: ~ [E [true U ~ [A2U_ext_rs<=table_upward]]]

abstracting: (A2U_ext_rs<=table_upward) states: 2,384,185 (6)
-> the formula is FALSE

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

MC time: 0m7sec

checking: AG [ch_FT_free<=A1L_rot3_rs]
normalized: ~ [E [true U ~ [ch_FT_free<=A1L_rot3_rs]]]

abstracting: (ch_FT_free<=A1L_rot3_rs) states: 2,314,031 (6)
-> the formula is FALSE

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

MC time: 0m9sec

checking: EF [[~ [~ [DB_at_end<=DB_in]] & [3<=ch_A1P_free | [arm2_release_angle<=A2U_ret_rs | 2<=A1U_rot3_run]]]]
normalized: E [true U [DB_at_end<=DB_in & [3<=ch_A1P_free | [arm2_release_angle<=A2U_ret_rs | 2<=A1U_rot3_run]]]]

abstracting: (2<=A1U_rot3_run) states: 0
abstracting: (arm2_release_angle<=A2U_ret_rs) states: 1,578,326 (6)
abstracting: (3<=ch_A1P_free) states: 0
abstracting: (DB_at_end<=DB_in) states: 2,338,617 (6)
-> the formula is TRUE

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

MC time: 0m13sec


Total processing time: 4m6sec


BK_STOP 1433631063945

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

2655 4846 9433 13656 19726 21971 23207 24740 36850 66946 66346 66108 94911 103492 91520
iterations count:15075 (74), effective:641 (3)

initing FirstDep: 0m0sec

22523 35744 48628 64317 74040 83539 85933 92602
iterations count:8909 (44), effective:373 (1)
23824 43155 57882 83783 90033 94979
iterations count:6793 (33), effective:287 (1)
35985 43255 48986 67531 87543 94650
iterations count:6750 (33), effective:283 (1)
80608 88561 90104 91063 90611
iterations count:5620 (27), effective:240 (1)
25132 42085 60661 82977 89074 94592
iterations count:6708 (33), effective:287 (1)
35534 40256 48742 69752 86547 94018
iterations count:6680 (33), effective:288 (1)
58482 69251 71831 75994 75144 90236
iterations count:6830 (33), effective:289 (1)
88543 91461
iterations count:2425 (12), effective:90 (0)
63742 64963 64720 82420 94227 92629 91515
iterations count:7232 (35), effective:299 (1)
34219 58964 87140 95579 97320 92100
iterations count:6512 (32), effective:281 (1)
59221 75433 80422 91948 90984
iterations count:5657 (28), effective:242 (1)
90806
iterations count:1598 (7), effective:83 (0)

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-4"
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/S_ParamProductionCell-PT-4.tgz
mv S_ParamProductionCell-PT-4 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-4, 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 r204st-blw3-143341204500061"
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 ;