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 IBM319-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065kn-blw3-146358913200030
=====================================================================

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


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: IBM319_PT_none
(NrP: 253 NrTr: 178 NrArc: 526)

net check time: 0m 0.002sec

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

init dd package: 0m 4.001sec


RS generation: 0m 0.094sec


-> reachability set: #nodes 1068 (1.1e+03) #states 2,482 (3)



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

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

abstracting: (2<=callToTask_s00002957_output_s00001077) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

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

abstracting: (3<=merge_s00001160_input_s00001129) states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AX [AF [[2<=callToTask_s00002952_inputCriterion_s00001053_used | 3<=callToTask_s00002896_inputCriterion_s00001053_used]]]
normalized: ~ [EX [EG [~ [[2<=callToTask_s00002952_inputCriterion_s00001053_used | 3<=callToTask_s00002896_inputCriterion_s00001053_used]]]]]

abstracting: (3<=callToTask_s00002896_inputCriterion_s00001053_used) states: 0
abstracting: (2<=callToTask_s00002952_inputCriterion_s00001053_used) states: 0

EG iterations: 0
.-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: [AF [EF [2<=callToTask_s00002958_output_s00001054]] | EX [EF [2<=callToProcess_s00002038_output_s00001077]]]
normalized: [~ [EG [~ [E [true U 2<=callToTask_s00002958_output_s00001054]]]] | EX [E [true U 2<=callToProcess_s00002038_output_s00001077]]]

abstracting: (2<=callToProcess_s00002038_output_s00001077) states: 0
.abstracting: (2<=callToTask_s00002958_output_s00001054) states: 0

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

checking: AG [callToTask_s00002952_inputCriterion_s00001053_used<=callToTask_s00002929_input_s00001052]
normalized: ~ [E [true U ~ [callToTask_s00002952_inputCriterion_s00001053_used<=callToTask_s00002929_input_s00001052]]]

abstracting: (callToTask_s00002952_inputCriterion_s00001053_used<=callToTask_s00002929_input_s00001052) states: 2,479 (3)
-> the formula is FALSE

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

MC time: 0m 0.093sec

checking: ~ [EG [[~ [decision_s00001123_input_s00001066<=callToTask_s00002961_input_s00001066] | ~ [2<=callToTask_s00002962_output_s00001054]]]]
normalized: ~ [EG [[~ [decision_s00001123_input_s00001066<=callToTask_s00002961_input_s00001066] | ~ [2<=callToTask_s00002962_output_s00001054]]]]

abstracting: (2<=callToTask_s00002962_output_s00001054) states: 0
abstracting: (decision_s00001123_input_s00001066<=callToTask_s00002961_input_s00001066) states: 2,437 (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.002sec

checking: EF [[EG [callToTask_s00001168_input_s00001052<=callToTask_s00002063_output_s00001077] & EX [callToTask_s00002956_input_s00001066<=callToTask_s00001406_output_s00001077]]]
normalized: E [true U [EG [callToTask_s00001168_input_s00001052<=callToTask_s00002063_output_s00001077] & EX [callToTask_s00002956_input_s00001066<=callToTask_s00001406_output_s00001077]]]

abstracting: (callToTask_s00002956_input_s00001066<=callToTask_s00001406_output_s00001077) states: 2,479 (3)
.abstracting: (callToTask_s00001168_input_s00001052<=callToTask_s00002063_output_s00001077) states: 2,437 (3)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.048sec

checking: EG [[merge_s00002239_input_s00001129<=callToTask_s00002962_output_s00001054 & AG [callToTask_s00002962_output_s00001054<=decision_s00001126_input_s00001066]]]
normalized: EG [[merge_s00002239_input_s00001129<=callToTask_s00002962_output_s00001054 & ~ [E [true U ~ [callToTask_s00002962_output_s00001054<=decision_s00001126_input_s00001066]]]]]

abstracting: (callToTask_s00002962_output_s00001054<=decision_s00001126_input_s00001066) states: 2,479 (3)
abstracting: (merge_s00002239_input_s00001129<=callToTask_s00002962_output_s00001054) states: 2,479 (3)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.056sec

checking: EG [AG [[callToTask_s00002965_output_s00001077<=callToTask_s00002963_output_s00001054 | callToTask_s00002956_output_s00001077<=callToTask_s00002954_input_s00001052]]]
normalized: EG [~ [E [true U ~ [[callToTask_s00002965_output_s00001077<=callToTask_s00002963_output_s00001054 | callToTask_s00002956_output_s00001077<=callToTask_s00002954_input_s00001052]]]]]

abstracting: (callToTask_s00002956_output_s00001077<=callToTask_s00002954_input_s00001052) states: 2,479 (3)
abstracting: (callToTask_s00002965_output_s00001077<=callToTask_s00002963_output_s00001054) states: 2,479 (3)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: AG [[~ [[1<=callToTask_s00002954_input_s00001066 | 1<=join_s00001164_input_s00001052]] | [~ [callToTask_s00002930_input_s00001052<=callToTask_s00002063_output_s00001054] & ~ [3<=callToTask_s00002956_output_s00001054]]]]
normalized: ~ [E [true U ~ [[~ [[1<=callToTask_s00002954_input_s00001066 | 1<=join_s00001164_input_s00001052]] | [~ [3<=callToTask_s00002956_output_s00001054] & ~ [callToTask_s00002930_input_s00001052<=callToTask_s00002063_output_s00001054]]]]]]

abstracting: (callToTask_s00002930_input_s00001052<=callToTask_s00002063_output_s00001054) states: 2,182 (3)
abstracting: (3<=callToTask_s00002956_output_s00001054) states: 0
abstracting: (1<=join_s00001164_input_s00001052) states: 45
abstracting: (1<=callToTask_s00002954_input_s00001066) states: 3
-> the formula is FALSE

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

MC time: 0m 0.066sec

checking: [AF [callToTask_s00001168_input_s00001052<=merge_s00002239_input_s00001128] & EG [~ [[join_s00001164_input_s00001127<=merge_s00002239_input_s00001128 & 3<=callToTask_s00002963_inputCriterion_s00001053_used]]]]
normalized: [EG [~ [[join_s00001164_input_s00001127<=merge_s00002239_input_s00001128 & 3<=callToTask_s00002963_inputCriterion_s00001053_used]]] & ~ [EG [~ [callToTask_s00001168_input_s00001052<=merge_s00002239_input_s00001128]]]]

abstracting: (callToTask_s00001168_input_s00001052<=merge_s00002239_input_s00001128) states: 2,437 (3)
.
EG iterations: 1
abstracting: (3<=callToTask_s00002963_inputCriterion_s00001053_used) states: 0
abstracting: (join_s00001164_input_s00001127<=merge_s00002239_input_s00001128) states: 2,437 (3)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.004sec

checking: [[EF [~ [2<=callToTask_s00002959_input_s00001052]] & AF [[3<=callToTask_s00002667_output_s00001077 & 2<=callToTask_s00001406_output_s00001054]]] | ~ [callToProcess_s00002802_inputCriterion_s00001053_used<=callToTask_s00002824_output_s00001077]]
normalized: [[E [true U ~ [2<=callToTask_s00002959_input_s00001052]] & ~ [EG [~ [[3<=callToTask_s00002667_output_s00001077 & 2<=callToTask_s00001406_output_s00001054]]]]] | ~ [callToProcess_s00002802_inputCriterion_s00001053_used<=callToTask_s00002824_output_s00001077]]

abstracting: (callToProcess_s00002802_inputCriterion_s00001053_used<=callToTask_s00002824_output_s00001077) states: 2,479 (3)
abstracting: (2<=callToTask_s00001406_output_s00001054) states: 0
abstracting: (3<=callToTask_s00002667_output_s00001077) states: 0

EG iterations: 0
abstracting: (2<=callToTask_s00002959_input_s00001052) states: 0
-> the formula is FALSE

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

MC time: 0m 0.033sec

checking: ~ [[AF [[callToTask_s00002963_inputCriterion_s00001053_used<=decision_s00002055_input_s00001066 | 3<=callToTask_s00001852_inputCriterion_s00001053_used]] & AF [[callToTask_s00002953_input_s00001052<=callToTask_s00002956_input_s00001052 & 1<=callToTask_s00002931_input_s00001066]]]]
normalized: ~ [[~ [EG [~ [[callToTask_s00002963_inputCriterion_s00001053_used<=decision_s00002055_input_s00001066 | 3<=callToTask_s00001852_inputCriterion_s00001053_used]]]] & ~ [EG [~ [[callToTask_s00002953_input_s00001052<=callToTask_s00002956_input_s00001052 & 1<=callToTask_s00002931_input_s00001066]]]]]]

abstracting: (1<=callToTask_s00002931_input_s00001066) states: 150
abstracting: (callToTask_s00002953_input_s00001052<=callToTask_s00002956_input_s00001052) states: 2,479 (3)
.
EG iterations: 1
abstracting: (3<=callToTask_s00001852_inputCriterion_s00001053_used) states: 0
abstracting: (callToTask_s00002963_inputCriterion_s00001053_used<=decision_s00002055_input_s00001066) states: 2,479 (3)
...
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.047sec

checking: E [EF [callToTask_s00002959_input_s00001052<=merge_s00001161_input_s00001068] U [2<=callToTask_s00002932_input_s00001066 & [callToTask_s00001406_output_s00001054<=callToTask_s00002959_input_s00001052 & callToTask_s00002930_inputCriterion_s00001053_used<=join_s00001163_input_s00001127]]]
normalized: E [E [true U callToTask_s00002959_input_s00001052<=merge_s00001161_input_s00001068] U [2<=callToTask_s00002932_input_s00001066 & [callToTask_s00001406_output_s00001054<=callToTask_s00002959_input_s00001052 & callToTask_s00002930_inputCriterion_s00001053_used<=join_s00001163_input_s00001127]]]

abstracting: (callToTask_s00002930_inputCriterion_s00001053_used<=join_s00001163_input_s00001127) states: 2,212 (3)
abstracting: (callToTask_s00001406_output_s00001054<=callToTask_s00002959_input_s00001052) states: 2,437 (3)
abstracting: (2<=callToTask_s00002932_input_s00001066) states: 0
abstracting: (callToTask_s00002959_input_s00001052<=merge_s00001161_input_s00001068) states: 2,479 (3)
-> the formula is FALSE

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

MC time: 0m 0.012sec

checking: [[A [2<=join_s00001163_input_s00001128 U callToTask_s00002931_input_s00001066<=callToTask_s00002962_output_s00001077] & [EF [2<=callToTask_s00002962_input_s00001052] & ~ [[3<=callToTask_s00002929_input_s00001066 & callToTask_s00002960_input_s00001066<=decision_s00002055_activated]]]] | 3<=callToTask_s00002958_output_s00001054]
normalized: [3<=callToTask_s00002958_output_s00001054 | [[~ [E [~ [callToTask_s00002931_input_s00001066<=callToTask_s00002962_output_s00001077] U [~ [2<=join_s00001163_input_s00001128] & ~ [callToTask_s00002931_input_s00001066<=callToTask_s00002962_output_s00001077]]]] & ~ [EG [~ [callToTask_s00002931_input_s00001066<=callToTask_s00002962_output_s00001077]]]] & [~ [[3<=callToTask_s00002929_input_s00001066 & callToTask_s00002960_input_s00001066<=decision_s00002055_activated]] & E [true U 2<=callToTask_s00002962_input_s00001052]]]]

abstracting: (2<=callToTask_s00002962_input_s00001052) states: 0
abstracting: (callToTask_s00002960_input_s00001066<=decision_s00002055_activated) states: 2,477 (3)
abstracting: (3<=callToTask_s00002929_input_s00001066) states: 0
abstracting: (callToTask_s00002931_input_s00001066<=callToTask_s00002962_output_s00001077) states: 2,332 (3)
...............
EG iterations: 15
abstracting: (callToTask_s00002931_input_s00001066<=callToTask_s00002962_output_s00001077) states: 2,332 (3)
abstracting: (2<=join_s00001163_input_s00001128) states: 0
abstracting: (callToTask_s00002931_input_s00001066<=callToTask_s00002962_output_s00001077) states: 2,332 (3)
abstracting: (3<=callToTask_s00002958_output_s00001054) 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.182sec

checking: [[E [callToTask_s00002965_inputCriterion_s00001053_used<=callToTask_s00002952_input_s00001052 U 3<=join_s00001164_input_s00001127] & EX [callToTask_s00002932_input_s00001052<=callToTask_s00001406_output_s00001054]] | ~ [[~ [fork_s00001298_activated_s00001073<=merge_s00002239_input_s00001129] | ~ [~ [callToTask_s00002951_input_s00001066<=callToTask_s00002932_inputCriterion_s00001053_used]]]]]
normalized: [~ [[callToTask_s00002951_input_s00001066<=callToTask_s00002932_inputCriterion_s00001053_used | ~ [fork_s00001298_activated_s00001073<=merge_s00002239_input_s00001129]]] | [E [callToTask_s00002965_inputCriterion_s00001053_used<=callToTask_s00002952_input_s00001052 U 3<=join_s00001164_input_s00001127] & EX [callToTask_s00002932_input_s00001052<=callToTask_s00001406_output_s00001054]]]

abstracting: (callToTask_s00002932_input_s00001052<=callToTask_s00001406_output_s00001054) states: 2,332 (3)
.abstracting: (3<=join_s00001164_input_s00001127) states: 0
abstracting: (callToTask_s00002965_inputCriterion_s00001053_used<=callToTask_s00002952_input_s00001052) states: 2,479 (3)
abstracting: (fork_s00001298_activated_s00001073<=merge_s00002239_input_s00001129) states: 2,332 (3)
abstracting: (callToTask_s00002951_input_s00001066<=callToTask_s00002932_inputCriterion_s00001053_used) states: 2,479 (3)
-> the formula is FALSE

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

MC time: 0m 0.035sec


Total processing time: 0m 6.156sec


BK_STOP 1463723561537

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

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

initing FirstDep: 0m 0.000sec


iterations count:587 (3), effective:123 (0)

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

iterations count:443 (2), effective:80 (0)

iterations count:509 (2), effective:100 (0)

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

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

iterations count:178 (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="IBM319-PT-none"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/hulinhub/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/IBM319-PT-none.tgz
mv IBM319-PT-none 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 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 r065kn-blw3-146358913200030"
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 ;