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

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

=== Now, execution of the tool begins

BK_START 1464164311597


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: Dekker_PT_020
(NrP: 100 NrTr: 440 NrArc: 3240)

net check time: 0m 0.000sec

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

init dd package: 0m35.653sec


RS generation: 0m 0.488sec


-> reachability set: #nodes 1185 (1.2e+03) #states 11,534,336 (7)



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

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

abstracting: (2<=p1_17) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-020-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [2<=flag_1_18]]
normalized: ~ [E [true U 2<=flag_1_18]]

abstracting: (2<=flag_1_18) states: 0
-> the formula is TRUE

FORMULA Dekker-PT-020-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (2<=p1_7) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-020-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p3_2<=p0_7]
normalized: ~ [E [true U ~ [p3_2<=p0_7]]]

abstracting: (p3_2<=p0_7) states: 11,272,192 (7)
-> the formula is FALSE

FORMULA Dekker-PT-020-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.391sec

checking: EF [~ [~ [~ [p3_16<=flag_1_16]]]]
normalized: E [true U ~ [p3_16<=flag_1_16]]

abstracting: (p3_16<=flag_1_16) states: 11,534,336 (7)
-> the formula is FALSE

FORMULA Dekker-PT-020-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p3_7<=p0_1]
normalized: ~ [E [true U ~ [p3_7<=p0_1]]]

abstracting: (p3_7<=p0_1) states: 11,272,192 (7)
-> the formula is FALSE

FORMULA Dekker-PT-020-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.124sec

checking: EF [[~ [3<=flag_1_3] & 2<=p0_7]]
normalized: E [true U [2<=p0_7 & ~ [3<=flag_1_3]]]

abstracting: (3<=flag_1_3) states: 0
abstracting: (2<=p0_7) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-020-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[3<=p3_17 & ~ [~ [p0_12<=p3_4]]]]
normalized: E [true U [3<=p3_17 & p0_12<=p3_4]]

abstracting: (p0_12<=p3_4) states: 6,291,456 (6)
abstracting: (3<=p3_17) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-020-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [[[p0_11<=flag_0_12 | flag_0_7<=p1_2] | ~ [2<=p1_9]]]]
normalized: E [true U ~ [[~ [2<=p1_9] | [p0_11<=flag_0_12 | flag_0_7<=p1_2]]]]

abstracting: (flag_0_7<=p1_2) states: 8,650,752 (6)
abstracting: (p0_11<=flag_0_12) states: 8,650,752 (6)
abstracting: (2<=p1_9) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-020-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[2<=p3_10 & [[3<=p3_5 & 1<=flag_0_6] & [3<=flag_0_17 | p3_13<=flag_0_3]]]]
normalized: E [true U [2<=p3_10 & [[3<=flag_0_17 | p3_13<=flag_0_3] & [3<=p3_5 & 1<=flag_0_6]]]]

abstracting: (1<=flag_0_6) states: 5,505,024 (6)
abstracting: (3<=p3_5) states: 0
abstracting: (p3_13<=flag_0_3) states: 11,272,192 (7)
abstracting: (3<=flag_0_17) states: 0
abstracting: (2<=p3_10) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-020-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [[[1<=flag_1_18 & ~ [flag_1_1<=p0_3]] & [1<=flag_1_15 & [3<=p3_12 & flag_1_14<=p3_4]]]]
normalized: E [true U [[1<=flag_1_15 & [3<=p3_12 & flag_1_14<=p3_4]] & [1<=flag_1_18 & ~ [flag_1_1<=p0_3]]]]

abstracting: (flag_1_1<=p0_3) states: 8,388,608 (6)
abstracting: (1<=flag_1_18) states: 6,029,312 (6)
abstracting: (flag_1_14<=p3_4) states: 5,767,168 (6)
abstracting: (3<=p3_12) states: 0
abstracting: (1<=flag_1_15) states: 6,029,312 (6)
-> the formula is FALSE

FORMULA Dekker-PT-020-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [[[3<=p0_11 & ~ [p0_0<=p3_14]] | [[flag_0_4<=p3_1 & 3<=p1_2] & ~ [3<=p3_13]]]]
normalized: E [true U [[3<=p0_11 & ~ [p0_0<=p3_14]] | [~ [3<=p3_13] & [flag_0_4<=p3_1 & 3<=p1_2]]]]

abstracting: (3<=p1_2) states: 0
abstracting: (flag_0_4<=p3_1) states: 6,291,456 (6)
abstracting: (3<=p3_13) states: 0
abstracting: (p0_0<=p3_14) states: 6,291,456 (6)
abstracting: (3<=p0_11) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-020-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [[[[1<=flag_1_8 & 3<=p0_9] & p3_4<=p3_8] | [p3_15<=p3_3 | [2<=p0_1 | p1_6<=p0_0]]]]
normalized: ~ [E [true U ~ [[[p3_15<=p3_3 | [2<=p0_1 | p1_6<=p0_0]] | [p3_4<=p3_8 & [1<=flag_1_8 & 3<=p0_9]]]]]]

abstracting: (3<=p0_9) states: 0
abstracting: (1<=flag_1_8) states: 6,029,312 (6)
abstracting: (p3_4<=p3_8) states: 11,010,048 (7)
abstracting: (p1_6<=p0_0) states: 8,650,752 (6)
abstracting: (2<=p0_1) states: 0
abstracting: (p3_15<=p3_3) states: 11,010,048 (7)
-> the formula is FALSE

FORMULA Dekker-PT-020-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.344sec

checking: EF [[[[p3_10<=p1_4 & 3<=p3_14] & [3<=p1_16 | flag_0_10<=flag_1_16]] | [2<=p0_0 & [2<=flag_1_2 | 1<=p1_0]]]]
normalized: E [true U [[2<=p0_0 & [2<=flag_1_2 | 1<=p1_0]] | [[p3_10<=p1_4 & 3<=p3_14] & [3<=p1_16 | flag_0_10<=flag_1_16]]]]

abstracting: (flag_0_10<=flag_1_16) states: 8,912,896 (6)
abstracting: (3<=p1_16) states: 0
abstracting: (3<=p3_14) states: 0
abstracting: (p3_10<=p1_4) states: 11,272,192 (7)
abstracting: (1<=p1_0) states: 5,505,024 (6)
abstracting: (2<=flag_1_2) states: 0
abstracting: (2<=p0_0) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-020-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [[[~ [3<=p0_6] | [flag_0_2<=flag_1_12 & p0_14<=flag_1_7]] | [~ [p1_1<=p3_5] & flag_0_10<=p3_2]]]
normalized: ~ [E [true U ~ [[[[flag_0_2<=flag_1_12 & p0_14<=flag_1_7] | ~ [3<=p0_6]] | [flag_0_10<=p3_2 & ~ [p1_1<=p3_5]]]]]]

abstracting: (p1_1<=p3_5) states: 6,291,456 (6)
abstracting: (flag_0_10<=p3_2) states: 6,291,456 (6)
abstracting: (3<=p0_6) states: 0
abstracting: (p0_14<=flag_1_7) states: 8,912,896 (6)
abstracting: (flag_0_2<=flag_1_12) states: 8,912,896 (6)
-> the formula is TRUE

FORMULA Dekker-PT-020-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AG [[[[p3_17<=flag_0_5 & 1<=flag_1_14] & [3<=flag_1_16 | 2<=p3_3]] | [[3<=flag_0_18 | p3_19<=p1_0] | [p1_13<=p0_1 | 3<=flag_0_5]]]]
normalized: ~ [E [true U ~ [[[[p1_13<=p0_1 | 3<=flag_0_5] | [3<=flag_0_18 | p3_19<=p1_0]] | [[3<=flag_1_16 | 2<=p3_3] & [p3_17<=flag_0_5 & 1<=flag_1_14]]]]]]

abstracting: (1<=flag_1_14) states: 6,029,312 (6)
abstracting: (p3_17<=flag_0_5) states: 11,272,192 (7)
abstracting: (2<=p3_3) states: 0
abstracting: (3<=flag_1_16) states: 0
abstracting: (p3_19<=p1_0) states: 11,272,192 (7)
abstracting: (3<=flag_0_18) states: 0
abstracting: (3<=flag_0_5) states: 0
abstracting: (p1_13<=p0_1) states: 8,650,752 (6)
-> the formula is FALSE

FORMULA Dekker-PT-020-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.152sec


Total processing time: 0m39.561sec


BK_STOP 1464164351205

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

245 260 289 354 296 344 390 350 458 637 1088
iterations count:11810 (26), effective:335 (0)

initing FirstDep: 0m 0.001sec

539 620 672 829
iterations count:4893 (11), effective:106 (0)
570 644 721 911
iterations count:4716 (10), effective:93 (0)
578 605 630 567 606 693 1049
iterations count:7275 (16), effective:202 (0)
640 705 766 1049
iterations count:4472 (10), effective:61 (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_Dekker-PT-020"
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_Dekker-PT-020.tgz
mv S_Dekker-PT-020 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_Dekker-PT-020, 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-146416257900025"
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 ;