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 SwimmingPool-PT-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r125kn-qhx2-146373371400385
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464507803395


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: SwimmingPool_PT_03
(NrP: 9 NrTr: 7 NrArc: 20)

net check time: 0m 0.000sec

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

init dd package: 0m16.815sec


RS generation: 0m18.803sec


-> reachability set: #nodes 141394 (1.4e+05) #states 32,209,356 (7)



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

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

abstracting: (1<=Out) states: 30,701,728 (7)
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.179sec

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

abstracting: (1<=Bags) states: 31,968,636 (7)
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.595sec

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

abstracting: (2<=Out) states: 29,210,216 (7)
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.219sec

checking: EF [Out<=Dressed]
normalized: E [true U Out<=Dressed]

abstracting: (Out<=Dressed) states: 9,540,770 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.433sec

checking: AG [[~ [~ [2<=Dressed]] | ~ [~ [2<=Cabins]]]]
normalized: ~ [E [true U ~ [[2<=Dressed | 2<=Cabins]]]]

abstracting: (2<=Cabins) states: 27,036,688 (7)
abstracting: (2<=Dressed) states: 24,624,004 (7)
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.844sec

checking: EF [~ [~ [Cabins<=Undress]]]
normalized: E [true U Cabins<=Undress]

abstracting: (Cabins<=Undress) states: 14,034,660 (7)
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.612sec

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

abstracting: (Out<=Out) states: 32,209,356 (7)
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.814sec

checking: EF [[Bags<=Dress & ~ [~ [Entered<=Undress]]]]
normalized: E [true U [Bags<=Dress & Entered<=Undress]]

abstracting: (Entered<=Undress) states: 9,231,272 (6)
abstracting: (Bags<=Dress) states: 3,609,280 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m25.014sec

checking: AG [~ [[~ [Undress<=Out] & Dress<=Dressed]]]
normalized: ~ [E [true U [Dress<=Dressed & ~ [Undress<=Out]]]]

abstracting: (Undress<=Out) states: 24,346,584 (7)
abstracting: (Dress<=Dressed) states: 17,494,428 (7)
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m39.451sec

checking: AG [[~ [[2<=Bags & 2<=Entered]] | [[Dress<=Dress | 3<=InBath] | ~ [2<=InBath]]]]
normalized: ~ [E [true U ~ [[[~ [2<=InBath] | [Dress<=Dress | 3<=InBath]] | ~ [[2<=Bags & 2<=Entered]]]]]]

abstracting: (2<=Entered) states: 29,210,216 (7)
abstracting: (2<=Bags) states: 31,693,440 (7)
abstracting: (3<=InBath) states: 27,200,748 (7)
abstracting: (Dress<=Dress) states: 32,209,356 (7)
abstracting: (2<=InBath) states: 28,823,908 (7)
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.258sec

checking: AG [[[3<=InBath | [3<=Out | WaitBag<=Dressed]] | ~ [[2<=Bags | 3<=WaitBag]]]]
normalized: ~ [E [true U ~ [[~ [[2<=Bags | 3<=WaitBag]] | [3<=InBath | [3<=Out | WaitBag<=Dressed]]]]]]

abstracting: (WaitBag<=Dressed) states: 17,149,668 (7)
abstracting: (3<=Out) states: 27,737,115 (7)
abstracting: (3<=InBath) states: 27,200,748 (7)
abstracting: (3<=WaitBag) states: 21,379,036 (7)
abstracting: (2<=Bags) states: 31,693,440 (7)
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m37.338sec

checking: AG [[[~ [3<=WaitBag] | [Undress<=Out & 1<=Cabins]] & Undress<=Cabins]]
normalized: ~ [E [true U ~ [[Undress<=Cabins & [~ [3<=WaitBag] | [Undress<=Out & 1<=Cabins]]]]]]

abstracting: (1<=Cabins) states: 29,580,904 (7)
abstracting: (Undress<=Out) states: 24,346,584 (7)
abstracting: (3<=WaitBag) states: 21,379,036 (7)
abstracting: (Undress<=Cabins) states: 19,905,168 (7)
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m37.862sec

checking: AG [[[Out<=Out & Entered<=Bags] | ~ [Dressed<=Dress]]]
normalized: ~ [E [true U ~ [[~ [Dressed<=Dress] | [Out<=Out & Entered<=Bags]]]]]

abstracting: (Entered<=Bags) states: 25,961,924 (7)
abstracting: (Out<=Out) states: 32,209,356 (7)
abstracting: (Dressed<=Dress) states: 16,886,916 (7)
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.000sec

checking: EF [~ [[Dress<=Dress & [Undress<=WaitBag | Dressed<=Out]]]]
normalized: E [true U ~ [[Dress<=Dress & [Undress<=WaitBag | Dressed<=Out]]]]

abstracting: (Dressed<=Out) states: 23,975,868 (7)
abstracting: (Undress<=WaitBag) states: 17,494,428 (7)
abstracting: (Dress<=Dress) states: 32,209,356 (7)
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m27.706sec

checking: EF [[[[Dress<=WaitBag & 3<=Bags] & ~ [3<=Bags]] | ~ [[Cabins<=Out | Dressed<=InBath]]]]
normalized: E [true U [~ [[Cabins<=Out | Dressed<=InBath]] | [~ [3<=Bags] & [Dress<=WaitBag & 3<=Bags]]]]

abstracting: (3<=Bags) states: 31,381,878 (7)
abstracting: (Dress<=WaitBag) states: 17,494,428 (7)
abstracting: (3<=Bags) states: 31,381,878 (7)
abstracting: (Dressed<=InBath) states: 23,583,420 (7)
abstracting: (Cabins<=Out) states: 22,723,424 (7)
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m51.931sec

checking: EF [[[[WaitBag<=Dress | Undress<=InBath] & Out<=Entered] | [InBath<=Cabins & [Cabins<=InBath | Bags<=InBath]]]]
normalized: E [true U [[InBath<=Cabins & [Cabins<=InBath | Bags<=InBath]] | [Out<=Entered & [WaitBag<=Dress | Undress<=InBath]]]]

abstracting: (Undress<=InBath) states: 23,600,892 (7)
abstracting: (WaitBag<=Dress) states: 16,886,916 (7)
abstracting: (Out<=Entered) states: 16,483,800 (7)
abstracting: (Bags<=InBath) states: 9,504,768 (6)
abstracting: (Cabins<=InBath) states: 21,960,260 (7)
abstracting: (InBath<=Cabins) states: 11,686,752 (7)
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m10.896sec


Total processing time: 7m48.792sec


BK_STOP 1464508272574

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


initing FirstDep: 0m 0.002sec


iterations count:63 (9), effective:15 (2)

initing FirstDep: 0m 0.000sec


iterations count:13 (1), effective:1 (0)

iterations count:52 (7), effective:12 (1)

iterations count:13 (1), effective:1 (0)

iterations count:25 (3), effective:5 (0)

iterations count:25 (3), effective:6 (0)

iterations count:25 (3), effective:4 (0)

iterations count:53 (7), effective:13 (1)

iterations count:45 (6), effective:10 (1)

iterations count:324 (46), effective:123 (17)

iterations count:43 (6), effective:10 (1)

iterations count:30 (4), effective:8 (1)

iterations count:56 (8), effective:14 (2)

iterations count:88 (12), effective:26 (3)

iterations count:312 (44), effective:121 (17)

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="SwimmingPool-PT-03"
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/SwimmingPool-PT-03.tgz
mv SwimmingPool-PT-03 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 SwimmingPool-PT-03, 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 r125kn-qhx2-146373371400385"
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 ;