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

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

=== Now, execution of the tool begins

BK_START 1464330447969


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: IBM5964_PT_none
(NrP: 263 NrTr: 139 NrArc: 541)

net check time: 0m 0.000sec

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

init dd package: 0m 3.924sec


RS generation: 0m 0.053sec


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



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

checking: AX [AG [~ [3<=callToTask_s00002741_input_s00000935]]]
normalized: ~ [EX [E [true U 3<=callToTask_s00002741_input_s00000935]]]

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

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

MC time: 0m 0.001sec

checking: AF [~ [callToTask_s00005972_input_s00000950<=callToTask_s00002741_input_s00000986]]
normalized: ~ [EG [callToTask_s00005972_input_s00000950<=callToTask_s00002741_input_s00000986]]

abstracting: (callToTask_s00005972_input_s00000950<=callToTask_s00002741_input_s00000986) states: 15,546 (4)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AX [AF [~ [callToTask_s00005966_output_s00000979<=callToTask_s00002741_inputCriterion_s00000937_used]]]
normalized: ~ [EX [EG [callToTask_s00005966_output_s00000979<=callToTask_s00002741_inputCriterion_s00000937_used]]]

abstracting: (callToTask_s00005966_output_s00000979<=callToTask_s00002741_inputCriterion_s00000937_used) states: 15,546 (4)

EG iterations: 0
.-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: AG [join_s00001295_input_s00000952<=merge_s00001120_input_s00000935]
normalized: ~ [E [true U ~ [join_s00001295_input_s00000952<=merge_s00001120_input_s00000935]]]

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

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

MC time: 0m 0.000sec

checking: AF [AF [[3<=callToTask_s00001746_input_s00000935 & decision_s00001286_activated<=callToTask_s00002183_inputCriterion_s00000937_used]]]
normalized: ~ [EG [EG [~ [[3<=callToTask_s00001746_input_s00000935 & decision_s00001286_activated<=callToTask_s00002183_inputCriterion_s00000937_used]]]]]

abstracting: (decision_s00001286_activated<=callToTask_s00002183_inputCriterion_s00000937_used) states: 15,546 (4)
abstracting: (3<=callToTask_s00001746_input_s00000935) states: 0

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AX [A [decision_s00001286_activated<=join_s00001295_input_s00000985 U 3<=callToProcess_s00004075_output_s00000938]]
normalized: ~ [EX [~ [[~ [E [~ [3<=callToProcess_s00004075_output_s00000938] U [~ [3<=callToProcess_s00004075_output_s00000938] & ~ [decision_s00001286_activated<=join_s00001295_input_s00000985]]]] & ~ [EG [~ [3<=callToProcess_s00004075_output_s00000938]]]]]]]

abstracting: (3<=callToProcess_s00004075_output_s00000938) states: 0

EG iterations: 0
abstracting: (decision_s00001286_activated<=join_s00001295_input_s00000985) states: 15,546 (4)
abstracting: (3<=callToProcess_s00004075_output_s00000938) states: 0
abstracting: (3<=callToProcess_s00004075_output_s00000938) states: 0
.-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: [EF [1<=callToTask_s00002186_inputCriterion_s00000937_used] & merge_s00001292_input_s00000950<=callToTask_s00001746_input_s00000952]
normalized: [merge_s00001292_input_s00000950<=callToTask_s00001746_input_s00000952 & E [true U 1<=callToTask_s00002186_inputCriterion_s00000937_used]]

abstracting: (1<=callToTask_s00002186_inputCriterion_s00000937_used) states: 0
abstracting: (merge_s00001292_input_s00000950<=callToTask_s00001746_input_s00000952) states: 8,723 (3)
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: [1<=join_s00001295_input_s00000985 | ~ [EG [merge_s00001290_activated<=callToTask_s00002186_input_s00000935]]]
normalized: [1<=join_s00001295_input_s00000985 | ~ [EG [merge_s00001290_activated<=callToTask_s00002186_input_s00000935]]]

abstracting: (merge_s00001290_activated<=callToTask_s00002186_input_s00000935) states: 12,658 (4)
.............................
EG iterations: 29
abstracting: (1<=join_s00001295_input_s00000985) states: 0
-> the formula is TRUE

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

MC time: 0m 0.447sec

checking: AX [A [callToTask_s00005967_output_s00000938<=callToProcess_s00005925_output_s00000938 U 1<=callToProcess_s00002538_input_s00000950]]
normalized: ~ [EX [~ [[~ [EG [~ [1<=callToProcess_s00002538_input_s00000950]]] & ~ [E [~ [1<=callToProcess_s00002538_input_s00000950] U [~ [callToTask_s00005967_output_s00000938<=callToProcess_s00005925_output_s00000938] & ~ [1<=callToProcess_s00002538_input_s00000950]]]]]]]]

abstracting: (1<=callToProcess_s00002538_input_s00000950) states: 2,888 (3)
abstracting: (callToTask_s00005967_output_s00000938<=callToProcess_s00005925_output_s00000938) states: 15,546 (4)
abstracting: (1<=callToProcess_s00002538_input_s00000950) states: 2,888 (3)
abstracting: (1<=callToProcess_s00002538_input_s00000950) states: 2,888 (3)
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.017sec

checking: A [AF [decision_s00001615_activated<=callToTask_s00005849_inputCriterion_s00000937_used] U 3<=callToTask_s00005849_input_s00000952]
normalized: [~ [EG [~ [3<=callToTask_s00005849_input_s00000952]]] & ~ [E [~ [3<=callToTask_s00005849_input_s00000952] U [EG [~ [decision_s00001615_activated<=callToTask_s00005849_inputCriterion_s00000937_used]] & ~ [3<=callToTask_s00005849_input_s00000952]]]]]

abstracting: (3<=callToTask_s00005849_input_s00000952) states: 0
abstracting: (decision_s00001615_activated<=callToTask_s00005849_inputCriterion_s00000937_used) states: 15,546 (4)
.
EG iterations: 1
abstracting: (3<=callToTask_s00005849_input_s00000952) states: 0
abstracting: (3<=callToTask_s00005849_input_s00000952) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA IBM5964-PT-none-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [AF [~ [[callToTask_s00001746_output_s00000956<=join_s00001295_input_s00000987 | 1<=callToProcess_s00002538_input_s00000952]]] | 1<=callToTask_s00005967_output_s00000938]
normalized: [1<=callToTask_s00005967_output_s00000938 | ~ [EG [[callToTask_s00001746_output_s00000956<=join_s00001295_input_s00000987 | 1<=callToProcess_s00002538_input_s00000952]]]]

abstracting: (1<=callToProcess_s00002538_input_s00000952) states: 2,888 (3)
abstracting: (callToTask_s00001746_output_s00000956<=join_s00001295_input_s00000987) states: 15,546 (4)

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

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

MC time: 0m 0.002sec

checking: [~ [A [join_s00001295_input_s00000985<=alpha U 1<=callToTask_s00005967_input_s00000950]] | ~ [~ [EX [1<=join_s00001295_input_s00000935]]]]
normalized: [~ [[~ [EG [~ [1<=callToTask_s00005967_input_s00000950]]] & ~ [E [~ [1<=callToTask_s00005967_input_s00000950] U [~ [1<=callToTask_s00005967_input_s00000950] & ~ [join_s00001295_input_s00000985<=alpha]]]]]] | EX [1<=join_s00001295_input_s00000935]]

abstracting: (1<=join_s00001295_input_s00000935) states: 0
.abstracting: (join_s00001295_input_s00000985<=alpha) states: 15,546 (4)
abstracting: (1<=callToTask_s00005967_input_s00000950) states: 0
abstracting: (1<=callToTask_s00005967_input_s00000950) states: 0
abstracting: (1<=callToTask_s00005967_input_s00000950) states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: A [[merge_s00001290_input_s00001009<=callToTask_s00002741_output_s00000960 | ~ [2<=merge_s00001066_activated]] U [~ [1<=fork_s00001067_activated_s00000991] & ~ [callToTask_s00002526_input_s00000935<=callToProcess_s00004075_input_s00000935]]]
normalized: [~ [EG [~ [[~ [1<=fork_s00001067_activated_s00000991] & ~ [callToTask_s00002526_input_s00000935<=callToProcess_s00004075_input_s00000935]]]]] & ~ [E [~ [[~ [1<=fork_s00001067_activated_s00000991] & ~ [callToTask_s00002526_input_s00000935<=callToProcess_s00004075_input_s00000935]]] U [~ [[~ [1<=fork_s00001067_activated_s00000991] & ~ [callToTask_s00002526_input_s00000935<=callToProcess_s00004075_input_s00000935]]] & ~ [[merge_s00001290_input_s00001009<=callToTask_s00002741_output_s00000960 | ~ [2<=merge_s00001066_activated]]]]]]]

abstracting: (2<=merge_s00001066_activated) states: 0
abstracting: (merge_s00001290_input_s00001009<=callToTask_s00002741_output_s00000960) states: 13,355 (4)
abstracting: (callToTask_s00002526_input_s00000935<=callToProcess_s00004075_input_s00000935) states: 15,546 (4)
abstracting: (1<=fork_s00001067_activated_s00000991) states: 0
abstracting: (callToTask_s00002526_input_s00000935<=callToProcess_s00004075_input_s00000935) states: 15,546 (4)
abstracting: (1<=fork_s00001067_activated_s00000991) states: 0
abstracting: (callToTask_s00002526_input_s00000935<=callToProcess_s00004075_input_s00000935) states: 15,546 (4)
abstracting: (1<=fork_s00001067_activated_s00000991) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.010sec

checking: [[EF [[3<=callToTask_s00002186_input_s00000935 & callToTask_s00002190_output_s00000956<=callToTask_s00005966_output_s00000979]] | 2<=callToTask_s00005849_input_s00000985] | ~ [[AG [callToTask_s00002186_input_s00000950<=callToTask_s00005849_input_s00000952] | EG [3<=callToTask_s00005971_inputCriterion_s00000937_used]]]]
normalized: [[2<=callToTask_s00005849_input_s00000985 | E [true U [3<=callToTask_s00002186_input_s00000935 & callToTask_s00002190_output_s00000956<=callToTask_s00005966_output_s00000979]]] | ~ [[EG [3<=callToTask_s00005971_inputCriterion_s00000937_used] | ~ [E [true U ~ [callToTask_s00002186_input_s00000950<=callToTask_s00005849_input_s00000952]]]]]]

abstracting: (callToTask_s00002186_input_s00000950<=callToTask_s00005849_input_s00000952) states: 15,546 (4)
abstracting: (3<=callToTask_s00005971_inputCriterion_s00000937_used) states: 0
.
EG iterations: 1
abstracting: (callToTask_s00002190_output_s00000956<=callToTask_s00005966_output_s00000979) states: 15,546 (4)
abstracting: (3<=callToTask_s00002186_input_s00000935) states: 0
abstracting: (2<=callToTask_s00005849_input_s00000985) states: 0
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: [~ [[~ [[callToTask_s00002186_output_s00000938<=callToTask_s00005966_inputCriterion_s00000937_used & 3<=merge_s00001066_activated]] & EF [2<=callToTask_s00005969_output_s00000960]]] & [2<=fork_s00001293_input_s00000952 | [[[fork_s00001537_activated_s00000991<=fork_s00001536_activated_s00000991 | callToTask_s00005969_input_s00000952<=process_s00000383__s00005964_output_s00001610] & [callToProcess_s00004075_output_s00000956<=callToTask_s00002741_output_s00000981 | decision_s00001616_activated<=callToTask_s00002427_output_s00000956]] | callToTask_s00001746_inputCriterion_s00000937_used<=join_s00001295_input_s00000987]]]
normalized: [~ [[~ [[callToTask_s00002186_output_s00000938<=callToTask_s00005966_inputCriterion_s00000937_used & 3<=merge_s00001066_activated]] & E [true U 2<=callToTask_s00005969_output_s00000960]]] & [2<=fork_s00001293_input_s00000952 | [callToTask_s00001746_inputCriterion_s00000937_used<=join_s00001295_input_s00000987 | [[callToProcess_s00004075_output_s00000956<=callToTask_s00002741_output_s00000981 | decision_s00001616_activated<=callToTask_s00002427_output_s00000956] & [fork_s00001537_activated_s00000991<=fork_s00001536_activated_s00000991 | callToTask_s00005969_input_s00000952<=process_s00000383__s00005964_output_s00001610]]]]]

abstracting: (callToTask_s00005969_input_s00000952<=process_s00000383__s00005964_output_s00001610) states: 15,546 (4)
abstracting: (fork_s00001537_activated_s00000991<=fork_s00001536_activated_s00000991) states: 13,355 (4)
abstracting: (decision_s00001616_activated<=callToTask_s00002427_output_s00000956) states: 12,658 (4)
abstracting: (callToProcess_s00004075_output_s00000956<=callToTask_s00002741_output_s00000981) states: 15,546 (4)
abstracting: (callToTask_s00001746_inputCriterion_s00000937_used<=join_s00001295_input_s00000987) states: 15,546 (4)
abstracting: (2<=fork_s00001293_input_s00000952) states: 0
abstracting: (2<=callToTask_s00005969_output_s00000960) states: 0
abstracting: (3<=merge_s00001066_activated) states: 0
abstracting: (callToTask_s00002186_output_s00000938<=callToTask_s00005966_inputCriterion_s00000937_used) states: 15,546 (4)
-> the formula is TRUE

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

MC time: 0m 0.009sec

checking: [E [[callToTask_s00002189_output_s00000938<=callToTask_s00001746_input_s00000950 | callToTask_s00005849_output_s00000938<=callToProcess_s00002411_output_s00000956] U 2<=callToTask_s00002741_input_s00000985] & [[~ [[callToTask_s00005897_inputCriterion_s00000937_used<=callToTask_s00005967_input_s00000952 & callToTask_s00005966_output_s00000956<=callToTask_s00005970_inputCriterion_s00000937_used]] | ~ [[1<=callToTask_s00002186_inputCriterion_s00000937_used & callToTask_s00002427_input_s00001203<=callToProcess_s00001273_inputCriterion_s00000937_used]]] | AF [[3<=callToTask_s00005968_output_s00000938 & process_s00000383__s00005964_input_s00001512<=join_s00001295_input_s00000987]]]]
normalized: [[[~ [[1<=callToTask_s00002186_inputCriterion_s00000937_used & callToTask_s00002427_input_s00001203<=callToProcess_s00001273_inputCriterion_s00000937_used]] | ~ [[callToTask_s00005897_inputCriterion_s00000937_used<=callToTask_s00005967_input_s00000952 & callToTask_s00005966_output_s00000956<=callToTask_s00005970_inputCriterion_s00000937_used]]] | ~ [EG [~ [[3<=callToTask_s00005968_output_s00000938 & process_s00000383__s00005964_input_s00001512<=join_s00001295_input_s00000987]]]]] & E [[callToTask_s00002189_output_s00000938<=callToTask_s00001746_input_s00000950 | callToTask_s00005849_output_s00000938<=callToProcess_s00002411_output_s00000956] U 2<=callToTask_s00002741_input_s00000985]]

abstracting: (2<=callToTask_s00002741_input_s00000985) states: 0
abstracting: (callToTask_s00005849_output_s00000938<=callToProcess_s00002411_output_s00000956) states: 15,546 (4)
abstracting: (callToTask_s00002189_output_s00000938<=callToTask_s00001746_input_s00000950) states: 15,546 (4)
abstracting: (process_s00000383__s00005964_input_s00001512<=join_s00001295_input_s00000987) states: 15,091 (4)
abstracting: (3<=callToTask_s00005968_output_s00000938) states: 0

EG iterations: 0
abstracting: (callToTask_s00005966_output_s00000956<=callToTask_s00005970_inputCriterion_s00000937_used) states: 15,546 (4)
abstracting: (callToTask_s00005897_inputCriterion_s00000937_used<=callToTask_s00005967_input_s00000952) states: 10,618 (4)
abstracting: (callToTask_s00002427_input_s00001203<=callToProcess_s00001273_inputCriterion_s00000937_used) states: 14,783 (4)
abstracting: (1<=callToTask_s00002186_inputCriterion_s00000937_used) states: 0
-> the formula is FALSE

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

MC time: 0m 0.008sec


Total processing time: 0m 5.906sec


BK_STOP 1464330453906

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


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="S_IBM5964-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/S_IBM5964-PT-none.tgz
mv S_IBM5964-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 S_IBM5964-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 r161kn-blw3-146416418000039"
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 ;