fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution%20of%20r185kn-smll-146444131001150
Last Updated
June 30, 2016

About the Execution of Marcie for S_ParamProductionCell-PT-4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5675.800 19319.00 19019.00 120.60 FFTFTFTTTFTTFFFT 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-2979
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 r185kn-smll-146444131001150
=====================================================================


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


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_4
(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 4.069sec


RS generation: 0m 1.522sec


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



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

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

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

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

MC time: 0m 0.003sec

checking: EF [~ [~ [[1<=ch_A1P_free & 2<=A2U_rot2_rs]]]]
normalized: E [true U [1<=ch_A1P_free & 2<=A2U_rot2_rs]]

abstracting: (2<=A2U_rot2_rs) states: 0
abstracting: (1<=ch_A1P_free) states: 104,566 (5)
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EF [[2<=TU_rot_run & 3<=A2L_ret_run]]
normalized: E [true U [2<=TU_rot_run & 3<=A2L_ret_run]]

abstracting: (3<=A2L_ret_run) states: 0
abstracting: (2<=TU_rot_run) states: 0
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: EF [arm1_magnet_off<=A2U_rot1_in]
normalized: E [true U arm1_magnet_off<=A2U_rot1_in]

abstracting: (arm1_magnet_off<=A2U_rot1_in) states: 1,307,684 (6)
-> the formula is TRUE

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

MC time: 0m 1.170sec

checking: AG [~ [[A2L_in<=DB_deliver_run & 2<=belt1_light_barrier_false]]]
normalized: ~ [E [true U [A2L_in<=DB_deliver_run & 2<=belt1_light_barrier_false]]]

abstracting: (2<=belt1_light_barrier_false) states: 0
abstracting: (A2L_in<=DB_deliver_run) states: 2,388,619 (6)
-> the formula is TRUE

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

MC time: 0m 0.016sec

checking: AG [[~ [~ [1<=PU_lower_run]] | [~ [1<=FB_deliver_run] | crane_lift<=CU_unloaded]]]
normalized: ~ [E [true U ~ [[1<=PU_lower_run | [crane_lift<=CU_unloaded | ~ [1<=FB_deliver_run]]]]]]

abstracting: (1<=FB_deliver_run) states: 36,614 (4)
abstracting: (crane_lift<=CU_unloaded) states: 1,991,806 (6)
abstracting: (1<=PU_lower_run) states: 199,862 (5)
-> the formula is FALSE

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

MC time: 0m 3.004sec

checking: AG [[A1U_out<=CL_trans_run | TL_lower_rs<=TU_in]]
normalized: ~ [E [true U ~ [[A1U_out<=CL_trans_run | TL_lower_rs<=TU_in]]]]

abstracting: (TL_lower_rs<=TU_in) states: 2,314,031 (6)
abstracting: (A1U_out<=CL_trans_run) states: 2,398,087 (6)
-> the formula is FALSE

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

MC time: 0m 0.737sec

checking: EF [[~ [[arm2_forward<=arm1_having_swivel_2 | 2<=crane_mag_on]] & 3<=ch_TA1_free]]
normalized: E [true U [3<=ch_TA1_free & ~ [[arm2_forward<=arm1_having_swivel_2 | 2<=crane_mag_on]]]]

abstracting: (2<=crane_mag_on) states: 0
abstracting: (arm2_forward<=arm1_having_swivel_2) states: 2,274,025 (6)
abstracting: (3<=ch_TA1_free) states: 0
-> the formula is FALSE

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

MC time: 0m 0.015sec

checking: EF [[~ [[crane_stop_h<=TU_in & 3<=A1U_rot2_rs]] & 1<=FB_deliver_run]]
normalized: E [true U [1<=FB_deliver_run & ~ [[crane_stop_h<=TU_in & 3<=A1U_rot2_rs]]]]

abstracting: (3<=A1U_rot2_rs) states: 0
abstracting: (crane_stop_h<=TU_in) states: 491,785 (5)
abstracting: (1<=FB_deliver_run) states: 36,614 (4)
-> the formula is TRUE

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

MC time: 0m 2.046sec

checking: EF [[[2<=A1U_rot1_in & ~ [1<=A2U_rot1_run]] & [~ [2<=arm2_stop] | [1<=press_at_upper_pos & 2<=forge_rs]]]]
normalized: E [true U [[[1<=press_at_upper_pos & 2<=forge_rs] | ~ [2<=arm2_stop]] & [2<=A1U_rot1_in & ~ [1<=A2U_rot1_run]]]]

abstracting: (1<=A2U_rot1_run) states: 31,498 (4)
abstracting: (2<=A1U_rot1_in) states: 0
abstracting: (2<=arm2_stop) states: 0
abstracting: (2<=forge_rs) states: 0
abstracting: (1<=press_at_upper_pos) states: 399,724 (5)
-> the formula is FALSE

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

MC time: 0m 0.006sec

checking: EF [~ [[~ [3<=table_stop_v] & [DB_deliver_rs<=A2U_ext_rs & A1L_rot1_in<=DB_at_end]]]]
normalized: E [true U ~ [[[DB_deliver_rs<=A2U_ext_rs & A1L_rot1_in<=DB_at_end] & ~ [3<=table_stop_v]]]]

abstracting: (3<=table_stop_v) states: 0
abstracting: (A1L_rot1_in<=DB_at_end) states: 2,403,903 (6)
abstracting: (DB_deliver_rs<=A2U_ext_rs) states: 2,338,617 (6)
-> the formula is TRUE

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

MC time: 0m 2.377sec

checking: EF [[CL_lower_run<=arm2_release_ext & ~ [[table_at_load_angle<=CL_out & TL_rot_rs<=ch_A2D_free]]]]
normalized: E [true U [CL_lower_run<=arm2_release_ext & ~ [[table_at_load_angle<=CL_out & TL_rot_rs<=ch_A2D_free]]]]

abstracting: (TL_rot_rs<=ch_A2D_free) states: 2,322,071 (6)
abstracting: (table_at_load_angle<=CL_out) states: 2,316,921 (6)
abstracting: (CL_lower_run<=arm2_release_ext) states: 2,273,649 (6)
-> the formula is TRUE

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

MC time: 0m 1.575sec

checking: AG [[~ [[A1U_out<=arm2_pick_up_angle & 3<=belt2_start]] | [~ [1<=ch_CF_free] | ~ [table_right<=TU_lift_rs]]]]
normalized: ~ [E [true U ~ [[[~ [1<=ch_CF_free] | ~ [table_right<=TU_lift_rs]] | ~ [[A1U_out<=arm2_pick_up_angle & 3<=belt2_start]]]]]]

abstracting: (3<=belt2_start) states: 0
abstracting: (A1U_out<=arm2_pick_up_angle) states: 2,397,381 (6)
abstracting: (table_right<=TU_lift_rs) states: 1,854,241 (6)
abstracting: (1<=ch_CF_free) states: 349,390 (5)
-> the formula is TRUE

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

MC time: 0m 0.056sec

checking: AG [[arm1_release_ext<=feed_belt_idle | [[3<=table_at_load_angle | CU_lift_run<=A1U_rot1_rs] | [3<=TU_rot_run & 3<=robot_right]]]]
normalized: ~ [E [true U ~ [[arm1_release_ext<=feed_belt_idle | [[3<=table_at_load_angle | CU_lift_run<=A1U_rot1_rs] | [3<=TU_rot_run & 3<=robot_right]]]]]]

abstracting: (3<=robot_right) states: 0
abstracting: (3<=TU_rot_run) states: 0
abstracting: (CU_lift_run<=A1U_rot1_rs) states: 2,282,301 (6)
abstracting: (3<=table_at_load_angle) states: 0
abstracting: (arm1_release_ext<=feed_belt_idle) states: 2,388,869 (6)
-> the formula is TRUE

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

MC time: 0m 0.042sec

checking: EF [[[[deposit_belt_occupied<=ch_CF_full & 1<=arm2_having_swivel_1] | ~ [2<=A1L_ext_rs]] & [~ [arm2_magnet_off<=TL_rot_rs] & 3<=FB_deliver_rs]]]
normalized: E [true U [[3<=FB_deliver_rs & ~ [arm2_magnet_off<=TL_rot_rs]] & [~ [2<=A1L_ext_rs] | [deposit_belt_occupied<=ch_CF_full & 1<=arm2_having_swivel_1]]]]

abstracting: (1<=arm2_having_swivel_1) states: 86,163 (4)
abstracting: (deposit_belt_occupied<=ch_CF_full) states: 2,169,993 (6)
abstracting: (2<=A1L_ext_rs) states: 0
abstracting: (arm2_magnet_off<=TL_rot_rs) states: 1,171,650 (6)
abstracting: (3<=FB_deliver_rs) states: 0
-> the formula is FALSE

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

MC time: 0m 0.038sec

checking: AG [[[[A2U_rotated<=ch_A2D_full & 1<=A1U_unloadet] | [3<=press_upward & A1L_rot3_in<=A2L_rot2_run]] | [[A1L_rot1_in<=crane_to_belt2 | CL_trans_run<=A1U_rot2_rs] | A2U_rot2_rs<=A1L_ret_rs]]]
normalized: ~ [E [true U ~ [[[A2U_rot2_rs<=A1L_ret_rs | [A1L_rot1_in<=crane_to_belt2 | CL_trans_run<=A1U_rot2_rs]] | [[3<=press_upward & A1L_rot3_in<=A2L_rot2_run] | [A2U_rotated<=ch_A2D_full & 1<=A1U_unloadet]]]]]]

abstracting: (1<=A1U_unloadet) states: 12,358 (4)
abstracting: (A2U_rotated<=ch_A2D_full) states: 2,376,013 (6)
abstracting: (A1L_rot3_in<=A2L_rot2_run) states: 2,404,665 (6)
abstracting: (3<=press_upward) states: 0
abstracting: (CL_trans_run<=A1U_rot2_rs) states: 2,259,665 (6)
abstracting: (A1L_rot1_in<=crane_to_belt2) states: 2,404,232 (6)
abstracting: (A2U_rot2_rs<=A1L_ret_rs) states: 2,396,011 (6)
-> the formula is TRUE

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

MC time: 0m 0.059sec


Total processing time: 0m19.275sec


BK_STOP 1464952424214

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

1229 5699 7436 7899 9921 11727 11884 13491 14672 15257 14796 14797 13737
iterations count:13103 (64), effective:883 (4)

initing FirstDep: 0m 0.000sec

11334 12618
iterations count:2914 (14), effective:230 (1)
10183 11146 12461 13011 14042 12943 12831 13891
iterations count:8654 (42), effective:541 (2)
3117 5225 7365 8327 11724 12794 13129 13797
iterations count:8543 (42), effective:487 (2)
12232 12890 13560 12827 14114
iterations count:5226 (25), effective:282 (1)
13569 14318 14507 14588 15182
iterations count:5748 (28), effective:376 (1)
11505 12253 12960 13197 13713
iterations count:5634 (27), effective:344 (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-4"
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-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-2979"
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 r185kn-smll-146444131001150"
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 ;