fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r113kn-smll-146373293000070
Last Updated
June 30, 2016

About the Execution of Marcie for RwMutex-PT-r0010w2000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6714.640 205719.00 205028.00 30.30 FTFFFFFTFFTTTTTF normal

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 RwMutex-PT-r0010w2000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r113kn-smll-146373293000070
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1463759419995


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: RwMutex_PT_r0010w2000
(NrP: 4030 NrTr: 4020 NrArc: 48060)

net check time: 0m 0.006sec

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

init dd package: 0m 3.868sec


RS generation: 1m10.293sec


-> reachability set: #nodes 614941 (6.1e+05) #states 3,024 (3)



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

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

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

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

MC time: 0m 0.017sec

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

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

FORMULA RwMutex-PT-r0010w2000-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

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

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

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

MC time: 0m 0.015sec

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

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

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

MC time: 0m 0.018sec

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

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

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

MC time: 0m 0.020sec

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

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

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

MC time: 0m 0.011sec

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

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

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

MC time: 0m 0.030sec

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

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

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

MC time: 0m 0.013sec

checking: AG [~ [~ [~ [1<=p3462]]]]
normalized: ~ [E [true U 1<=p3462]]

abstracting: (1<=p3462) states: 1
-> the formula is FALSE

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

MC time: 0m27.535sec

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

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

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

MC time: 0m 0.209sec

checking: AG [~ [~ [[p465<=p737 | 3<=p3764]]]]
normalized: ~ [E [true U ~ [[p465<=p737 | 3<=p3764]]]]

abstracting: (3<=p3764) states: 0
abstracting: (p465<=p737) states: 3,023 (3)
-> the formula is FALSE

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

MC time: 0m13.185sec

checking: AG [~ [[~ [1<=p1337] & [p1669<=p3480 & p1519<=p216]]]]
normalized: ~ [E [true U [[p1669<=p3480 & p1519<=p216] & ~ [1<=p1337]]]]

abstracting: (1<=p1337) states: 3,023 (3)
abstracting: (p1519<=p216) states: 3,023 (3)
abstracting: (p1669<=p3480) states: 2
-> the formula is TRUE

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

MC time: 0m 0.175sec

checking: AG [~ [[[3<=p983 & 3<=p472] & [p1996<=p959 | p1408<=p1923]]]]
normalized: ~ [E [true U [[p1996<=p959 | p1408<=p1923] & [3<=p983 & 3<=p472]]]]

abstracting: (3<=p472) states: 0
abstracting: (3<=p983) states: 0
abstracting: (p1408<=p1923) states: 3,023 (3)
abstracting: (p1996<=p959) states: 3,023 (3)
-> the formula is TRUE

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

MC time: 0m 0.064sec

checking: AG [[[p105<=p2649 & [2<=p2400 | p2379<=p714]] | p2313<=p1011]]
normalized: ~ [E [true U ~ [[p2313<=p1011 | [[2<=p2400 | p2379<=p714] & p105<=p2649]]]]]

abstracting: (p105<=p2649) states: 2
abstracting: (p2379<=p714) states: 3,024 (3)
abstracting: (2<=p2400) states: 0
abstracting: (p2313<=p1011) states: 3,024 (3)
-> the formula is TRUE

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

MC time: 0m 0.313sec

checking: AG [[~ [[p3103<=p1805 & p361<=p2801]] | [p3305<=p1604 | ~ [p187<=p917]]]]
normalized: ~ [E [true U ~ [[[~ [p187<=p917] | p3305<=p1604] | ~ [[p3103<=p1805 & p361<=p2801]]]]]]

abstracting: (p361<=p2801) states: 2
abstracting: (p3103<=p1805) states: 3,024 (3)
abstracting: (p3305<=p1604) states: 3,024 (3)
abstracting: (p187<=p917) states: 3,023 (3)
-> the formula is TRUE

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

MC time: 0m 0.254sec

checking: EF [[[[2<=p1618 & p2487<=p1702] | [3<=p2743 | 2<=p3726]] & [[p2812<=p1753 & p2475<=p3022] | [2<=p627 | 1<=p3944]]]]
normalized: E [true U [[[2<=p627 | 1<=p3944] | [p2812<=p1753 & p2475<=p3022]] & [[3<=p2743 | 2<=p3726] | [2<=p1618 & p2487<=p1702]]]]

abstracting: (p2487<=p1702) states: 3,024 (3)
abstracting: (2<=p1618) states: 0
abstracting: (2<=p3726) states: 0
abstracting: (3<=p2743) states: 0
abstracting: (p2475<=p3022) states: 3,023 (3)
abstracting: (p2812<=p1753) states: 3,024 (3)
abstracting: (1<=p3944) states: 1
abstracting: (2<=p627) states: 0
-> the formula is FALSE

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

MC time: 0m 0.114sec


Total processing time: 3m25.639sec


BK_STOP 1463759625714

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

......................

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-r0010w2000"
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/RwMutex-PT-r0010w2000.tgz
mv RwMutex-PT-r0010w2000 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 RwMutex-PT-r0010w2000, 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 r113kn-smll-146373293000070"
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 ;