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-3253
Executing tool marcie
Input is SwimmingPool-PT-01, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r071-ebro-149440997700169
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494829847275

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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

parse successfull
net created successfully

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

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

net check time: 0m 0.000sec

init dd package: 0m 2.331sec

parse successfull
net created successfully

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

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

net check time: 0m 0.000sec

init dd package: 0m 8.157sec


RS generation: 0m 0.075sec


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



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

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

abstracting: (1<=Out)
states: 78,211 (4)
-> the formula is FALSE

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

MC time: 0m 0.080sec

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

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

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

MC time: 0m 0.016sec

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-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

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

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

FORMULA SwimmingPool-PT-01-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.055sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.053sec

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

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

FORMULA SwimmingPool-PT-01-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.047sec

checking: AG [~ [Cabins<=Dress]]
normalized: ~ [E [true U Cabins<=Dress]]

abstracting: (Cabins<=Dress)
states: 42,491 (4)
-> the formula is FALSE

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

MC time: 0m 0.041sec

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

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

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

MC time: 0m 0.000sec

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

abstracting: (Entered<=Dress)
states: 30,093 (4)
abstracting: (2<=Bags)
states: 84,147 (4)
-> the formula is FALSE

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

MC time: 0m 0.080sec

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

abstracting: (1<=Out)
states: 78,211 (4)
abstracting: (1<=InBath)
states: 76,608 (4)
abstracting: (1<=Bags)
states: 87,297 (4)
abstracting: (1<=Cabins)
states: 71,403 (4)
-> the formula is FALSE

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

MC time: 0m 0.055sec

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

abstracting: (Dress<=Bags)
states: 80,715 (4)
abstracting: (Entered<=Cabins)
states: 35,098 (4)
abstracting: (Bags<=Dress)
states: 12,872 (4)
-> the formula is TRUE

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

MC time: 0m 0.041sec

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

abstracting: (3<=Out)
states: 56,749 (4)
abstracting: (Dress<=Dress)
states: 89,621 (4)
abstracting: (2<=Dressed)
states: 42,528 (4)
abstracting: (WaitBag<=Out)
states: 68,579 (4)
-> the formula is FALSE

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

MC time: 0m 0.033sec

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

abstracting: (InBath<=Bags)
states: 65,093 (4)
abstracting: (3<=InBath)
states: 53,585 (4)
abstracting: (3<=Bags)
states: 80,091 (4)
abstracting: (Dressed<=Entered)
states: 68,579 (4)
abstracting: (1<=Cabins)
states: 71,403 (4)
abstracting: (Out<=WaitBag)
states: 30,932 (4)
-> the formula is FALSE

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

MC time: 0m 0.015sec

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

abstracting: (Bags<=Undress)
states: 12,872 (4)
abstracting: (InBath<=InBath)
states: 89,621 (4)
abstracting: (2<=Bags)
states: 84,147 (4)
abstracting: (2<=InBath)
states: 64,596 (4)
abstracting: (Dressed<=WaitBag)
states: 52,395 (4)
abstracting: (Undress<=Undress)
states: 89,621 (4)
-> the formula is FALSE

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

MC time: 0m 0.022sec

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

abstracting: (Undress<=Bags)
states: 80,715 (4)
abstracting: (1<=Bags)
states: 87,297 (4)
abstracting: (1<=Dressed)
states: 62,824 (4)
abstracting: (1<=Undress)
states: 61,536 (4)
abstracting: (Dress<=Dressed)
states: 53,725 (4)
abstracting: (Dress<=WaitBag)
states: 53,725 (4)
abstracting: (Out<=Dressed)
states: 30,932 (4)
-> the formula is TRUE

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

MC time: 0m 0.116sec

totally nodes used: 107429 (1.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 369480 156791 526271
used/not used/entry size/cache size: 249165 66859699 16 1024MB
basic ops cache: hits/miss/sum: 254769 153543 408312
used/not used/entry size/cache size: 291192 16486024 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 57027 27100 84127
used/not used/entry size/cache size: 27086 8361522 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67017053
1 87692
2 2116
3 514
4 411
5 324
6 112
7 82
8 97
9 29
>= 10 434

Total processing time: 0m16.625sec


BK_STOP 1494829864101

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

check for maximal unmarked siphon
ok
check for constant places
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:66 (9), effective:17 (2)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

iterations count:62 (8), effective:17 (2)

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

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

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

iterations count:22 (3), effective:6 (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="SwimmingPool-PT-01"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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-3253"
echo " Executing tool marcie"
echo " Input is SwimmingPool-PT-01, 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 r071-ebro-149440997700169"
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 ;