fond
Model Checking Contest @ Petri Nets 2015
Bruxelles, Belgium, June 23, 2015
Execution of r204st-blw3-143341204500074
Last Updated
August 19, 2015

About the Execution of Marcie for S_ParamProductionCell-PT-5

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4505.930 186645.00 186038.00 30.60 TTTTFFTTTFTTTFFT 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-5, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r204st-blw3-143341204500074
=====================================================================


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

Model: S_ParamProductionCell-PT-5
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: 0m7sec


-> reachability set: #nodes 75901 (7.6e+04) #states 1,657,242 (6)



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

checking: AG [~ [[[A1L_rot3_run<=arm1_magnet_off & 2<=belt2_start] & [belt2_start<=arm1_pick_up_angle | table_unload_angle<=CL_lift_run]]]]
normalized: ~ [E [true U [[belt2_start<=arm1_pick_up_angle | table_unload_angle<=CL_lift_run] & [A1L_rot3_run<=arm1_magnet_off & 2<=belt2_start]]]]

abstracting: (2<=belt2_start) states: 0
abstracting: (A1L_rot3_run<=arm1_magnet_off) states: 1,657,242 (6)
abstracting: (table_unload_angle<=CL_lift_run) states: 719,760 (5)
abstracting: (belt2_start<=arm1_pick_up_angle) states: 1,504,968 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [[2<=CL_trans_run | ~ [3<=A2U_rot1_rs]]]
normalized: ~ [E [true U ~ [[2<=CL_trans_run | ~ [3<=A2U_rot1_rs]]]]]

abstracting: (3<=A2U_rot1_rs) states: 0
abstracting: (2<=CL_trans_run) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [[belt1_stop<=A2U_rot1_run | 1<=A1L_ret_run]]
normalized: E [true U [belt1_stop<=A2U_rot1_run | 1<=A1L_ret_run]]

abstracting: (1<=A1L_ret_run) states: 13,412 (4)
abstracting: (belt1_stop<=A2U_rot1_run) states: 96,808 (4)
-> the formula is TRUE

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

MC time: 0m11sec

checking: AG [ch_A2D_free<=belt2_light_barrier_true]
normalized: ~ [E [true U ~ [ch_A2D_free<=belt2_light_barrier_true]]]

abstracting: (ch_A2D_free<=belt2_light_barrier_true) states: 1,540,402 (6)
-> the formula is FALSE

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

MC time: 0m24sec

checking: EF [arm1_stop<=A1U_rot2_rs]
normalized: E [true U arm1_stop<=A1U_rot2_rs]

abstracting: (arm1_stop<=A1U_rot2_rs) states: 91,362 (4)
-> the formula is TRUE

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

MC time: 0m5sec

checking: EF [[1<=ch_A2D_free & [~ [1<=arm1_retract_ext] & ~ [1<=CU_ready_to_transport]]]]
normalized: E [true U [1<=ch_A2D_free & [~ [1<=CU_ready_to_transport] & ~ [1<=arm1_retract_ext]]]]

abstracting: (1<=arm1_retract_ext) states: 1,586,222 (6)
abstracting: (1<=CU_ready_to_transport) states: 41,495 (4)
abstracting: (1<=ch_A2D_free) states: 116,840 (5)
-> the formula is TRUE

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

MC time: 0m3sec

checking: AG [[~ [~ [A2U_rot3_in<=A2L_rotated]] | A2U_rot2_rs<=DB_trans_rs]]
normalized: ~ [E [true U ~ [[A2U_rot3_in<=A2L_rotated | A2U_rot2_rs<=DB_trans_rs]]]]

abstracting: (A2U_rot2_rs<=DB_trans_rs) states: 1,650,565 (6)
abstracting: (A2U_rot3_in<=A2L_rotated) states: 1,652,602 (6)
-> the formula is TRUE

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

MC time: 0m2sec

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

abstracting: (A2L_extended<=A2L_rot1_in) states: 1,650,185 (6)
-> the formula is FALSE

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

MC time: 0m5sec

checking: AG [arm1_waiting_for_swivel_1<=DB_in]
normalized: ~ [E [true U ~ [arm1_waiting_for_swivel_1<=DB_in]]]

abstracting: (arm1_waiting_for_swivel_1<=DB_in) states: 1,636,814 (6)
-> the formula is FALSE

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

MC time: 0m15sec

checking: AG [[~ [~ [A1L_rot1_rs<=arm1_storing]] | ~ [~ [FB_deliver_rs<=ch_CF_free]]]]
normalized: ~ [E [true U ~ [[A1L_rot1_rs<=arm1_storing | FB_deliver_rs<=ch_CF_free]]]]

abstracting: (FB_deliver_rs<=ch_CF_free) states: 1,646,630 (6)
abstracting: (A1L_rot1_rs<=arm1_storing) states: 1,651,404 (6)
-> the formula is TRUE

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

MC time: 0m13sec

checking: AG [[[A2L_rot3_rs<=A1U_ext_rs | 1<=ch_A1P_full] | [[A1U_rot3_run<=CU_trans_rs | FB_out<=deposit_belt_idle] | [A1L_out<=A1L_rot1_run | 1<=crane_above_deposit_belt]]]]
normalized: ~ [E [true U ~ [[[[A1L_out<=A1L_rot1_run | 1<=crane_above_deposit_belt] | [A1U_rot3_run<=CU_trans_rs | FB_out<=deposit_belt_idle]] | [A2L_rot3_rs<=A1U_ext_rs | 1<=ch_A1P_full]]]]]

abstracting: (1<=ch_A1P_full) states: 89,841 (4)
abstracting: (A2L_rot3_rs<=A1U_ext_rs) states: 1,650,185 (6)
abstracting: (FB_out<=deposit_belt_idle) states: 1,652,898 (6)
abstracting: (A1U_rot3_run<=CU_trans_rs) states: 1,654,566 (6)
abstracting: (1<=crane_above_deposit_belt) states: 808,285 (5)
abstracting: (A1L_out<=A1L_rot1_run) states: 1,650,536 (6)
-> the formula is TRUE

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

MC time: 0m26sec

checking: EF [[[~ [A2U_ext_rs<=A1U_rot1_rs] & 1<=TU_lift_rs] | [~ [arm2_retract_ext<=TL_lower_rs] & [3<=arm1_waiting_for_swivel_1 & A2U_rot3_run<=ch_FT_free]]]]
normalized: E [true U [[~ [arm2_retract_ext<=TL_lower_rs] & [3<=arm1_waiting_for_swivel_1 & A2U_rot3_run<=ch_FT_free]] | [1<=TU_lift_rs & ~ [A2U_ext_rs<=A1U_rot1_rs]]]]

abstracting: (A2U_ext_rs<=A1U_rot1_rs) states: 1,632,725 (6)
abstracting: (1<=TU_lift_rs) states: 95,708 (4)
abstracting: (A2U_rot3_run<=ch_FT_free) states: 1,647,994 (6)
abstracting: (3<=arm1_waiting_for_swivel_1) states: 0
abstracting: (arm2_retract_ext<=TL_lower_rs) states: 189,022 (5)
-> the formula is TRUE

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

MC time: 0m9sec

checking: EF [3<=FB_deliver_rs]
normalized: E [true U 3<=FB_deliver_rs]

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

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

MC time: 0m0sec

checking: AG [arm2_having_swivel_2<=A1U_rot1_rs]
normalized: ~ [E [true U ~ [arm2_having_swivel_2<=A1U_rot1_rs]]]

abstracting: (arm2_having_swivel_2<=A1U_rot1_rs) states: 1,568,399 (6)
-> the formula is FALSE

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

MC time: 0m20sec

checking: EF [~ [[[A1_extended<=A1L_in | crane_lower<=table_load_angle] | [A2L_ret_run<=belt1_stop & 1<=A2L_rot3_in]]]]
normalized: E [true U ~ [[[A1_extended<=A1L_in | crane_lower<=table_load_angle] | [A2L_ret_run<=belt1_stop & 1<=A2L_rot3_in]]]]

abstracting: (1<=A2L_rot3_in) states: 7,057 (3)
abstracting: (A2L_ret_run<=belt1_stop) states: 1,656,702 (6)
abstracting: (crane_lower<=table_load_angle) states: 1,484,586 (6)
abstracting: (A1_extended<=A1L_in) states: 1,650,536 (6)
-> the formula is TRUE

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

MC time: 0m10sec

checking: AG [~ [[2<=CL_out & [A1L_ret_rs<=crane_pick_up_height & arm1_release_angle<=arm2_waiting_for_swivel_1]]]]
normalized: ~ [E [true U [2<=CL_out & [A1L_ret_rs<=crane_pick_up_height & arm1_release_angle<=arm2_waiting_for_swivel_1]]]]

abstracting: (arm1_release_angle<=arm2_waiting_for_swivel_1) states: 1,339,969 (6)
abstracting: (A1L_ret_rs<=crane_pick_up_height) states: 1,651,466 (6)
abstracting: (2<=CL_out) states: 0
-> the formula is TRUE

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

MC time: 0m15sec


Total processing time: 3m6sec


BK_STOP 1433631032250

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

2632 4767 9170 11541 37219 42566 43213 43279 57484 75476 77096
iterations count:11304 (55), effective:471 (2)

initing FirstDep: 0m0sec

44443 55549 63654 71887 78355 80551
iterations count:6509 (32), effective:273 (1)
62869 63388 75279 75259
iterations count:4786 (23), effective:180 (0)
29744 45255 61671 69749 73877 76451
iterations count:6391 (31), effective:275 (1)
13642 22971 25804 42831 52769 62072 75919 77118 76119
iterations count:9854 (48), effective:408 (2)
24973 48532 61150 73558 74279 76557 75901
iterations count:7068 (34), effective:306 (1)
24949 51182 61530 73396 79084
iterations count:5696 (28), effective:240 (1)
12636 31243 44844 56737 58278 63888 65273 67162 78002 75792 75901
iterations count:11053 (54), effective:485 (2)
39626 56205 67487 70977 75655
iterations count:5985 (29), effective:261 (1)
8778 11578 17474 24805 30240 53958 58296 60794 61505 60397 71584 79677
iterations count:12666 (62), effective:538 (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-5"
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-5.tgz
mv S_ParamProductionCell-PT-5 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-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 r204st-blw3-143341204500074"
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 ;