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

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

=== Now, execution of the tool begins

BK_START 1464440176717


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_100
(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.816sec


RS generation: 0m38.548sec


-> reachability set: #nodes 138172 (1.4e+05) #states 2,703,057,272,484,320,385,816 (21)



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

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

abstracting: (3<=P12wM3) states: 1,946,771,430,088,951,462,080 (21)
-> the formula is TRUE

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

MC time: 0m21.208sec

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

abstracting: (3<=P2) states: 2,295,306,700,686,096,771,450 (21)
-> the formula is FALSE

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

MC time: 0m25.446sec

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

abstracting: (2<=P12s) states: 2,174,213,835,498,788,459,130 (21)
-> the formula is TRUE

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

MC time: 0m 5.136sec

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

abstracting: (1<=P12s) states: 2,425,562,975,054,125,720,725 (21)
-> the formula is TRUE

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

MC time: 0m 1.755sec

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

abstracting: (3<=P2wP1) states: 2,295,306,700,686,096,771,450 (21)
-> the formula is TRUE

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

MC time: 0m20.168sec

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

abstracting: (P12wM3<=P12s) states: 1,424,315,820,114,864,197,196 (21)
-> the formula is FALSE

FORMULA FMS-PT-100-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m50.996sec

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

abstracting: (P3M2<=P3) states: 1,364,910,107,888,122,175,016 (21)
-> the formula is TRUE

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

MC time: 0m48.680sec

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

abstracting: (P2<=P1d) states: 1,383,251,887,953,708,941,766 (21)
-> the formula is TRUE

FORMULA FMS-PT-100-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 3.625sec

checking: EF [~ [~ [[1<=P12M3 & P3<=P3M2]]]]
normalized: E [true U [1<=P12M3 & P3<=P3M2]]

abstracting: (P3<=P3M2) states: 1,364,910,107,888,122,175,016 (21)
abstracting: (1<=P12M3) states: 1,703,474,971,855,028,509,020 (21)
-> the formula is TRUE

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

MC time: 0m48.727sec

checking: EF [[[[2<=P2wP1 | 3<=P12M3] & [2<=P1wM1 & 3<=P12wM3]] & ~ [[3<=P2d & 2<=P3s]]]]
normalized: E [true U [~ [[3<=P2d & 2<=P3s]] & [[2<=P1wM1 & 3<=P12wM3] & [2<=P2wP1 | 3<=P12M3]]]]

abstracting: (3<=P12M3) states: 0
abstracting: (2<=P2wP1) states: 2,425,479,888,629,781,537,330 (21)
abstracting: (3<=P12wM3) states: 1,946,771,430,088,951,462,080 (21)
abstracting: (2<=P1wM1) states: 2,421,916,949,627,676,051,195 (21)
abstracting: (2<=P3s) states: 2,597,579,790,098,502,409,200 (21)
abstracting: (3<=P2d) states: 2,295,306,700,686,096,771,450 (21)
-> the formula is TRUE

FORMULA FMS-PT-100-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m17.103sec

checking: AG [[[P2d<=P3M2 | [P2d<=P2d | P12M3<=P2wP1]] | ~ [2<=P2s]]]
normalized: ~ [E [true U ~ [[~ [2<=P2s] | [P2d<=P3M2 | [P2d<=P2d | P12M3<=P2wP1]]]]]]

abstracting: (P12M3<=P2wP1) states: 2,572,394,345,134,732,062,321 (21)
abstracting: (P2d<=P2d) states: 2,703,057,272,484,320,385,816 (21)
abstracting: (P2d<=P3M2) states: 2,011,406,185,933,851,091,236 (21)
abstracting: (2<=P2s) states: 2,425,479,888,629,781,537,330 (21)
-> the formula is TRUE

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

MC time: 0m46.230sec

checking: AG [[[[P12<=P2s & P2wP1<=P1] & ~ [P3s<=P1d]] | P2wM2<=P3]]
normalized: ~ [E [true U ~ [[P2wM2<=P3 | [~ [P3s<=P1d] & [P12<=P2s & P2wP1<=P1]]]]]]


before gc: list nodes free: 480

after gc: idd nodes used:138292, unused:63861708; list nodes free:680229700
abstracting: (P2wP1<=P1) states: 1,383,251,887,953,708,941,766 (21)
abstracting: (P12<=P2s) states: 1,828,599,502,907,092,034,496 (21)

before gc: list nodes free: 778

after gc: idd nodes used:5937415, unused:58062585; list nodes free:502824218

FORMULA FMS-PT-100-ReachabilityCardinality-3 CANNOT_COMPUTE


BK_STOP 1464442004540

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

7461 31886 42068 83337 213957 272960 138172
iterations count:7220 (361), effective:1600 (80)

initing FirstDep: 0m 0.000sec


iterations count:263 (13), effective:42 (2)

iterations count:314 (15), effective:98 (4)

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

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

iterations count:161 (8), effective:27 (1)

iterations count:893 (44), effective:113 (5)

iterations count:73 (3), effective:52 (2)

iterations count:320 (16), effective:100 (5)

iterations count:150 (7), effective:64 (3)

iterations count:554 (27), effective:171 (8)
std::bad_alloc

/home/mcc/BenchKit/BenchKit_head.sh: line 13: 325 Killed ${TIMEOUT} marcie --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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-100"
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-100.tgz
mv S_FMS-PT-100 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-100, 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-146416259400682"
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 ;