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-r0010w0100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r092kn-qhx2-143267650200061
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432978132750

Model: RwMutex-PT-r0010w0100
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: 230 NrTr: 220 NrArc: 2460)

net check time: 0m0sec

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

init dd package: 0m12sec


RS generation: 0m0sec


-> reachability set: #nodes 46097 (4.6e+04) #states 1,124 (3)



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

checking: EF [[3<=p29 & ~ [p49<=p176]]]
normalized: E [true U [3<=p29 & ~ [p49<=p176]]]

abstracting: (p49<=p176) states: 2
abstracting: (3<=p29) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[[[p167<=p15 | p62<=p141] | [1<=p65 | p213<=p162]] | p122<=p99]]
normalized: ~ [E [true U ~ [[p122<=p99 | [[1<=p65 | p213<=p162] | [p167<=p15 | p62<=p141]]]]]]

abstracting: (p62<=p141) states: 2
abstracting: (p167<=p15) states: 1,124 (3)
abstracting: (p213<=p162) states: 1,123 (3)
abstracting: (1<=p65) states: 1,123 (3)
abstracting: (p122<=p99) states: 1,124 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [[[p30<=p65 & [1<=p60 & p215<=p212]] | ~ [[3<=p129 | 2<=p115]]]]
normalized: ~ [E [true U ~ [[[p30<=p65 & [1<=p60 & p215<=p212]] | ~ [[3<=p129 | 2<=p115]]]]]]

abstracting: (2<=p115) states: 0
abstracting: (3<=p129) states: 0
abstracting: (p215<=p212) states: 1,123 (3)
abstracting: (1<=p60) states: 1,123 (3)
abstracting: (p30<=p65) states: 1,123 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [~ [p179<=p74]]
normalized: E [true U ~ [p179<=p74]]

abstracting: (p179<=p74) states: 1,124 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [p161<=p44]
normalized: ~ [E [true U ~ [p161<=p44]]]

abstracting: (p161<=p44) states: 1,124 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0100-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA RwMutex-PT-r0010w0100-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[2<=p153 & p136<=p39] & ~ [2<=p186]] | p108<=p108]]
normalized: ~ [E [true U ~ [[p108<=p108 | [~ [2<=p186] & [2<=p153 & p136<=p39]]]]]]

abstracting: (p136<=p39) states: 1,124 (3)
abstracting: (2<=p153) states: 0
abstracting: (2<=p186) states: 0
abstracting: (p108<=p108) states: 1,124 (3)
-> the formula is TRUE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: AG [[~ [~ [p158<=p111]] & [[p169<=p151 | p65<=p137] | ~ [2<=p193]]]]
normalized: ~ [E [true U ~ [[p158<=p111 & [~ [2<=p193] | [p169<=p151 | p65<=p137]]]]]]

abstracting: (p65<=p137) states: 2
abstracting: (p169<=p151) states: 1,123 (3)
abstracting: (2<=p193) states: 0
abstracting: (p158<=p111) states: 1,124 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0100-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: EF [[[[3<=p183 | 2<=p162] & [1<=p196 & 2<=p180]] & [p2<=p29 & 2<=p179]]]
normalized: E [true U [[[3<=p183 | 2<=p162] & [1<=p196 & 2<=p180]] & [p2<=p29 & 2<=p179]]]

abstracting: (2<=p179) states: 0
abstracting: (p2<=p29) states: 1,123 (3)
abstracting: (2<=p180) states: 0
abstracting: (1<=p196) states: 1
abstracting: (2<=p162) states: 0
abstracting: (3<=p183) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[2<=p21 & ~ [~ [2<=p187]]]]
normalized: E [true U [2<=p187 & 2<=p21]]

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

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

MC time: 0m0sec

checking: EF [[3<=p165 | [1<=p192 & [p18<=p174 & p141<=p217]]]]
normalized: E [true U [3<=p165 | [1<=p192 & [p18<=p174 & p141<=p217]]]]

abstracting: (p141<=p217) states: 1,123 (3)
abstracting: (p18<=p174) states: 2
abstracting: (1<=p192) states: 1
abstracting: (3<=p165) states: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0100-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[2<=p46 & ~ [~ [3<=p156]]]]
normalized: E [true U [2<=p46 & 3<=p156]]

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: AG [[[~ [2<=p90] | [p148<=p76 & p115<=p137]] | ~ [[p76<=p173 | 2<=p24]]]]
normalized: ~ [E [true U ~ [[~ [[p76<=p173 | 2<=p24]] | [[p148<=p76 & p115<=p137] | ~ [2<=p90]]]]]]

abstracting: (2<=p90) states: 0
abstracting: (p115<=p137) states: 612
abstracting: (p148<=p76) states: 1,124 (3)
abstracting: (2<=p24) states: 0
abstracting: (p76<=p173) states: 2
-> the formula is TRUE

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

MC time: 0m0sec


Total processing time: 0m19sec


BK_STOP 1432978152193

--------------------
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-r0010w0100"
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-r0010w0100.tgz
mv RwMutex-PT-r0010w0100 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-r0010w0100, 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-143267650200061"
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 ;