About the Execution of Marcie for ParamProductionCell-PT-0
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5595.170 | 108624.00 | 107999.00 | 20.40 | TFTFFTTTFTTFFTFF | 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-2265
Executing tool marcie
Input is ParamProductionCell-PT-0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r064kn-blw3-143254880200002
=====================================================================
--------------------
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-0-CTLCardinality-0
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-1
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-15
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-2
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-3
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-4
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-5
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-6
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-7
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-8
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1432724905963
Model: ParamProductionCell-PT-0
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=CTLCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5
parse successfull
net created successfully
(NrP: 198 NrTr: 176 NrArc: 730)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec
init dd package: 0m2sec
RS generation: 0m2sec
-> reachability set: #nodes 14351 (1.4e+04) #states 2,776,936 (6)
starting MCC model checker
--------------------------
checking: [AG [EX [TL_out<=A2L_rot3_in]] | EF [[[A1L_loaded<=arm1_having_swivel_2 & 3<=TU_out] | [press_ready_for_loading<=ch_PA2_free & c_p1<=A1U_out]]]]
normalized: [~ [E [true U ~ [EX [TL_out<=A2L_rot3_in]]]] | E [true U [[press_ready_for_loading<=ch_PA2_free & c_p1<=A1U_out] | [A1L_loaded<=arm1_having_swivel_2 & 3<=TU_out]]]]
abstracting: (3<=TU_out) states: 0
abstracting: (A1L_loaded<=arm1_having_swivel_2) states: 2,766,296 (6)
abstracting: (c_p1<=A1U_out) states: 1,395,452 (6)
abstracting: (press_ready_for_loading<=ch_PA2_free) states: 2,204,136 (6)
abstracting: (TL_out<=A2L_rot3_in) states: 2,671,656 (6)
.-> the formula is TRUE
FORMULA ParamProductionCell-PT-0-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m19sec
checking: [A [[2<=A1U_ret_run | belt2_start<=TU_lift_rs] U [1<=TL_lower_rs & 3<=A1L_rot3_run]] & EF [2<=A2U_ext_run]]
normalized: [E [true U 2<=A2U_ext_run] & [~ [EG [~ [[1<=TL_lower_rs & 3<=A1L_rot3_run]]]] & ~ [E [~ [[2<=A1U_ret_run | belt2_start<=TU_lift_rs]] U [~ [[2<=A1U_ret_run | belt2_start<=TU_lift_rs]] & ~ [[1<=TL_lower_rs & 3<=A1L_rot3_run]]]]]]]
abstracting: (3<=A1L_rot3_run) states: 0
abstracting: (1<=TL_lower_rs) states: 105,824 (5)
abstracting: (belt2_start<=TU_lift_rs) states: 2,021,416 (6)
abstracting: (2<=A1U_ret_run) states: 0
abstracting: (belt2_start<=TU_lift_rs) states: 2,021,416 (6)
abstracting: (2<=A1U_ret_run) states: 0
abstracting: (3<=A1L_rot3_run) states: 0
abstracting: (1<=TL_lower_rs) states: 105,824 (5)
EG iterations: 0
abstracting: (2<=A2U_ext_run) states: 0
-> the formula is FALSE
FORMULA ParamProductionCell-PT-0-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AF [[EG [1<=press_ready_for_loading] & EG [1<=A1U_rot1_in]]]
normalized: ~ [EG [~ [[EG [1<=A1U_rot1_in] & EG [1<=press_ready_for_loading]]]]]
abstracting: (1<=press_ready_for_loading) states: 572,800 (5)
.....................................................................................................................................................................................................................
EG iterations: 213
abstracting: (1<=A1U_rot1_in) states: 13,968 (4)
...........................................................
EG iterations: 59
EG iterations: 0
-> the formula is FALSE
FORMULA ParamProductionCell-PT-0-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m13sec
checking: ~ [EF [AG [2<=c_p2]]]
normalized: ~ [E [true U ~ [E [true U ~ [2<=c_p2]]]]]
abstracting: (2<=c_p2) states: 0
-> the formula is TRUE
FORMULA ParamProductionCell-PT-0-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AF [~ [AX [A1U_rot1_in<=A1U_rot1_rs]]]
normalized: ~ [EG [~ [EX [~ [A1U_rot1_in<=A1U_rot1_rs]]]]]
abstracting: (A1U_rot1_in<=A1U_rot1_rs) states: 2,762,968 (6)
......................................................................................................................................
EG iterations: 133
-> the formula is TRUE
FORMULA ParamProductionCell-PT-0-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m6sec
checking: AX [[[[arm1_waiting_for_swivel_2<=c_p1 | arm2_having_swivel_1<=arm1_waiting_for_swivel_2] & [3<=arm1_waiting_for_swivel_1 | belt2_light_barrier_false<=arm2_waiting_for_swivel_1]] | AG [A2L_rot3_rs<=A1L_ret_run]]]
normalized: ~ [EX [~ [[~ [E [true U ~ [A2L_rot3_rs<=A1L_ret_run]]] | [[3<=arm1_waiting_for_swivel_1 | belt2_light_barrier_false<=arm2_waiting_for_swivel_1] & [arm1_waiting_for_swivel_2<=c_p1 | arm2_having_swivel_1<=arm1_waiting_for_swivel_2]]]]]]
abstracting: (arm2_having_swivel_1<=arm1_waiting_for_swivel_2) states: 2,682,688 (6)
abstracting: (arm1_waiting_for_swivel_2<=c_p1) states: 2,748,612 (6)
abstracting: (belt2_light_barrier_false<=arm2_waiting_for_swivel_1) states: 558,232 (5)
abstracting: (3<=arm1_waiting_for_swivel_1) states: 0
abstracting: (A2L_rot3_rs<=A1L_ret_run) states: 2,763,472 (6)
.-> the formula is FALSE
FORMULA ParamProductionCell-PT-0-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m23sec
checking: E [[[1<=arm2_release_ext & DB_trans_run<=A1U_rot3_in] | ~ [1<=A1U_rot2_in]] U ~ [~ [3<=A2L_ret_rs]]]
normalized: E [[~ [1<=A1U_rot2_in] | [1<=arm2_release_ext & DB_trans_run<=A1U_rot3_in]] U 3<=A2L_ret_rs]
abstracting: (3<=A2L_ret_rs) states: 0
abstracting: (DB_trans_run<=A1U_rot3_in) states: 2,516,016 (6)
abstracting: (1<=arm2_release_ext) states: 146,440 (5)
abstracting: (1<=A1U_rot2_in) states: 7,372 (3)
-> the formula is FALSE
FORMULA ParamProductionCell-PT-0-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m1sec
checking: AG [AG [[A2U_unloaded<=arm1_pick_up_angle | A1L_ext_rs<=belt1_light_barrier_false]]]
normalized: ~ [E [true U E [true U ~ [[A2U_unloaded<=arm1_pick_up_angle | A1L_ext_rs<=belt1_light_barrier_false]]]]]
abstracting: (A1L_ext_rs<=belt1_light_barrier_false) states: 2,776,936 (6)
abstracting: (A2U_unloaded<=arm1_pick_up_angle) states: 2,747,648 (6)
-> the formula is TRUE
FORMULA ParamProductionCell-PT-0-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AF [~ [A2U_ret_rs<=TL_out]]
normalized: ~ [EG [A2U_ret_rs<=TL_out]]
abstracting: (A2U_ret_rs<=TL_out) states: 2,748,832 (6)
.........................................................................
EG iterations: 73
-> the formula is FALSE
FORMULA ParamProductionCell-PT-0-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m4sec
checking: AF [A [1<=A2U_ret_rs U 3<=TU_lift_run]]
normalized: ~ [EG [~ [[~ [EG [~ [3<=TU_lift_run]]] & ~ [E [~ [1<=A2U_ret_rs] U [~ [1<=A2U_ret_rs] & ~ [3<=TU_lift_run]]]]]]]]
abstracting: (3<=TU_lift_run) states: 0
abstracting: (1<=A2U_ret_rs) states: 29,288 (4)
abstracting: (1<=A2U_ret_rs) states: 29,288 (4)
abstracting: (3<=TU_lift_run) states: 0
EG iterations: 0
EG iterations: 0
-> the formula is FALSE
FORMULA ParamProductionCell-PT-0-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [[AX [belt2_start<=A1U_rot2_run] | AG [A1U_ext_rs<=PL_lower_run]]]
normalized: EG [[~ [E [true U ~ [A1U_ext_rs<=PL_lower_run]]] | ~ [EX [~ [belt2_start<=A1U_rot2_run]]]]]
abstracting: (belt2_start<=A1U_rot2_run) states: 1,996,504 (6)
.abstracting: (A1U_ext_rs<=PL_lower_run) states: 2,762,968 (6)
.......................................................................................................................................................................................................
EG iterations: 199
-> the formula is TRUE
FORMULA ParamProductionCell-PT-0-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10sec
checking: EF [EG [1<=A1U_ext_rs]]
normalized: E [true U EG [1<=A1U_ext_rs]]
abstracting: (1<=A1U_ext_rs) states: 13,968 (4)
...........................................................
EG iterations: 59
-> the formula is FALSE
FORMULA ParamProductionCell-PT-0-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [[EF [~ [arm1_magnet_on<=A1U_extendet]] & EG [[A2U_rotated<=PL_lower_run & feed_belt_empty<=belt1_stop]]]]
normalized: ~ [[EG [[A2U_rotated<=PL_lower_run & feed_belt_empty<=belt1_stop]] & E [true U ~ [arm1_magnet_on<=A1U_extendet]]]]
abstracting: (arm1_magnet_on<=A1U_extendet) states: 1,245,068 (6)
abstracting: (feed_belt_empty<=belt1_stop) states: 2,776,936 (6)
abstracting: (A2U_rotated<=PL_lower_run) states: 2,750,816 (6)
.......................................................................................................................................................................................................
EG iterations: 199
-> the formula is FALSE
FORMULA ParamProductionCell-PT-0-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m12sec
checking: EF [1<=arm2_pick_up_ext]
normalized: E [true U 1<=arm2_pick_up_ext]
abstracting: (1<=arm2_pick_up_ext) states: 67,320 (4)
-> the formula is TRUE
FORMULA ParamProductionCell-PT-0-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[~ [[1<=table_at_load_angle & table_load_angle<=TU_rot_rs]] & [[3<=arm1_having_swivel_2 | arm1_store_free<=p_p2] | A1_extended<=A2L_rot2_rs]]]
normalized: ~ [E [true U ~ [[[A1_extended<=A2L_rot2_rs | [3<=arm1_having_swivel_2 | arm1_store_free<=p_p2]] & ~ [[1<=table_at_load_angle & table_load_angle<=TU_rot_rs]]]]]]
abstracting: (table_load_angle<=TU_rot_rs) states: 1,374,768 (6)
abstracting: (1<=table_at_load_angle) states: 105,824 (5)
abstracting: (arm1_store_free<=p_p2) states: 2,355,180 (6)
abstracting: (3<=arm1_having_swivel_2) states: 0
abstracting: (A1_extended<=A2L_rot2_rs) states: 2,766,296 (6)
-> the formula is TRUE
FORMULA ParamProductionCell-PT-0-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m5sec
checking: AG [A1L_rot1_rs<=belt1_light_barrier_false]
normalized: ~ [E [true U ~ [A1L_rot1_rs<=belt1_light_barrier_false]]]
abstracting: (A1L_rot1_rs<=belt1_light_barrier_false) states: 2,776,936 (6)
-> the formula is TRUE
FORMULA ParamProductionCell-PT-0-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 1m48sec
BK_STOP 1432725014587
--------------------
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
1110 2462 4320 5974 7898 9368 11426 12423 12737 14206 14576 16278 15618 15366 16389 15347 15728 15417 16046 14555 14613
iterations count:21333 (121), effective:1085 (6)
initing FirstDep: 0m0sec
12419 12705 13900 14607 14993
iterations count:5630 (31), effective:284 (1)
1631 3498 5550 9408 9964 11747 13840 13925 15621 14967
iterations count:10693 (60), effective:551 (3)
iterations count:176 (1), effective:0 (0)
iterations count:176 (1), effective:0 (0)
6553 8163 10711 12397 13676 14261
iterations count:6722 (38), effective:347 (1)
iterations count:176 (1), effective:0 (0)
6487 7045 8328 12880 14325
iterations count:5244 (29), effective:261 (1)
13343 14285
iterations count:2380 (13), effective:111 (0)
5540 10426 12222 13577 14403
iterations count:5437 (30), effective:274 (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-0"
export BK_EXAMINATION="CTLCardinality"
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/ParamProductionCell-PT-0.tgz
mv ParamProductionCell-PT-0 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is ParamProductionCell-PT-0, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r064kn-blw3-143254880200002"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 ;