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-10a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468026800075
=====================================================================

--------------------
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-10a-CTLCardinality-0
FORMULA_NAME DES-PT-10a-CTLCardinality-1
FORMULA_NAME DES-PT-10a-CTLCardinality-10
FORMULA_NAME DES-PT-10a-CTLCardinality-11
FORMULA_NAME DES-PT-10a-CTLCardinality-12
FORMULA_NAME DES-PT-10a-CTLCardinality-13
FORMULA_NAME DES-PT-10a-CTLCardinality-14
FORMULA_NAME DES-PT-10a-CTLCardinality-15
FORMULA_NAME DES-PT-10a-CTLCardinality-2
FORMULA_NAME DES-PT-10a-CTLCardinality-3
FORMULA_NAME DES-PT-10a-CTLCardinality-4
FORMULA_NAME DES-PT-10a-CTLCardinality-5
FORMULA_NAME DES-PT-10a-CTLCardinality-6
FORMULA_NAME DES-PT-10a-CTLCardinality-7
FORMULA_NAME DES-PT-10a-CTLCardinality-8
FORMULA_NAME DES-PT-10a-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1464821861124


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=CTLCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: DES_PT_10a
(NrP: 155 NrTr: 112 NrArc: 552)

net check time: 0m 0.000sec

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.003sec

init dd package: 0m 3.804sec


RS generation: 0m12.668sec


-> reachability set: #nodes 102633 (1.0e+05) #states 1,600,305,869,653 (12)



starting MCC model checker
--------------------------

checking: EG [~ [AF [2<=p11]]]
normalized: EG [EG [~ [2<=p11]]]

abstracting: (2<=p11) states: 0

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA DES-PT-10a-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.059sec

checking: EF [2<=p90]
normalized: E [true U 2<=p90]

abstracting: (2<=p90) states: 0
-> the formula is FALSE

FORMULA DES-PT-10a-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.059sec

checking: AF [1<=p5]
normalized: ~ [EG [~ [1<=p5]]]

abstracting: (1<=p5) states: 217,410,262,456 (11)
........................................................................................................................................................
before gc: list nodes free: 2311030

after gc: idd nodes used:423549, unused:63576451; list nodes free:299938755
................................
EG iterations: 184
-> the formula is FALSE

FORMULA DES-PT-10a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m18.422sec

checking: ~ [EG [EG [p2<=p144]]]
normalized: ~ [EG [EG [p2<=p144]]]

abstracting: (p2<=p144) states: 1,552,396,795,833 (12)
..............................................................................................................................................................
before gc: list nodes free: 680715

after gc: idd nodes used:204550, unused:63795450; list nodes free:301067907
................
EG iterations: 174
.
EG iterations: 1
-> the formula is FALSE

FORMULA DES-PT-10a-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m33.264sec

checking: A [~ [2<=p70] U EG [2<=p74]]
normalized: [~ [EG [~ [EG [2<=p74]]]] & ~ [E [~ [EG [2<=p74]] U [2<=p70 & ~ [EG [2<=p74]]]]]]

abstracting: (2<=p74) states: 0
.
EG iterations: 1
abstracting: (2<=p70) states: 0
abstracting: (2<=p74) states: 0
.
EG iterations: 1
abstracting: (2<=p74) states: 0
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA DES-PT-10a-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EG [p153<=p9]
normalized: EG [p153<=p9]

abstracting: (p153<=p9) states: 705,330,345,427 (11)
......................
before gc: list nodes free: 1218622

after gc: idd nodes used:1030304, unused:62969696; list nodes free:296770259
.......................
before gc: list nodes free: 733686

after gc: idd nodes used:543314, unused:63456686; list nodes free:299431143
....................................................................................
before gc: list nodes free: 9045055

after gc: idd nodes used:284588, unused:63715412; list nodes free:300688927
....................................................
EG iterations: 181
-> the formula is FALSE

FORMULA DES-PT-10a-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 10m 2.616sec

checking: E [AF [3<=p84] U AG [2<=p138]]
normalized: E [~ [EG [~ [3<=p84]]] U ~ [E [true U ~ [2<=p138]]]]

abstracting: (2<=p138) states: 0
abstracting: (3<=p84) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA DES-PT-10a-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.762sec

checking: ~ [[AF [3<=p46] | 3<=p104]]
normalized: ~ [[3<=p104 | ~ [EG [~ [3<=p46]]]]]

abstracting: (3<=p46) states: 0

EG iterations: 0
abstracting: (3<=p104) states: 0
-> the formula is TRUE

FORMULA DES-PT-10a-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.110sec

checking: EF [EX [[1<=p84 & 3<=p41]]]
normalized: E [true U EX [[1<=p84 & 3<=p41]]]

abstracting: (3<=p41) states: 0
abstracting: (1<=p84) states: 1,012,857,873,224 (12)
.-> the formula is FALSE

FORMULA DES-PT-10a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.288sec

checking: AG [AF [[2<=p29 | p70<=p66]]]
normalized: ~ [E [true U EG [~ [[2<=p29 | p70<=p66]]]]]

abstracting: (p70<=p66) states: 1,171,741,225,219 (12)
abstracting: (2<=p29) states: 0
...............................
before gc: list nodes free: 11122623

after gc: idd nodes used:604768, unused:63395232; list nodes free:299123644
........................................
before gc: list nodes free: 10541860

after gc: idd nodes used:630733, unused:63369267; list nodes free:299023293
...............................................
before gc: list nodes free: 12625016

after gc: idd nodes used:573327, unused:63426673; list nodes free:299369655
..................................................................................................
EG iterations: 216

before gc: list nodes free: 14977553

after gc: idd nodes used:276998, unused:63723002; list nodes free:300741054
-> the formula is FALSE

FORMULA DES-PT-10a-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 17m20.463sec

checking: EF [AG [[p72<=p26 & 2<=p65]]]
normalized: E [true U ~ [E [true U ~ [[p72<=p26 & 2<=p65]]]]]

abstracting: (2<=p65) states: 0
abstracting: (p72<=p26) states: 653,895,930,092 (11)
-> the formula is FALSE

FORMULA DES-PT-10a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.771sec

checking: EG [A [p38<=p95 U 2<=p35]]
normalized: EG [[~ [E [~ [2<=p35] U [~ [p38<=p95] & ~ [2<=p35]]]] & ~ [EG [~ [2<=p35]]]]]

abstracting: (2<=p35) states: 0

EG iterations: 0
abstracting: (2<=p35) states: 0
abstracting: (p38<=p95) states: 1,467,943,873,803 (12)
abstracting: (2<=p35) states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA DES-PT-10a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.075sec

checking: AG [E [p118<=p125 U p43<=p116]]
normalized: ~ [E [true U ~ [E [p118<=p125 U p43<=p116]]]]

abstracting: (p43<=p116) states: 1,065,343,827,915 (12)
abstracting: (p118<=p125) states: 1,398,213,077,956 (12)
-> the formula is FALSE

FORMULA DES-PT-10a-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m42.596sec

checking: AX [AG [[p93<=p9 | p6<=p109]]]
normalized: ~ [EX [E [true U ~ [[p93<=p9 | p6<=p109]]]]]

abstracting: (p6<=p109) states: 1,463,330,641,281 (12)
abstracting: (p93<=p9) states: 1,071,790,607,971 (12)
.-> the formula is FALSE

FORMULA DES-PT-10a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m40.000sec

checking: EF [[2<=p18 & [[3<=p39 | 1<=p91] & [1<=p52 | 3<=p48]]]]
normalized: E [true U [2<=p18 & [[1<=p52 | 3<=p48] & [3<=p39 | 1<=p91]]]]

abstracting: (1<=p91) states: 587,447,996,428 (11)
abstracting: (3<=p39) states: 0
abstracting: (3<=p48) states: 0
abstracting: (1<=p52) states: 1,600,305,869,652 (12)
abstracting: (2<=p18) states: 0
-> the formula is FALSE

FORMULA DES-PT-10a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.428sec

checking: A [[[1<=p42 & p81<=p53] & ~ [p154<=p129]] U EG [p133<=p104]]
normalized: [~ [EG [~ [EG [p133<=p104]]]] & ~ [E [~ [EG [p133<=p104]] U [~ [[~ [p154<=p129] & [1<=p42 & p81<=p53]]] & ~ [EG [p133<=p104]]]]]]

abstracting: (p133<=p104) states: 1,554,205,347,120 (12)
.......................................................
EG iterations: 55
abstracting: (p81<=p53) states: 1,325,109,029,573 (12)
abstracting: (1<=p42) states: 763,556,030,084 (11)
abstracting: (p154<=p129) states: 1,298,946,805,569 (12)
abstracting: (p133<=p104) states: 1,554,205,347,120 (12)
.......................................................
EG iterations: 55
abstracting: (p133<=p104) states: 1,554,205,347,120 (12)
.......................................................
EG iterations: 55
.
before gc: list nodes free: 6171873

after gc: idd nodes used:174570, unused:63825430; list nodes free:301210228
............................................................
EG iterations: 61
-> the formula is TRUE

FORMULA DES-PT-10a-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m 0.355sec


Total processing time: 40m45.954sec


BK_STOP 1464824307276

--------------------
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

9654 10510 10805 10721 10785 10791 10808 10758 10820 10815 10960 10869 10914 13543 23229 24319 29935 34099 34571 36350 57740 58069 66835 66321 65969 71098 72102 71399 79854 77126 76676 77581 80888 82172 85956 84677 86089 86971 85904 88783 90093 93698 92237 93309 94149 92455 94743 96192 99104 99856 98240 98527 96888 98263 99358 102088 105631 100809 99905 99113 100232 101284 103766 102129 102455 102302 102385 102967 101794 107354 104138 102489
iterations count:72986 (651), effective:8762 (78)

initing FirstDep: 0m 0.000sec


iterations count:112 (1), effective:0 (0)
91587 95169 96503 96677 96819 97261 96648 95384 85555 109024 128148 129543 132216 147905 147588 152162 153340 158945 162049 161529 166159 168244 164294 171222 172066 157537 171678 168925 166026 171904 168012 171914 171880 169897 172064 174052 172590 187804 189146 208745 210895 208928 209225 209496 208253 205688 201817 196934 193991 184707
iterations count:50576 (451), effective:6472 (57)

iterations count:112 (1), effective:0 (0)
88772 104448 104440 109721 103328
iterations count:5255 (46), effective:543 (4)
133119 127696 132866 127323
iterations count:4524 (40), effective:467 (4)
114718 124633 122829 106783 116897 115688 119609 109119
iterations count:8276 (73), effective:797 (7)
36852 36274 48450 49836 50432 60009 59600 62123 63025 69198 71509 70590 74918 74481 80393 79234 83560 86083 86535 108813 114655 116486
iterations count:22610 (201), effective:2320 (20)

iterations count:146 (1), effective:5 (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="DES-PT-10a"
export BK_EXAMINATION="CTLCardinality"
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-10a.tgz
mv DES-PT-10a 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-10a, 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 r221su-smll-146468026800075"
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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;