About the Execution of Marcie for S_ParamProductionCell-PT-3
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4533.790 | 164455.00 | 163979.00 | 40.10 | FFFTFFTFFTFFFTTF | normal |
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-3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r204st-blw3-143341204500048
=====================================================================
--------------------
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-3-ReachabilityCardinality-0
FORMULA_NAME ParamProductionCell-PT-3-ReachabilityCardinality-1
FORMULA_NAME ParamProductionCell-PT-3-ReachabilityCardinality-10
FORMULA_NAME ParamProductionCell-PT-3-ReachabilityCardinality-11
FORMULA_NAME ParamProductionCell-PT-3-ReachabilityCardinality-12
FORMULA_NAME ParamProductionCell-PT-3-ReachabilityCardinality-13
FORMULA_NAME ParamProductionCell-PT-3-ReachabilityCardinality-14
FORMULA_NAME ParamProductionCell-PT-3-ReachabilityCardinality-15
FORMULA_NAME ParamProductionCell-PT-3-ReachabilityCardinality-2
FORMULA_NAME ParamProductionCell-PT-3-ReachabilityCardinality-3
FORMULA_NAME ParamProductionCell-PT-3-ReachabilityCardinality-4
FORMULA_NAME ParamProductionCell-PT-3-ReachabilityCardinality-5
FORMULA_NAME ParamProductionCell-PT-3-ReachabilityCardinality-6
FORMULA_NAME ParamProductionCell-PT-3-ReachabilityCardinality-7
FORMULA_NAME ParamProductionCell-PT-3-ReachabilityCardinality-8
FORMULA_NAME ParamProductionCell-PT-3-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1433630802765
Model: S_ParamProductionCell-PT-3
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: 0m2sec
RS generation: 0m7sec
-> reachability set: #nodes 71919 (7.2e+04) #states 1,465,206 (6)
starting MCC model checker
--------------------------
checking: EF [[2<=ch_FT_full & ~ [[arm1_store_free<=arm2_waiting_for_swivel_1 | arm1_release_ext<=press_ready_for_loading]]]]
normalized: E [true U [2<=ch_FT_full & ~ [[arm1_store_free<=arm2_waiting_for_swivel_1 | arm1_release_ext<=press_ready_for_loading]]]]
abstracting: (arm1_release_ext<=press_ready_for_loading) states: 1,465,206 (6)
abstracting: (arm1_store_free<=arm2_waiting_for_swivel_1) states: 765,563 (5)
abstracting: (2<=ch_FT_full) states: 0
-> the formula is FALSE
FORMULA ParamProductionCell-PT-3-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m18sec
checking: AG [[A2U_extended<=CL_lower_rs | [[3<=arm2_retract_ext & table_at_load_angle<=arm2_retract_ext] | ~ [deposit_belt_occupied<=arm2_storing]]]]
normalized: ~ [E [true U ~ [[A2U_extended<=CL_lower_rs | [~ [deposit_belt_occupied<=arm2_storing] | [3<=arm2_retract_ext & table_at_load_angle<=arm2_retract_ext]]]]]]
abstracting: (table_at_load_angle<=arm2_retract_ext) states: 1,456,496 (6)
abstracting: (3<=arm2_retract_ext) states: 0
abstracting: (deposit_belt_occupied<=arm2_storing) states: 1,370,565 (6)
abstracting: (A2U_extended<=CL_lower_rs) states: 1,446,388 (6)
-> the formula is FALSE
FORMULA ParamProductionCell-PT-3-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m23sec
checking: AG [[[~ [press_ready_for_unloading<=A1L_rot2_rs] | [PL_lower_run<=DB_deliver_run | arm1_waiting_for_swivel_1<=crane_above_deposit_belt]] | [1<=belt1_light_barrier_true | ~ [press_stop<=arm2_store_free]]]]
normalized: ~ [E [true U ~ [[[[PL_lower_run<=DB_deliver_run | arm1_waiting_for_swivel_1<=crane_above_deposit_belt] | ~ [press_ready_for_unloading<=A1L_rot2_rs]] | [1<=belt1_light_barrier_true | ~ [press_stop<=arm2_store_free]]]]]]
abstracting: (press_stop<=arm2_store_free) states: 886,332 (5)
abstracting: (1<=belt1_light_barrier_true) states: 34,960 (4)
abstracting: (press_ready_for_unloading<=A1L_rot2_rs) states: 1,165,897 (6)
abstracting: (arm1_waiting_for_swivel_1<=crane_above_deposit_belt) states: 1,457,698 (6)
abstracting: (PL_lower_run<=DB_deliver_run) states: 1,290,964 (6)
-> the formula is FALSE
FORMULA ParamProductionCell-PT-3-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m38sec
checking: EF [1<=press_at_lower_pos]
normalized: E [true U 1<=press_at_lower_pos]
abstracting: (1<=press_at_lower_pos) states: 612,600 (5)
-> the formula is TRUE
FORMULA ParamProductionCell-PT-3-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m5sec
checking: EF [2<=A1U_rot2_run]
normalized: E [true U 2<=A1U_rot2_run]
abstracting: (2<=A1U_rot2_run) states: 0
-> the formula is FALSE
FORMULA ParamProductionCell-PT-3-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [2<=A1L_rot3_in]
normalized: E [true U 2<=A1L_rot3_in]
abstracting: (2<=A1L_rot3_in) states: 0
-> the formula is FALSE
FORMULA ParamProductionCell-PT-3-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[[~ [table_unload_angle<=table_unload_angle] & [TL_out<=CU_trans_rs & 3<=A2L_loaded]] | [3<=A1L_rot2_run & ~ [1<=A1L_rot3_in]]]]
normalized: E [true U [[3<=A1L_rot2_run & ~ [1<=A1L_rot3_in]] | [~ [table_unload_angle<=table_unload_angle] & [TL_out<=CU_trans_rs & 3<=A2L_loaded]]]]
abstracting: (3<=A2L_loaded) states: 0
abstracting: (TL_out<=CU_trans_rs) states: 1,378,274 (6)
abstracting: (table_unload_angle<=table_unload_angle) states: 1,465,206 (6)
abstracting: (1<=A1L_rot3_in) states: 3,894 (3)
abstracting: (3<=A1L_rot2_run) states: 0
-> the formula is FALSE
FORMULA ParamProductionCell-PT-3-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m2sec
checking: EF [[3<=A1L_rot3_rs | [3<=TU_lift_rs | [1<=FB_deliver_rs | 3<=A1U_ret_rs]]]]
normalized: E [true U [3<=A1L_rot3_rs | [3<=TU_lift_rs | [1<=FB_deliver_rs | 3<=A1U_ret_rs]]]]
abstracting: (3<=A1U_ret_rs) states: 0
abstracting: (1<=FB_deliver_rs) states: 8,740 (3)
abstracting: (3<=TU_lift_rs) states: 0
abstracting: (3<=A1L_rot3_rs) states: 0
-> the formula is TRUE
FORMULA ParamProductionCell-PT-3-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m3sec
checking: AG [[~ [3<=A1U_rot1_rs] | ~ [[A2L_ret_rs<=PU_lower_run | belt1_start<=deposit_belt_idle]]]]
normalized: ~ [E [true U ~ [[~ [[A2L_ret_rs<=PU_lower_run | belt1_start<=deposit_belt_idle]] | ~ [3<=A1U_rot1_rs]]]]]
abstracting: (3<=A1U_rot1_rs) states: 0
abstracting: (belt1_start<=deposit_belt_idle) states: 1,441,590 (6)
abstracting: (A2L_ret_rs<=PU_lower_run) states: 1,458,149 (6)
-> the formula is TRUE
FORMULA ParamProductionCell-PT-3-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m18sec
checking: EF [2<=crane_above_deposit_belt]
normalized: E [true U 2<=crane_above_deposit_belt]
abstracting: (2<=crane_above_deposit_belt) states: 0
-> the formula is FALSE
FORMULA ParamProductionCell-PT-3-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[FB_in<=table_ready_for_unloading & [[A2L_rot2_rs<=A1U_rot2_run | 2<=table_stop_h] & 3<=A1U_rot2_rs]]]
normalized: E [true U [FB_in<=table_ready_for_unloading & [3<=A1U_rot2_rs & [A2L_rot2_rs<=A1U_rot2_run | 2<=table_stop_h]]]]
abstracting: (2<=table_stop_h) states: 0
abstracting: (A2L_rot2_rs<=A1U_rot2_run) states: 1,459,509 (6)
abstracting: (3<=A1U_rot2_rs) states: 0
abstracting: (FB_in<=table_ready_for_unloading) states: 1,456,466 (6)
-> the formula is FALSE
FORMULA ParamProductionCell-PT-3-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m6sec
checking: EF [[[~ [arm2_forward<=belt2_stop] | [1<=A1L_rot2_in | blank_forged<=robot_stop]] & ~ [press_upward<=A2U_rot3_rs]]]
normalized: E [true U [~ [press_upward<=A2U_rot3_rs] & [[1<=A1L_rot2_in | blank_forged<=robot_stop] | ~ [arm2_forward<=belt2_stop]]]]
abstracting: (arm2_forward<=belt2_stop) states: 1,460,652 (6)
abstracting: (blank_forged<=robot_stop) states: 1,462,731 (6)
abstracting: (1<=A1L_rot2_in) states: 1,162 (3)
abstracting: (press_upward<=A2U_rot3_rs) states: 1,335,363 (6)
-> the formula is TRUE
FORMULA ParamProductionCell-PT-3-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m9sec
checking: EF [~ [[~ [3<=crane_storing] | ~ [1<=crane_storing]]]]
normalized: E [true U ~ [[~ [3<=crane_storing] | ~ [1<=crane_storing]]]]
abstracting: (1<=crane_storing) states: 91,422 (4)
abstracting: (3<=crane_storing) states: 0
-> the formula is FALSE
FORMULA ParamProductionCell-PT-3-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [~ [~ [DB_trans_rs<=ch_FT_free]]]
normalized: ~ [E [true U ~ [DB_trans_rs<=ch_FT_free]]]
abstracting: (DB_trans_rs<=ch_FT_free) states: 1,428,406 (6)
-> the formula is FALSE
FORMULA ParamProductionCell-PT-3-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m9sec
checking: EF [1<=PU_lower_run]
normalized: E [true U 1<=PU_lower_run]
abstracting: (1<=PU_lower_run) states: 86,562 (4)
-> the formula is TRUE
FORMULA ParamProductionCell-PT-3-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m4sec
checking: AG [A2U_rot3_rs<=A1L_ret_rs]
normalized: ~ [E [true U ~ [A2U_rot3_rs<=A1L_ret_rs]]]
abstracting: (A2U_rot3_rs<=A1L_ret_rs) states: 1,451,998 (6)
-> the formula is FALSE
FORMULA ParamProductionCell-PT-3-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m2sec
Total processing time: 2m44sec
BK_STOP 1433630967220
--------------------
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
1521 3737 8466 11420 14263 16467 17708 44468 67777 70751 72990 74094 72724 72211
iterations count:14281 (70), effective:597 (2)
initing FirstDep: 0m0sec
25592 44907 63781 73458 76365 73089
iterations count:6325 (31), effective:273 (1)
9752 15480 21309 49248 54578 55643 55989 69128 72494 73580
iterations count:10647 (52), effective:470 (2)
69569 70159 72298 72357
iterations count:4242 (21), effective:174 (0)
41123 44710 44712 63599 71266 71446 71919
iterations count:7123 (35), effective:299 (1)
41587 47137 51409 59260 70117 73678
iterations count:6720 (33), effective:280 (1)
54917 63087 69284 70050 68402 75863 71919
iterations count:7136 (35), effective:311 (1)
43209 49192 52768 59842 70186 73513
iterations count:6716 (33), effective:278 (1)
22536 45090 55624 67780 70877 73202
iterations count:6964 (34), effective:297 (1)
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-3"
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-3.tgz
mv S_ParamProductionCell-PT-3 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-3, 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-143341204500048"
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 '
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 ;