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-002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r149kn-smll-146416259400637
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464439261225


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=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: FMS_PT_002
(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.150sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 139 (1.4e+02) #states 3,444 (3)



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

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

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

FORMULA FMS-PT-002-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (3<=P1s) states: 0
-> the formula is FALSE

FORMULA FMS-PT-002-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA FMS-PT-002-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (P12s<=P2) states: 3,240 (3)
-> the formula is FALSE

FORMULA FMS-PT-002-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (P12s<=P2wP1) states: 3,240 (3)
-> the formula is TRUE

FORMULA FMS-PT-002-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [[2<=M2 & 1<=P12]]]
normalized: ~ [E [true U [2<=M2 & 1<=P12]]]

abstracting: (1<=P12) states: 240
abstracting: (2<=M2) states: 0
-> the formula is TRUE

FORMULA FMS-PT-002-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [~ [[M2<=M2 | 1<=P1]]]]
normalized: ~ [E [true U ~ [[M2<=M2 | 1<=P1]]]]

abstracting: (1<=P1) states: 864
abstracting: (M2<=M2) states: 3,444 (3)
-> the formula is TRUE

FORMULA FMS-PT-002-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[3<=P2s & [2<=P1wM1 | 1<=P2wP1]]]
normalized: E [true U [3<=P2s & [2<=P1wM1 | 1<=P2wP1]]]

abstracting: (1<=P2wP1) states: 900
abstracting: (2<=P1wM1) states: 120
abstracting: (3<=P2s) states: 0
-> the formula is FALSE

FORMULA FMS-PT-002-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[2<=P12s | 3<=M2] & 1<=P1wP2] | ~ [3<=P12M3]]]
normalized: ~ [E [true U ~ [[~ [3<=P12M3] | [1<=P1wP2 & [2<=P12s | 3<=M2]]]]]]

abstracting: (3<=M2) states: 0
abstracting: (2<=P12s) states: 6
abstracting: (1<=P1wP2) states: 864
abstracting: (3<=P12M3) states: 0
-> the formula is TRUE

FORMULA FMS-PT-002-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[[P2s<=P1s & 1<=P1] | [P12wM3<=P3s | 3<=P3s]]]]
normalized: E [true U ~ [[[P12wM3<=P3s | 3<=P3s] | [P2s<=P1s & 1<=P1]]]]

abstracting: (1<=P1) states: 864
abstracting: (P2s<=P1s) states: 2,754 (3)
abstracting: (3<=P3s) states: 0
abstracting: (P12wM3<=P3s) states: 3,322 (3)
-> the formula is TRUE

FORMULA FMS-PT-002-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[~ [[2<=P3 & 2<=P12wM3]] & [[P2wP1<=P1wP2 & P12<=P2M2] & 3<=P1s]]]
normalized: E [true U [[3<=P1s & [P2wP1<=P1wP2 & P12<=P2M2]] & ~ [[2<=P3 & 2<=P12wM3]]]]

abstracting: (2<=P12wM3) states: 6
abstracting: (2<=P3) states: 574
abstracting: (P12<=P2M2) states: 3,240 (3)
abstracting: (P2wP1<=P1wP2) states: 2,754 (3)
abstracting: (3<=P1s) states: 0
-> the formula is FALSE

FORMULA FMS-PT-002-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[3<=P3M2 & P2wM2<=P3M2] | ~ [3<=P1]] | [[P1d<=P2wP1 | 1<=P12wM3] & 2<=P1s]]]
normalized: ~ [E [true U ~ [[[2<=P1s & [P1d<=P2wP1 | 1<=P12wM3]] | [~ [3<=P1] | [3<=P3M2 & P2wM2<=P3M2]]]]]]

abstracting: (P2wM2<=P3M2) states: 2,952 (3)
abstracting: (3<=P3M2) states: 0
abstracting: (3<=P1) states: 0
abstracting: (1<=P12wM3) states: 240
abstracting: (P1d<=P2wP1) states: 2,790 (3)
abstracting: (2<=P1s) states: 120
-> the formula is TRUE

FORMULA FMS-PT-002-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[P2wP1<=P12s | P1<=P3] | [P2M2<=M3 | P2wM2<=P1d]] & ~ [~ [3<=P2wM2]]]]
normalized: E [true U [3<=P2wM2 & [[P2M2<=M3 | P2wM2<=P1d] | [P2wP1<=P12s | P1<=P3]]]]

abstracting: (P1<=P3) states: 2,972 (3)
abstracting: (P2wP1<=P12s) states: 2,580 (3)
abstracting: (P2wM2<=P1d) states: 2,754 (3)
abstracting: (P2M2<=M3) states: 3,444 (3)
abstracting: (3<=P2wM2) states: 0
-> the formula is FALSE

FORMULA FMS-PT-002-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[~ [2<=P12wM3] | [P2<=P12 | P1s<=P12wM3]] | ~ [[P1wM1<=P12M3 | P1wM1<=P2M2]]]]
normalized: ~ [E [true U ~ [[~ [[P1wM1<=P12M3 | P1wM1<=P2M2]] | [[P2<=P12 | P1s<=P12wM3] | ~ [2<=P12wM3]]]]]]

abstracting: (2<=P12wM3) states: 6
abstracting: (P1s<=P12wM3) states: 2,616 (3)
abstracting: (P2<=P12) states: 2,580 (3)
abstracting: (P1wM1<=P2M2) states: 2,754 (3)
abstracting: (P1wM1<=P12M3) states: 2,616 (3)
-> the formula is TRUE

FORMULA FMS-PT-002-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[M1<=P1wM1 & 2<=P3]] & [[1<=P12M3 & 3<=P2] & [P1wM1<=P2wM2 | P2s<=M3]]]]
normalized: E [true U [[[1<=P12M3 & 3<=P2] & [P1wM1<=P2wM2 | P2s<=M3]] & ~ [[M1<=P1wM1 & 2<=P3]]]]

abstracting: (2<=P3) states: 574
abstracting: (M1<=P1wM1) states: 0
abstracting: (P2s<=M3) states: 3,444 (3)
abstracting: (P1wM1<=P2wM2) states: 2,790 (3)
abstracting: (3<=P2) states: 0
abstracting: (1<=P12M3) states: 240
-> the formula is FALSE

FORMULA FMS-PT-002-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[P1<=P12 | ~ [3<=P1wP2]] & [[P1<=M1 & P1d<=P1] | [2<=P3 | P1<=P12wM3]]]]
normalized: ~ [E [true U ~ [[[P1<=P12 | ~ [3<=P1wP2]] & [[2<=P3 | P1<=P12wM3] | [P1<=M1 & P1d<=P1]]]]]]

abstracting: (P1d<=P1) states: 2,700 (3)
abstracting: (P1<=M1) states: 3,444 (3)
abstracting: (P1<=P12wM3) states: 2,616 (3)
abstracting: (2<=P3) states: 574
abstracting: (3<=P1wP2) states: 0
abstracting: (P1<=P12) states: 2,616 (3)
-> the formula is TRUE

FORMULA FMS-PT-002-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec


Total processing time: 0m 5.712sec


BK_STOP 1464439266978

--------------------
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:164 (8), effective:32 (1)

initing FirstDep: 0m 0.000sec


iterations count:97 (4), effective:15 (0)

iterations count:166 (8), effective:25 (1)

iterations count:123 (6), effective:21 (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-002"
export BK_EXAMINATION="ReachabilityCardinality"
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-002.tgz
mv S_FMS-PT-002 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-002, 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 r149kn-smll-146416259400637"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; 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 ;