About the Execution of Marcie for DES-PT-00a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5673.510 | 20341.00 | 20029.00 | 30.30 | TTTFFFFFFFFFFTFT | 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-00a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468026600007
=====================================================================
--------------------
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-00a-ReachabilityCardinality-0
FORMULA_NAME DES-PT-00a-ReachabilityCardinality-1
FORMULA_NAME DES-PT-00a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-00a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-00a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-00a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-00a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-00a-ReachabilityCardinality-15
FORMULA_NAME DES-PT-00a-ReachabilityCardinality-2
FORMULA_NAME DES-PT-00a-ReachabilityCardinality-3
FORMULA_NAME DES-PT-00a-ReachabilityCardinality-4
FORMULA_NAME DES-PT-00a-ReachabilityCardinality-5
FORMULA_NAME DES-PT-00a-ReachabilityCardinality-6
FORMULA_NAME DES-PT-00a-ReachabilityCardinality-7
FORMULA_NAME DES-PT-00a-ReachabilityCardinality-8
FORMULA_NAME DES-PT-00a-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1464784964720
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_00a
(NrP: 115 NrTr: 76 NrArc: 373)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
init dd package: 0m 4.178sec
RS generation: 0m 5.563sec
-> reachability set: #nodes 7956 (8.0e+03) #states 24,196,956,529 (10)
starting MCC model checker
--------------------------
checking: EF [2<=p94]
normalized: E [true U 2<=p94]
abstracting: (2<=p94) states: 0
-> the formula is FALSE
FORMULA DES-PT-00a-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [1<=p41]
normalized: E [true U 1<=p41]
abstracting: (1<=p41) states: 8,951,891,280 (9)
-> the formula is TRUE
FORMULA DES-PT-00a-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.581sec
checking: EF [2<=p21]
normalized: E [true U 2<=p21]
abstracting: (2<=p21) states: 0
-> the formula is FALSE
FORMULA DES-PT-00a-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EF [~ [p20<=p56]]
normalized: E [true U ~ [p20<=p56]]
abstracting: (p20<=p56) states: 22,436,015,873 (10)
-> the formula is TRUE
FORMULA DES-PT-00a-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.331sec
checking: EF [[[1<=p94 & 1<=p95] & 2<=p41]]
normalized: E [true U [2<=p41 & [1<=p94 & 1<=p95]]]
abstracting: (1<=p95) states: 450,248,832 (8)
abstracting: (1<=p94) states: 2,557,419,168 (9)
abstracting: (2<=p41) states: 0
-> the formula is FALSE
FORMULA DES-PT-00a-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EF [[~ [p66<=p3] & 2<=p76]]
normalized: E [true U [2<=p76 & ~ [p66<=p3]]]
abstracting: (p66<=p3) states: 16,577,851,665 (10)
abstracting: (2<=p76) states: 0
-> the formula is FALSE
FORMULA DES-PT-00a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: EF [[2<=p6 & p13<=p109]]
normalized: E [true U [2<=p6 & p13<=p109]]
abstracting: (p13<=p109) states: 13,293,511,537 (10)
abstracting: (2<=p6) states: 0
-> the formula is FALSE
FORMULA DES-PT-00a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: EF [~ [[~ [2<=p94] & [3<=p44 | p37<=p77]]]]
normalized: E [true U ~ [[~ [2<=p94] & [3<=p44 | p37<=p77]]]]
abstracting: (p37<=p77) states: 23,442,979,921 (10)
abstracting: (3<=p44) states: 0
abstracting: (2<=p94) states: 0
-> the formula is TRUE
FORMULA DES-PT-00a-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.332sec
checking: AG [[p54<=p62 & p87<=p65]]
normalized: ~ [E [true U ~ [[p54<=p62 & p87<=p65]]]]
abstracting: (p87<=p65) states: 14,821,653,361 (10)
abstracting: (p54<=p62) states: 18,779,016,049 (10)
-> the formula is FALSE
FORMULA DES-PT-00a-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.510sec
checking: AG [[~ [[p43<=p45 & 1<=p99]] | 2<=p89]]
normalized: ~ [E [true U ~ [[2<=p89 | ~ [[p43<=p45 & 1<=p99]]]]]]
abstracting: (1<=p99) states: 5,549,265,552 (9)
abstracting: (p43<=p45) states: 18,779,016,049 (10)
abstracting: (2<=p89) states: 0
-> the formula is FALSE
FORMULA DES-PT-00a-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.976sec
checking: AG [[~ [2<=p109] & [[2<=p63 & 3<=p2] | p82<=p84]]]
normalized: ~ [E [true U ~ [[[p82<=p84 | [2<=p63 & 3<=p2]] & ~ [2<=p109]]]]]
abstracting: (2<=p109) states: 0
abstracting: (3<=p2) states: 0
abstracting: (2<=p63) states: 0
abstracting: (p82<=p84) states: 19,208,497,009 (10)
-> the formula is FALSE
FORMULA DES-PT-00a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.086sec
checking: EF [[[~ [1<=p83] & ~ [p41<=p86]] & ~ [[2<=p84 & p28<=p49]]]]
normalized: E [true U [[~ [1<=p83] & ~ [p41<=p86]] & ~ [[2<=p84 & p28<=p49]]]]
abstracting: (p28<=p49) states: 16,572,661,057 (10)
abstracting: (2<=p84) states: 0
abstracting: (p41<=p86) states: 18,348,995,617 (10)
abstracting: (1<=p83) states: 14,363,762,688 (10)
-> the formula is TRUE
FORMULA DES-PT-00a-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.145sec
checking: AG [[[[p74<=p35 | p101<=p64] & ~ [2<=p26]] & ~ [[p25<=p14 & 3<=p97]]]]
normalized: ~ [E [true U ~ [[~ [[p25<=p14 & 3<=p97]] & [~ [2<=p26] & [p74<=p35 | p101<=p64]]]]]]
abstracting: (p101<=p64) states: 23,794,506,481 (10)
abstracting: (p74<=p35) states: 21,591,872,113 (10)
abstracting: (2<=p26) states: 0
abstracting: (3<=p97) states: 0
abstracting: (p25<=p14) states: 21,259,872,625 (10)
-> the formula is FALSE
FORMULA DES-PT-00a-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.632sec
checking: EF [[[3<=p54 & [p42<=p104 | 1<=p110]] & [[3<=p88 | 1<=p110] | p39<=p77]]]
normalized: E [true U [[p39<=p77 | [3<=p88 | 1<=p110]] & [3<=p54 & [p42<=p104 | 1<=p110]]]]
abstracting: (1<=p110) states: 4,168,866,672 (9)
abstracting: (p42<=p104) states: 10,480,678,945 (10)
abstracting: (3<=p54) states: 0
abstracting: (1<=p110) states: 4,168,866,672 (9)
abstracting: (3<=p88) states: 0
abstracting: (p39<=p77) states: 17,878,510,321 (10)
-> the formula is FALSE
FORMULA DES-PT-00a-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: EF [[[[p55<=p98 | p61<=p63] & [3<=p109 & p21<=p27]] & ~ [[2<=p26 & 1<=p55]]]]
normalized: E [true U [~ [[2<=p26 & 1<=p55]] & [[3<=p109 & p21<=p27] & [p55<=p98 | p61<=p63]]]]
abstracting: (p61<=p63) states: 18,779,016,049 (10)
abstracting: (p55<=p98) states: 18,049,469,329 (10)
abstracting: (p21<=p27) states: 22,361,279,089 (10)
abstracting: (3<=p109) states: 0
abstracting: (1<=p55) states: 8,951,891,280 (9)
abstracting: (2<=p26) states: 0
-> the formula is FALSE
FORMULA DES-PT-00a-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: AG [[[[p97<=p91 & p43<=p60] | [p77<=p21 | p80<=p59]] | ~ [[3<=p71 & 3<=p36]]]]
normalized: ~ [E [true U ~ [[[[p77<=p21 | p80<=p59] | [p97<=p91 & p43<=p60]] | ~ [[3<=p71 & 3<=p36]]]]]]
abstracting: (3<=p36) states: 0
abstracting: (3<=p71) states: 0
abstracting: (p43<=p60) states: 20,663,005,729 (10)
abstracting: (p97<=p91) states: 23,656,159,921 (10)
abstracting: (p80<=p59) states: 19,208,497,009 (10)
abstracting: (p77<=p21) states: 12,662,419,825 (10)
-> the formula is TRUE
FORMULA DES-PT-00a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.030sec
Total processing time: 0m20.296sec
BK_STOP 1464784985061
--------------------
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
8737 38929 24597 24465 20507 24423 18371 27713 21584 14739
iterations count:10891 (143), effective:1446 (19)
initing FirstDep: 0m 0.000sec
8744
iterations count:1432 (18), effective:162 (2)
25263 29266 29477 30106
iterations count:4119 (54), effective:506 (6)
8654
iterations count:1080 (14), effective:122 (1)
9287
iterations count:1719 (22), effective:218 (2)
15159
iterations count:1428 (18), effective:160 (2)
11824
iterations count:1902 (25), effective:233 (3)
8741
iterations count:1511 (19), effective:176 (2)
14562 16234 13780 19755
iterations count:4463 (58), effective:538 (7)
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-00a"
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-00a.tgz
mv DES-PT-00a 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-00a, 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-146468026600007"
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 ;