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

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

=== Now, execution of the tool begins

BK_START 1464164220591


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

net check time: 0m 0.001sec

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

init dd package: 0m42.272sec


RS generation: 0m 0.425sec


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



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

checking: ~ [AF [EF [2<=p3_19]]]
normalized: EG [~ [E [true U 2<=p3_19]]]

abstracting: (2<=p3_19) states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA Dekker-PT-020-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

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

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

MC time: 0m 0.000sec

checking: AF [EF [[1<=p0_3 & 3<=p3_18]]]
normalized: ~ [EG [~ [E [true U [1<=p0_3 & 3<=p3_18]]]]]

abstracting: (3<=p3_18) states: 0
abstracting: (1<=p0_3) states: 5,505,024 (6)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: p1_5<=flag_0_7
normalized: p1_5<=flag_0_7

abstracting: (p1_5<=flag_0_7) states: 8,650,752 (6)
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: A [AF [flag_0_12<=p0_17] U EG [p0_17<=p0_9]]
normalized: [~ [EG [~ [EG [p0_17<=p0_9]]]] & ~ [E [~ [EG [p0_17<=p0_9]] U [EG [~ [flag_0_12<=p0_17]] & ~ [EG [p0_17<=p0_9]]]]]]

abstracting: (p0_17<=p0_9) states: 8,650,752 (6)
.
EG iterations: 1
abstracting: (flag_0_12<=p0_17) states: 8,650,752 (6)
.
EG iterations: 1
abstracting: (p0_17<=p0_9) states: 8,650,752 (6)
.
EG iterations: 1
abstracting: (p0_17<=p0_9) states: 8,650,752 (6)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-020-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.265sec

checking: E [[p3_4<=flag_0_19 | p1_17<=p1_16] U AG [1<=p3_0]]
normalized: E [[p3_4<=flag_0_19 | p1_17<=p1_16] U ~ [E [true U ~ [1<=p3_0]]]]

abstracting: (1<=p3_0) states: 524,288 (5)
abstracting: (p1_17<=p1_16) states: 8,650,752 (6)
abstracting: (p3_4<=flag_0_19) states: 11,272,192 (7)
-> the formula is FALSE

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

MC time: 0m 0.231sec

checking: AG [[AG [p1_9<=flag_0_18] | [~ [3<=flag_1_4] | flag_1_2<=p0_0]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [p1_9<=flag_0_18]]] | [flag_1_2<=p0_0 | ~ [3<=flag_1_4]]]]]]

abstracting: (3<=flag_1_4) states: 0
abstracting: (flag_1_2<=p0_0) states: 8,388,608 (6)
abstracting: (p1_9<=flag_0_18) states: 8,650,752 (6)
-> the formula is TRUE

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

MC time: 0m 0.095sec

checking: E [EF [p1_9<=p1_5] U ~ [[p3_15<=p3_9 & 3<=flag_1_6]]]
normalized: E [E [true U p1_9<=p1_5] U ~ [[p3_15<=p3_9 & 3<=flag_1_6]]]

abstracting: (3<=flag_1_6) states: 0
abstracting: (p3_15<=p3_9) states: 11,010,048 (7)
abstracting: (p1_9<=p1_5) states: 8,650,752 (6)
-> the formula is TRUE

FORMULA Dekker-PT-020-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.063sec

checking: A [[[2<=p3_5 & flag_1_13<=flag_0_17] | ~ [p0_6<=flag_0_12]] U EF [3<=p3_11]]
normalized: [~ [EG [~ [E [true U 3<=p3_11]]]] & ~ [E [~ [E [true U 3<=p3_11]] U [~ [E [true U 3<=p3_11]] & ~ [[[2<=p3_5 & flag_1_13<=flag_0_17] | ~ [p0_6<=flag_0_12]]]]]]]

abstracting: (p0_6<=flag_0_12) states: 8,650,752 (6)
abstracting: (flag_1_13<=flag_0_17) states: 8,388,608 (6)
abstracting: (2<=p3_5) states: 0
abstracting: (3<=p3_11) states: 0
abstracting: (3<=p3_11) states: 0
abstracting: (3<=p3_11) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.100sec

checking: A [[[p0_15<=p3_16 & 2<=p1_18] | ~ [p0_17<=p3_7]] U EF [3<=flag_0_17]]
normalized: [~ [EG [~ [E [true U 3<=flag_0_17]]]] & ~ [E [~ [E [true U 3<=flag_0_17]] U [~ [E [true U 3<=flag_0_17]] & ~ [[~ [p0_17<=p3_7] | [p0_15<=p3_16 & 2<=p1_18]]]]]]]

abstracting: (2<=p1_18) states: 0
abstracting: (p0_15<=p3_16) states: 6,291,456 (6)
abstracting: (p0_17<=p3_7) states: 6,291,456 (6)
abstracting: (3<=flag_0_17) states: 0
abstracting: (3<=flag_0_17) states: 0
abstracting: (3<=flag_0_17) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.171sec

checking: EF [[AG [p0_13<=flag_0_14] & [flag_0_5<=p0_9 | [3<=p3_2 | p0_17<=p3_16]]]]
normalized: E [true U [[flag_0_5<=p0_9 | [3<=p3_2 | p0_17<=p3_16]] & ~ [E [true U ~ [p0_13<=flag_0_14]]]]]

abstracting: (p0_13<=flag_0_14) states: 8,650,752 (6)
abstracting: (p0_17<=p3_16) states: 6,291,456 (6)
abstracting: (3<=p3_2) states: 0
abstracting: (flag_0_5<=p0_9) states: 8,650,752 (6)
-> the formula is FALSE

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

MC time: 0m 0.054sec

checking: AX [~ [[[p0_16<=p3_11 | flag_1_16<=flag_1_2] & [2<=p3_2 & flag_0_19<=p1_19]]]]
normalized: ~ [EX [[[p0_16<=p3_11 | flag_1_16<=flag_1_2] & [2<=p3_2 & flag_0_19<=p1_19]]]]

abstracting: (flag_0_19<=p1_19) states: 6,029,312 (6)
abstracting: (2<=p3_2) states: 0
abstracting: (flag_1_16<=flag_1_2) states: 8,650,752 (6)
abstracting: (p0_16<=p3_11) states: 6,291,456 (6)
.-> the formula is TRUE

FORMULA Dekker-PT-020-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: E [~ [[p0_15<=flag_1_6 & 3<=p3_15]] U [[flag_1_17<=p3_15 | p0_1<=p0_2] & 3<=p1_4]]
normalized: E [~ [[p0_15<=flag_1_6 & 3<=p3_15]] U [3<=p1_4 & [flag_1_17<=p3_15 | p0_1<=p0_2]]]

abstracting: (p0_1<=p0_2) states: 8,650,752 (6)
abstracting: (flag_1_17<=p3_15) states: 5,767,168 (6)
abstracting: (3<=p1_4) states: 0
abstracting: (3<=p3_15) states: 0
abstracting: (p0_15<=flag_1_6) states: 8,912,896 (6)
-> the formula is FALSE

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

MC time: 0m 0.007sec

checking: E [[p0_16<=p1_17 | [p3_2<=p1_17 & flag_1_19<=flag_0_5]] U EF [p1_12<=flag_1_12]]
normalized: E [[p0_16<=p1_17 | [p3_2<=p1_17 & flag_1_19<=flag_0_5]] U E [true U p1_12<=flag_1_12]]

abstracting: (p1_12<=flag_1_12) states: 11,534,336 (7)
abstracting: (flag_1_19<=flag_0_5) states: 8,388,608 (6)
abstracting: (p3_2<=p1_17) states: 11,272,192 (7)
abstracting: (p0_16<=p1_17) states: 8,650,752 (6)
-> the formula is TRUE

FORMULA Dekker-PT-020-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: [[[[flag_1_9<=p3_9 | [2<=flag_0_13 & 2<=p3_11]] & [1<=p0_13 | [2<=p3_17 & 3<=flag_0_1]]] | ~ [p3_2<=flag_1_2]] | EX [1<=flag_0_11]]
normalized: [EX [1<=flag_0_11] | [~ [p3_2<=flag_1_2] | [[1<=p0_13 | [2<=p3_17 & 3<=flag_0_1]] & [flag_1_9<=p3_9 | [2<=flag_0_13 & 2<=p3_11]]]]]

abstracting: (2<=p3_11) states: 0
abstracting: (2<=flag_0_13) states: 0
abstracting: (flag_1_9<=p3_9) states: 6,029,312 (6)
abstracting: (3<=flag_0_1) states: 0
abstracting: (2<=p3_17) states: 0
abstracting: (1<=p0_13) states: 5,505,024 (6)
abstracting: (p3_2<=flag_1_2) states: 11,534,336 (7)
abstracting: (1<=flag_0_11) states: 5,505,024 (6)
.-> the formula is TRUE

FORMULA Dekker-PT-020-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: E [[2<=flag_1_6 | ~ [flag_1_5<=flag_0_19]] U [[p1_12<=p0_4 & 1<=p0_18] | [p3_11<=p1_5 | p1_18<=p1_5]]]
normalized: E [[2<=flag_1_6 | ~ [flag_1_5<=flag_0_19]] U [[p1_12<=p0_4 & 1<=p0_18] | [p3_11<=p1_5 | p1_18<=p1_5]]]

abstracting: (p1_18<=p1_5) states: 8,650,752 (6)
abstracting: (p3_11<=p1_5) states: 11,272,192 (7)
abstracting: (1<=p0_18) states: 5,505,024 (6)
abstracting: (p1_12<=p0_4) states: 8,650,752 (6)
abstracting: (flag_1_5<=flag_0_19) states: 8,388,608 (6)
abstracting: (2<=flag_1_6) states: 0
-> the formula is TRUE

FORMULA Dekker-PT-020-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.046sec


Total processing time: 0m46.202sec


BK_STOP 1464164266846

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


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

iterations count:577 (1), effective:3 (0)

iterations count:475 (1), effective:2 (0)

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

iterations count:469 (1), effective:1 (0)
1105 1080
iterations count:2423 (5), effective:78 (0)

iterations count:480 (1), effective:4 (0)

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

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

iterations count:440 (1), effective:0 (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="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/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 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 r149kn-smll-146416257900021"
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 ;