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 IBM5964-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r031-blw7-149440473800088
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494452228083

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=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Net: IBM5964_PT_none
(NrP: 263 NrTr: 139 NrArc: 541)

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

net check time: 0m 0.000sec

init dd package: 0m 1.077sec


RS generation: 0m 0.010sec


-> last computed set: #nodes 19 (1.9e+01) #states 3


parse successfull
net created successfully

Net: IBM5964_PT_none
(NrP: 263 NrTr: 139 NrArc: 541)

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

net check time: 0m 0.000sec

init dd package: 0m 3.304sec


RS generation: 0m 0.045sec


-> reachability set: #nodes 1027 (1.0e+03) #states 15,546 (4)



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

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

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

FORMULA IBM5964-PT-none-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=callToTask_s00005968_input_s00000950)
states: 0
-> the formula is FALSE

FORMULA IBM5964-PT-none-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA IBM5964-PT-none-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [3<=callToProcess_s00002411_output_s00000938]]
normalized: ~ [E [true U 3<=callToProcess_s00002411_output_s00000938]]

abstracting: (3<=callToProcess_s00002411_output_s00000938)
states: 0
-> the formula is TRUE

FORMULA IBM5964-PT-none-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA IBM5964-PT-none-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA IBM5964-PT-none-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [callToTask_s00002183_output_s00000962<=fork_s00001067_activated_s00000991]
normalized: ~ [E [true U ~ [callToTask_s00002183_output_s00000962<=fork_s00001067_activated_s00000991]]]

abstracting: (callToTask_s00002183_output_s00000962<=fork_s00001067_activated_s00000991)
states: 15,546 (4)
-> the formula is TRUE

FORMULA IBM5964-PT-none-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [callToProcess_s00002316_output_s00000938<=callToTask_s00005897_output_s00000979]
normalized: ~ [E [true U ~ [callToProcess_s00002316_output_s00000938<=callToTask_s00005897_output_s00000979]]]

abstracting: (callToProcess_s00002316_output_s00000938<=callToTask_s00005897_output_s00000979)
states: 15,546 (4)
-> the formula is TRUE

FORMULA IBM5964-PT-none-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [callToTask_s00002183_output_s00000956<=callToTask_s00005970_input_s00000952]
normalized: ~ [E [true U ~ [callToTask_s00002183_output_s00000956<=callToTask_s00005970_input_s00000952]]]

abstracting: (callToTask_s00002183_output_s00000956<=callToTask_s00005970_input_s00000952)
states: 15,546 (4)
-> the formula is TRUE

FORMULA IBM5964-PT-none-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [3<=callToTask_s00002185_input_s00000952] & [2<=callToTask_s00002186_input_s00001012 | [3<=callToTask_s00002186_output_s00000938 | callToTask_s00002185_input_s00000935<=callToTask_s00002427_output_s00000938]]]]
normalized: ~ [E [true U ~ [[[2<=callToTask_s00002186_input_s00001012 | [3<=callToTask_s00002186_output_s00000938 | callToTask_s00002185_input_s00000935<=callToTask_s00002427_output_s00000938]] & ~ [3<=callToTask_s00002185_input_s00000952]]]]]

abstracting: (3<=callToTask_s00002185_input_s00000952)
states: 0
abstracting: (callToTask_s00002185_input_s00000935<=callToTask_s00002427_output_s00000938)
states: 15,546 (4)
abstracting: (3<=callToTask_s00002186_output_s00000938)
states: 0
abstracting: (2<=callToTask_s00002186_input_s00001012)
states: 0
-> the formula is TRUE

FORMULA IBM5964-PT-none-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[callToTask_s00002189_inputCriterion_s00000937_used<=join_s00001295_input_s00000950 & [3<=callToProcess_s00002411_output_s00000938 | [callToTask_s00005849_output_s00000959<=callToTask_s00002186_input_s00000950 | 1<=callToTask_s00005968_input_s00000950]]]]
normalized: ~ [E [true U ~ [[callToTask_s00002189_inputCriterion_s00000937_used<=join_s00001295_input_s00000950 & [[callToTask_s00005849_output_s00000959<=callToTask_s00002186_input_s00000950 | 1<=callToTask_s00005968_input_s00000950] | 3<=callToProcess_s00002411_output_s00000938]]]]]

abstracting: (3<=callToProcess_s00002411_output_s00000938)
states: 0
abstracting: (1<=callToTask_s00005968_input_s00000950)
states: 0
abstracting: (callToTask_s00005849_output_s00000959<=callToTask_s00002186_input_s00000950)
states: 15,546 (4)
abstracting: (callToTask_s00002189_inputCriterion_s00000937_used<=join_s00001295_input_s00000950)
states: 15,546 (4)
-> the formula is TRUE

FORMULA IBM5964-PT-none-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[callToTask_s00005972_input_s00000950<=callToTask_s00001971_output_s00000938 | [[3<=process_s00000383__s00005964_output_s00001463 & callToTask_s00002185_input_s00000935<=callToTask_s00002526_input_s00000950] & [2<=callToProcess_s00005925_input_s00000985 & 2<=callToTask_s00002185_input_s00000950]]]]
normalized: ~ [E [true U ~ [[[[3<=process_s00000383__s00005964_output_s00001463 & callToTask_s00002185_input_s00000935<=callToTask_s00002526_input_s00000950] & [2<=callToProcess_s00005925_input_s00000985 & 2<=callToTask_s00002185_input_s00000950]] | callToTask_s00005972_input_s00000950<=callToTask_s00001971_output_s00000938]]]]

abstracting: (callToTask_s00005972_input_s00000950<=callToTask_s00001971_output_s00000938)
states: 15,546 (4)
abstracting: (2<=callToTask_s00002185_input_s00000950)
states: 0
abstracting: (2<=callToProcess_s00005925_input_s00000985)
states: 369
abstracting: (callToTask_s00002185_input_s00000935<=callToTask_s00002526_input_s00000950)
states: 15,546 (4)
abstracting: (3<=process_s00000383__s00005964_output_s00001463)
states: 0
-> the formula is TRUE

FORMULA IBM5964-PT-none-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[~ [callToTask_s00005897_input_s00000986<=callToTask_s00001746_input_s00000952] | [[3<=callToTask_s00002427_inputCriterion_s00000937_used | callToProcess_s00005925_input_s00000985<=fork_s00001067_activated_s00000991] | process_s00000383__s00005964_output_s00001610<=callToTask_s00005967_input_s00000935]]]
normalized: ~ [E [true U ~ [[[[3<=callToTask_s00002427_inputCriterion_s00000937_used | callToProcess_s00005925_input_s00000985<=fork_s00001067_activated_s00000991] | process_s00000383__s00005964_output_s00001610<=callToTask_s00005967_input_s00000935] | ~ [callToTask_s00005897_input_s00000986<=callToTask_s00001746_input_s00000952]]]]]

abstracting: (callToTask_s00005897_input_s00000986<=callToTask_s00001746_input_s00000952)
states: 10,618 (4)
abstracting: (process_s00000383__s00005964_output_s00001610<=callToTask_s00005967_input_s00000935)
states: 15,546 (4)
abstracting: (callToProcess_s00005925_input_s00000985<=fork_s00001067_activated_s00000991)
states: 12,658 (4)
abstracting: (3<=callToTask_s00002427_inputCriterion_s00000937_used)
states: 0
-> the formula is TRUE

FORMULA IBM5964-PT-none-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[~ [~ [callToProcess_s00002316_output_s00000938<=callToTask_s00001746_output_s00000938]] & [[callToTask_s00002189_inputCriterion_s00000937_used<=callToProcess_s00004075_output_s00000938 & 1<=merge_s00001369_activated] | [decision_s00001615_activated<=callToTask_s00005849_input_s00000950 & callToTask_s00001305_input_s00000935<=callToTask_s00001971_input_s00000985]]]]
normalized: ~ [E [true U ~ [[callToProcess_s00002316_output_s00000938<=callToTask_s00001746_output_s00000938 & [[decision_s00001615_activated<=callToTask_s00005849_input_s00000950 & callToTask_s00001305_input_s00000935<=callToTask_s00001971_input_s00000985] | [callToTask_s00002189_inputCriterion_s00000937_used<=callToProcess_s00004075_output_s00000938 & 1<=merge_s00001369_activated]]]]]]

abstracting: (1<=merge_s00001369_activated)
states: 0
abstracting: (callToTask_s00002189_inputCriterion_s00000937_used<=callToProcess_s00004075_output_s00000938)
states: 15,546 (4)
abstracting: (callToTask_s00001305_input_s00000935<=callToTask_s00001971_input_s00000985)
states: 15,546 (4)
abstracting: (decision_s00001615_activated<=callToTask_s00005849_input_s00000950)
states: 15,546 (4)
abstracting: (callToProcess_s00002316_output_s00000938<=callToTask_s00001746_output_s00000938)
states: 15,546 (4)
-> the formula is TRUE

FORMULA IBM5964-PT-none-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[[merge_s00000945_input_s00000987<=callToTask_s00002427_input_s00000952 & 3<=callToTask_s00002186_input_s00001513] & [merge_s00001291_input_s00000987<=callToTask_s00002741_input_s00000986 & 2<=callToTask_s00005965_input_s00000952]] & [callToTask_s00005968_output_s00000938<=fork_s00001293_input_s00000952 & [3<=merge_s00000945_input_s00000952 | 3<=callToTask_s00001305_input_s00001009]]]]
normalized: E [true U [[[merge_s00001291_input_s00000987<=callToTask_s00002741_input_s00000986 & 2<=callToTask_s00005965_input_s00000952] & [merge_s00000945_input_s00000987<=callToTask_s00002427_input_s00000952 & 3<=callToTask_s00002186_input_s00001513]] & [[3<=merge_s00000945_input_s00000952 | 3<=callToTask_s00001305_input_s00001009] & callToTask_s00005968_output_s00000938<=fork_s00001293_input_s00000952]]]

abstracting: (callToTask_s00005968_output_s00000938<=fork_s00001293_input_s00000952)
states: 15,546 (4)
abstracting: (3<=callToTask_s00001305_input_s00001009)
states: 0
abstracting: (3<=merge_s00000945_input_s00000952)
states: 0
abstracting: (3<=callToTask_s00002186_input_s00001513)
states: 0
abstracting: (merge_s00000945_input_s00000987<=callToTask_s00002427_input_s00000952)
states: 15,546 (4)
abstracting: (2<=callToTask_s00005965_input_s00000952)
states: 0
abstracting: (merge_s00001291_input_s00000987<=callToTask_s00002741_input_s00000986)
states: 15,546 (4)
-> the formula is FALSE

FORMULA IBM5964-PT-none-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[[[callToTask_s00002741_input_s00000986<=decision_s00000989_activated | callToTask_s00002185_input_s00000952<=merge_s00001066_input_s00000985] & [1<=fork_s00001537_activated_s00000991 & 2<=callToProcess_s00002538_inputCriterion_s00000937_used]] | [callToTask_s00005965_input_s00000950<=callToTask_s00002186_inputCriterion_s00000937_used & [callToTask_s00005968_input_s00000952<=process_s00000383__s00005964_input_s00000936 & 2<=merge_s00001120_input_s00001010]]]]
normalized: E [true U [[[callToTask_s00002741_input_s00000986<=decision_s00000989_activated | callToTask_s00002185_input_s00000952<=merge_s00001066_input_s00000985] & [1<=fork_s00001537_activated_s00000991 & 2<=callToProcess_s00002538_inputCriterion_s00000937_used]] | [[callToTask_s00005968_input_s00000952<=process_s00000383__s00005964_input_s00000936 & 2<=merge_s00001120_input_s00001010] & callToTask_s00005965_input_s00000950<=callToTask_s00002186_inputCriterion_s00000937_used]]]

abstracting: (callToTask_s00005965_input_s00000950<=callToTask_s00002186_inputCriterion_s00000937_used)
states: 15,546 (4)
abstracting: (2<=merge_s00001120_input_s00001010)
states: 0
abstracting: (callToTask_s00005968_input_s00000952<=process_s00000383__s00005964_input_s00000936)
states: 15,546 (4)
abstracting: (2<=callToProcess_s00002538_inputCriterion_s00000937_used)
states: 0
abstracting: (1<=fork_s00001537_activated_s00000991)
states: 2,191 (3)
abstracting: (callToTask_s00002185_input_s00000952<=merge_s00001066_input_s00000985)
states: 15,546 (4)
abstracting: (callToTask_s00002741_input_s00000986<=decision_s00000989_activated)
states: 15,546 (4)
-> the formula is FALSE

FORMULA IBM5964-PT-none-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

totally nodes used: 49974 (5.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5499 86936 92435
used/not used/entry size/cache size: 98923 67009941 16 1024MB
basic ops cache: hits/miss/sum: 1077 43591 44668
used/not used/entry size/cache size: 116441 16660775 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 783 2630 3413
used/not used/entry size/cache size: 2630 8385978 32 256MB
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 67059109
1 49556
2 192
3 1
4 2
5 1
6 3
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.978sec


BK_STOP 1494452234140

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

zbdd.cc:1122: Boundedness exception: net is not 1-bounded!

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


iterations count:378 (2), effective:51 (0)

initing FirstDep: 0m 0.000sec

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="IBM5964-PT-none"
export BK_EXAMINATION="ReachabilityCardinality"
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/IBM5964-PT-none.tgz
mv IBM5964-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 IBM5964-PT-none, 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 r031-blw7-149440473800088"
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 ;