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

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

=== Now, execution of the tool begins

BK_START 1465322704164


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=CTLCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: SwimmingPool_PT_01
(NrP: 9 NrTr: 7 NrArc: 20)

net check time: 0m 0.025sec

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

init dd package: 0m20.730sec


RS generation: 0m 0.233sec


-> reachability set: #nodes 6529 (6.5e+03) #states 89,621 (4)



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

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

abstracting: (3<=Dressed) states: 27,622 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.171sec

checking: ~ [EG [EF [Bags<=Dress]]]
normalized: ~ [EG [E [true U Bags<=Dress]]]

abstracting: (Bags<=Dress) states: 12,872 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.182sec

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

abstracting: (Cabins<=Bags) states: 80,471 (4)
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.324sec

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

abstracting: (Out<=Dress) states: 30,093 (4)
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.160sec

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

abstracting: (Entered<=Entered) states: 89,621 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (Cabins<=InBath) states: 62,594 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.126sec

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

abstracting: (1<=Undress) states: 61,536 (4)
abstracting: (Cabins<=Dressed) states: 43,351 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.378sec

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

abstracting: (3<=InBath) states: 53,585 (4)
abstracting: (3<=Dressed) states: 27,622 (4)
abstracting: (2<=Entered) states: 67,207 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.195sec

checking: EF [AG [[Bags<=Dressed & WaitBag<=InBath]]]
normalized: E [true U ~ [E [true U ~ [[Bags<=Dressed & WaitBag<=InBath]]]]]

abstracting: (WaitBag<=InBath) states: 67,599 (4)
abstracting: (Bags<=Dressed) states: 8,512 (3)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.130sec

checking: EF [AG [[WaitBag<=WaitBag & WaitBag<=Cabins]]]
normalized: E [true U ~ [E [true U ~ [[WaitBag<=WaitBag & WaitBag<=Cabins]]]]]

abstracting: (WaitBag<=Cabins) states: 58,513 (4)
abstracting: (WaitBag<=WaitBag) states: 89,621 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.197sec

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

abstracting: (Out<=Dressed) states: 30,932 (4)
abstracting: (Entered<=Out) states: 47,723 (4)
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.284sec

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

abstracting: (1<=WaitBag) states: 62,824 (4)
abstracting: (Entered<=Entered) states: 89,621 (4)
abstracting: (3<=Cabins) states: 40,334 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: [AG [~ [[Undress<=Out | Cabins<=InBath]]] | AG [EG [Cabins<=Bags]]]
normalized: [~ [E [true U ~ [EG [Cabins<=Bags]]]] | ~ [E [true U [Undress<=Out | Cabins<=InBath]]]]

abstracting: (Cabins<=InBath) states: 62,594 (4)
abstracting: (Undress<=Out) states: 69,937 (4)
abstracting: (Cabins<=Bags) states: 80,471 (4)
.......
EG iterations: 7
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.171sec

checking: [[~ [AX [Cabins<=Dressed]] & AF [~ [1<=Dress]]] & AF [[3<=Entered | [1<=InBath & 3<=Bags]]]]
normalized: [~ [EG [~ [[3<=Entered | [1<=InBath & 3<=Bags]]]]] & [~ [EG [1<=Dress]] & EX [~ [Cabins<=Dressed]]]]

abstracting: (Cabins<=Dressed) states: 43,351 (4)
.abstracting: (1<=Dress) states: 61,536 (4)
.
EG iterations: 1
abstracting: (3<=Bags) states: 80,091 (4)
abstracting: (1<=InBath) states: 76,608 (4)
abstracting: (3<=Entered) states: 56,749 (4)
......................................................
EG iterations: 54
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.549sec

checking: AG [[[[2<=Undress & 2<=Undress] | [Undress<=Undress | Cabins<=Dress]] | AF [Out<=Undress]]]
normalized: ~ [E [true U ~ [[[[2<=Undress & 2<=Undress] | [Undress<=Undress | Cabins<=Dress]] | ~ [EG [~ [Out<=Undress]]]]]]]

abstracting: (Out<=Undress) states: 30,093 (4)
............
EG iterations: 12
abstracting: (Cabins<=Dress) states: 42,491 (4)
abstracting: (Undress<=Undress) states: 89,621 (4)
abstracting: (2<=Undress) states: 40,872 (4)
abstracting: (2<=Undress) states: 40,872 (4)
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.354sec

checking: [[AG [[Entered<=Undress | Dress<=Out]] & AX [[Entered<=Cabins | 3<=Undress]]] | Out<=Dressed]
normalized: [Out<=Dressed | [~ [EX [~ [[Entered<=Cabins | 3<=Undress]]]] & ~ [E [true U ~ [[Entered<=Undress | Dress<=Out]]]]]]

abstracting: (Dress<=Out) states: 69,937 (4)
abstracting: (Entered<=Undress) states: 30,093 (4)
abstracting: (3<=Undress) states: 26,078 (4)
abstracting: (Entered<=Cabins) states: 35,098 (4)
.abstracting: (Out<=Dressed) states: 30,932 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.238sec


Total processing time: 0m29.240sec


BK_STOP 1465322733653

--------------------
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.004sec


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

initing FirstDep: 0m 0.001sec


iterations count:32 (4), effective:6 (0)

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

iterations count:39 (5), effective:9 (1)

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

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

iterations count:20 (2), effective:2 (0)

iterations count:37 (5), effective:8 (1)

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

iterations count:18 (2), effective:5 (0)

iterations count:31 (4), effective:7 (1)

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

iterations count:11 (1), effective:2 (0)

iterations count:39 (5), effective:9 (1)

iterations count:48 (6), effective:12 (1)

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-01"
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/SwimmingPool-PT-01.tgz
mv SwimmingPool-PT-01 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-01, 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 r125kn-qhx2-146373371400363"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; 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 ;