About the Execution of Marcie for S_ResAllocation-PT-R003C020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5415.580 | 5852.00 | 4945.00 | 112.90 | TFFFTFTFTFTFTFFT | 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_ResAllocation-PT-R003C020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444128500322
=====================================================================
--------------------
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 ResAllocation-PT-R003C020-ReachabilityCardinality-0
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-1
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-15
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-2
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-3
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-4
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-5
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-6
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-7
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-8
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1464598445272
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: ResAllocation_PT_R003C020
(NrP: 120 NrTr: 80 NrArc: 354)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
init dd package: 0m 4.124sec
RS generation: 0m 0.018sec
-> reachability set: #nodes 796 (8.0e+02) #states 406,454,747,136 (11)
starting MCC model checker
--------------------------
checking: AG [~ [3<=r_18_1]]
normalized: ~ [E [true U 3<=r_18_1]]
abstracting: (3<=r_18_1) states: 0
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [2<=r_2_0]]
normalized: ~ [E [true U 2<=r_2_0]]
abstracting: (2<=r_2_0) states: 0
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [2<=r_19_1]
normalized: E [true U 2<=r_19_1]
abstracting: (2<=r_19_1) states: 0
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [~ [~ [3<=r_1_0]]]]
normalized: ~ [E [true U 3<=r_1_0]]
abstracting: (3<=r_1_0) states: 0
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [3<=r_15_0]
normalized: E [true U 3<=r_15_0]
abstracting: (3<=r_15_0) states: 0
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [3<=r_3_2]
normalized: E [true U 3<=r_3_2]
abstracting: (3<=r_3_2) states: 0
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [3<=p_15_0]
normalized: E [true U 3<=p_15_0]
abstracting: (3<=p_15_0) states: 0
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[~ [2<=p_7_0] | [2<=r_13_1 | 2<=p_7_0]]]
normalized: ~ [E [true U ~ [[[2<=r_13_1 | 2<=p_7_0] | ~ [2<=p_7_0]]]]]
abstracting: (2<=p_7_0) states: 0
abstracting: (2<=p_7_0) states: 0
abstracting: (2<=r_13_1) states: 0
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [~ [[p_13_0<=p_11_2 | 1<=p_3_2]]]]
normalized: ~ [E [true U ~ [[p_13_0<=p_11_2 | 1<=p_3_2]]]]
abstracting: (1<=p_3_2) states: 150,149,185,536 (11)
abstracting: (p_13_0<=p_11_2) states: 377,103,630,336 (11)
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.046sec
checking: EF [[p_1_0<=p_15_0 & 1<=p_17_0]]
normalized: E [true U [p_1_0<=p_15_0 & 1<=p_17_0]]
abstracting: (1<=p_17_0) states: 68,706,238,464 (10)
abstracting: (p_1_0<=p_15_0) states: 379,100,774,400 (11)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: AG [~ [[[2<=r_13_0 & 1<=r_13_0] & ~ [r_3_1<=r_18_2]]]]
normalized: ~ [E [true U [~ [r_3_1<=r_18_2] & [2<=r_13_0 & 1<=r_13_0]]]]
abstracting: (1<=r_13_0) states: 196,380,016,640 (11)
abstracting: (2<=r_13_0) states: 0
abstracting: (r_3_1<=r_18_2) states: 297,397,862,400 (11)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [[3<=r_5_2 & [2<=p_2_1 & [1<=r_7_0 | p_0_1<=p_4_2]]]]
normalized: E [true U [3<=r_5_2 & [2<=p_2_1 & [1<=r_7_0 | p_0_1<=p_4_2]]]]
abstracting: (p_0_1<=p_4_2) states: 271,349,342,208 (11)
abstracting: (1<=r_7_0) states: 195,815,555,072 (11)
abstracting: (2<=p_2_1) states: 0
abstracting: (3<=r_5_2) states: 0
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [[[[1<=r_6_2 | p_18_2<=p_18_1] | ~ [1<=r_17_1]] & 2<=p_7_0]]
normalized: E [true U [2<=p_7_0 & [[1<=r_6_2 | p_18_2<=p_18_1] | ~ [1<=r_17_1]]]]
abstracting: (1<=r_17_1) states: 213,640,650,752 (11)
abstracting: (p_18_2<=p_18_1) states: 390,526,001,152 (11)
abstracting: (1<=r_6_2) states: 194,882,977,792 (11)
abstracting: (2<=p_7_0) states: 0
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[p_19_0<=p_14_1 | [~ [r_18_1<=p_10_0] & 2<=r_15_2]]]
normalized: ~ [E [true U ~ [[p_19_0<=p_14_1 | [2<=r_15_2 & ~ [r_18_1<=p_10_0]]]]]]
abstracting: (r_18_1<=p_10_0) states: 298,654,568,448 (11)
abstracting: (2<=r_15_2) states: 0
abstracting: (p_19_0<=p_14_1) states: 315,733,999,616 (11)
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: EF [[3<=p_7_2 & [[3<=p_5_0 & r_6_1<=p_10_1] & [3<=r_0_1 | p_8_2<=r_4_2]]]]
normalized: E [true U [3<=p_7_2 & [[3<=r_0_1 | p_8_2<=r_4_2] & [3<=p_5_0 & r_6_1<=p_10_1]]]]
abstracting: (r_6_1<=p_10_1) states: 263,161,819,136 (11)
abstracting: (3<=p_5_0) states: 0
abstracting: (p_8_2<=r_4_2) states: 380,311,912,448 (11)
abstracting: (3<=r_0_1) states: 0
abstracting: (3<=p_7_2) states: 0
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [[[~ [r_2_1<=p_7_2] | [r_15_1<=p_12_0 & 3<=p_18_1]] | [[p_13_0<=r_7_2 | 1<=p_13_0] | 1<=p_9_2]]]
normalized: ~ [E [true U ~ [[[[r_15_1<=p_12_0 & 3<=p_18_1] | ~ [r_2_1<=p_7_2]] | [1<=p_9_2 | [p_13_0<=r_7_2 | 1<=p_13_0]]]]]]
abstracting: (1<=p_13_0) states: 54,427,238,400 (10)
abstracting: (p_13_0<=r_7_2) states: 378,700,455,936 (11)
abstracting: (1<=p_9_2) states: 157,627,006,976 (11)
abstracting: (r_2_1<=p_7_2) states: 289,232,207,872 (11)
abstracting: (3<=p_18_1) states: 0
abstracting: (r_15_1<=p_12_0) states: 284,073,058,304 (11)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
Total processing time: 0m 5.818sec
BK_STOP 1464598451124
--------------------
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
iterations count:611 (7), effective:120 (1)
initing FirstDep: 0m 0.000sec
iterations count:222 (2), effective:21 (0)
iterations count:186 (2), effective:16 (0)
iterations count:156 (1), effective:11 (0)
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_ResAllocation-PT-R003C020"
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_ResAllocation-PT-R003C020.tgz
mv S_ResAllocation-PT-R003C020 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_ResAllocation-PT-R003C020, 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-146444128500322"
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 ;