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 BridgeAndVehicles-PT-V04P05N02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r001-csrt-149436061500435
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494459582062

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: BridgeAndVehicles_PT_V04P05N02
(NrP: 28 NrTr: 52 NrArc: 326)

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

net check time: 0m 0.000sec

init dd package: 0m 1.300sec

parse successfull
net created successfully

Net: BridgeAndVehicles_PT_V04P05N02
(NrP: 28 NrTr: 52 NrArc: 326)

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

net check time: 0m 0.000sec

init dd package: 0m 4.339sec


RS generation: 0m 0.023sec


-> reachability set: #nodes 1448 (1.4e+03) #states 2,874 (3)



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

checking: EG [2<=ROUTE_B]
normalized: EG [2<=ROUTE_B]

abstracting: (2<=ROUTE_B)
states: 934
............................................
EG iterations: 44
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.139sec

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

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

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [2<=sum(CONTROLEUR_2, CONTROLEUR_1)]
normalized: ~ [EG [~ [2<=sum(CONTROLEUR_2, CONTROLEUR_1)]]]

abstracting: (2<=sum(CONTROLEUR_2, CONTROLEUR_1))
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: EF [EF [~ [CAPACITE<=CAPACITE]]]
normalized: E [true U E [true U ~ [CAPACITE<=CAPACITE]]]

abstracting: (CAPACITE<=CAPACITE)
states: 2,874 (3)
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [2<=sum(CHOIX_2, CHOIX_1)]
normalized: ~ [EG [~ [2<=sum(CHOIX_2, CHOIX_1)]]]

abstracting: (2<=sum(CHOIX_2, CHOIX_1))
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: EG [SUR_PONT_A<=SUR_PONT_B]
normalized: EG [SUR_PONT_A<=SUR_PONT_B]

abstracting: (SUR_PONT_A<=SUR_PONT_B)
states: 2,246 (3)
.................................
EG iterations: 33
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.125sec

checking: AF [EG [[SUR_PONT_B<=SUR_PONT_B & 1<=SUR_PONT_B]]]
normalized: ~ [EG [~ [EG [[SUR_PONT_B<=SUR_PONT_B & 1<=SUR_PONT_B]]]]]

abstracting: (1<=SUR_PONT_B)
states: 628
abstracting: (SUR_PONT_B<=SUR_PONT_B)
states: 2,874 (3)
.............
EG iterations: 13

EG iterations: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EG [sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=CAPACITE]
normalized: EG [sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=CAPACITE]

abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=CAPACITE)
states: 2,874 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: EF [[~ [[2<=CAPACITE | 1<=sum(VIDANGE_2, VIDANGE_1)]] | ~ [3<=CAPACITE]]]
normalized: E [true U [~ [3<=CAPACITE] | ~ [[2<=CAPACITE | 1<=sum(VIDANGE_2, VIDANGE_1)]]]]

abstracting: (1<=sum(VIDANGE_2, VIDANGE_1))
states: 712
abstracting: (2<=CAPACITE)
states: 2,874 (3)
abstracting: (3<=CAPACITE)
states: 2,874 (3)
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: ~ [AF [[~ [3<=ROUTE_A] & [sum(CONTROLEUR_2, CONTROLEUR_1)<=ATTENTE_B & 3<=SORTI_A]]]]
normalized: EG [~ [[[sum(CONTROLEUR_2, CONTROLEUR_1)<=ATTENTE_B & 3<=SORTI_A] & ~ [3<=ROUTE_A]]]]

abstracting: (3<=ROUTE_A)
states: 380
abstracting: (3<=SORTI_A)
states: 574
abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=ATTENTE_B)
states: 2,593 (3)
..................................................
EG iterations: 50
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.204sec

checking: A [[[3<=CAPACITE | 3<=ROUTE_A] | 1<=sum(CHOIX_2, CHOIX_1)] U AX [2<=ATTENTE_A]]
normalized: [~ [EG [EX [~ [2<=ATTENTE_A]]]] & ~ [E [EX [~ [2<=ATTENTE_A]] U [~ [[1<=sum(CHOIX_2, CHOIX_1) | [3<=CAPACITE | 3<=ROUTE_A]]] & EX [~ [2<=ATTENTE_A]]]]]]

abstracting: (2<=ATTENTE_A)
states: 1,011 (3)
.abstracting: (3<=ROUTE_A)
states: 380
abstracting: (3<=CAPACITE)
states: 2,874 (3)
abstracting: (1<=sum(CHOIX_2, CHOIX_1))
states: 1,321 (3)
abstracting: (2<=ATTENTE_A)
states: 1,011 (3)
.abstracting: (2<=ATTENTE_A)
states: 1,011 (3)
...........................................................
EG iterations: 58
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.304sec

checking: [EF [[[1<=ATTENTE_A & 1<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)] | 3<=CAPACITE]] & EX [AF [3<=SORTI_A]]]
normalized: [EX [~ [EG [~ [3<=SORTI_A]]]] & E [true U [3<=CAPACITE | [1<=ATTENTE_A & 1<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]]]]

abstracting: (1<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0))
states: 2,874 (3)
abstracting: (1<=ATTENTE_A)
states: 1,862 (3)
abstracting: (3<=CAPACITE)
states: 2,874 (3)
abstracting: (3<=SORTI_A)
states: 574
..................................................
EG iterations: 50
.-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.065sec

checking: [A [sum(CHOIX_2, CHOIX_1)<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) U ~ [SORTI_A<=ROUTE_A]] | 1<=sum(CONTROLEUR_2, CONTROLEUR_1)]
normalized: [1<=sum(CONTROLEUR_2, CONTROLEUR_1) | [~ [E [SORTI_A<=ROUTE_A U [SORTI_A<=ROUTE_A & ~ [sum(CHOIX_2, CHOIX_1)<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]]]] & ~ [EG [SORTI_A<=ROUTE_A]]]]

abstracting: (SORTI_A<=ROUTE_A)
states: 1,530 (3)
..............................................
EG iterations: 46
abstracting: (sum(CHOIX_2, CHOIX_1)<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0))
states: 2,874 (3)
abstracting: (SORTI_A<=ROUTE_A)
states: 1,530 (3)
abstracting: (SORTI_A<=ROUTE_A)
states: 1,530 (3)
abstracting: (1<=sum(CONTROLEUR_2, CONTROLEUR_1))
states: 841
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.182sec

checking: [[AF [[2<=sum(VIDANGE_2, VIDANGE_1) | 2<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]] & ~ [2<=SUR_PONT_A]] & E [[1<=SORTI_A | sum(CONTROLEUR_2, CONTROLEUR_1)<=SORTI_A] U ~ [2<=ATTENTE_B]]]
normalized: [E [[1<=SORTI_A | sum(CONTROLEUR_2, CONTROLEUR_1)<=SORTI_A] U ~ [2<=ATTENTE_B]] & [~ [2<=SUR_PONT_A] & ~ [EG [~ [[2<=sum(VIDANGE_2, VIDANGE_1) | 2<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]]]]]]

abstracting: (2<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0))
states: 0
abstracting: (2<=sum(VIDANGE_2, VIDANGE_1))
states: 0

EG iterations: 0
abstracting: (2<=SUR_PONT_A)
states: 160
abstracting: (2<=ATTENTE_B)
states: 1,020 (3)
abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=SORTI_A)
states: 2,655 (3)
abstracting: (1<=SORTI_A)
states: 2,108 (3)
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.202sec

checking: [~ [[~ [3<=SORTI_B] & [[sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=ROUTE_A | 2<=CAPACITE] & [3<=sum(VIDANGE_2, VIDANGE_1) | sum(VIDANGE_2, VIDANGE_1)<=ATTENTE_B]]]] | EF [~ [~ [2<=sum(CONTROLEUR_2, CONTROLEUR_1)]]]]
normalized: [E [true U 2<=sum(CONTROLEUR_2, CONTROLEUR_1)] | ~ [[[[3<=sum(VIDANGE_2, VIDANGE_1) | sum(VIDANGE_2, VIDANGE_1)<=ATTENTE_B] & [sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=ROUTE_A | 2<=CAPACITE]] & ~ [3<=SORTI_B]]]]

abstracting: (3<=SORTI_B)
states: 574
abstracting: (2<=CAPACITE)
states: 2,874 (3)
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=ROUTE_A)
states: 1,775 (3)
abstracting: (sum(VIDANGE_2, VIDANGE_1)<=ATTENTE_B)
states: 2,640 (3)
abstracting: (3<=sum(VIDANGE_2, VIDANGE_1))
states: 0
abstracting: (2<=sum(CONTROLEUR_2, CONTROLEUR_1))
states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.142sec

checking: [~ [AF [~ [SUR_PONT_A<=ROUTE_A]]] & [[~ [[3<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0) & 1<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]] | [[1<=ROUTE_B | 1<=CAPACITE] & [1<=ATTENTE_B | ROUTE_A<=CAPACITE]]] | [[[3<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) | sum(VIDANGE_2, VIDANGE_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)] | [ATTENTE_B<=sum(CHOIX_2, CHOIX_1) & 3<=ATTENTE_A]] | 2<=ROUTE_A]]]
normalized: [[[2<=ROUTE_A | [[ATTENTE_B<=sum(CHOIX_2, CHOIX_1) & 3<=ATTENTE_A] | [3<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) | sum(VIDANGE_2, VIDANGE_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]]] | [[[1<=ATTENTE_B | ROUTE_A<=CAPACITE] & [1<=ROUTE_B | 1<=CAPACITE]] | ~ [[3<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0) & 1<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]]]] & EG [SUR_PONT_A<=ROUTE_A]]

abstracting: (SUR_PONT_A<=ROUTE_A)
states: 2,550 (3)
........................................................
EG iterations: 56
abstracting: (1<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0))
states: 2,874 (3)
abstracting: (3<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0))
states: 0
abstracting: (1<=CAPACITE)
states: 2,874 (3)
abstracting: (1<=ROUTE_B)
states: 1,772 (3)
abstracting: (ROUTE_A<=CAPACITE)
states: 2,866 (3)
abstracting: (1<=ATTENTE_B)
states: 1,874 (3)
abstracting: (sum(VIDANGE_2, VIDANGE_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0))
states: 2,874 (3)
abstracting: (3<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0))
states: 0
abstracting: (3<=ATTENTE_A)
states: 420
abstracting: (ATTENTE_B<=sum(CHOIX_2, CHOIX_1))
states: 1,389 (3)
abstracting: (2<=ROUTE_A)
states: 940
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.350sec

totally nodes used: 351470 (3.5e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 277169 888410 1165579
used/not used/entry size/cache size: 1190726 65918138 16 1024MB
basic ops cache: hits/miss/sum: 58616 174948 233564
used/not used/entry size/cache size: 338755 16438461 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 564 564
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 1870 5980 7850
used/not used/entry size/cache size: 5980 8382628 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 66804074
1 282827
2 18734
3 2099
4 398
5 156
6 71
7 42
8 36
9 32
>= 10 395

Total processing time: 0m 9.832sec


BK_STOP 1494459591987

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

ptnet_zbdd.cc:255: 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.000sec


iterations count:1718 (33), effective:171 (3)

initing FirstDep: 0m 0.000sec


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

iterations count:1069 (20), effective:85 (1)

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="BridgeAndVehicles-PT-V04P05N02"
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/BridgeAndVehicles-PT-V04P05N02.tgz
mv BridgeAndVehicles-PT-V04P05N02 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 BridgeAndVehicles-PT-V04P05N02, 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 r001-csrt-149436061500435"
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 ;