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-2270
Executing tool marcie
Input is Parking-PT-104, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r232su-smll-143354324800139
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433637786258

Model: Parking-PT-104
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 65 NrTr: 97 NrArc: 284)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m3sec


RS generation: 0m0sec


-> reachability set: #nodes 444 (4.4e+02) #states 31,745 (4)



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

checking: AG [p28<=p40]
normalized: ~ [E [true U ~ [p28<=p40]]]

abstracting: (p28<=p40) states: 31,745 (4)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[~ [[3<=p54 & 1<=p19]] | ~ [p35<=p31]]]
normalized: ~ [E [true U ~ [[~ [[3<=p54 & 1<=p19]] | ~ [p35<=p31]]]]]

abstracting: (p35<=p31) states: 31,233 (4)
abstracting: (1<=p19) states: 768
abstracting: (3<=p54) states: 0
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [~ [~ [p25<=p16]]]]
normalized: E [true U ~ [p25<=p16]]

abstracting: (p25<=p16) states: 31,361 (4)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA Parking-PT-104-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [~ [~ [p27<=p1]]]]
normalized: E [true U ~ [p27<=p1]]

abstracting: (p27<=p1) states: 31,361 (4)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[[p2<=p0 | p57<=p37] & [1<=p37 & p37<=p37]] & [~ [p21<=p35] | [1<=p28 & p53<=p28]]]]
normalized: E [true U [[[1<=p28 & p53<=p28] | ~ [p21<=p35]] & [[p2<=p0 | p57<=p37] & [1<=p37 & p37<=p37]]]]

abstracting: (p37<=p37) states: 31,745 (4)
abstracting: (1<=p37) states: 512
abstracting: (p57<=p37) states: 30,721 (4)
abstracting: (p2<=p0) states: 15,873 (4)
abstracting: (p21<=p35) states: 31,233 (4)
abstracting: (p53<=p28) states: 30,721 (4)
abstracting: (1<=p28) states: 768
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [~ [[~ [2<=p42] | [p15<=p16 | 2<=p24]]]]
normalized: E [true U ~ [[[p15<=p16 | 2<=p24] | ~ [2<=p42]]]]

abstracting: (2<=p42) states: 0
abstracting: (2<=p24) states: 0
abstracting: (p15<=p16) states: 15,873 (4)
-> the formula is FALSE

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

MC time: 0m0sec

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

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

FORMULA Parking-PT-104-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [~ [[p20<=p37 | p7<=p26]]]]
normalized: ~ [E [true U ~ [[p20<=p37 | p7<=p26]]]]

abstracting: (p7<=p26) states: 16,257 (4)
abstracting: (p20<=p37) states: 30,977 (4)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [p51<=p21]
normalized: ~ [E [true U ~ [p51<=p21]]]

abstracting: (p51<=p21) states: 30,721 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[[1<=p41 | 2<=p15] | [3<=p26 & 1<=p3]] & ~ [[3<=p33 & 1<=p4]]]]
normalized: E [true U [~ [[3<=p33 & 1<=p4]] & [[3<=p26 & 1<=p3] | [1<=p41 | 2<=p15]]]]

abstracting: (2<=p15) states: 0
abstracting: (1<=p41) states: 768
abstracting: (1<=p3) states: 15,872 (4)
abstracting: (3<=p26) states: 0
abstracting: (1<=p4) states: 15,872 (4)
abstracting: (3<=p33) states: 0
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[p36<=p8 | 3<=p1] & p59<=p4] | p12<=p48]]
normalized: ~ [E [true U ~ [[p12<=p48 | [p59<=p4 & [p36<=p8 | 3<=p1]]]]]]

abstracting: (3<=p1) states: 0
abstracting: (p36<=p8) states: 31,489 (4)
abstracting: (p59<=p4) states: 31,233 (4)
abstracting: (p12<=p48) states: 29,185 (4)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (1<=p28) states: 768
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [~ [~ [3<=p1]]]]
normalized: ~ [E [true U 3<=p1]]

abstracting: (3<=p1) states: 0
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (p34<=p10) states: 31,361 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [[2<=p12 & [p34<=p10 | p64<=p25]]]]
normalized: ~ [E [true U [2<=p12 & [p34<=p10 | p64<=p25]]]]

abstracting: (p64<=p25) states: 22,273 (4)
abstracting: (p34<=p10) states: 31,361 (4)
abstracting: (2<=p12) states: 0
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m6sec


BK_STOP 1433637792847

--------------------
content from stderr:

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: 0m0sec

416
iterations count:1147 (11), effective:103 (1)

initing FirstDep: 0m0sec

567 919
iterations count:2607 (26), effective:182 (1)
603 977
iterations count:2647 (27), effective:181 (1)

iterations count:880 (9), effective:57 (0)
586 842
iterations count:2274 (23), effective:153 (1)
636 885
iterations count:2747 (28), effective:200 (2)

iterations count:882 (9), effective:56 (0)
622
iterations count:1454 (14), effective:98 (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="Parking-PT-104"
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/Parking-PT-104.tgz
mv Parking-PT-104 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is Parking-PT-104, 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 r232su-smll-143354324800139"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 ;