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 SwimmingPool-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r288su-ebro-143385262200087
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433940889054

Model: SwimmingPool-PT-02
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --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=ReachabilityCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 9 NrTr: 7 NrArc: 20)

net check time: 0m0sec

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

init dd package: 0m5sec


RS generation: 0m0sec


-> reachability set: #nodes 7579 (7.6e+03) #states 3,408,031 (6)



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

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

abstracting: (Entered<=WaitBag) states: 1,054,144 (6)
abstracting: (Out<=Entered) states: 1,762,888 (6)
abstracting: (1<=Dressed) states: 2,811,688 (6)
abstracting: (1<=Dress) states: 2,782,912 (6)
abstracting: (InBath<=Dress) states: 1,112,692 (6)
-> the formula is FALSE

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

MC time: 0m5sec

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

abstracting: (Entered<=Cabins) states: 1,198,450 (6)
-> the formula is FALSE

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

MC time: 0m1sec

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

abstracting: (Entered<=Cabins) states: 1,198,450 (6)
-> the formula is FALSE

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

MC time: 0m1sec

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

abstracting: (Bags<=Cabins) states: 420,224 (5)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (InBath<=Bags) states: 2,459,017 (6)
abstracting: (3<=Dressed) states: 1,857,009 (6)
abstracting: (3<=InBath) states: 2,642,959 (6)
abstracting: (Out<=WaitBag) states: 1,054,144 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m3sec

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

abstracting: (Cabins<=Undress) states: 1,520,810 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (3<=Cabins) states: 2,277,408 (6)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (3<=Out) states: 2,720,662 (6)
abstracting: (1<=Undress) states: 2,782,912 (6)
abstracting: (Dressed<=Dressed) states: 3,408,031 (6)
abstracting: (Out<=Undress) states: 1,021,350 (6)
abstracting: (2<=Entered) states: 2,945,404 (6)
abstracting: (3<=Dressed) states: 1,857,009 (6)
abstracting: (Dressed<=Dress) states: 1,836,681 (6)
-> the formula is TRUE

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

MC time: 0m4sec

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

abstracting: (Undress<=Dressed) states: 1,904,034 (6)
abstracting: (InBath<=Dress) states: 1,112,692 (6)
abstracting: (Undress<=Undress) states: 3,408,031 (6)
-> the formula is FALSE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (Out<=Entered) states: 1,762,888 (6)
abstracting: (Out<=InBath) states: 1,713,745 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m6sec

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

abstracting: (Bags<=WaitBag) states: 250,393 (5)
abstracting: (Undress<=Cabins) states: 2,151,407 (6)
abstracting: (Undress<=Dress) states: 1,872,733 (6)
abstracting: (InBath<=Undress) states: 1,112,692 (6)
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (Undress<=Undress) states: 3,408,031 (6)
abstracting: (1<=Out) states: 3,174,787 (6)
abstracting: (Undress<=WaitBag) states: 1,904,034 (6)
abstracting: (3<=Dress) states: 1,803,396 (6)
abstracting: (3<=WaitBag) states: 1,857,009 (6)
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (1<=Dress) states: 2,782,912 (6)
abstracting: (3<=Bags) states: 3,263,302 (6)
abstracting: (2<=Entered) states: 2,945,404 (6)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (3<=Bags) states: 3,263,302 (6)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [~ [~ [[3<=Out & Undress<=Bags]]]]
normalized: ~ [E [true U ~ [[3<=Out & Undress<=Bags]]]]

abstracting: (Undress<=Bags) states: 3,074,288 (6)
abstracting: (3<=Out) states: 2,720,662 (6)
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (Bags<=Cabins) states: 420,224 (5)
-> the formula is FALSE

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

MC time: 0m0sec


Total processing time: 0m36sec


BK_STOP 1433940925694

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


iterations count:807 (115), effective:240 (34)

initing FirstDep: 0m0sec


iterations count:49 (7), effective:14 (2)

iterations count:25 (3), effective:7 (1)

iterations count:25 (3), effective:7 (1)

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

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

iterations count:16 (2), effective:3 (0)

iterations count:16 (2), effective:3 (0)

iterations count:36 (5), effective:11 (1)

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

iterations count:47 (6), effective:13 (1)

iterations count:77 (11), effective:28 (4)

iterations count:65 (9), effective:20 (2)

iterations count:40 (5), effective:10 (1)

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

iterations count:29 (4), effective:7 (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-02"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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-02.tgz
mv SwimmingPool-PT-02 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 SwimmingPool-PT-02, 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 r288su-ebro-143385262200087"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 ;