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 FMS-PT-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r053kn-smll-146358767800075
=====================================================================

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


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_010
(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 3.611sec


RS generation: 0m 0.029sec


-> reachability set: #nodes 1687 (1.7e+03) #states 2,501,413,200 (9)



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

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

abstracting: (2<=P3) states: 1,705,509,000 (9)
.-> the formula is TRUE

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

MC time: 0m 0.040sec

checking: EF [2<=P12]
normalized: E [true U 2<=P12]

abstracting: (2<=P12) states: 363,737,418 (8)
-> the formula is TRUE

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

MC time: 0m 0.021sec

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

abstracting: (1<=P1wP2) states: 1,543,588,332 (9)
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: ~ [EF [AX [3<=P2s]]]
normalized: ~ [E [true U ~ [EX [~ [3<=P2s]]]]]

abstracting: (3<=P2s) states: 556,422,900 (8)
.-> the formula is FALSE

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

MC time: 0m 0.090sec

checking: ~ [AG [~ [[3<=P1wM1 & 3<=M3]]]]
normalized: E [true U [3<=P1wM1 & 3<=M3]]

abstracting: (3<=M3) states: 0
abstracting: (3<=P1wM1) states: 496,756,788 (8)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: [~ [AG [~ [3<=P12M3]]] | 2<=P12wM3]
normalized: [2<=P12wM3 | E [true U 3<=P12M3]]

abstracting: (3<=P12M3) states: 0
abstracting: (2<=P12wM3) states: 363,737,418 (8)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [[~ [[1<=M1 & 1<=P12wM3]] | EG [1<=M2]]]
normalized: ~ [E [true U ~ [[EG [1<=M2] | ~ [[1<=M1 & 1<=P12wM3]]]]]]

abstracting: (1<=P12wM3) states: 993,692,700 (8)
abstracting: (1<=M1) states: 2,245,463,220 (9)
abstracting: (1<=M2) states: 1,516,159,788 (9)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.049sec

checking: E [~ [~ [2<=P2]] U ~ [[P2wP1<=P12s | 1<=P3]]]
normalized: E [2<=P2 U ~ [[P2wP1<=P12s | 1<=P3]]]

abstracting: (1<=P3) states: 2,084,511,000 (9)
abstracting: (P2wP1<=P12s) states: 1,229,682,234 (9)
abstracting: (2<=P2) states: 970,876,698 (8)
-> the formula is TRUE

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

MC time: 0m 0.099sec

checking: [[2<=P1 | EX [[1<=P1wM1 & 1<=P1M1]]] & EF [AG [P2wP1<=P1M1]]]
normalized: [E [true U ~ [E [true U ~ [P2wP1<=P1M1]]]] & [2<=P1 | EX [[1<=P1wM1 & 1<=P1M1]]]]

abstracting: (1<=P1M1) states: 1,404,008,892 (9)
abstracting: (1<=P1wM1) states: 1,543,588,332 (9)
.abstracting: (2<=P1) states: 903,699,852 (8)
abstracting: (P2wP1<=P1M1) states: 1,397,618,970 (9)
-> the formula is FALSE

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

MC time: 0m 0.069sec

checking: [~ [AG [~ [M3<=P2s]]] & ~ [AG [[3<=P3 | P1<=P2s]]]]
normalized: [E [true U ~ [[3<=P3 | P1<=P2s]]] & E [true U M3<=P2s]]

abstracting: (M3<=P2s) states: 1,304,693,676 (9)
abstracting: (P1<=P2s) states: 1,606,245,498 (9)
abstracting: (3<=P3) states: 1,364,407,200 (9)
-> the formula is TRUE

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

MC time: 0m 0.155sec

checking: EF [[EF [P2<=M2] & ~ [[P1<=M2 & 3<=P1wP2]]]]
normalized: E [true U [~ [[P1<=M2 & 3<=P1wP2]] & E [true U P2<=M2]]]

abstracting: (P2<=M2) states: 1,278,169,464 (9)
abstracting: (3<=P1wP2) states: 496,756,788 (8)
abstracting: (P1<=M2) states: 1,346,294,466 (9)
-> the formula is TRUE

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

MC time: 0m 0.024sec

checking: EF [[[P3<=P2wM2 & [P3s<=P1 & P2wP1<=M2]] & AF [P3M2<=P3M2]]]
normalized: E [true U [~ [EG [~ [P3M2<=P3M2]]] & [P3<=P2wM2 & [P3s<=P1 & P2wP1<=M2]]]]

abstracting: (P2wP1<=M2) states: 1,278,169,464 (9)
abstracting: (P3s<=P1) states: 876,645,696 (8)
abstracting: (P3<=P2wM2) states: 909,759,218 (8)
abstracting: (P3M2<=P3M2) states: 2,501,413,200 (9)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.380sec

checking: E [[[P2wP1<=P1wP2 | 1<=M3] | [P1d<=P3s & P12s<=P3]] U 3<=P12s]
normalized: E [[[P1d<=P3s & P12s<=P3] | [P2wP1<=P1wP2 | 1<=M3]] U 3<=P12s]

abstracting: (3<=P12s) states: 120,792,408 (8)
abstracting: (1<=M3) states: 2,251,264,158 (9)
abstracting: (P2wP1<=P1wP2) states: 1,516,999,770 (9)
abstracting: (P12s<=P3) states: 2,258,725,329 (9)
abstracting: (P1d<=P3s) states: 1,990,375,656 (9)
-> the formula is TRUE

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

MC time: 0m 0.419sec

checking: [[E [P1wM1<=M2 U 2<=P1d] & E [P12wM3<=P12s U P3s<=P1s]] & ~ [EF [~ [P12M3<=P1wP2]]]]
normalized: [~ [E [true U ~ [P12M3<=P1wP2]]] & [E [P12wM3<=P12s U P3s<=P1s] & E [P1wM1<=M2 U 2<=P1d]]]

abstracting: (2<=P1d) states: 903,699,852 (8)
abstracting: (P1wM1<=M2) states: 1,346,294,466 (9)
abstracting: (P3s<=P1s) states: 876,645,696 (8)
abstracting: (P12wM3<=P12s) states: 1,778,866,518 (9)
abstracting: (P12M3<=P1wP2) states: 2,067,743,568 (9)
-> the formula is FALSE

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

MC time: 0m 0.207sec

checking: [~ [[AX [3<=P2s] | [P2s<=P12s | P1<=P1wM1]]] | AG [[[3<=P2 | 3<=P12M3] | [1<=M2 & 1<=P3]]]]
normalized: [~ [E [true U ~ [[[1<=M2 & 1<=P3] | [3<=P2 | 3<=P12M3]]]]] | ~ [[[P2s<=P12s | P1<=P1wM1] | ~ [EX [~ [3<=P2s]]]]]]

abstracting: (3<=P2s) states: 556,422,900 (8)
.abstracting: (P1<=P1wM1) states: 1,535,696,448 (9)
abstracting: (P2s<=P12s) states: 1,229,682,234 (9)
abstracting: (3<=P12M3) states: 0
abstracting: (3<=P2) states: 556,422,900 (8)
abstracting: (1<=P3) states: 2,084,511,000 (9)
abstracting: (1<=M2) states: 1,516,159,788 (9)
-> the formula is FALSE

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

MC time: 0m 0.034sec

checking: [E [[P3s<=P2M2 | M1<=P2s] U ~ [P1wP2<=P1]] & E [[1<=P2wP1 | P12s<=P12M3] U P1s<=M1]]
normalized: [E [[1<=P2wP1 | P12s<=P12M3] U P1s<=M1] & E [[P3s<=P2M2 | M1<=P2s] U ~ [P1wP2<=P1]]]

abstracting: (P1wP2<=P1) states: 1,535,696,448 (9)
abstracting: (M1<=P2s) states: 1,051,462,698 (9)
abstracting: (P3s<=P2M2) states: 566,183,020 (8)
abstracting: (P1s<=M1) states: 1,943,095,440 (9)
abstracting: (P12s<=P12M3) states: 1,750,665,510 (9)
abstracting: (1<=P2wP1) states: 1,596,875,280 (9)
-> the formula is TRUE

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

MC time: 0m 0.101sec


Total processing time: 0m 6.850sec


BK_STOP 1463598880609

--------------------
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:740 (37), effective:160 (8)

initing FirstDep: 0m 0.000sec


iterations count:29 (1), effective:9 (0)

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

iterations count:62 (3), effective:9 (0)

iterations count:419 (20), effective:71 (3)

iterations count:209 (10), effective:32 (1)

iterations count:184 (9), effective:38 (1)

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

iterations count:197 (9), effective:31 (1)

iterations count:197 (9), effective:32 (1)

iterations count:54 (2), effective:10 (0)

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

iterations count:668 (33), effective:115 (5)

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

iterations count:190 (9), effective:30 (1)

iterations count:40 (2), effective:10 (0)

iterations count:432 (21), effective:64 (3)

iterations count:54 (2), effective:18 (0)

iterations count:107 (5), effective:23 (1)

iterations count:55 (2), effective:7 (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-010"
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/FMS-PT-010.tgz
mv FMS-PT-010 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 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 r053kn-smll-146358767800075"
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 ;