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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468027000183
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464896644222


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: 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.016sec

init dd package: 0m 3.691sec


RS generation: 0m 0.438sec


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



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

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

abstracting: (1<=p119) states: 47,475,615,099,430 (13)
-> the formula is TRUE

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

MC time: 0m 0.175sec

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

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

FORMULA DLCshifumi-PT-2a-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

FORMULA DLCshifumi-PT-2a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [~ [[1<=p38 & 2<=p54]]]]
normalized: E [true U [1<=p38 & 2<=p54]]

abstracting: (2<=p54) states: 0
abstracting: (1<=p38) states: 67,822,307,284,900 (13)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: [~ [~ [~ [3<=p80]]] & EF [EF [3<=p127]]]
normalized: [E [true U E [true U 3<=p127]] & ~ [3<=p80]]

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

FORMULA DLCshifumi-PT-2a-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[EX [1<=p98] & AX [2<=p18]]]
normalized: E [true U [~ [EX [~ [2<=p18]]] & EX [1<=p98]]]

abstracting: (1<=p98) states: 67,822,307,284,900 (13)
.abstracting: (2<=p18) states: 0
.-> the formula is FALSE

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

MC time: 0m 0.008sec

checking: E [EF [p148<=p69] U AG [3<=p115]]
normalized: E [E [true U p148<=p69] U ~ [E [true U ~ [3<=p115]]]]

abstracting: (3<=p115) states: 0
abstracting: (p148<=p69) states: 67,822,307,284,901 (13)
-> the formula is FALSE

FORMULA DLCshifumi-PT-2a-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: ~ [[[EX [2<=p179] | EF [2<=p135]] & p180<=p62]]
normalized: ~ [[p180<=p62 & [EX [2<=p179] | E [true U 2<=p135]]]]

abstracting: (2<=p135) states: 0
abstracting: (2<=p179) states: 0
.abstracting: (p180<=p62) states: 67,822,307,284,901 (13)
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: AG [A [p39<=p163 U p111<=p47]]
normalized: ~ [E [true U ~ [[~ [E [~ [p111<=p47] U [~ [p39<=p163] & ~ [p111<=p47]]]] & ~ [EG [~ [p111<=p47]]]]]]]

abstracting: (p111<=p47) states: 434,062,766,623,361 (14)
.
EG iterations: 1
abstracting: (p111<=p47) states: 434,062,766,623,361 (14)
abstracting: (p39<=p163) states: 474,756,150,994,301 (14)
abstracting: (p111<=p47) states: 434,062,766,623,361 (14)
-> the formula is FALSE

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

MC time: 0m 0.146sec

checking: EG [AG [[p29<=p61 | p10<=p22]]]
normalized: EG [~ [E [true U ~ [[p29<=p61 | p10<=p22]]]]]

abstracting: (p10<=p22) states: 416,622,744,750,101 (14)
abstracting: (p29<=p61) states: 416,622,744,750,101 (14)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.077sec

checking: AG [[EG [p3<=p160] | AX [p70<=p161]]]
normalized: ~ [E [true U ~ [[EG [p3<=p160] | ~ [EX [~ [p70<=p161]]]]]]]

abstracting: (p70<=p161) states: 474,756,150,994,301 (14)
.abstracting: (p3<=p160) states: 474,756,150,994,301 (14)

EG iterations: 0
-> the formula is TRUE

FORMULA DLCshifumi-PT-2a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [[[3<=p95 | 3<=p93] | [p136<=p129 | 2<=p44]] U EF [3<=p52]]
normalized: [~ [E [~ [E [true U 3<=p52]] U [~ [E [true U 3<=p52]] & ~ [[[p136<=p129 | 2<=p44] | [3<=p95 | 3<=p93]]]]]] & ~ [EG [~ [E [true U 3<=p52]]]]]

abstracting: (3<=p52) states: 0

EG iterations: 0
abstracting: (3<=p93) states: 0
abstracting: (3<=p95) states: 0
abstracting: (2<=p44) states: 0
abstracting: (p136<=p129) states: 474,756,150,994,301 (14)
abstracting: (3<=p52) states: 0
abstracting: (3<=p52) states: 0
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EF [[[p168<=p121 & 3<=p7] & [[1<=p5 | p183<=p18] | p151<=p14]]]
normalized: E [true U [[p151<=p14 | [1<=p5 | p183<=p18]] & [p168<=p121 & 3<=p7]]]

abstracting: (3<=p7) states: 0
abstracting: (p168<=p121) states: 47,475,615,099,431 (13)
abstracting: (p183<=p18) states: 67,822,307,284,901 (13)
abstracting: (1<=p5) states: 67,822,307,284,900 (13)
abstracting: (p151<=p14) states: 67,822,307,284,901 (13)
-> the formula is FALSE

FORMULA DLCshifumi-PT-2a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [[EX [[p39<=p126 | 2<=p110]] | ~ [[[1<=p167 & 2<=p6] | [2<=p7 & 2<=p40]]]] & ~ [[AG [p25<=p161] & ~ [1<=p71]]]]
normalized: [~ [[~ [1<=p71] & ~ [E [true U ~ [p25<=p161]]]]] & [~ [[[1<=p167 & 2<=p6] | [2<=p7 & 2<=p40]]] | EX [[p39<=p126 | 2<=p110]]]]

abstracting: (2<=p110) states: 0
abstracting: (p39<=p126) states: 474,756,150,994,301 (14)
.abstracting: (2<=p40) states: 0
abstracting: (2<=p7) states: 0
abstracting: (2<=p6) states: 0
abstracting: (1<=p167) states: 474,756,150,994,300 (14)
abstracting: (p25<=p161) states: 474,756,150,994,301 (14)
abstracting: (1<=p71) states: 67,822,307,284,900 (13)
-> the formula is FALSE

FORMULA DLCshifumi-PT-2a-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: A [[[p34<=p89 | p69<=p38] | [p80<=p177 & p92<=p61]] U AG [p71<=p141]]
normalized: [~ [E [E [true U ~ [p71<=p141]] U [~ [[[p34<=p89 | p69<=p38] | [p80<=p177 & p92<=p61]]] & E [true U ~ [p71<=p141]]]]] & ~ [EG [E [true U ~ [p71<=p141]]]]]

abstracting: (p71<=p141) states: 474,756,150,994,301 (14)
.
EG iterations: 1
abstracting: (p71<=p141) states: 474,756,150,994,301 (14)
abstracting: (p92<=p61) states: 416,622,744,750,101 (14)
abstracting: (p80<=p177) states: 474,756,150,994,301 (14)
abstracting: (p69<=p38) states: 416,622,744,750,101 (14)
abstracting: (p34<=p89) states: 416,622,744,750,101 (14)
abstracting: (p71<=p141) states: 474,756,150,994,301 (14)
-> the formula is TRUE

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

MC time: 0m 0.003sec


Total processing time: 0m 6.196sec


BK_STOP 1464896650453

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

565 573
iterations count:2919 (3), effective:10 (0)

iterations count:888 (1), effective:0 (0)

iterations count:888 (1), effective:0 (0)
753
iterations count:1410 (1), effective:6 (0)
369 569 758
iterations count:3496 (3), effective:11 (0)
573
iterations count:1890 (2), effective:15 (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="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/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 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 r221su-smll-146468027000183"
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 ;