About the Execution of Marcie for DES-PT-01a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5548.380 | 13486.00 | 13039.00 | 20.20 | FTTFFFFFTTFFTFTT | 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 DES-PT-01a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468026700025
=====================================================================
--------------------
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 DES-PT-01a-ReachabilityCardinality-0
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-1
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-15
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-2
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-3
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-4
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-5
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-6
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-7
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-8
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1464792705896
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: DES_PT_01a
(NrP: 119 NrTr: 76 NrArc: 381)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
init dd package: 0m 3.767sec
RS generation: 0m 1.117sec
-> reachability set: #nodes 24378 (2.4e+04) #states 108,580,356 (8)
starting MCC model checker
--------------------------
checking: EF [3<=p9]
normalized: E [true U 3<=p9]
abstracting: (3<=p9) states: 0
-> the formula is FALSE
FORMULA DES-PT-01a-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: EF [2<=p56]
normalized: E [true U 2<=p56]
abstracting: (2<=p56) states: 0
-> the formula is FALSE
FORMULA DES-PT-01a-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [2<=p36]
normalized: E [true U 2<=p36]
abstracting: (2<=p36) states: 0
-> the formula is FALSE
FORMULA DES-PT-01a-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: EF [[3<=p97 & 2<=p47]]
normalized: E [true U [3<=p97 & 2<=p47]]
abstracting: (2<=p47) states: 0
abstracting: (3<=p97) states: 0
-> the formula is FALSE
FORMULA DES-PT-01a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: AG [[~ [2<=p21] | [~ [2<=p33] & ~ [p97<=p0]]]]
normalized: ~ [E [true U ~ [[[~ [2<=p33] & ~ [p97<=p0]] | ~ [2<=p21]]]]]
abstracting: (2<=p21) states: 0
abstracting: (p97<=p0) states: 108,482,911 (8)
abstracting: (2<=p33) states: 0
-> the formula is TRUE
FORMULA DES-PT-01a-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.022sec
checking: AG [~ [[[1<=p43 & 2<=p83] & p13<=p0]]]
normalized: ~ [E [true U [p13<=p0 & [1<=p43 & 2<=p83]]]]
abstracting: (2<=p83) states: 0
abstracting: (1<=p43) states: 58,283,553 (7)
abstracting: (p13<=p0) states: 13,709,362 (7)
-> the formula is TRUE
FORMULA DES-PT-01a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.057sec
checking: EF [[~ [p24<=p107] | [[1<=p84 | 1<=p83] & ~ [1<=p12]]]]
normalized: E [true U [[~ [1<=p12] & [1<=p84 | 1<=p83]] | ~ [p24<=p107]]]
abstracting: (p24<=p107) states: 103,389,392 (8)
abstracting: (1<=p83) states: 69,249,003 (7)
abstracting: (1<=p84) states: 34,580,844 (7)
abstracting: (1<=p12) states: 13,709,361 (7)
-> the formula is TRUE
FORMULA DES-PT-01a-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.136sec
checking: EF [[[1<=p61 & p72<=p118] & ~ [p104<=p80]]]
normalized: E [true U [~ [p104<=p80] & [1<=p61 & p72<=p118]]]
abstracting: (p72<=p118) states: 65,359,568 (7)
abstracting: (1<=p61) states: 36,853,356 (7)
abstracting: (p104<=p80) states: 99,504,456 (7)
-> the formula is TRUE
FORMULA DES-PT-01a-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.360sec
checking: AG [~ [[[p19<=p115 & 2<=p118] & [1<=p46 | 3<=p73]]]]
normalized: ~ [E [true U [[1<=p46 | 3<=p73] & [p19<=p115 & 2<=p118]]]]
abstracting: (2<=p118) states: 0
abstracting: (p19<=p115) states: 54,358,692 (7)
abstracting: (3<=p73) states: 0
abstracting: (1<=p46) states: 71,726,999 (7)
-> the formula is TRUE
FORMULA DES-PT-01a-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.051sec
checking: AG [~ [[[3<=p10 & 1<=p40] & [p33<=p1 | 2<=p61]]]]
normalized: ~ [E [true U [[p33<=p1 | 2<=p61] & [3<=p10 & 1<=p40]]]]
abstracting: (1<=p40) states: 108,546,789 (8)
abstracting: (3<=p10) states: 0
abstracting: (2<=p61) states: 0
abstracting: (p33<=p1) states: 108,575,016 (8)
-> the formula is TRUE
FORMULA DES-PT-01a-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.057sec
checking: EF [[3<=p70 & ~ [[p49<=p93 | p92<=p86]]]]
normalized: E [true U [3<=p70 & ~ [[p49<=p93 | p92<=p86]]]]
abstracting: (p92<=p86) states: 104,374,028 (8)
abstracting: (p49<=p93) states: 71,975,576 (7)
abstracting: (3<=p70) states: 0
-> the formula is FALSE
FORMULA DES-PT-01a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.027sec
checking: AG [[~ [~ [p85<=p57]] & [p41<=p97 | [p101<=p86 | 2<=p101]]]]
normalized: ~ [E [true U ~ [[p85<=p57 & [p41<=p97 | [p101<=p86 | 2<=p101]]]]]]
abstracting: (2<=p101) states: 0
abstracting: (p101<=p86) states: 108,549,535 (8)
abstracting: (p41<=p97) states: 108,546,790 (8)
abstracting: (p85<=p57) states: 62,385,249 (7)
-> the formula is FALSE
FORMULA DES-PT-01a-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.343sec
checking: EF [[p91<=p22 & [3<=p103 & [p81<=p31 | p72<=p102]]]]
normalized: E [true U [p91<=p22 & [3<=p103 & [p81<=p31 | p72<=p102]]]]
abstracting: (p72<=p102) states: 52,345,540 (7)
abstracting: (p81<=p31) states: 51,210,210 (7)
abstracting: (3<=p103) states: 0
abstracting: (p91<=p22) states: 56,374,092 (7)
-> the formula is FALSE
FORMULA DES-PT-01a-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.110sec
checking: EF [[[[2<=p93 | 3<=p100] | p72<=p0] & [[p33<=p47 & 1<=p16] & ~ [3<=p33]]]]
normalized: E [true U [[~ [3<=p33] & [p33<=p47 & 1<=p16]] & [p72<=p0 | [2<=p93 | 3<=p100]]]]
abstracting: (3<=p100) states: 0
abstracting: (2<=p93) states: 0
abstracting: (p72<=p0) states: 36,853,357 (7)
abstracting: (1<=p16) states: 108,580,355 (8)
abstracting: (p33<=p47) states: 78,094,170 (7)
abstracting: (3<=p33) states: 0
-> the formula is TRUE
FORMULA DES-PT-01a-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.447sec
checking: AG [[~ [[p38<=p80 | p12<=p63]] | [[p25<=p37 | 1<=p93] | [2<=p24 & p35<=p33]]]]
normalized: ~ [E [true U ~ [[[[2<=p24 & p35<=p33] | [p25<=p37 | 1<=p93]] | ~ [[p38<=p80 | p12<=p63]]]]]]
abstracting: (p12<=p63) states: 99,506,115 (7)
abstracting: (p38<=p80) states: 70,672,385 (7)
abstracting: (1<=p93) states: 544,180 (5)
abstracting: (p25<=p37) states: 73,091,104 (7)
abstracting: (p35<=p33) states: 108,579,152 (8)
abstracting: (2<=p24) states: 0
-> the formula is FALSE
FORMULA DES-PT-01a-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.026sec
checking: AG [[[~ [p78<=p35] & ~ [p90<=p90]] | [[2<=p45 | p91<=p21] | [3<=p75 | p44<=p83]]]]
normalized: ~ [E [true U ~ [[[[3<=p75 | p44<=p83] | [2<=p45 | p91<=p21]] | [~ [p90<=p90] & ~ [p78<=p35]]]]]]
abstracting: (p78<=p35) states: 73,999,512 (7)
abstracting: (p90<=p90) states: 108,580,356 (8)
abstracting: (p91<=p21) states: 51,684,312 (7)
abstracting: (2<=p45) states: 0
abstracting: (p44<=p83) states: 83,048,464 (7)
abstracting: (3<=p75) states: 0
-> the formula is FALSE
FORMULA DES-PT-01a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.709sec
Total processing time: 0m13.444sec
BK_STOP 1464792719382
--------------------
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.001sec
15793
iterations count:1792 (23), effective:197 (2)
initing FirstDep: 0m 0.000sec
iterations count:926 (12), effective:96 (1)
35517
iterations count:1102 (14), effective:108 (1)
iterations count:992 (13), effective:105 (1)
29187
iterations count:1064 (14), effective:113 (1)
30538
iterations count:1358 (17), effective:146 (1)
26527
iterations count:1098 (14), effective:116 (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="DES-PT-01a"
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/DES-PT-01a.tgz
mv DES-PT-01a 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 DES-PT-01a, 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 r221su-smll-146468026700025"
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 ;