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 S_FMS-PT-005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r149kn-smll-146416259400642
=====================================================================

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


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: FMS_PT_005
(NrP: 22 NrTr: 20 NrArc: 50)

net check time: 0m 0.000sec

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

init dd package: 0m 4.076sec


RS generation: 0m 0.007sec


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



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

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

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

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

MC time: 0m 0.001sec

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

abstracting: (3<=P1d) states: 149,856 (5)
-> the formula is FALSE

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

MC time: 0m 0.003sec

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

abstracting: (P12<=P3) states: 2,692,865 (6)
-> the formula is TRUE

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

MC time: 0m 0.006sec

checking: EF [M3<=M2]
normalized: E [true U M3<=M2]

abstracting: (M3<=M2) states: 443,541 (5)
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: EF [A [1<=P2s U 2<=P12wM3]]
normalized: E [true U [~ [EG [~ [2<=P12wM3]]] & ~ [E [~ [2<=P12wM3] U [~ [1<=P2s] & ~ [2<=P12wM3]]]]]]

abstracting: (2<=P12wM3) states: 102,039 (5)
abstracting: (1<=P2s) states: 1,356,810 (6)
abstracting: (2<=P12wM3) states: 102,039 (5)
abstracting: (2<=P12wM3) states: 102,039 (5)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.016sec

checking: AX [E [P1d<=P1M1 U 2<=P2M2]]
normalized: ~ [EX [~ [E [P1d<=P1M1 U 2<=P2M2]]]]

abstracting: (2<=P2M2) states: 0
abstracting: (P1d<=P1M1) states: 1,976,436 (6)
.-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [EF [[3<=P2s & P12M3<=P2]]]
normalized: ~ [E [true U ~ [E [true U [3<=P2s & P12M3<=P2]]]]]

abstracting: (P12M3<=P2) states: 2,519,517 (6)
abstracting: (3<=P2s) states: 178,080 (5)
-> the formula is TRUE

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

MC time: 0m 0.015sec

checking: [3<=M1 & E [~ [1<=P2M2] U 3<=P1wP2]]
normalized: [3<=M1 & E [~ [1<=P2M2] U 3<=P1wP2]]

abstracting: (3<=P1wP2) states: 149,856 (5)
abstracting: (1<=P2M2) states: 951,321 (5)
abstracting: (3<=M1) states: 1,643,712 (6)
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: A [[[2<=P2wP1 | 3<=M1] | 3<=P12] U EF [3<=P12s]]
normalized: [~ [EG [~ [E [true U 3<=P12s]]]] & ~ [E [~ [E [true U 3<=P12s]] U [~ [E [true U 3<=P12s]] & ~ [[3<=P12 | [2<=P2wP1 | 3<=M1]]]]]]]

abstracting: (3<=M1) states: 1,643,712 (6)
abstracting: (2<=P2wP1) states: 547,239 (5)
abstracting: (3<=P12) states: 12,054 (4)
abstracting: (3<=P12s) states: 12,054 (4)
abstracting: (3<=P12s) states: 12,054 (4)
abstracting: (3<=P12s) states: 12,054 (4)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.006sec

checking: ~ [E [P2s<=P2d U [3<=M2 | 3<=P1d]]]
normalized: ~ [E [P2s<=P2d U [3<=M2 | 3<=P1d]]]

abstracting: (3<=P1d) states: 149,856 (5)
abstracting: (3<=M2) states: 0
abstracting: (P2s<=P2d) states: 1,943,697 (6)
-> the formula is FALSE

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

MC time: 0m 0.006sec

checking: [AG [~ [[3<=M1 & 2<=P2M2]]] & AF [~ [[1<=P2s | 3<=P1M1]]]]
normalized: [~ [EG [[1<=P2s | 3<=P1M1]]] & ~ [E [true U [3<=M1 & 2<=P2M2]]]]

abstracting: (2<=P2M2) states: 0
abstracting: (3<=M1) states: 1,643,712 (6)
abstracting: (3<=P1M1) states: 116,340 (5)
abstracting: (1<=P2s) states: 1,356,810 (6)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.004sec

checking: AG [[EF [1<=P12M3] & [[P2s<=P2s & 1<=P2] | ~ [2<=P2M2]]]]
normalized: ~ [E [true U ~ [[E [true U 1<=P12M3] & [~ [2<=P2M2] | [P2s<=P2s & 1<=P2]]]]]]

abstracting: (1<=P2) states: 1,356,810 (6)
abstracting: (P2s<=P2s) states: 2,895,018 (6)
abstracting: (2<=P2M2) states: 0
abstracting: (1<=P12M3) states: 602,826 (5)
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: A [[[P3s<=P1wM1 | P3M2<=M1] & ~ [P1<=P3M2]] U EF [3<=P1wP2]]
normalized: [~ [EG [~ [E [true U 3<=P1wP2]]]] & ~ [E [~ [E [true U 3<=P1wP2]] U [~ [[~ [P1<=P3M2] & [P3s<=P1wM1 | P3M2<=M1]]] & ~ [E [true U 3<=P1wP2]]]]]]

abstracting: (3<=P1wP2) states: 149,856 (5)
abstracting: (P3M2<=M1) states: 2,188,666 (6)
abstracting: (P3s<=P1wM1) states: 1,249,578 (6)
abstracting: (P1<=P3M2) states: 2,379,498 (6)
abstracting: (3<=P1wP2) states: 149,856 (5)
abstracting: (3<=P1wP2) states: 149,856 (5)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.010sec

checking: EF [[~ [[M1<=P3s & 2<=P1]] & [P3<=M1 & ~ [P12wM3<=P12wM3]]]]
normalized: E [true U [[P3<=M1 & ~ [P12wM3<=P12wM3]] & ~ [[M1<=P3s & 2<=P1]]]]

abstracting: (2<=P1) states: 486,696 (5)
abstracting: (M1<=P3s) states: 1,206,632 (6)
abstracting: (P12wM3<=P12wM3) states: 2,895,018 (6)
abstracting: (P3<=M1) states: 2,188,666 (6)
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: [EF [AG [P12wM3<=P3s]] & [AX [[P1M1<=P2wP1 | 1<=P2wM2]] | P2<=P1M1]]
normalized: [[P2<=P1M1 | ~ [EX [~ [[P1M1<=P2wP1 | 1<=P2wM2]]]]] & E [true U ~ [E [true U ~ [P12wM3<=P3s]]]]]

abstracting: (P12wM3<=P3s) states: 2,692,865 (6)
abstracting: (1<=P2wM2) states: 1,356,810 (6)
abstracting: (P1M1<=P2wP1) states: 2,098,362 (6)
.abstracting: (P2<=P1M1) states: 1,958,208 (6)
-> the formula is FALSE

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

MC time: 0m 0.013sec

checking: [[[2<=P3M2 | [1<=P2s | 2<=P2M2]] | E [2<=P1 U 2<=P12M3]] | EX [[[1<=P2wM2 & 1<=P2wP1] & [3<=P3M2 & 1<=P2wM2]]]]
normalized: [[E [2<=P1 U 2<=P12M3] | [2<=P3M2 | [1<=P2s | 2<=P2M2]]] | EX [[[1<=P2wM2 & 1<=P2wP1] & [3<=P3M2 & 1<=P2wM2]]]]

abstracting: (1<=P2wM2) states: 1,356,810 (6)
abstracting: (3<=P3M2) states: 827,148 (5)
abstracting: (1<=P2wP1) states: 1,356,810 (6)
abstracting: (1<=P2wM2) states: 1,356,810 (6)
.abstracting: (2<=P2M2) states: 0
abstracting: (1<=P2s) states: 1,356,810 (6)
abstracting: (2<=P3M2) states: 1,378,580 (6)
abstracting: (2<=P12M3) states: 90,006 (4)
abstracting: (2<=P1) states: 486,696 (5)
-> the formula is TRUE

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

MC time: 0m 0.010sec


Total processing time: 0m 5.685sec


BK_STOP 1464439320414

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


iterations count:380 (19), effective:80 (4)

initing FirstDep: 0m 0.000sec


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

iterations count:254 (12), effective:42 (2)

iterations count:96 (4), effective:19 (0)

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

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

iterations count:182 (9), effective:28 (1)

iterations count:314 (15), effective:54 (2)

iterations count:146 (7), effective:27 (1)

iterations count:242 (12), effective:42 (2)

iterations count:242 (12), effective:42 (2)

iterations count:242 (12), effective:42 (2)

iterations count:254 (12), effective:42 (2)

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

iterations count:146 (7), effective:27 (1)

iterations count:146 (7), effective:27 (1)

iterations count:146 (7), effective:27 (1)

iterations count:111 (5), effective:19 (0)

iterations count:180 (9), effective:28 (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="S_FMS-PT-005"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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-005.tgz
mv S_FMS-PT-005 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 S_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 r149kn-smll-146416259400642"
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 ;