About the Execution of MARCIE for DLCround-PT-05a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2209.280 | 5595.00 | 5020.00 | 20.20 | TTFFFTTTFTTFTTFF | 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-3254
Executing tool marcie
Input is DLCround-PT-05a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r171-csrt-149580951500241
=====================================================================
--------------------
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 DLCround-PT-05a-ReachabilityCardinality-0
FORMULA_NAME DLCround-PT-05a-ReachabilityCardinality-1
FORMULA_NAME DLCround-PT-05a-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-05a-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-05a-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-05a-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-05a-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-05a-ReachabilityCardinality-15
FORMULA_NAME DLCround-PT-05a-ReachabilityCardinality-2
FORMULA_NAME DLCround-PT-05a-ReachabilityCardinality-3
FORMULA_NAME DLCround-PT-05a-ReachabilityCardinality-4
FORMULA_NAME DLCround-PT-05a-ReachabilityCardinality-5
FORMULA_NAME DLCround-PT-05a-ReachabilityCardinality-6
FORMULA_NAME DLCround-PT-05a-ReachabilityCardinality-7
FORMULA_NAME DLCround-PT-05a-ReachabilityCardinality-8
FORMULA_NAME DLCround-PT-05a-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1495823132648
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie rev. 8852M (built: crohr on 2017-05-03)
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
parse successfull
net created successfully
Net: DLCround_PT_05a
(NrP: 167 NrTr: 1055 NrArc: 3985)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.018sec
net check time: 0m 0.000sec
init dd package: 0m 1.323sec
RS generation: 0m 1.085sec
-> reachability set: #nodes 19656 (2.0e+04) #states 2,401,000,001 (9)
starting MCC model checker
--------------------------
checking: EF [3<=p159]
normalized: E [true U 3<=p159]
abstracting: (3<=p159)
states: 0
-> the formula is FALSE
FORMULA DLCround-PT-05a-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: EF [3<=p160]
normalized: E [true U 3<=p160]
abstracting: (3<=p160)
states: 0
-> the formula is FALSE
FORMULA DLCround-PT-05a-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [2<=p134]
normalized: E [true U 2<=p134]
abstracting: (2<=p134)
states: 0
-> the formula is FALSE
FORMULA DLCround-PT-05a-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [~ [~ [p79<=p157]]]]
normalized: E [true U ~ [p79<=p157]]
abstracting: (p79<=p157)
states: 2,401,000,001 (9)
-> the formula is FALSE
FORMULA DLCround-PT-05a-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [p52<=p64]]
normalized: E [true U ~ [p52<=p64]]
abstracting: (p52<=p64)
states: 2,184,910,001 (9)
-> the formula is TRUE
FORMULA DLCround-PT-05a-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.691sec
checking: AG [p65<=p143]
normalized: ~ [E [true U ~ [p65<=p143]]]
abstracting: (p65<=p143)
states: 2,401,000,001 (9)
-> the formula is TRUE
FORMULA DLCround-PT-05a-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [p152<=p140]
normalized: ~ [E [true U ~ [p152<=p140]]]
abstracting: (p152<=p140)
states: 2,401,000,001 (9)
-> the formula is TRUE
FORMULA DLCround-PT-05a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [~ [~ [[1<=p82 | p21<=p92]]]]
normalized: ~ [E [true U ~ [[1<=p82 | p21<=p92]]]]
abstracting: (p21<=p92)
states: 2,401,000,001 (9)
abstracting: (1<=p82)
states: 240,100,000 (8)
-> the formula is TRUE
FORMULA DLCround-PT-05a-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[~ [[p40<=p84 | 3<=p84]] | ~ [~ [p90<=p94]]]]
normalized: ~ [E [true U ~ [[p90<=p94 | ~ [[p40<=p84 | 3<=p84]]]]]]
abstracting: (3<=p84)
states: 0
abstracting: (p40<=p84)
states: 2,184,910,001 (9)
abstracting: (p90<=p94)
states: 2,401,000,001 (9)
-> the formula is TRUE
FORMULA DLCround-PT-05a-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: AG [[p97<=p58 | [1<=p154 | [2<=p0 | 2<=p105]]]]
normalized: ~ [E [true U ~ [[p97<=p58 | [[2<=p0 | 2<=p105] | 1<=p154]]]]]
abstracting: (1<=p154)
states: 2,401,000,000 (9)
abstracting: (2<=p105)
states: 0
abstracting: (2<=p0)
states: 0
abstracting: (p97<=p58)
states: 240,100,001 (8)
-> the formula is TRUE
FORMULA DLCround-PT-05a-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: AG [[~ [~ [p104<=p123]] | [2<=p46 & [2<=p40 | p93<=p82]]]]
normalized: ~ [E [true U ~ [[p104<=p123 | [2<=p46 & [2<=p40 | p93<=p82]]]]]]
abstracting: (p93<=p82)
states: 240,100,001 (8)
abstracting: (2<=p40)
states: 0
abstracting: (2<=p46)
states: 0
abstracting: (p104<=p123)
states: 2,401,000,001 (9)
-> the formula is TRUE
FORMULA DLCround-PT-05a-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [[[~ [p129<=p115] & p5<=p166] | p121<=p113]]
normalized: ~ [E [true U ~ [[p121<=p113 | [p5<=p166 & ~ [p129<=p115]]]]]]
abstracting: (p129<=p115)
states: 2,401,000,001 (9)
abstracting: (p5<=p166)
states: 2,401,000,001 (9)
abstracting: (p121<=p113)
states: 2,401,000,001 (9)
-> the formula is TRUE
FORMULA DLCround-PT-05a-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: EF [[p117<=p25 & [[1<=p28 | 2<=p72] & [p90<=p2 & 3<=p63]]]]
normalized: E [true U [[[p90<=p2 & 3<=p63] & [1<=p28 | 2<=p72]] & p117<=p25]]
abstracting: (p117<=p25)
states: 343,000,001 (8)
abstracting: (2<=p72)
states: 0
abstracting: (1<=p28)
states: 343,000,000 (8)
abstracting: (3<=p63)
states: 0
abstracting: (p90<=p2)
states: 343,000,001 (8)
-> the formula is FALSE
FORMULA DLCround-PT-05a-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: AG [[[[1<=p57 | 3<=p57] & [p65<=p33 | 3<=p32]] | p54<=p60]]
normalized: ~ [E [true U ~ [[[[p65<=p33 | 3<=p32] & [1<=p57 | 3<=p57]] | p54<=p60]]]]
abstracting: (p54<=p60)
states: 2,184,910,001 (9)
abstracting: (3<=p57)
states: 0
abstracting: (1<=p57)
states: 240,100,000 (8)
abstracting: (3<=p32)
states: 0
abstracting: (p65<=p33)
states: 2,184,910,001 (9)
-> the formula is FALSE
FORMULA DLCround-PT-05a-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.252sec
checking: EF [[[[3<=p74 & 1<=p85] & [p111<=p153 | p36<=p111]] & p61<=p144]]
normalized: E [true U [[[p111<=p153 | p36<=p111] & [3<=p74 & 1<=p85]] & p61<=p144]]
abstracting: (p61<=p144)
states: 2,401,000,001 (9)
abstracting: (1<=p85)
states: 240,100,000 (8)
abstracting: (3<=p74)
states: 0
abstracting: (p36<=p111)
states: 2,401,000,001 (9)
abstracting: (p111<=p153)
states: 2,401,000,001 (9)
-> the formula is FALSE
FORMULA DLCround-PT-05a-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[[p133<=p140 & [1<=p25 & p127<=p113]] & [[1<=p158 | 1<=p12] & [1<=p72 | p147<=p84]]]]
normalized: E [true U [[p133<=p140 & [1<=p25 & p127<=p113]] & [[1<=p72 | p147<=p84] & [1<=p158 | 1<=p12]]]]
abstracting: (1<=p12)
states: 343,000,000 (8)
abstracting: (1<=p158)
states: 2,401,000,000 (9)
abstracting: (p147<=p84)
states: 240,100,001 (8)
abstracting: (1<=p72)
states: 240,100,000 (8)
abstracting: (p127<=p113)
states: 2,401,000,001 (9)
abstracting: (1<=p25)
states: 343,000,000 (8)
abstracting: (p133<=p140)
states: 2,401,000,001 (9)
-> the formula is TRUE
FORMULA DLCround-PT-05a-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.167sec
totally nodes used: 2036136(2.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3397552 13183701 16581253
used/not used/entry size/cache size: 11690356 55418508 16 1024MB
basic ops cache: hits/miss/sum: 728657 2523231 3251888
used/not used/entry size/cache size: 4102621 12674595 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 15016 54382 69398
used/not used/entry size/cache size: 53819 2043333 32 64MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 65096476
1 1988783
2 23462
3 143
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.564sec
BK_STOP 1495823138243
--------------------
content from stderr:
check for maximal unmarked siphon
ok
check for constant places
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.006sec
iterations count:26337 (24), effective:79 (0)
initing FirstDep: 0m 0.005sec
iterations count:4730 (4), effective:11 (0)
iterations count:3651 (3), effective:11 (0)
iterations count:6454 (6), effective:16 (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="DLCround-PT-05a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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/DLCround-PT-05a.tgz
mv DLCround-PT-05a execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is DLCround-PT-05a, 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 r171-csrt-149580951500241"
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 ;