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_BridgeAndVehicles-COL-V04P05N02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r081-csrt-149441064300291
=====================================================================

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

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

Unfolding complete |P|=28|T|=52|A|=326
Time for unfolding: 0m 1.258sec

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

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

net check time: 0m 0.000sec

init dd package: 0m 1.331sec

parse successfull
net created successfully

Unfolding complete |P|=28|T|=52|A|=326
Time for unfolding: 0m 1.161sec

Net: BridgeAndVehicles_COL_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.379sec


RS generation: 0m 0.059sec


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



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

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

abstracting: (2<=ROUTE_B_dot)
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.169sec

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

abstracting: (3<=SUR_PONT_B_dot)
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.001sec

checking: AF [2<=sum(CONTROLEUR_sens2, CONTROLEUR_sens1)]
normalized: ~ [EG [~ [2<=sum(CONTROLEUR_sens2, CONTROLEUR_sens1)]]]

abstracting: (2<=sum(CONTROLEUR_sens2, CONTROLEUR_sens1))
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.046sec

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

abstracting: (CAPACITE_dot<=CAPACITE_dot)
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_sens2, CHOIX_sens1)]
normalized: ~ [EG [~ [2<=sum(CHOIX_sens2, CHOIX_sens1)]]]

abstracting: (2<=sum(CHOIX_sens2, CHOIX_sens1))
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.048sec

checking: EG [SUR_PONT_A_dot<=SUR_PONT_B_dot]
normalized: EG [SUR_PONT_A_dot<=SUR_PONT_B_dot]

abstracting: (SUR_PONT_A_dot<=SUR_PONT_B_dot)
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.160sec

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

abstracting: (1<=SUR_PONT_B_dot)
states: 628
abstracting: (SUR_PONT_B_dot<=SUR_PONT_B_dot)
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.043sec

checking: EG [sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0)<=CAPACITE_dot]
normalized: EG [sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0)<=CAPACITE_dot]

abstracting: (sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0)<=CAPACITE_dot)
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.049sec

checking: EF [[~ [[2<=CAPACITE_dot | 1<=sum(VIDANGE_sens2, VIDANGE_sens1)]] | ~ [3<=CAPACITE_dot]]]
normalized: E [true U [~ [[2<=CAPACITE_dot | 1<=sum(VIDANGE_sens2, VIDANGE_sens1)]] | ~ [3<=CAPACITE_dot]]]

abstracting: (3<=CAPACITE_dot)
states: 2,874 (3)
abstracting: (1<=sum(VIDANGE_sens2, VIDANGE_sens1))
states: 712
abstracting: (2<=CAPACITE_dot)
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.051sec

checking: ~ [AF [[~ [3<=ROUTE_A_dot] & [sum(CONTROLEUR_sens2, CONTROLEUR_sens1)<=ATTENTE_B_dot & 3<=SORTI_A_dot]]]]
normalized: EG [~ [[~ [3<=ROUTE_A_dot] & [sum(CONTROLEUR_sens2, CONTROLEUR_sens1)<=ATTENTE_B_dot & 3<=SORTI_A_dot]]]]

abstracting: (3<=SORTI_A_dot)
states: 574
abstracting: (sum(CONTROLEUR_sens2, CONTROLEUR_sens1)<=ATTENTE_B_dot)
states: 2,593 (3)
abstracting: (3<=ROUTE_A_dot)
states: 380
..................................................
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.346sec

checking: A [[1<=sum(CHOIX_sens2, CHOIX_sens1) | [3<=CAPACITE_dot | 3<=ROUTE_A_dot]] U AX [2<=ATTENTE_A_dot]]
normalized: [~ [EG [EX [~ [2<=ATTENTE_A_dot]]]] & ~ [E [EX [~ [2<=ATTENTE_A_dot]] U [EX [~ [2<=ATTENTE_A_dot]] & ~ [[1<=sum(CHOIX_sens2, CHOIX_sens1) | [3<=CAPACITE_dot | 3<=ROUTE_A_dot]]]]]]]

abstracting: (3<=ROUTE_A_dot)
states: 380
abstracting: (3<=CAPACITE_dot)
states: 2,874 (3)
abstracting: (1<=sum(CHOIX_sens2, CHOIX_sens1))
states: 1,321 (3)
abstracting: (2<=ATTENTE_A_dot)
states: 1,011 (3)
.abstracting: (2<=ATTENTE_A_dot)
states: 1,011 (3)
.abstracting: (2<=ATTENTE_A_dot)
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.339sec

checking: [EX [AF [3<=SORTI_A_dot]] & EF [[3<=CAPACITE_dot | [1<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0) & 1<=ATTENTE_A_dot]]]]
normalized: [E [true U [3<=CAPACITE_dot | [1<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0) & 1<=ATTENTE_A_dot]]] & EX [~ [EG [~ [3<=SORTI_A_dot]]]]]

abstracting: (3<=SORTI_A_dot)
states: 574
..................................................
EG iterations: 50
.abstracting: (1<=ATTENTE_A_dot)
states: 1,862 (3)
abstracting: (1<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0))
states: 2,874 (3)
abstracting: (3<=CAPACITE_dot)
states: 2,874 (3)
-> the formula is TRUE

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

MC time: 0m 0.101sec

checking: [A [sum(CHOIX_sens2, CHOIX_sens1)<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0) U ~ [SORTI_A_dot<=ROUTE_A_dot]] | 1<=sum(CONTROLEUR_sens2, CONTROLEUR_sens1)]
normalized: [1<=sum(CONTROLEUR_sens2, CONTROLEUR_sens1) | [~ [EG [SORTI_A_dot<=ROUTE_A_dot]] & ~ [E [SORTI_A_dot<=ROUTE_A_dot U [SORTI_A_dot<=ROUTE_A_dot & ~ [sum(CHOIX_sens2, CHOIX_sens1)<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0)]]]]]]

abstracting: (sum(CHOIX_sens2, CHOIX_sens1)<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0))
states: 2,874 (3)
abstracting: (SORTI_A_dot<=ROUTE_A_dot)
states: 1,530 (3)
abstracting: (SORTI_A_dot<=ROUTE_A_dot)
states: 1,530 (3)
abstracting: (SORTI_A_dot<=ROUTE_A_dot)
states: 1,530 (3)
..............................................
EG iterations: 46
abstracting: (1<=sum(CONTROLEUR_sens2, CONTROLEUR_sens1))
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.309sec

checking: [[~ [2<=SUR_PONT_A_dot] & AF [[2<=sum(VIDANGE_sens2, VIDANGE_sens1) | 2<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0)]]] & E [[sum(CONTROLEUR_sens2, CONTROLEUR_sens1)<=SORTI_A_dot | 1<=SORTI_A_dot] U ~ [2<=ATTENTE_B_dot]]]
normalized: [[~ [2<=SUR_PONT_A_dot] & ~ [EG [~ [[2<=sum(VIDANGE_sens2, VIDANGE_sens1) | 2<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0)]]]]] & E [[sum(CONTROLEUR_sens2, CONTROLEUR_sens1)<=SORTI_A_dot | 1<=SORTI_A_dot] U ~ [2<=ATTENTE_B_dot]]]

abstracting: (2<=ATTENTE_B_dot)
states: 1,020 (3)
abstracting: (1<=SORTI_A_dot)
states: 2,108 (3)
abstracting: (sum(CONTROLEUR_sens2, CONTROLEUR_sens1)<=SORTI_A_dot)
states: 2,655 (3)
abstracting: (2<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0))
states: 0
abstracting: (2<=sum(VIDANGE_sens2, VIDANGE_sens1))
states: 0

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

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

MC time: 0m 0.186sec

checking: [~ [[[[2<=CAPACITE_dot | sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0)<=ROUTE_A_dot] & [3<=sum(VIDANGE_sens2, VIDANGE_sens1) | sum(VIDANGE_sens2, VIDANGE_sens1)<=ATTENTE_B_dot]] & ~ [3<=SORTI_B_dot]]] | EF [~ [~ [2<=sum(CONTROLEUR_sens2, CONTROLEUR_sens1)]]]]
normalized: [~ [[~ [3<=SORTI_B_dot] & [[3<=sum(VIDANGE_sens2, VIDANGE_sens1) | sum(VIDANGE_sens2, VIDANGE_sens1)<=ATTENTE_B_dot] & [2<=CAPACITE_dot | sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0)<=ROUTE_A_dot]]]] | E [true U 2<=sum(CONTROLEUR_sens2, CONTROLEUR_sens1)]]

abstracting: (2<=sum(CONTROLEUR_sens2, CONTROLEUR_sens1))
states: 0
abstracting: (sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0)<=ROUTE_A_dot)
states: 1,775 (3)
abstracting: (2<=CAPACITE_dot)
states: 2,874 (3)
abstracting: (sum(VIDANGE_sens2, VIDANGE_sens1)<=ATTENTE_B_dot)
states: 2,640 (3)
abstracting: (3<=sum(VIDANGE_sens2, VIDANGE_sens1))
states: 0
abstracting: (3<=SORTI_B_dot)
states: 574
-> the formula is FALSE

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

MC time: 0m 0.148sec

checking: [[[[[sum(VIDANGE_sens2, VIDANGE_sens1)<=sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0) | 3<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0)] | [3<=ATTENTE_A_dot & ATTENTE_B_dot<=sum(CHOIX_sens2, CHOIX_sens1)]] | 2<=ROUTE_A_dot] | [[[1<=CAPACITE_dot | 1<=ROUTE_B_dot] & [1<=ATTENTE_B_dot | ROUTE_A_dot<=CAPACITE_dot]] | ~ [[1<=sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0) & 3<=sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0)]]]] & ~ [AF [~ [SUR_PONT_A_dot<=ROUTE_A_dot]]]]
normalized: [EG [SUR_PONT_A_dot<=ROUTE_A_dot] & [[2<=ROUTE_A_dot | [[sum(VIDANGE_sens2, VIDANGE_sens1)<=sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0) | 3<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0)] | [3<=ATTENTE_A_dot & ATTENTE_B_dot<=sum(CHOIX_sens2, CHOIX_sens1)]]] | [~ [[1<=sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0) & 3<=sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0)]] | [[1<=CAPACITE_dot | 1<=ROUTE_B_dot] & [1<=ATTENTE_B_dot | ROUTE_A_dot<=CAPACITE_dot]]]]]

abstracting: (ROUTE_A_dot<=CAPACITE_dot)
states: 2,866 (3)
abstracting: (1<=ATTENTE_B_dot)
states: 1,874 (3)
abstracting: (1<=ROUTE_B_dot)
states: 1,772 (3)
abstracting: (1<=CAPACITE_dot)
states: 2,874 (3)
abstracting: (3<=sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0))
states: 0
abstracting: (1<=sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0))
states: 2,874 (3)
abstracting: (ATTENTE_B_dot<=sum(CHOIX_sens2, CHOIX_sens1))
states: 1,389 (3)
abstracting: (3<=ATTENTE_A_dot)
states: 420
abstracting: (3<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0))
states: 0
abstracting: (sum(VIDANGE_sens2, VIDANGE_sens1)<=sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0))
states: 2,874 (3)
abstracting: (2<=ROUTE_A_dot)
states: 940
abstracting: (SUR_PONT_A_dot<=ROUTE_A_dot)
states: 2,550 (3)
........................................................
EG iterations: 56
-> the formula is FALSE

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

MC time: 0m 0.603sec

totally nodes used: 564376 (5.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 428795 1594745 2023540
used/not used/entry size/cache size: 1966999 65141865 16 1024MB
basic ops cache: hits/miss/sum: 88301 272094 360395
used/not used/entry size/cache size: 518475 16258741 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 443 443
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 4041 13614 17655
used/not used/entry size/cache size: 13609 8374999 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 66604810
1 458980
2 37835
3 5273
4 990
5 170
6 97
7 230
8 73
9 46
>= 10 360

Total processing time: 0m13.089sec


BK_STOP 1494890180918

--------------------
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:2453 (47), effective:176 (3)

initing FirstDep: 0m 0.000sec


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

iterations count:1406 (27), effective:94 (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="S_BridgeAndVehicles-COL-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/S_BridgeAndVehicles-COL-V04P05N02.tgz
mv S_BridgeAndVehicles-COL-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 S_BridgeAndVehicles-COL-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 r081-csrt-149441064300291"
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 ;