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-2265
Executing tool marcie
Input is RwMutex-PT-r0010w0050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r092kn-qhx2-143267650200048
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432978034061

Model: RwMutex-PT-r0010w0050
reachability algorithm:
Transition chaining algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=2 --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=2 --place-order=5

parse successfull
net created successfully

(NrP: 130 NrTr: 120 NrArc: 1260)

net check time: 0m0sec

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

init dd package: 0m14sec


RS generation: 0m0sec


-> reachability set: #nodes 24291 (2.4e+04) #states 1,074 (3)



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

checking: EF [[[~ [1<=p127] & [2<=p112 & p46<=p35]] & ~ [[p15<=p116 & p84<=p97]]]]
normalized: E [true U [[~ [1<=p127] & [2<=p112 & p46<=p35]] & ~ [[p15<=p116 & p84<=p97]]]]

abstracting: (p84<=p97) states: 1,073 (3)
abstracting: (p15<=p116) states: 2
abstracting: (p46<=p35) states: 1,073 (3)
abstracting: (2<=p112) states: 0
abstracting: (1<=p127) states: 1
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0050-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [2<=p95]]
normalized: ~ [E [true U 2<=p95]]

abstracting: (2<=p95) states: 0
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0050-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [~ [[1<=p51 | p101<=p48]]]]
normalized: ~ [E [true U ~ [[1<=p51 | p101<=p48]]]]

abstracting: (p101<=p48) states: 1,074 (3)
abstracting: (1<=p51) states: 1,073 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0050-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA RwMutex-PT-r0010w0050-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[~ [~ [2<=p115]] & [[3<=p6 & p108<=p59] | ~ [3<=p83]]]]
normalized: E [true U [2<=p115 & [~ [3<=p83] | [3<=p6 & p108<=p59]]]]

abstracting: (p108<=p59) states: 1,074 (3)
abstracting: (3<=p6) states: 0
abstracting: (3<=p83) states: 0
abstracting: (2<=p115) states: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0050-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (p82<=p34) states: 1,074 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0050-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA RwMutex-PT-r0010w0050-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[3<=p6 | p114<=p102] & ~ [2<=p43]] | [[p62<=p124 | 1<=p52] & [p24<=p52 | 3<=p88]]]]
normalized: ~ [E [true U ~ [[[[p62<=p124 | 1<=p52] & [p24<=p52 | 3<=p88]] | [~ [2<=p43] & [3<=p6 | p114<=p102]]]]]]

abstracting: (p114<=p102) states: 1,073 (3)
abstracting: (3<=p6) states: 0
abstracting: (2<=p43) states: 0
abstracting: (3<=p88) states: 0
abstracting: (p24<=p52) states: 1,073 (3)
abstracting: (1<=p52) states: 1,073 (3)
abstracting: (p62<=p124) states: 562
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0050-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA RwMutex-PT-r0010w0050-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[[3<=p27 & p53<=p101] & [p74<=p82 | 3<=p118]] | ~ [~ [2<=p80]]]]
normalized: E [true U [2<=p80 | [[3<=p27 & p53<=p101] & [p74<=p82 | 3<=p118]]]]

abstracting: (3<=p118) states: 0
abstracting: (p74<=p82) states: 562
abstracting: (p53<=p101) states: 2
abstracting: (3<=p27) states: 0
abstracting: (2<=p80) states: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0050-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA RwMutex-PT-r0010w0050-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA RwMutex-PT-r0010w0050-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [p86<=p55]
normalized: ~ [E [true U ~ [p86<=p55]]]

abstracting: (p86<=p55) states: 1,074 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0050-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[2<=p120 | p100<=p35] | 3<=p108]]
normalized: ~ [E [true U ~ [[3<=p108 | [2<=p120 | p100<=p35]]]]]

abstracting: (p100<=p35) states: 1,074 (3)
abstracting: (2<=p120) states: 0
abstracting: (3<=p108) states: 0
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0050-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[~ [1<=p77] | ~ [2<=p73]] | ~ [[3<=p57 & p37<=p9]]]]
normalized: ~ [E [true U ~ [[[~ [2<=p73] | ~ [1<=p77]] | ~ [[3<=p57 & p37<=p9]]]]]]

abstracting: (p37<=p9) states: 562
abstracting: (3<=p57) states: 0
abstracting: (1<=p77) states: 512
abstracting: (2<=p73) states: 0
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0050-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [[~ [2<=p13] & ~ [2<=p78]]]]
normalized: E [true U ~ [[~ [2<=p78] & ~ [2<=p13]]]]

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

FORMULA RwMutex-PT-r0010w0050-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m21sec


BK_STOP 1432978055285

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

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="RwMutex-PT-r0010w0050"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/fko/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/RwMutex-PT-r0010w0050.tgz
mv RwMutex-PT-r0010w0050 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is RwMutex-PT-r0010w0050, 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 r092kn-qhx2-143267650200048"
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 ;