About the Execution of MARCIE for ParamProductionCell-PT-5
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2207.210 | 4633.00 | 4010.00 | 20.00 | FTFTFTFFFTFTTFFT | 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-3254
Executing tool marcie
Input is ParamProductionCell-PT-5, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r031-blw7-149440474000322
=====================================================================
--------------------
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-5-ReachabilityCardinality-0
FORMULA_NAME ParamProductionCell-PT-5-ReachabilityCardinality-1
FORMULA_NAME ParamProductionCell-PT-5-ReachabilityCardinality-10
FORMULA_NAME ParamProductionCell-PT-5-ReachabilityCardinality-11
FORMULA_NAME ParamProductionCell-PT-5-ReachabilityCardinality-12
FORMULA_NAME ParamProductionCell-PT-5-ReachabilityCardinality-13
FORMULA_NAME ParamProductionCell-PT-5-ReachabilityCardinality-14
FORMULA_NAME ParamProductionCell-PT-5-ReachabilityCardinality-15
FORMULA_NAME ParamProductionCell-PT-5-ReachabilityCardinality-2
FORMULA_NAME ParamProductionCell-PT-5-ReachabilityCardinality-3
FORMULA_NAME ParamProductionCell-PT-5-ReachabilityCardinality-4
FORMULA_NAME ParamProductionCell-PT-5-ReachabilityCardinality-5
FORMULA_NAME ParamProductionCell-PT-5-ReachabilityCardinality-6
FORMULA_NAME ParamProductionCell-PT-5-ReachabilityCardinality-7
FORMULA_NAME ParamProductionCell-PT-5-ReachabilityCardinality-8
FORMULA_NAME ParamProductionCell-PT-5-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1494463243705
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie rev. 8852M (built: crohr on 2017-05-03)
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
parse successfull
net created successfully
Net: ParamProductionCell_PT_5
(NrP: 231 NrTr: 202 NrArc: 846)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.005sec
net check time: 0m 0.000sec
init dd package: 0m 1.126sec
RS generation: 0m 0.298sec
-> reachability set: #nodes 3330 (3.3e+03) #states 1,657,242 (6)
starting MCC model checker
--------------------------
checking: EF [1<=arm1_waiting_for_swivel_1]
normalized: E [true U 1<=arm1_waiting_for_swivel_1]
abstracting: (1<=arm1_waiting_for_swivel_1)
states: 20,764 (4)
-> the formula is TRUE
FORMULA ParamProductionCell-PT-5-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.379sec
checking: EF [1<=CU_in]
normalized: E [true U 1<=CU_in]
abstracting: (1<=CU_in)
states: 41,495 (4)
-> the formula is TRUE
FORMULA ParamProductionCell-PT-5-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.654sec
checking: EF [3<=arm2_storing]
normalized: E [true U 3<=arm2_storing]
abstracting: (3<=arm2_storing)
states: 0
-> the formula is FALSE
FORMULA ParamProductionCell-PT-5-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [[2<=table_stop_h & 1<=FB_trans_run]]]
normalized: ~ [E [true U [2<=table_stop_h & 1<=FB_trans_run]]]
abstracting: (1<=FB_trans_run)
states: 21,224 (4)
abstracting: (2<=table_stop_h)
states: 0
-> the formula is TRUE
FORMULA ParamProductionCell-PT-5-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [arm1_pick_up_ext<=feed_belt_occupied]
normalized: ~ [E [true U ~ [arm1_pick_up_ext<=feed_belt_occupied]]]
abstracting: (arm1_pick_up_ext<=feed_belt_occupied)
states: 1,631,147 (6)
-> the formula is FALSE
FORMULA ParamProductionCell-PT-5-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.401sec
checking: EF [~ [[2<=press_at_upper_pos | ~ [1<=A2U_in]]]]
normalized: E [true U ~ [[~ [1<=A2U_in] | 2<=press_at_upper_pos]]]
abstracting: (2<=press_at_upper_pos)
states: 0
abstracting: (1<=A2U_in)
states: 28,989 (4)
-> the formula is TRUE
FORMULA ParamProductionCell-PT-5-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.232sec
checking: AG [A2L_rot1_in<=TU_rot_run]
normalized: ~ [E [true U ~ [A2L_rot1_in<=TU_rot_run]]]
abstracting: (A2L_rot1_in<=TU_rot_run)
states: 1,652,371 (6)
-> the formula is FALSE
FORMULA ParamProductionCell-PT-5-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.111sec
checking: AG [~ [~ [[A2L_rot3_in<=A2L_rot1_run | 2<=A2U_rot3_run]]]]
normalized: ~ [E [true U ~ [[A2L_rot3_in<=A2L_rot1_run | 2<=A2U_rot3_run]]]]
abstracting: (2<=A2U_rot3_run)
states: 0
abstracting: (A2L_rot3_in<=A2L_rot1_run)
states: 1,650,185 (6)
-> the formula is FALSE
FORMULA ParamProductionCell-PT-5-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.084sec
checking: AG [[ch_TA1_free<=A1_extended | 2<=table_right]]
normalized: ~ [E [true U ~ [[ch_TA1_free<=A1_extended | 2<=table_right]]]]
abstracting: (2<=table_right)
states: 0
abstracting: (ch_TA1_free<=A1_extended)
states: 1,622,650 (6)
-> the formula is FALSE
FORMULA ParamProductionCell-PT-5-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.281sec
checking: EF [[3<=FB_trans_run & crane_above_feed_belt<=CL_trans_rs]]
normalized: E [true U [3<=FB_trans_run & crane_above_feed_belt<=CL_trans_rs]]
abstracting: (crane_above_feed_belt<=CL_trans_rs)
states: 860,630 (5)
abstracting: (3<=FB_trans_run)
states: 0
-> the formula is FALSE
FORMULA ParamProductionCell-PT-5-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: AG [~ [[~ [3<=PU_out] & [deposit_belt_empty<=A2L_loaded & 1<=A1U_in]]]]
normalized: ~ [E [true U [~ [3<=PU_out] & [deposit_belt_empty<=A2L_loaded & 1<=A1U_in]]]]
abstracting: (1<=A1U_in)
states: 14,996 (4)
abstracting: (deposit_belt_empty<=A2L_loaded)
states: 1,540,985 (6)
abstracting: (3<=PU_out)
states: 0
-> the formula is FALSE
FORMULA ParamProductionCell-PT-5-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.058sec
checking: EF [[~ [A2L_rot2_in<=belt1_light_barrier_true] & ~ [[2<=A1U_in & 3<=forge_run]]]]
normalized: E [true U [~ [[2<=A1U_in & 3<=forge_run]] & ~ [A2L_rot2_in<=belt1_light_barrier_true]]]
abstracting: (A2L_rot2_in<=belt1_light_barrier_true)
states: 1,655,772 (6)
abstracting: (3<=forge_run)
states: 0
abstracting: (2<=A1U_in)
states: 0
-> the formula is TRUE
FORMULA ParamProductionCell-PT-5-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.093sec
checking: AG [[A2L_rot3_run<=A2U_rot1_run & [~ [3<=FB_out] | ~ [FB_out<=A1U_rot1_rs]]]]
normalized: ~ [E [true U ~ [[[~ [FB_out<=A1U_rot1_rs] | ~ [3<=FB_out]] & A2L_rot3_run<=A2U_rot1_run]]]]
abstracting: (A2L_rot3_run<=A2U_rot1_run)
states: 1,643,128 (6)
abstracting: (3<=FB_out)
states: 0
abstracting: (FB_out<=A1U_rot1_rs)
states: 1,646,676 (6)
-> the formula is FALSE
FORMULA ParamProductionCell-PT-5-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.022sec
checking: AG [[[~ [2<=PL_lower_run] | 1<=A2U_rot3_run] & [~ [2<=crane_mag_on] | [table_stop_h<=press_at_middle_pos | FB_deliver_rs<=DB_trans_rs]]]]
normalized: ~ [E [true U ~ [[[~ [2<=PL_lower_run] | 1<=A2U_rot3_run] & [~ [2<=crane_mag_on] | [table_stop_h<=press_at_middle_pos | FB_deliver_rs<=DB_trans_rs]]]]]]
abstracting: (FB_deliver_rs<=DB_trans_rs)
states: 1,646,792 (6)
abstracting: (table_stop_h<=press_at_middle_pos)
states: 873,414 (5)
abstracting: (2<=crane_mag_on)
states: 0
abstracting: (1<=A2U_rot3_run)
states: 9,280 (3)
abstracting: (2<=PL_lower_run)
states: 0
-> the formula is TRUE
FORMULA ParamProductionCell-PT-5-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: EF [[[~ [2<=robot_right] & [1<=CU_lower_run | 3<=table_ready_for_unloading]] & [[2<=table_load_angle | 2<=CU_lift_rs] & [2<=crane_above_feed_belt | 1<=TL_out]]]]
normalized: E [true U [[[2<=crane_above_feed_belt | 1<=TL_out] & [2<=table_load_angle | 2<=CU_lift_rs]] & [[1<=CU_lower_run | 3<=table_ready_for_unloading] & ~ [2<=robot_right]]]]
abstracting: (2<=robot_right)
states: 0
abstracting: (3<=table_ready_for_unloading)
states: 0
abstracting: (1<=CU_lower_run)
states: 82,990 (4)
abstracting: (2<=CU_lift_rs)
states: 0
abstracting: (2<=table_load_angle)
states: 0
abstracting: (1<=TL_out)
states: 34,592 (4)
abstracting: (2<=crane_above_feed_belt)
states: 0
-> the formula is FALSE
FORMULA ParamProductionCell-PT-5-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: EF [[[[CL_lower_rs<=A1L_in | crane_to_belt1<=PL_out] | ~ [A2U_rot2_rs<=A1U_ext_run]] & [[3<=ch_A1P_full & table_right<=crane_above_feed_belt] | [3<=TL_in | 1<=A2L_rot3_run]]]]
normalized: E [true U [[[CL_lower_rs<=A1L_in | crane_to_belt1<=PL_out] | ~ [A2U_rot2_rs<=A1U_ext_run]] & [[3<=ch_A1P_full & table_right<=crane_above_feed_belt] | [3<=TL_in | 1<=A2L_rot3_run]]]]
abstracting: (1<=A2L_rot3_run)
states: 14,114 (4)
abstracting: (3<=TL_in)
states: 0
abstracting: (table_right<=crane_above_feed_belt)
states: 1,468,590 (6)
abstracting: (3<=ch_A1P_full)
states: 0
abstracting: (A2U_rot2_rs<=A1U_ext_run)
states: 1,650,565 (6)
abstracting: (crane_to_belt1<=PL_out)
states: 1,504,521 (6)
abstracting: (CL_lower_rs<=A1L_in)
states: 1,605,131 (6)
-> the formula is TRUE
FORMULA ParamProductionCell-PT-5-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.017sec
totally nodes used: 2418196(2.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1749120 3293198 5042318
used/not used/entry size/cache size: 3095170 64013694 16 1024MB
basic ops cache: hits/miss/sum: 1686041 4096679 5782720
used/not used/entry size/cache size: 6999678 9777538 12 192MB
unary ops cache: hits/miss/sum: 0 630 630
used/not used/entry size/cache size: 630 8387978 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 8282 21159 29441
used/not used/entry size/cache size: 21087 2076065 32 64MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 64731498
1 2336970
2 39966
3 426
4 4
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.606sec
BK_STOP 1494463248338
--------------------
content from stderr:
check for maximal unmarked siphon
ok
check for constant places
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.001sec
iterations count:9413 (46), effective:673 (3)
initing FirstDep: 0m 0.000sec
iterations count:4269 (21), effective:243 (1)
iterations count:5209 (25), effective:279 (1)
iterations count:9558 (47), effective:516 (2)
iterations count:5048 (24), effective:279 (1)
iterations count:6670 (33), effective:403 (1)
iterations count:6404 (31), effective:362 (1)
iterations count:5440 (26), effective:319 (1)
iterations count:5222 (25), effective:311 (1)
iterations count:6896 (34), effective:446 (2)
iterations count:6412 (31), effective:361 (1)
iterations count:6412 (31), effective:361 (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="ParamProductionCell-PT-5"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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-5.tgz
mv ParamProductionCell-PT-5 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is ParamProductionCell-PT-5, 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 r031-blw7-149440474000322"
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 '
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 ;