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 FMS-PT-005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r050kn-ebro-143236503500106
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432534094552

Model: FMS-PT-005
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Plain order (as read)
--memory=6 --suppress --rs-algorithm=3 --place-order=1

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=3 --place-order=1

parse successfull
net created successfully

(NrP: 22 NrTr: 20 NrArc: 50)

net check time: 0m0sec

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

init dd package: 0m6sec


RS generation: 0m0sec


-> reachability set: #nodes 517 (5.2e+02) #states 2,895,018 (6)



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

checking: AF [EF [~ [P1wP2<=P2]]]
normalized: ~ [EG [~ [E [true U ~ [P1wP2<=P2]]]]]

abstracting: (P1wP2<=P2) states: 2,067,492 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-005-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EX [[[2<=M1 | [P2s<=P3M2 | P1M1<=P12wM3]] & AG [P12wM3<=P2wP1]]]
normalized: EX [[~ [E [true U ~ [P12wM3<=P2wP1]]] & [2<=M1 | [P2s<=P3M2 | P1M1<=P12wM3]]]]

abstracting: (P1M1<=P12wM3) states: 1,814,211 (6)
abstracting: (P2s<=P3M2) states: 2,336,723 (6)
abstracting: (2<=M1) states: 2,441,838 (6)
abstracting: (P12wM3<=P2wP1) states: 2,508,177 (6)
.-> the formula is FALSE

FORMULA FMS-PT-005-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m3sec

checking: AG [[[~ [P3M2<=M3] | [P12M3<=M1 | 1<=P2s]] & [1<=P3M2 | [P12<=P2wP1 | 2<=P1wM1]]]]
normalized: ~ [E [true U ~ [[[1<=P3M2 | [P12<=P2wP1 | 2<=P1wM1]] & [[P12M3<=M1 | 1<=P2s] | ~ [P3M2<=M3]]]]]]

abstracting: (P3M2<=M3) states: 1,931,616 (6)
abstracting: (1<=P2s) states: 1,356,810 (6)
abstracting: (P12M3<=M1) states: 2,873,283 (6)
abstracting: (2<=P1wM1) states: 486,696 (5)
abstracting: (P12<=P2wP1) states: 2,508,177 (6)
abstracting: (1<=P3M2) states: 2,067,870 (6)
-> the formula is FALSE

FORMULA FMS-PT-005-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [EF [[[P1s<=P2M2 & 1<=P1wP2] & 3<=P12M3]]]
normalized: ~ [E [true U [3<=P12M3 & [P1s<=P2M2 & 1<=P1wP2]]]]

abstracting: (1<=P1wP2) states: 1,280,706 (6)
abstracting: (P1s<=P2M2) states: 1,876,518 (6)
abstracting: (3<=P12M3) states: 0
-> the formula is TRUE

FORMULA FMS-PT-005-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[EG [P2d<=P1M1] | EF [P12M3<=M3]]]
normalized: ~ [E [true U ~ [[E [true U P12M3<=M3] | EG [P2d<=P1M1]]]]]

abstracting: (P2d<=P1M1) states: 1,958,208 (6)
....................
EG iterations: 20
abstracting: (P12M3<=M3) states: 2,805,012 (6)
-> the formula is TRUE

FORMULA FMS-PT-005-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: [[AG [P12<=P12] & E [P2<=P2wM2 U P1s<=P2]] & AF [AF [P12s<=P12M3]]]
normalized: [[E [P2<=P2wM2 U P1s<=P2] & ~ [E [true U ~ [P12<=P12]]]] & ~ [EG [EG [~ [P12s<=P12M3]]]]]

abstracting: (P12s<=P12M3) states: 2,370,963 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (P12<=P12) states: 2,895,018 (6)
abstracting: (P1s<=P2) states: 2,067,492 (6)
abstracting: (P2<=P2wM2) states: 1,943,697 (6)
-> the formula is TRUE

FORMULA FMS-PT-005-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[P12wM3<=M3 | P12<=M1] | 2<=P12] | ~ [[P1wP2<=M1 | M3<=P2]]]]
normalized: ~ [E [true U ~ [[~ [[P1wP2<=M1 | M3<=P2]] | [2<=P12 | [P12wM3<=M3 | P12<=M1]]]]]]

abstracting: (P12<=M1) states: 2,869,545 (6)
abstracting: (P12wM3<=M3) states: 2,861,376 (6)
abstracting: (2<=P12) states: 102,039 (5)
abstracting: (M3<=P2) states: 771,498 (5)
abstracting: (P1wP2<=M1) states: 2,777,418 (6)
-> the formula is TRUE

FORMULA FMS-PT-005-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (P12s<=P1wP2) states: 2,494,422 (6)
-> the formula is TRUE

FORMULA FMS-PT-005-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [EX [P12<=P1]]]
normalized: E [true U ~ [EX [P12<=P1]]]

abstracting: (P12<=P1) states: 2,494,422 (6)
.-> the formula is TRUE

FORMULA FMS-PT-005-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: E [~ [2<=P12wM3] U AG [M3<=P2wP1]]
normalized: E [~ [2<=P12wM3] U ~ [E [true U ~ [M3<=P2wP1]]]]

abstracting: (M3<=P2wP1) states: 771,498 (5)
abstracting: (2<=P12wM3) states: 102,039 (5)
-> the formula is FALSE

FORMULA FMS-PT-005-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [AF [[3<=P1d & 3<=P2]]]
normalized: E [true U ~ [EG [~ [[3<=P1d & 3<=P2]]]]]

abstracting: (3<=P2) states: 178,080 (5)
abstracting: (3<=P1d) states: 149,856 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-005-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [AX [~ [3<=M3]]]
normalized: ~ [E [true U EX [3<=M3]]]

abstracting: (3<=M3) states: 0
.-> the formula is TRUE

FORMULA FMS-PT-005-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (3<=P12wM3) states: 12,054 (4)
-> the formula is FALSE

FORMULA FMS-PT-005-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: E [AX [P3s<=P3M2] U [3<=P2M2 & P12s<=P12s]]
normalized: E [~ [EX [~ [P3s<=P3M2]]] U [3<=P2M2 & P12s<=P12s]]

abstracting: (P12s<=P12s) states: 2,895,018 (6)
abstracting: (3<=P2M2) states: 0
abstracting: (P3s<=P3M2) states: 1,654,296 (6)
.-> the formula is FALSE

FORMULA FMS-PT-005-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AX [AG [[1<=M3 | 1<=M1]]]
normalized: ~ [EX [E [true U ~ [[1<=M3 | 1<=M1]]]]]

abstracting: (1<=M1) states: 2,778,678 (6)
abstracting: (1<=M3) states: 2,805,012 (6)
.-> the formula is FALSE

FORMULA FMS-PT-005-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: E [[[P1wM1<=P12M3 & 3<=M2] | P12<=P3] U EG [3<=P1wP2]]
normalized: E [[P12<=P3 | [P1wM1<=P12M3 & 3<=M2]] U EG [3<=P1wP2]]

abstracting: (3<=P1wP2) states: 149,856 (5)
.
EG iterations: 1
abstracting: (3<=M2) states: 0
abstracting: (P1wM1<=P12M3) states: 1,781,913 (6)
abstracting: (P12<=P3) states: 2,692,865 (6)
-> the formula is TRUE

FORMULA FMS-PT-005-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m2sec


Total processing time: 0m17sec


BK_STOP 1432534112398

--------------------
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:380 (19), effective:80 (4)

initing FirstDep: 0m0sec


iterations count:65 (3), effective:10 (0)

iterations count:128 (6), effective:17 (0)

iterations count:144 (7), effective:24 (1)

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

iterations count:131 (6), effective:20 (1)

iterations count:119 (5), effective:20 (1)

iterations count:105 (5), effective:17 (0)

iterations count:110 (5), effective:16 (0)

iterations count:260 (13), effective:43 (2)

iterations count:123 (6), effective:18 (0)

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

iterations count:65 (3), effective:11 (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="FMS-PT-005"
export BK_EXAMINATION="CTLCardinality"
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/FMS-PT-005.tgz
mv FMS-PT-005 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 FMS-PT-005, 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 r050kn-ebro-143236503500106"
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 ;