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 S_FMS-PT-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r162st-ebro-143319440700119
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433367519091

Model: S_FMS-PT-010
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=CTLCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

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 1496 (1.5e+03) #states 2,501,413,200 (9)



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

checking: AF [EF [P1<=P2M2]]
normalized: ~ [EG [~ [E [true U P1<=P2M2]]]]

abstracting: (P1<=P2M2) states: 1,209,243,750 (9)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m2sec

checking: AG [E [2<=P2 U P1wM1<=P1]]
normalized: ~ [E [true U ~ [E [2<=P2 U P1wM1<=P1]]]]

abstracting: (P1wM1<=P1) states: 1,535,696,448 (9)
abstracting: (2<=P2) states: 970,876,698 (8)
-> the formula is FALSE

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

MC time: 0m2sec

checking: ~ [[A [1<=P12wM3 U P2wP1<=P1wM1] & EF [[3<=P1d & P1<=M1]]]]
normalized: ~ [[E [true U [3<=P1d & P1<=M1]] & [~ [EG [~ [P2wP1<=P1wM1]]] & ~ [E [~ [1<=P12wM3] U [~ [1<=P12wM3] & ~ [P2wP1<=P1wM1]]]]]]]

abstracting: (P2wP1<=P1wM1) states: 1,516,999,770 (9)
abstracting: (1<=P12wM3) states: 993,692,700 (8)
abstracting: (1<=P12wM3) states: 993,692,700 (8)
abstracting: (P2wP1<=P1wM1) states: 1,516,999,770 (9)
.
EG iterations: 1
abstracting: (P1<=M1) states: 1,943,095,440 (9)
abstracting: (3<=P1d) states: 496,756,788 (8)
-> the formula is TRUE

FORMULA FMS-PT-010-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m54sec

checking: AX [EF [~ [2<=M3]]]
normalized: ~ [EX [~ [E [true U ~ [2<=M3]]]]]

abstracting: (2<=M3) states: 1,594,469,448 (9)
.-> the formula is TRUE

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

MC time: 0m0sec

checking: [EF [EF [3<=P2wP1]] | AF [[~ [P2s<=P2] & [P2d<=P1s | 1<=P12]]]]
normalized: [E [true U E [true U 3<=P2wP1]] | ~ [EG [~ [[~ [P2s<=P2] & [P2d<=P1s | 1<=P12]]]]]]

abstracting: (1<=P12) states: 993,692,700 (8)
abstracting: (P2d<=P1s) states: 1,516,999,770 (9)
abstracting: (P2s<=P2) states: 1,516,159,788 (9)
.
EG iterations: 1
abstracting: (3<=P2wP1) states: 556,422,900 (8)
-> the formula is TRUE

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

MC time: 22m35sec

checking: [~ [~ [EF [P2<=P1M1]]] & [EF [[P2d<=M1 | 2<=P3s]] | E [P12wM3<=P2M2 U P2s<=P12]]]
normalized: [[E [P12wM3<=P2M2 U P2s<=P12] | E [true U [P2d<=M1 | 2<=P3s]]] & E [true U P2<=P1M1]]

abstracting: (P2<=P1M1) states: 1,397,618,970 (9)
abstracting: (2<=P3s) states: 1,705,509,000 (9)
abstracting: (P2d<=M1) states: 1,878,390,030 (9)
abstracting: (P2s<=P12) states: 1,229,682,234 (9)
abstracting: (P12wM3<=P2M2) states: 1,754,087,148 (9)
-> the formula is TRUE

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

MC time: 7m2sec

checking: ~ [[3<=P12M3 | EF [~ [P12<=M2]]]]
normalized: ~ [[3<=P12M3 | E [true U ~ [P12<=M2]]]]

abstracting: (P12<=M2) states: 1,891,309,134 (9)
abstracting: (3<=P12M3) states: 0
-> the formula is FALSE

FORMULA FMS-PT-010-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m5sec

checking: AG [AG [[2<=P1 | P1M1<=P12M3]]]
normalized: ~ [E [true U E [true U ~ [[2<=P1 | P1M1<=P12M3]]]]]

abstracting: (P1M1<=P12M3) states: 1,395,815,850 (9)
abstracting: (2<=P1) states: 903,699,852 (8)

BK_TIME_CONFINEMENT_REACHED

--------------------
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:790 (39), effective:170 (8)

initing FirstDep: 0m0sec


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

iterations count:111 (5), effective:22 (1)

iterations count:102 (5), effective:15 (0)

iterations count:107 (5), effective:14 (0)

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

iterations count:95 (4), effective:14 (0)

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

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

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

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

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

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

iterations count:93 (4), effective:16 (0)

iterations count:20 (1), effective:0 (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="S_FMS-PT-010"
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/S_FMS-PT-010.tgz
mv S_FMS-PT-010 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 S_FMS-PT-010, 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 r162st-ebro-143319440700119"
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 ;