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

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

=== Now, execution of the tool begins

BK_START 1432978368145

Model: RwMutex-PT-r0010w1000
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=CTLCardinality.xml --memory=6 --suppress --rs-algorithm=2 --place-order=5

parse successfull
net created successfully

(NrP: 2030 NrTr: 2020 NrArc: 24060)

net check time: 0m0sec

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

init dd package: 0m11sec


RS generation: 0m47sec


-> reachability set: #nodes 425661 (4.3e+05) #states 2,024 (3)



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

checking: ~ [~ [EX [[2<=p1886 & 2<=p1065]]]]
normalized: EX [[2<=p1886 & 2<=p1065]]

abstracting: (2<=p1065) states: 0
abstracting: (2<=p1886) states: 0
.-> the formula is FALSE

FORMULA RwMutex-PT-r0010w1000-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AX [[EF [2<=p1991] | [[1<=p1775 | 3<=p802] | p1296<=p31]]]
normalized: ~ [EX [~ [[[p1296<=p31 | [1<=p1775 | 3<=p802]] | E [true U 2<=p1991]]]]]

abstracting: (2<=p1991) states: 0
abstracting: (3<=p802) states: 0
abstracting: (1<=p1775) states: 1
abstracting: (p1296<=p31) states: 2,024 (3)
.-> the formula is TRUE

FORMULA RwMutex-PT-r0010w1000-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [AG [[1<=p779 | ~ [2<=p1519]]] | ~ [p522<=p537]]
normalized: [~ [p522<=p537] | ~ [E [true U ~ [[1<=p779 | ~ [2<=p1519]]]]]]

abstracting: (2<=p1519) states: 0
abstracting: (1<=p779) states: 2,023 (3)
abstracting: (p522<=p537) states: 2,023 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w1000-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [AF [AX [2<=p1984]]]
normalized: EG [EX [~ [2<=p1984]]]

abstracting: (2<=p1984) states: 0
.
EG iterations: 0
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w1000-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [p844<=p1067 | EX [EX [3<=p1949]]]
normalized: [p844<=p1067 | EX [EX [3<=p1949]]]

abstracting: (3<=p1949) states: 0
..abstracting: (p844<=p1067) states: 2
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w1000-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [EF [[p1877<=p1218 | p832<=p1559]]]
normalized: EG [E [true U [p1877<=p1218 | p832<=p1559]]]

abstracting: (p832<=p1559) states: 2
abstracting: (p1877<=p1218) states: 2,023 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w1000-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m4sec

checking: EF [~ [~ [[2<=p249 | 2<=p429]]]]
normalized: E [true U [2<=p249 | 2<=p429]]

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

FORMULA RwMutex-PT-r0010w1000-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EX [EG [[1<=p1187 & 2<=p254]]]
normalized: EX [EG [[1<=p1187 & 2<=p254]]]

abstracting: (2<=p254) states: 0
abstracting: (1<=p1187) states: 1
.
EG iterations: 1
.-> the formula is FALSE

FORMULA RwMutex-PT-r0010w1000-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [EX [[3<=p404 | [3<=p1575 & p816<=p341]]]]
normalized: ~ [EX [[3<=p404 | [3<=p1575 & p816<=p341]]]]

abstracting: (p816<=p341) states: 2,023 (3)
abstracting: (3<=p1575) states: 0
abstracting: (3<=p404) states: 0
.-> the formula is TRUE

FORMULA RwMutex-PT-r0010w1000-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [~ [E [3<=p1635 U 2<=p131]] & [~ [EX [p1804<=p226]] | [~ [[p1391<=p923 & p103<=p65]] | EG [p2003<=p1192]]]]
normalized: [[~ [EX [p1804<=p226]] | [~ [[p1391<=p923 & p103<=p65]] | EG [p2003<=p1192]]] & ~ [E [3<=p1635 U 2<=p131]]]

abstracting: (2<=p131) states: 0
abstracting: (3<=p1635) states: 0
abstracting: (p2003<=p1192) states: 2,023 (3)
.
EG iterations: 1
abstracting: (p103<=p65) states: 2,023 (3)
abstracting: (p1391<=p923) states: 2,024 (3)
abstracting: (p1804<=p226) states: 2,024 (3)
.-> the formula is TRUE

FORMULA RwMutex-PT-r0010w1000-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: EX [E [2<=p1727 U 2<=p1801]]
normalized: EX [E [2<=p1727 U 2<=p1801]]

abstracting: (2<=p1801) states: 0
abstracting: (2<=p1727) states: 0
.-> the formula is FALSE

FORMULA RwMutex-PT-r0010w1000-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [[[[1<=p960 | p632<=p292] | [p1669<=p190 | 2<=p1458]] & EG [p1357<=p241]]]
normalized: EG [[EG [p1357<=p241] & [[1<=p960 | p632<=p292] | [p1669<=p190 | 2<=p1458]]]]

abstracting: (2<=p1458) states: 0
abstracting: (p1669<=p190) states: 2,024 (3)
abstracting: (p632<=p292) states: 2,023 (3)
abstracting: (1<=p960) states: 2,023 (3)
abstracting: (p1357<=p241) states: 2,024 (3)

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w1000-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[EX [[1<=p621 & 3<=p1115]] & [[p1642<=p1445 | p65<=p588] & [[p675<=p554 | 3<=p55] | [p1286<=p755 & p476<=p44]]]] & [~ [AX [2<=p1319]] & E [p1416<=p1695 U 3<=p1308]]]
normalized: [[E [p1416<=p1695 U 3<=p1308] & EX [~ [2<=p1319]]] & [EX [[1<=p621 & 3<=p1115]] & [[[p675<=p554 | 3<=p55] | [p1286<=p755 & p476<=p44]] & [p1642<=p1445 | p65<=p588]]]]

abstracting: (p65<=p588) states: 2,023 (3)
abstracting: (p1642<=p1445) states: 2,023 (3)
abstracting: (p476<=p44) states: 2,023 (3)
abstracting: (p1286<=p755) states: 2,024 (3)
abstracting: (3<=p55) states: 0
abstracting: (p675<=p554) states: 2,023 (3)
abstracting: (3<=p1115) states: 0
abstracting: (1<=p621) states: 2,023 (3)
.abstracting: (2<=p1319) states: 0
.abstracting: (3<=p1308) states: 0
abstracting: (p1416<=p1695) states: 2,023 (3)
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w1000-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m2sec

checking: [[p1606<=p191 | [[[3<=p1123 | p467<=p824] & [2<=p1367 & 3<=p890]] | p79<=p1379]] & EF [3<=p1741]]
normalized: [[p1606<=p191 | [p79<=p1379 | [[2<=p1367 & 3<=p890] & [3<=p1123 | p467<=p824]]]] & E [true U 3<=p1741]]

abstracting: (3<=p1741) states: 0
abstracting: (p467<=p824) states: 2,023 (3)
abstracting: (3<=p1123) states: 0
abstracting: (3<=p890) states: 0
abstracting: (2<=p1367) states: 0
abstracting: (p79<=p1379) states: 2
abstracting: (p1606<=p191) states: 2,024 (3)
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w1000-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: AG [AF [~ [1<=p463]]]
normalized: ~ [E [true U EG [1<=p463]]]

abstracting: (1<=p463) states: 2,023 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w1000-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m3sec

checking: AX [[[[1<=p1389 | p627<=p399] & [1<=p1196 | 2<=p22]] | EF [p773<=p856]]]
normalized: ~ [EX [~ [[E [true U p773<=p856] | [[1<=p1196 | 2<=p22] & [1<=p1389 | p627<=p399]]]]]]

abstracting: (p627<=p399) states: 2,023 (3)
abstracting: (1<=p1389) states: 1
abstracting: (2<=p22) states: 0
abstracting: (1<=p1196) states: 1
abstracting: (p773<=p856) states: 2,023 (3)
.-> the formula is TRUE

FORMULA RwMutex-PT-r0010w1000-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec


Total processing time: 3m2sec


BK_STOP 1432978551054

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

425660 425661 425661
iterations count:3733 (1), effective:1 (0)
425661 425661
iterations count:2945 (1), effective:1 (0)
425660 425661 425661
iterations count:3731 (1), effective:1 (0)

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-r0010w1000"
export BK_EXAMINATION="CTLCardinality"
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-r0010w1000.tgz
mv RwMutex-PT-r0010w1000 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-r0010w1000, examination is CTLCardinality"
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-143267650200080"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;