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 S_Parking-PT-208, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444131101177
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464953540057


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: Parking_PT_208
(NrP: 137 NrTr: 201 NrArc: 593)

net check time: 0m 0.000sec

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

init dd package: 0m 3.731sec


RS generation: 0m 0.177sec


-> reachability set: #nodes 700 (7.0e+02) #states 4,567,597,057 (9)



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

checking: EF [3<=p56]
normalized: E [true U 3<=p56]

abstracting: (3<=p56) states: 0
-> the formula is FALSE

FORMULA Parking-PT-208-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Parking-PT-208-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [3<=p15]
normalized: E [true U 3<=p15]

abstracting: (3<=p15) states: 0
-> the formula is FALSE

FORMULA Parking-PT-208-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [3<=p32]
normalized: E [true U 3<=p32]

abstracting: (3<=p32) states: 0
-> the formula is FALSE

FORMULA Parking-PT-208-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [1<=p58]
normalized: E [true U 1<=p58]

abstracting: (1<=p58) states: 138,412,032 (8)
-> the formula is TRUE

FORMULA Parking-PT-208-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.417sec

checking: AG [p29<=p10]
normalized: ~ [E [true U ~ [p29<=p10]]]

abstracting: (p29<=p10) states: 4,515,692,545 (9)
-> the formula is FALSE

FORMULA Parking-PT-208-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.891sec

checking: EF [~ [[~ [2<=p68] | p1<=p83]]]
normalized: E [true U ~ [[p1<=p83 | ~ [2<=p68]]]]

abstracting: (2<=p68) states: 0
abstracting: (p1<=p83) states: 3,425,697,793 (9)
-> the formula is FALSE

FORMULA Parking-PT-208-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[2<=p111 & [~ [1<=p124] & [1<=p105 & 3<=p69]]]]
normalized: E [true U [2<=p111 & [[1<=p105 & 3<=p69] & ~ [1<=p124]]]]

abstracting: (1<=p124) states: 138,412,032 (8)
abstracting: (3<=p69) states: 0
abstracting: (1<=p105) states: 69,206,016 (7)
abstracting: (2<=p111) states: 0
-> the formula is FALSE

FORMULA Parking-PT-208-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[[2<=p86 & 3<=p60] | ~ [3<=p29]] & 3<=p15]]
normalized: E [true U [3<=p15 & [[2<=p86 & 3<=p60] | ~ [3<=p29]]]]

abstracting: (3<=p29) states: 0
abstracting: (3<=p60) states: 0
abstracting: (2<=p86) states: 0
abstracting: (3<=p15) states: 0
-> the formula is FALSE

FORMULA Parking-PT-208-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[1<=p123 | ~ [p46<=p24]] & [~ [2<=p92] | ~ [1<=p37]]]]
normalized: E [true U [[~ [1<=p37] | ~ [2<=p92]] & [1<=p123 | ~ [p46<=p24]]]]

abstracting: (p46<=p24) states: 4,463,788,033 (9)
abstracting: (1<=p123) states: 138,412,032 (8)
abstracting: (2<=p92) states: 0
abstracting: (1<=p37) states: 103,809,024 (8)
-> the formula is TRUE

FORMULA Parking-PT-208-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.794sec

checking: EF [[[[1<=p45 | 1<=p52] & 3<=p93] | [[2<=p96 | 1<=p92] & ~ [p50<=p90]]]]
normalized: E [true U [[~ [p50<=p90] & [2<=p96 | 1<=p92]] | [3<=p93 & [1<=p45 | 1<=p52]]]]

abstracting: (1<=p52) states: 3,875,536,896 (9)
abstracting: (1<=p45) states: 103,809,024 (8)
abstracting: (3<=p93) states: 0
abstracting: (1<=p92) states: 138,412,032 (8)
abstracting: (2<=p96) states: 0
abstracting: (p50<=p90) states: 4,432,330,753 (9)
-> the formula is TRUE

FORMULA Parking-PT-208-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.814sec

checking: EF [[3<=p95 & [[p74<=p19 | 3<=p65] | [1<=p105 | p127<=p4]]]]
normalized: E [true U [3<=p95 & [[p74<=p19 | 3<=p65] | [1<=p105 | p127<=p4]]]]

abstracting: (p127<=p4) states: 4,498,391,041 (9)
abstracting: (1<=p105) states: 69,206,016 (7)
abstracting: (3<=p65) states: 0
abstracting: (p74<=p19) states: 3,425,697,793 (9)
abstracting: (3<=p95) states: 0
-> the formula is FALSE

FORMULA Parking-PT-208-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[[[p45<=p97 & 1<=p30] | [p8<=p35 | 2<=p131]] | ~ [[3<=p13 & 1<=p9]]]]
normalized: ~ [E [true U ~ [[~ [[3<=p13 & 1<=p9]] | [[p8<=p35 | 2<=p131] | [p45<=p97 & 1<=p30]]]]]]

abstracting: (1<=p30) states: 103,809,024 (8)
abstracting: (p45<=p97) states: 4,466,147,329 (9)
abstracting: (2<=p131) states: 0
abstracting: (p8<=p35) states: 2,353,004,545 (9)
abstracting: (1<=p9) states: 2,283,798,528 (9)
abstracting: (3<=p13) states: 0
-> the formula is TRUE

FORMULA Parking-PT-208-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[2<=p78 | [p55<=p67 | p28<=p125]] & [[1<=p37 & 3<=p98] & 3<=p69]]]
normalized: E [true U [[3<=p69 & [1<=p37 & 3<=p98]] & [2<=p78 | [p55<=p67 | p28<=p125]]]]

abstracting: (p28<=p125) states: 876,609,537 (8)
abstracting: (p55<=p67) states: 4,463,788,033 (9)
abstracting: (2<=p78) states: 0
abstracting: (3<=p98) states: 0
abstracting: (1<=p37) states: 103,809,024 (8)
abstracting: (3<=p69) states: 0
-> the formula is FALSE

FORMULA Parking-PT-208-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[[[1<=p106 & p43<=p1] | [p119<=p74 & p34<=p115]] | [[2<=p66 | p124<=p28] & ~ [2<=p21]]]]
normalized: ~ [E [true U ~ [[[[p119<=p74 & p34<=p115] | [1<=p106 & p43<=p1]] | [~ [2<=p21] & [2<=p66 | p124<=p28]]]]]]

abstracting: (p124<=p28) states: 4,544,528,385 (9)
abstracting: (2<=p66) states: 0
abstracting: (2<=p21) states: 0
abstracting: (p43<=p1) states: 4,498,391,041 (9)
abstracting: (1<=p106) states: 69,206,016 (7)
abstracting: (p34<=p115) states: 4,431,282,177 (9)
abstracting: (p119<=p74) states: 4,498,391,041 (9)
-> the formula is TRUE

FORMULA Parking-PT-208-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[[[p69<=p90 & 3<=p33] & [p77<=p33 | p72<=p12]] | [[p94<=p45 | p119<=p65] & [p69<=p129 | p60<=p56]]]]
normalized: ~ [E [true U ~ [[[[p69<=p129 | p60<=p56] & [p94<=p45 | p119<=p65]] | [[p77<=p33 | p72<=p12] & [p69<=p90 & 3<=p33]]]]]]

abstracting: (3<=p33) states: 0
abstracting: (p69<=p90) states: 3,214,934,017 (9)
abstracting: (p72<=p12) states: 3,425,697,793 (9)
abstracting: (p77<=p33) states: 2,318,401,537 (9)
abstracting: (p119<=p65) states: 4,433,379,329 (9)
abstracting: (p94<=p45) states: 847,773,697 (8)
abstracting: (p60<=p56) states: 4,429,185,025 (9)
abstracting: (p69<=p129) states: 3,225,419,777 (9)
-> the formula is FALSE

FORMULA Parking-PT-208-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.014sec


Total processing time: 0m25.461sec


BK_STOP 1464953565561

--------------------
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.002sec

407 557 709
iterations count:3945 (19), effective:198 (0)

initing FirstDep: 0m 0.000sec

876 3637
iterations count:2978 (14), effective:117 (0)
768 2342 2436 4253 8053 7922 7657
iterations count:7170 (35), effective:330 (1)
1138 2738 4453 5085 8814
iterations count:5339 (26), effective:206 (1)
678 1209 6842 6990 7093 11411 11576 11492 11387 12359 12533 12350 11362
iterations count:13166 (65), effective:590 (2)
1099 9433 9771 10718 11039
iterations count:5407 (26), effective:229 (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="S_Parking-PT-208"
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/S_Parking-PT-208.tgz
mv S_Parking-PT-208 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 S_Parking-PT-208, 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 r185kn-smll-146444131101177"
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 '' ReachabilityCardinality.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 ;