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 DLCshifumi-PT-2a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468027000187
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464896722862


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: DLCshifumi_PT_2a
(NrP: 188 NrTr: 888 NrArc: 3166)

net check time: 0m 0.000sec

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

init dd package: 0m 4.026sec


RS generation: 0m 0.460sec


-> reachability set: #nodes 758 (7.6e+02) #states 474,756,150,994,301 (14)



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

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

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

FORMULA DLCshifumi-PT-2a-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA DLCshifumi-PT-2a-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

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

FORMULA DLCshifumi-PT-2a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p34<=p132]
normalized: ~ [E [true U ~ [p34<=p132]]]

abstracting: (p34<=p132) states: 474,756,150,994,301 (14)
-> the formula is TRUE

FORMULA DLCshifumi-PT-2a-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p30<=p137]
normalized: ~ [E [true U ~ [p30<=p137]]]

abstracting: (p30<=p137) states: 474,756,150,994,301 (14)
-> the formula is TRUE

FORMULA DLCshifumi-PT-2a-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p52<=p147]
normalized: ~ [E [true U ~ [p52<=p147]]]

abstracting: (p52<=p147) states: 474,756,150,994,301 (14)
-> the formula is TRUE

FORMULA DLCshifumi-PT-2a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[[2<=p13 | 3<=p174] | 3<=p61]]]
normalized: ~ [E [true U [3<=p61 | [2<=p13 | 3<=p174]]]]

abstracting: (3<=p174) states: 0
abstracting: (2<=p13) states: 0
abstracting: (3<=p61) states: 0
-> the formula is TRUE

FORMULA DLCshifumi-PT-2a-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [[3<=p154 & ~ [[p166<=p58 & p96<=p168]]]]
normalized: E [true U [3<=p154 & ~ [[p166<=p58 & p96<=p168]]]]

abstracting: (p96<=p168) states: 474,756,150,994,301 (14)
abstracting: (p166<=p58) states: 67,822,307,284,901 (13)
abstracting: (3<=p154) states: 0
-> the formula is FALSE

FORMULA DLCshifumi-PT-2a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[p166<=p151 | [~ [p153<=p179] | ~ [p68<=p103]]]]
normalized: ~ [E [true U ~ [[p166<=p151 | [~ [p68<=p103] | ~ [p153<=p179]]]]]]

abstracting: (p153<=p179) states: 474,756,150,994,301 (14)
abstracting: (p68<=p103) states: 416,622,744,750,101 (14)
abstracting: (p166<=p151) states: 474,756,150,994,301 (14)
-> the formula is TRUE

FORMULA DLCshifumi-PT-2a-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[~ [p41<=p147] & [p18<=p99 | [1<=p118 | 2<=p89]]]]
normalized: E [true U [~ [p41<=p147] & [p18<=p99 | [1<=p118 | 2<=p89]]]]

abstracting: (2<=p89) states: 0
abstracting: (1<=p118) states: 47,475,615,099,430 (13)
abstracting: (p18<=p99) states: 416,622,744,750,101 (14)
abstracting: (p41<=p147) states: 474,756,150,994,301 (14)
-> the formula is FALSE

FORMULA DLCshifumi-PT-2a-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [[[[1<=p159 | p73<=p111] | [1<=p24 & p98<=p59]] | 2<=p157]]
normalized: ~ [E [true U ~ [[2<=p157 | [[1<=p24 & p98<=p59] | [1<=p159 | p73<=p111]]]]]]

abstracting: (p73<=p111) states: 413,716,074,437,891 (14)
abstracting: (1<=p159) states: 474,756,150,994,300 (14)
abstracting: (p98<=p59) states: 416,622,744,750,101 (14)
abstracting: (1<=p24) states: 67,822,307,284,900 (13)
abstracting: (2<=p157) states: 0
-> the formula is TRUE

FORMULA DLCshifumi-PT-2a-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[[[p131<=p124 | 3<=p16] & p97<=p77] | ~ [~ [p79<=p28]]]]
normalized: ~ [E [true U ~ [[p79<=p28 | [p97<=p77 & [p131<=p124 | 3<=p16]]]]]]

abstracting: (3<=p16) states: 0
abstracting: (p131<=p124) states: 47,475,615,099,431 (13)
abstracting: (p97<=p77) states: 416,622,744,750,101 (14)
abstracting: (p79<=p28) states: 416,622,744,750,101 (14)
-> the formula is FALSE

FORMULA DLCshifumi-PT-2a-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.103sec

checking: EF [[[~ [2<=p155] | [2<=p176 & p149<=p130]] & [[2<=p136 & 3<=p186] & ~ [p162<=p80]]]]
normalized: E [true U [[~ [p162<=p80] & [2<=p136 & 3<=p186]] & [[2<=p176 & p149<=p130] | ~ [2<=p155]]]]

abstracting: (2<=p155) states: 0
abstracting: (p149<=p130) states: 474,756,150,994,301 (14)
abstracting: (2<=p176) states: 0
abstracting: (3<=p186) states: 0
abstracting: (2<=p136) states: 0
abstracting: (p162<=p80) states: 67,822,307,284,901 (13)
-> the formula is FALSE

FORMULA DLCshifumi-PT-2a-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[[[2<=p95 & p94<=p108] & ~ [2<=p146]] & ~ [[p32<=p25 | p137<=p129]]]]
normalized: E [true U [~ [[p32<=p25 | p137<=p129]] & [~ [2<=p146] & [2<=p95 & p94<=p108]]]]

abstracting: (p94<=p108) states: 413,716,074,437,891 (14)
abstracting: (2<=p95) states: 0
abstracting: (2<=p146) states: 0
abstracting: (p137<=p129) states: 474,756,150,994,301 (14)
abstracting: (p32<=p25) states: 416,622,744,750,101 (14)
-> the formula is FALSE

FORMULA DLCshifumi-PT-2a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[[[p21<=p53 | 2<=p18] | [3<=p182 | p50<=p117]] | [[3<=p40 | p70<=p98] | ~ [p23<=p159]]]]
normalized: ~ [E [true U ~ [[[[3<=p182 | p50<=p117] | [p21<=p53 | 2<=p18]] | [[3<=p40 | p70<=p98] | ~ [p23<=p159]]]]]]

abstracting: (p23<=p159) states: 474,756,150,994,301 (14)
abstracting: (p70<=p98) states: 416,622,744,750,101 (14)
abstracting: (3<=p40) states: 0
abstracting: (2<=p18) states: 0
abstracting: (p21<=p53) states: 416,622,744,750,101 (14)
abstracting: (p50<=p117) states: 413,716,074,437,891 (14)
abstracting: (3<=p182) states: 0
-> the formula is FALSE

FORMULA DLCshifumi-PT-2a-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.091sec

checking: AG [[[[p106<=p15 & 2<=p37] | [1<=p134 | p38<=p132]] & [[p162<=p48 | p34<=p148] | [1<=p56 | p63<=p130]]]]
normalized: ~ [E [true U ~ [[[[p106<=p15 & 2<=p37] | [1<=p134 | p38<=p132]] & [[1<=p56 | p63<=p130] | [p162<=p48 | p34<=p148]]]]]]

abstracting: (p34<=p148) states: 474,756,150,994,301 (14)
abstracting: (p162<=p48) states: 67,822,307,284,901 (13)
abstracting: (p63<=p130) states: 474,756,150,994,301 (14)
abstracting: (1<=p56) states: 67,822,307,284,900 (13)
abstracting: (p38<=p132) states: 474,756,150,994,301 (14)
abstracting: (1<=p134) states: 474,756,150,994,300 (14)
abstracting: (2<=p37) states: 0
abstracting: (p106<=p15) states: 434,062,766,623,361 (14)
-> the formula is TRUE

FORMULA DLCshifumi-PT-2a-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec


Total processing time: 0m 6.476sec


BK_STOP 1464896729376

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

383 477 490 687 694 698 702 710 717 724 731 738 745 752
iterations count:14936 (16), effective:109 (0)

initing FirstDep: 0m 0.003sec

572 758
iterations count:2313 (2), effective:9 (0)
563 758
iterations count:2861 (3), effective:21 (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="DLCshifumi-PT-2a"
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/DLCshifumi-PT-2a.tgz
mv DLCshifumi-PT-2a 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 DLCshifumi-PT-2a, 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 r221su-smll-146468027000187"
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 ;