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 S_RwMutex-PT-r0010w0020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r274st-qhx2-143374441100035
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1434058663008

Model: S_RwMutex-PT-r0010w0020
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: 70 NrTr: 60 NrArc: 540)

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 12069 (1.2e+04) #states 1,044 (3)



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

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

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

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

MC time: 0m0sec

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

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

FORMULA RwMutex-PT-r0010w0020-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[~ [3<=p29] & ~ [2<=p62]] | [[2<=p59 & 2<=p14] | [1<=p42 & 2<=p35]]]]
normalized: ~ [E [true U ~ [[[[1<=p42 & 2<=p35] | [2<=p59 & 2<=p14]] | [~ [2<=p62] & ~ [3<=p29]]]]]]

abstracting: (3<=p29) states: 0
abstracting: (2<=p62) states: 0
abstracting: (2<=p14) states: 0
abstracting: (2<=p59) states: 0
abstracting: (2<=p35) states: 0
abstracting: (1<=p42) states: 512
-> the formula is TRUE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: AG [~ [[[p35<=p8 & 1<=p34] & [p14<=p21 & 1<=p66]]]]
normalized: ~ [E [true U [[p14<=p21 & 1<=p66] & [p35<=p8 & 1<=p34]]]]

abstracting: (1<=p34) states: 512
abstracting: (p35<=p8) states: 788
abstracting: (1<=p66) states: 1
abstracting: (p14<=p21) states: 1,043 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [[[~ [2<=p5] | [2<=p25 | p6<=p48]] | ~ [3<=p40]]]
normalized: ~ [E [true U ~ [[~ [3<=p40] | [[2<=p25 | p6<=p48] | ~ [2<=p5]]]]]]

abstracting: (2<=p5) states: 0
abstracting: (p6<=p48) states: 768
abstracting: (2<=p25) states: 0
abstracting: (3<=p40) states: 0
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0020-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [~ [[3<=p10 | 2<=p21]]]]
normalized: E [true U [3<=p10 | 2<=p21]]

abstracting: (2<=p21) states: 0
abstracting: (3<=p10) states: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0020-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: AG [~ [[~ [3<=p67] & [2<=p11 & 1<=p28]]]]
normalized: ~ [E [true U [[2<=p11 & 1<=p28] & ~ [3<=p67]]]]

abstracting: (3<=p67) states: 0
abstracting: (1<=p28) states: 1,043 (3)
abstracting: (2<=p11) states: 0
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0020-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: AG [[p4<=p49 | ~ [[p4<=p56 & 1<=p47]]]]
normalized: ~ [E [true U ~ [[p4<=p49 | ~ [[p4<=p56 & 1<=p47]]]]]]

abstracting: (1<=p47) states: 512
abstracting: (p4<=p56) states: 513
abstracting: (p4<=p49) states: 768
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0020-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[p44<=p19 | 3<=p63] | 1<=p56] | p66<=p40]]
normalized: ~ [E [true U ~ [[p66<=p40 | [1<=p56 | [p44<=p19 | 3<=p63]]]]]]

abstracting: (3<=p63) states: 0
abstracting: (p44<=p19) states: 1,044 (3)
abstracting: (1<=p56) states: 1
abstracting: (p66<=p40) states: 1,043 (3)
-> the formula is TRUE

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

MC time: 0m0sec

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

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

FORMULA RwMutex-PT-r0010w0020-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA RwMutex-PT-r0010w0020-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [[p60<=p54 & [2<=p13 & p66<=p46]]]]
normalized: ~ [E [true U [p60<=p54 & [2<=p13 & p66<=p46]]]]

abstracting: (p66<=p46) states: 1,043 (3)
abstracting: (2<=p13) states: 0
abstracting: (p60<=p54) states: 1,043 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0020-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m18sec


BK_STOP 1434058681412

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


iterations count:866 (14), effective:30 (0)

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="S_RwMutex-PT-r0010w0020"
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/S_RwMutex-PT-r0010w0020.tgz
mv S_RwMutex-PT-r0010w0020 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 S_RwMutex-PT-r0010w0020, 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 r274st-qhx2-143374441100035"
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 ;