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-3254
Executing tool marcie
Input is S_IBM319-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r111-blw7-149441636800066
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494775428239

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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 --memory=6

parse successfull
net created successfully

Net: IBM319_PT_none
(NrP: 253 NrTr: 178 NrArc: 526)

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

net check time: 0m 0.000sec

init dd package: 0m 1.117sec


RS generation: 0m 0.003sec


-> reachability set: #nodes 401 (4.0e+02) #states 2,482 (3)



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

checking: EG [AF [~ [3<=callToProcess_s00002499_input_s00001052]]]
normalized: EG [~ [EG [3<=callToProcess_s00002499_input_s00001052]]]

abstracting: (3<=callToProcess_s00002499_input_s00001052)
states: 0
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA IBM319-PT-none-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: AF [EG [~ [2<=decision_s00002055_input_s00001052]]]
normalized: ~ [EG [~ [EG [~ [2<=decision_s00002055_input_s00001052]]]]]

abstracting: (2<=decision_s00002055_input_s00001052)
states: 0

EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA IBM319-PT-none-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [AG [callToTask_s00002931_input_s00001052<=callToTask_s00002964_output_s00001054]]
normalized: E [true U ~ [E [true U ~ [callToTask_s00002931_input_s00001052<=callToTask_s00002964_output_s00001054]]]]

abstracting: (callToTask_s00002931_input_s00001052<=callToTask_s00002964_output_s00001054)
states: 2,332 (3)
-> the formula is TRUE

FORMULA IBM319-PT-none-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

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

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

FORMULA IBM319-PT-none-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [AX [~ [decision_s00002948_activated<=callToTask_s00002931_output_s00001077]]]
normalized: ~ [EG [EX [decision_s00002948_activated<=callToTask_s00002931_output_s00001077]]]

abstracting: (decision_s00002948_activated<=callToTask_s00002931_output_s00001077)
states: 2,479 (3)
..................................................................................................................................
EG iterations: 129
-> the formula is TRUE

FORMULA IBM319-PT-none-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.131sec

checking: AF [EG [~ [callToTask_s00002964_input_s00001066<=callToTask_s00002930_inputCriterion_s00001053_used]]]
normalized: ~ [EG [~ [EG [~ [callToTask_s00002964_input_s00001066<=callToTask_s00002930_inputCriterion_s00001053_used]]]]]

abstracting: (callToTask_s00002964_input_s00001066<=callToTask_s00002930_inputCriterion_s00001053_used)
states: 2,437 (3)
...............
EG iterations: 15

EG iterations: 0
-> the formula is FALSE

FORMULA IBM319-PT-none-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: ~ [E [~ [2<=callToTask_s00002957_input_s00001052] U 3<=decision_s00001159_activated]]
normalized: ~ [E [~ [2<=callToTask_s00002957_input_s00001052] U 3<=decision_s00001159_activated]]

abstracting: (3<=decision_s00001159_activated)
states: 0
abstracting: (2<=callToTask_s00002957_input_s00001052)
states: 0
-> the formula is TRUE

FORMULA IBM319-PT-none-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [EG [decision_s00001841_activated<=callToProcess_s00002121_inputCriterion_s00001053_used]]
normalized: ~ [EX [~ [EG [decision_s00001841_activated<=callToProcess_s00002121_inputCriterion_s00001053_used]]]]

abstracting: (decision_s00001841_activated<=callToProcess_s00002121_inputCriterion_s00001053_used)
states: 2,332 (3)
.................................
EG iterations: 33
.-> the formula is TRUE

FORMULA IBM319-PT-none-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.310sec

checking: AF [[AG [callToProcess_s00002944_inputCriterion_s00001053_used<=callToTask_s00002929_input_s00001066] & 3<=callToTask_s00002964_output_s00001077]]
normalized: ~ [EG [~ [[~ [E [true U ~ [callToProcess_s00002944_inputCriterion_s00001053_used<=callToTask_s00002929_input_s00001066]]] & 3<=callToTask_s00002964_output_s00001077]]]]

abstracting: (3<=callToTask_s00002964_output_s00001077)
states: 0
abstracting: (callToProcess_s00002944_inputCriterion_s00001053_used<=callToTask_s00002929_input_s00001066)
states: 2,480 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA IBM319-PT-none-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [AX [AG [merge_s00002240_input_s00001052<=merge_s00002241_input_s00001127]] | 3<=callToTask_s00002961_output_s00001054]
normalized: [~ [EX [E [true U ~ [merge_s00002240_input_s00001052<=merge_s00002241_input_s00001127]]]] | 3<=callToTask_s00002961_output_s00001054]

abstracting: (3<=callToTask_s00002961_output_s00001054)
states: 0
abstracting: (merge_s00002240_input_s00001052<=merge_s00002241_input_s00001127)
states: 2,440 (3)
.-> the formula is FALSE

FORMULA IBM319-PT-none-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: EG [EG [[callToTask_s00002869_input_s00001066<=callToTask_s00002951_inputCriterion_s00001053_used | 3<=merge_s00001160_input_s00001052]]]
normalized: EG [EG [[callToTask_s00002869_input_s00001066<=callToTask_s00002951_inputCriterion_s00001053_used | 3<=merge_s00001160_input_s00001052]]]

abstracting: (3<=merge_s00001160_input_s00001052)
states: 0
abstracting: (callToTask_s00002869_input_s00001066<=callToTask_s00002951_inputCriterion_s00001053_used)
states: 2,480 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA IBM319-PT-none-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AG [AF [[callToTask_s00002960_input_s00001127<=callToTask_s00002950_input_s00001052 & 3<=callToTask_s00002870_inputCriterion_s00001053_used]]]
normalized: ~ [E [true U EG [~ [[callToTask_s00002960_input_s00001127<=callToTask_s00002950_input_s00001052 & 3<=callToTask_s00002870_inputCriterion_s00001053_used]]]]]

abstracting: (3<=callToTask_s00002870_inputCriterion_s00001053_used)
states: 0
abstracting: (callToTask_s00002960_input_s00001127<=callToTask_s00002950_input_s00001052)
states: 2,477 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA IBM319-PT-none-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AF [EG [[callToTask_s00002963_input_s00001066<=callToTask_s00002959_output_s00001054 & callToTask_s00002667_input_s00001052<=callToTask_s00002960_output_s00001054]]]
normalized: ~ [EG [~ [EG [[callToTask_s00002963_input_s00001066<=callToTask_s00002959_output_s00001054 & callToTask_s00002667_input_s00001052<=callToTask_s00002960_output_s00001054]]]]]

abstracting: (callToTask_s00002667_input_s00001052<=callToTask_s00002960_output_s00001054)
states: 2,479 (3)
abstracting: (callToTask_s00002963_input_s00001066<=callToTask_s00002959_output_s00001054)
states: 2,479 (3)
.
EG iterations: 1
...
EG iterations: 3
-> the formula is TRUE

FORMULA IBM319-PT-none-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: [AX [~ [2<=merge_s00002239_input_s00001128]] & [AF [~ [callToTask_s00002964_output_s00001054<=callToTask_s00002956_input_s00001066]] | AX [~ [callToProcess_s00002802_inputCriterion_s00001053_used<=callToTask_s00001168_inputCriterion_s00001053_used]]]]
normalized: [~ [EX [2<=merge_s00002239_input_s00001128]] & [~ [EG [callToTask_s00002964_output_s00001054<=callToTask_s00002956_input_s00001066]] | ~ [EX [callToProcess_s00002802_inputCriterion_s00001053_used<=callToTask_s00001168_inputCriterion_s00001053_used]]]]

abstracting: (callToProcess_s00002802_inputCriterion_s00001053_used<=callToTask_s00001168_inputCriterion_s00001053_used)
states: 2,479 (3)
.abstracting: (callToTask_s00002964_output_s00001054<=callToTask_s00002956_input_s00001066)
states: 2,437 (3)
................
EG iterations: 16
abstracting: (2<=merge_s00002239_input_s00001128)
states: 0
.-> the formula is FALSE

FORMULA IBM319-PT-none-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.092sec

checking: A [~ [2<=callToTask_s00001406_input_s00001066] U [[2<=decision_s00001841_input_s00001052 & 2<=callToTask_s00002063_input_s00001066] & callToProcess_s00002943_output_s00001077<=decision_s00001841_input_s00001052]]
normalized: [~ [EG [~ [[[2<=decision_s00001841_input_s00001052 & 2<=callToTask_s00002063_input_s00001066] & callToProcess_s00002943_output_s00001077<=decision_s00001841_input_s00001052]]]] & ~ [E [~ [[[2<=decision_s00001841_input_s00001052 & 2<=callToTask_s00002063_input_s00001066] & callToProcess_s00002943_output_s00001077<=decision_s00001841_input_s00001052]] U [~ [[[2<=decision_s00001841_input_s00001052 & 2<=callToTask_s00002063_input_s00001066] & callToProcess_s00002943_output_s00001077<=decision_s00001841_input_s00001052]] & 2<=callToTask_s00001406_input_s00001066]]]]

abstracting: (2<=callToTask_s00001406_input_s00001066)
states: 0
abstracting: (callToProcess_s00002943_output_s00001077<=decision_s00001841_input_s00001052)
states: 2,479 (3)
abstracting: (2<=callToTask_s00002063_input_s00001066)
states: 0
abstracting: (2<=decision_s00001841_input_s00001052)
states: 0
abstracting: (callToProcess_s00002943_output_s00001077<=decision_s00001841_input_s00001052)
states: 2,479 (3)
abstracting: (2<=callToTask_s00002063_input_s00001066)
states: 0
abstracting: (2<=decision_s00001841_input_s00001052)
states: 0
abstracting: (callToProcess_s00002943_output_s00001077<=decision_s00001841_input_s00001052)
states: 2,479 (3)
abstracting: (2<=callToTask_s00002063_input_s00001066)
states: 0
abstracting: (2<=decision_s00001841_input_s00001052)
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA IBM319-PT-none-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [[[merge_s00002239_input_s00001066<=merge_s00002239_input_s00001068 & [~ [1<=decision_s00001158_activated] & [callToTask_s00002929_inputCriterion_s00001053_used<=callToTask_s00002963_output_s00001077 | merge_s00001161_input_s00001052<=callToTask_s00002959_input_s00001066]]] & [AG [callToTask_s00002044_output_s00001077<=callToTask_s00001406_input_s00001052] & [callToProcess_s00002882_output_s00001077<=join_s00001164_activated_s00001062 | ~ [1<=merge_s00001160_input_s00001129]]]] | ~ [[AF [process_s00000343__s00003019_input_s00001109<=merge_s00002240_input_s00001127] | ~ [~ [1<=callToTask_s00002896_inputCriterion_s00001053_used]]]]]
normalized: [[[~ [E [true U ~ [callToTask_s00002044_output_s00001077<=callToTask_s00001406_input_s00001052]]] & [~ [1<=merge_s00001160_input_s00001129] | callToProcess_s00002882_output_s00001077<=join_s00001164_activated_s00001062]] & [[~ [1<=decision_s00001158_activated] & [callToTask_s00002929_inputCriterion_s00001053_used<=callToTask_s00002963_output_s00001077 | merge_s00001161_input_s00001052<=callToTask_s00002959_input_s00001066]] & merge_s00002239_input_s00001066<=merge_s00002239_input_s00001068]] | ~ [[~ [EG [~ [process_s00000343__s00003019_input_s00001109<=merge_s00002240_input_s00001127]]] | 1<=callToTask_s00002896_inputCriterion_s00001053_used]]]

abstracting: (1<=callToTask_s00002896_inputCriterion_s00001053_used)
states: 3
abstracting: (process_s00000343__s00003019_input_s00001109<=merge_s00002240_input_s00001127)
states: 2,481 (3)
..
EG iterations: 2
abstracting: (merge_s00002239_input_s00001066<=merge_s00002239_input_s00001068)
states: 2,479 (3)
abstracting: (merge_s00001161_input_s00001052<=callToTask_s00002959_input_s00001066)
states: 2,332 (3)
abstracting: (callToTask_s00002929_inputCriterion_s00001053_used<=callToTask_s00002963_output_s00001077)
states: 2,479 (3)
abstracting: (1<=decision_s00001158_activated)
states: 45
abstracting: (callToProcess_s00002882_output_s00001077<=join_s00001164_activated_s00001062)
states: 2,479 (3)
abstracting: (1<=merge_s00001160_input_s00001129)
states: 3
abstracting: (callToTask_s00002044_output_s00001077<=callToTask_s00001406_input_s00001052)
states: 2,437 (3)
-> the formula is FALSE

FORMULA IBM319-PT-none-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

totally nodes used: 771399(7.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 616032 1177157 1793189
used/not used/entry size/cache size: 907695 66201169 16 1024MB
basic ops cache: hits/miss/sum: 96641 929436 1026077
used/not used/entry size/cache size: 2242685 14534531 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 2229 2415 4644
used/not used/entry size/cache size: 2414 2094738 32 64MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66354223
1 738538
2 15462
3 628
4 12
5 1
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 2.327sec


BK_STOP 1494775430594

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
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


iterations count:1019 (5), effective:161 (0)

initing FirstDep: 0m 0.000sec


iterations count:294 (1), effective:44 (0)

iterations count:292 (1), effective:45 (0)

iterations count:192 (1), effective:6 (0)

iterations count:505 (2), effective:99 (0)

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

iterations count:481 (2), effective:96 (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_IBM319-PT-none"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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_IBM319-PT-none.tgz
mv S_IBM319-PT-none execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is S_IBM319-PT-none, 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 r111-blw7-149441636800066"
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 ;