About the Execution of MARCIE for S_UtahNoC-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4362.510 | 290629.00 | 290060.00 | 20.00 | FFTTTTTTFFFTFFFF | 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-3253
Executing tool marcie
Input is S_UtahNoC-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r151-ebro-149443454600372
=====================================================================
--------------------
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 UtahNoC-PT-none-CTLCardinality-0
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-1
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-10
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-11
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-12
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-13
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-14
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-15
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-2
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-3
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-4
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-5
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-6
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-7
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-8
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496690886000
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=CTLCardinality.xml --memory=6
parse successfull
net created successfully
Net: UtahNoC_PT_none
(NrP: 216 NrTr: 977 NrArc: 2905)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.027sec
net check time: 0m 0.001sec
init dd package: 0m 2.292sec
RS generation: 0m53.653sec
-> reachability set: #nodes 5673 (5.7e+03) #states 4,759,924,249 (9)
starting MCC model checker
--------------------------
checking: ~ [EG [AG [p33<=p166]]]
normalized: ~ [EG [~ [E [true U ~ [p33<=p166]]]]]
abstracting: (p33<=p166)
states: 4,653,782,137 (9)
after gc: zbdd nodes used:14492, unused:18735508.
EG iterations: 1
-> the formula is TRUE
FORMULA UtahNoC-PT-none-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m16.876sec
checking: EF [EF [[1<=p77 & 2<=p186]]]
normalized: E [true U E [true U [1<=p77 & 2<=p186]]]
abstracting: (2<=p186)
states: 0
abstracting: (1<=p77)
states: 109,998,216 (8)
-> the formula is FALSE
FORMULA UtahNoC-PT-none-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: EF [[1<=p8 & EG [1<=p174]]]
normalized: E [true U [1<=p8 & EG [1<=p174]]]
abstracting: (1<=p174)
states: 162,320,760 (8)
.
EG iterations: 1
abstracting: (1<=p8)
states: 111,545,928 (8)
-> the formula is TRUE
FORMULA UtahNoC-PT-none-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.950sec
checking: [p129<=p147 & EF [AF [2<=p28]]]
normalized: [p129<=p147 & E [true U ~ [EG [~ [2<=p28]]]]]
abstracting: (2<=p28)
states: 0
EG iterations: 0
abstracting: (p129<=p147)
states: 4,653,498,889 (9)
-> the formula is FALSE
FORMULA UtahNoC-PT-none-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: A [~ [~ [p114<=p44]] U AG [p42<=p61]]
normalized: [~ [EG [E [true U ~ [p42<=p61]]]] & ~ [E [E [true U ~ [p42<=p61]] U [~ [p114<=p44] & E [true U ~ [p42<=p61]]]]]]
abstracting: (p42<=p61)
states: 4,652,438,761 (9)
abstracting: (p114<=p44)
states: 4,652,448,301 (9)
abstracting: (p42<=p61)
states: 4,652,438,761 (9)
after gc: zbdd nodes used:25095, unused:37474905abstracting: (p42<=p61)
states: 4,652,438,761 (9)
EG iterations: 0
-> the formula is FALSE
FORMULA UtahNoC-PT-none-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m28.041sec
checking: [~ [AF [[1<=p42 | p27<=p56]]] | EF [AF [2<=p166]]]
normalized: [E [true U ~ [EG [~ [2<=p166]]]] | EG [~ [[1<=p42 | p27<=p56]]]]
abstracting: (p27<=p56)
states: 4,652,512,201 (9)
abstracting: (1<=p42)
states: 110,072,520 (8)
.
EG iterations: 1
abstracting: (2<=p166)
states: 0
EG iterations: 0
-> the formula is FALSE
FORMULA UtahNoC-PT-none-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.777sec
checking: [[1<=p58 | AG [[3<=p60 | 1<=p86]]] | AG [~ [3<=p21]]]
normalized: [[~ [E [true U ~ [[3<=p60 | 1<=p86]]]] | 1<=p58] | ~ [E [true U 3<=p21]]]
abstracting: (3<=p21)
states: 0
abstracting: (1<=p58)
states: 111,545,928 (8)
abstracting: (1<=p86)
states: 110,072,520 (8)
abstracting: (3<=p60)
states: 0
-> the formula is TRUE
FORMULA UtahNoC-PT-none-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.202sec
checking: ~ [[AG [[p23<=p188 | 1<=p31]] | 2<=p40]]
normalized: ~ [[2<=p40 | ~ [E [true U ~ [[p23<=p188 | 1<=p31]]]]]]
abstracting: (1<=p31)
states: 109,998,216 (8)
abstracting: (p23<=p188)
states: 4,653,757,369 (9)
abstracting: (2<=p40)
states: 0
-> the formula is TRUE
FORMULA UtahNoC-PT-none-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 9.967sec
checking: E [[~ [3<=p89] | [2<=p199 | p147<=p56]] U 3<=p56]
normalized: E [[[2<=p199 | p147<=p56] | ~ [3<=p89]] U 3<=p56]
abstracting: (3<=p56)
states: 0
abstracting: (3<=p89)
states: 0
abstracting: (p147<=p56)
states: 4,601,424,457 (9)
abstracting: (2<=p199)
states: 0
-> the formula is FALSE
FORMULA UtahNoC-PT-none-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: AG [[~ [1<=p185] | [[3<=p174 & 2<=p205] | ~ [p43<=p187]]]]
normalized: ~ [E [true U ~ [[[~ [p43<=p187] | [3<=p174 & 2<=p205]] | ~ [1<=p185]]]]]
abstracting: (1<=p185)
states: 162,320,760 (8)
abstracting: (2<=p205)
states: 0
abstracting: (3<=p174)
states: 0
abstracting: (p43<=p187)
states: 4,653,645,625 (9)
-> the formula is FALSE
FORMULA UtahNoC-PT-none-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m12.663sec
checking: E [p177<=p122 U [p1<=p171 & [1<=p206 | 1<=p107]]]
normalized: E [p177<=p122 U [p1<=p171 & [1<=p206 | 1<=p107]]]
abstracting: (1<=p107)
states: 109,998,216 (8)
abstracting: (1<=p206)
states: 199,803,585 (8)
abstracting: (p1<=p171)
states: 3,227,389,753 (9)
abstracting: (p177<=p122)
states: 4,601,459,593 (9)
-> the formula is TRUE
FORMULA UtahNoC-PT-none-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m13.094sec
checking: [E [[p108<=p150 | 3<=p132] U [2<=p6 | 1<=p44]] | 3<=p140]
normalized: [3<=p140 | E [[p108<=p150 | 3<=p132] U [2<=p6 | 1<=p44]]]
abstracting: (1<=p44)
states: 110,072,520 (8)
abstracting: (2<=p6)
states: 0
abstracting: (3<=p132)
states: 0
abstracting: (p108<=p150)
states: 4,653,782,137 (9)
after gc: zbdd nodes used:47588, unused:74952412abstracting: (3<=p140)
states: 0
-> the formula is TRUE
FORMULA UtahNoC-PT-none-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m15.874sec
checking: [AG [EX [p153<=p61]] | [1<=p3 & A [p159<=p70 U p128<=p33]]]
normalized: [[1<=p3 & [~ [EG [~ [p128<=p33]]] & ~ [E [~ [p128<=p33] U [~ [p159<=p70] & ~ [p128<=p33]]]]]] | ~ [E [true U ~ [EX [p153<=p61]]]]]
abstracting: (p153<=p61)
states: 4,598,364,169 (9)
.abstracting: (p128<=p33)
states: 4,652,373,997 (9)
abstracting: (p159<=p70)
states: 4,598,364,169 (9)
abstracting: (p128<=p33)
states: 4,652,373,997 (9)
abstracting: (p128<=p33)
states: 4,652,373,997 (9)
.
EG iterations: 1
abstracting: (1<=p3)
states: 1,586,641,416 (9)
-> the formula is TRUE
FORMULA UtahNoC-PT-none-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m43.490sec
checking: AG [[~ [[2<=p163 | 1<=p35]] & [[1<=p201 | p49<=p101] | [1<=p38 & p30<=p185]]]]
normalized: ~ [E [true U ~ [[[[1<=p38 & p30<=p185] | [1<=p201 | p49<=p101]] & ~ [[2<=p163 | 1<=p35]]]]]]
abstracting: (1<=p35)
states: 109,998,216 (8)
abstracting: (2<=p163)
states: 0
abstracting: (p49<=p101)
states: 4,650,982,057 (9)
abstracting: (1<=p201)
states: 195,874,497 (8)
abstracting: (p30<=p185)
states: 4,653,553,537 (9)
abstracting: (1<=p38)
states: 110,072,520 (8)
-> the formula is FALSE
FORMULA UtahNoC-PT-none-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m22.102sec
checking: [AG [[~ [1<=p140] & [2<=p154 | p75<=p140]]] & AG [[[p203<=p79 & p107<=p97] & ~ [1<=p204]]]]
normalized: [~ [E [true U ~ [[~ [1<=p204] & [p203<=p79 & p107<=p97]]]]] & ~ [E [true U ~ [[[2<=p154 | p75<=p140] & ~ [1<=p140]]]]]]
abstracting: (1<=p140)
states: 162,320,760 (8)
abstracting: (p75<=p140)
states: 4,653,719,929 (9)
abstracting: (2<=p154)
states: 0
abstracting: (p107<=p97)
states: 4,649,926,033 (9)
abstracting: (p203<=p79)
states: 4,568,627,995 (9)
abstracting: (1<=p204)
states: 199,803,585 (8)
after gc: zbdd nodes used:69368, unused:149930632-> the formula is FALSE
FORMULA UtahNoC-PT-none-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m 1.291sec
checking: [EF [~ [~ [p65<=p71]]] & [E [p91<=p132 U 3<=p19] | ~ [[[p198<=p127 & p74<=p138] & ~ [2<=p96]]]]]
normalized: [E [true U p65<=p71] & [~ [[[p198<=p127 & p74<=p138] & ~ [2<=p96]]] | E [p91<=p132 U 3<=p19]]]
abstracting: (3<=p19)
states: 0
abstracting: (p91<=p132)
states: 4,648,378,321 (9)
abstracting: (2<=p96)
states: 0
abstracting: (p74<=p138)
states: 4,653,757,369 (9)
abstracting: (p198<=p127)
states: 4,568,418,523 (9)
abstracting: (p65<=p71)
states: 4,649,926,033 (9)
-> the formula is FALSE
FORMULA UtahNoC-PT-none-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.761sec
totally nodes used: 145678790(1.5e+08)
number of garbage collections: 4
fire ops cache: hits/miss/sum: 262074724 296088625 558163349
used/not used/entry size/cache size: 7060638 60048226 16 1024MB
basic ops cache: hits/miss/sum: 261081353 343042779 604124132
used/not used/entry size/cache size: 11983124 4794092 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: 100013 103117 203130
used/not used/entry size/cache size: 12005 2085147 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 62096673
1 4819201
2 187943
3 4944
4 101
5 2
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 4m50.586sec
BK_STOP 1496691176629
--------------------
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.007sec
520 1557 3048 4432 4476 4806 4903 5432 4802 4917 3437 3608 3598 5079 5102 5538 4750 4046 4605 4614 5163 5023 7081 7948 7375 7917
iterations count:2659652 (2722), effective:29063 (29)
initing FirstDep: 0m 0.010sec
iterations count:23665 (24), effective:460 (0)
iterations count:22782 (23), effective:431 (0)
iterations count:12338 (12), effective:261 (0)
iterations count:12338 (12), effective:261 (0)
iterations count:19213 (19), effective:358 (0)
iterations count:12338 (12), effective:261 (0)
iterations count:1021 (1), effective:1 (0)
iterations count:17624 (18), effective:361 (0)
iterations count:39216 (40), effective:811 (0)
iterations count:31182 (31), effective:713 (0)
iterations count:13170 (13), effective:274 (0)
3431
iterations count:124530 (127), effective:3254 (3)
iterations count:17876 (18), effective:383 (0)
iterations count:43494 (44), effective:926 (0)
6430 6444
iterations count:238428 (244), effective:5449 (5)
iterations count:1007 (1), effective:1 (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_UtahNoC-PT-none"
export BK_EXAMINATION="CTLCardinality"
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/S_UtahNoC-PT-none.tgz
mv S_UtahNoC-PT-none execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool marcie"
echo " Input is S_UtahNoC-PT-none, 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 r151-ebro-149443454600372"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; 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 ;