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 BridgeAndVehicles-COL-V04P05N02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r005kn-ebro-146347672600075
=====================================================================

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


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

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

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

net check time: 0m 0.000sec

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

init dd package: 0m 7.891sec


RS generation: 0m 0.051sec


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



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

checking: EG [~ [AX [ROUTE_B_dot<=ATTENTE_A_dot]]]
normalized: EG [EX [~ [ROUTE_B_dot<=ATTENTE_A_dot]]]

abstracting: (ROUTE_B_dot<=ATTENTE_A_dot) states: 1,890 (3)
...................................................
EG iterations: 50
-> the formula is FALSE

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

MC time: 0m 0.256sec

checking: EG [AF [[3<=ROUTE_B_dot & 2<=ROUTE_A_dot]]]
normalized: EG [~ [EG [~ [[3<=ROUTE_B_dot & 2<=ROUTE_A_dot]]]]]

abstracting: (2<=ROUTE_A_dot) states: 940
abstracting: (3<=ROUTE_B_dot) states: 371
.
EG iterations: 1
.......................
EG iterations: 23
-> the formula is FALSE

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

MC time: 0m 0.033sec

checking: AF [EG [~ [ATTENTE_B_dot<=sum(VIDANGE_sens2, VIDANGE_sens1)]]]
normalized: ~ [EG [~ [EG [~ [ATTENTE_B_dot<=sum(VIDANGE_sens2, VIDANGE_sens1)]]]]]

abstracting: (ATTENTE_B_dot<=sum(VIDANGE_sens2, VIDANGE_sens1)) states: 1,217 (3)
.....................................
EG iterations: 37

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.200sec

checking: [AF [~ [1<=SUR_PONT_A_dot]] & AF [AG [sum(CONTROLEUR_sens2, CONTROLEUR_sens1)<=ROUTE_A_dot]]]
normalized: [~ [EG [E [true U ~ [sum(CONTROLEUR_sens2, CONTROLEUR_sens1)<=ROUTE_A_dot]]]] & ~ [EG [1<=SUR_PONT_A_dot]]]

abstracting: (1<=SUR_PONT_A_dot) states: 628
.............
EG iterations: 13
abstracting: (sum(CONTROLEUR_sens2, CONTROLEUR_sens1)<=ROUTE_A_dot) states: 2,566 (3)

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

checking: AF [[2<=sum(CHOIX_sens2, CHOIX_sens1) | ROUTE_A_dot<=SORTI_B_dot]]
normalized: ~ [EG [~ [[2<=sum(CHOIX_sens2, CHOIX_sens1) | ROUTE_A_dot<=SORTI_B_dot]]]]

abstracting: (ROUTE_A_dot<=SORTI_B_dot) states: 2,025 (3)
abstracting: (2<=sum(CHOIX_sens2, CHOIX_sens1)) states: 0
...............................
EG iterations: 31
-> the formula is TRUE

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

MC time: 0m 0.205sec

checking: ~ [AF [EG [sum(CHOIX_sens2, CHOIX_sens1)<=sum(VIDANGE_sens2, VIDANGE_sens1)]]]
normalized: EG [~ [EG [sum(CHOIX_sens2, CHOIX_sens1)<=sum(VIDANGE_sens2, VIDANGE_sens1)]]]

abstracting: (sum(CHOIX_sens2, CHOIX_sens1)<=sum(VIDANGE_sens2, VIDANGE_sens1)) states: 1,553 (3)
...........
EG iterations: 11
..........................................................
EG iterations: 58
-> the formula is FALSE

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

MC time: 0m 0.552sec

checking: EG [A [sum(VIDANGE_sens2, VIDANGE_sens1)<=CAPACITE_dot U 3<=sum(VIDANGE_sens2, VIDANGE_sens1)]]
normalized: EG [[~ [EG [~ [3<=sum(VIDANGE_sens2, VIDANGE_sens1)]]] & ~ [E [~ [3<=sum(VIDANGE_sens2, VIDANGE_sens1)] U [~ [3<=sum(VIDANGE_sens2, VIDANGE_sens1)] & ~ [sum(VIDANGE_sens2, VIDANGE_sens1)<=CAPACITE_dot]]]]]]

abstracting: (sum(VIDANGE_sens2, VIDANGE_sens1)<=CAPACITE_dot) states: 2,874 (3)
abstracting: (3<=sum(VIDANGE_sens2, VIDANGE_sens1)) states: 0
abstracting: (3<=sum(VIDANGE_sens2, VIDANGE_sens1)) states: 0
abstracting: (3<=sum(VIDANGE_sens2, VIDANGE_sens1)) states: 0

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.227sec

checking: AG [~ [AG [2<=sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0)]]]
normalized: ~ [E [true U ~ [E [true U ~ [2<=sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0)]]]]]

abstracting: (2<=sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0)) states: 0
-> the formula is TRUE

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

MC time: 0m 0.068sec

checking: ~ [AG [[[2<=ROUTE_B_dot | 2<=CAPACITE_dot] | [ATTENTE_A_dot<=SORTI_B_dot & 2<=CAPACITE_dot]]]]
normalized: E [true U ~ [[[ATTENTE_A_dot<=SORTI_B_dot & 2<=CAPACITE_dot] | [2<=ROUTE_B_dot | 2<=CAPACITE_dot]]]]

abstracting: (2<=CAPACITE_dot) states: 2,874 (3)
abstracting: (2<=ROUTE_B_dot) states: 934
abstracting: (2<=CAPACITE_dot) states: 2,874 (3)
abstracting: (ATTENTE_A_dot<=SORTI_B_dot) states: 1,950 (3)
-> the formula is FALSE

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

MC time: 0m 0.006sec

checking: EX [[EG [1<=ROUTE_A_dot] | AX [2<=sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0)]]]
normalized: EX [[~ [EX [~ [2<=sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0)]]] | EG [1<=ROUTE_A_dot]]]

abstracting: (1<=ROUTE_A_dot) states: 1,775 (3)
....................................................
EG iterations: 52
abstracting: (2<=sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0)) states: 0
..-> the formula is FALSE

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

MC time: 0m 0.285sec

checking: [EF [AF [ATTENTE_A_dot<=sum(VIDANGE_sens2, VIDANGE_sens1)]] & A [1<=CAPACITE_dot U [3<=SORTI_A_dot & 3<=ROUTE_B_dot]]]
normalized: [[~ [EG [~ [[3<=SORTI_A_dot & 3<=ROUTE_B_dot]]]] & ~ [E [~ [[3<=SORTI_A_dot & 3<=ROUTE_B_dot]] U [~ [1<=CAPACITE_dot] & ~ [[3<=SORTI_A_dot & 3<=ROUTE_B_dot]]]]]] & E [true U ~ [EG [~ [ATTENTE_A_dot<=sum(VIDANGE_sens2, VIDANGE_sens1)]]]]]

abstracting: (ATTENTE_A_dot<=sum(VIDANGE_sens2, VIDANGE_sens1)) states: 1,228 (3)
....................................
EG iterations: 36
abstracting: (3<=ROUTE_B_dot) states: 371
abstracting: (3<=SORTI_A_dot) states: 574
abstracting: (1<=CAPACITE_dot) states: 2,874 (3)
abstracting: (3<=ROUTE_B_dot) states: 371
abstracting: (3<=SORTI_A_dot) states: 574
abstracting: (3<=ROUTE_B_dot) states: 371
abstracting: (3<=SORTI_A_dot) states: 574
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.378sec

checking: ~ [~ [[~ [[ATTENTE_A_dot<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0) | 2<=SUR_PONT_B_dot]] | AG [ATTENTE_A_dot<=ATTENTE_A_dot]]]]
normalized: [~ [[ATTENTE_A_dot<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0) | 2<=SUR_PONT_B_dot]] | ~ [E [true U ~ [ATTENTE_A_dot<=ATTENTE_A_dot]]]]

abstracting: (ATTENTE_A_dot<=ATTENTE_A_dot) states: 2,874 (3)
abstracting: (2<=SUR_PONT_B_dot) states: 160
abstracting: (ATTENTE_A_dot<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0)) states: 1,863 (3)
-> the formula is TRUE

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

MC time: 0m 0.117sec

checking: A [EX [ATTENTE_B_dot<=CAPACITE_dot] U [~ [3<=sum(VIDANGE_sens2, VIDANGE_sens1)] & [ROUTE_B_dot<=CAPACITE_dot & sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0)<=ATTENTE_A_dot]]]
normalized: [~ [EG [~ [[[ROUTE_B_dot<=CAPACITE_dot & sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0)<=ATTENTE_A_dot] & ~ [3<=sum(VIDANGE_sens2, VIDANGE_sens1)]]]]] & ~ [E [~ [[[ROUTE_B_dot<=CAPACITE_dot & sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0)<=ATTENTE_A_dot] & ~ [3<=sum(VIDANGE_sens2, VIDANGE_sens1)]]] U [~ [EX [ATTENTE_B_dot<=CAPACITE_dot]] & ~ [[[ROUTE_B_dot<=CAPACITE_dot & sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0)<=ATTENTE_A_dot] & ~ [3<=sum(VIDANGE_sens2, VIDANGE_sens1)]]]]]]]

abstracting: (3<=sum(VIDANGE_sens2, VIDANGE_sens1)) states: 0
abstracting: (sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0)<=ATTENTE_A_dot) states: 1,862 (3)
abstracting: (ROUTE_B_dot<=CAPACITE_dot) states: 2,866 (3)
abstracting: (ATTENTE_B_dot<=CAPACITE_dot) states: 2,866 (3)
.abstracting: (3<=sum(VIDANGE_sens2, VIDANGE_sens1)) states: 0
abstracting: (sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0)<=ATTENTE_A_dot) states: 1,862 (3)
abstracting: (ROUTE_B_dot<=CAPACITE_dot) states: 2,866 (3)
abstracting: (3<=sum(VIDANGE_sens2, VIDANGE_sens1)) states: 0
abstracting: (sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0)<=ATTENTE_A_dot) states: 1,862 (3)
abstracting: (ROUTE_B_dot<=CAPACITE_dot) states: 2,866 (3)
..............................
EG iterations: 30
-> the formula is TRUE

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

MC time: 0m 0.817sec

checking: EG [AF [[SORTI_B_dot<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0) | sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0)<=ATTENTE_A_dot]]]
normalized: EG [~ [EG [~ [[SORTI_B_dot<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0) | sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0)<=ATTENTE_A_dot]]]]]

abstracting: (sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0)<=ATTENTE_A_dot) states: 1,862 (3)
abstracting: (SORTI_B_dot<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0)) states: 1,596 (3)
..................
EG iterations: 18
........................................................
EG iterations: 56
-> the formula is FALSE

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

MC time: 0m 0.627sec

checking: EF [[3<=sum(CONTROLEUR_sens2, CONTROLEUR_sens1) & [[1<=sum(CONTROLEUR_sens2, CONTROLEUR_sens1) & ROUTE_A_dot<=ATTENTE_B_dot] & [SUR_PONT_A_dot<=sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0) & 1<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0)]]]]
normalized: E [true U [3<=sum(CONTROLEUR_sens2, CONTROLEUR_sens1) & [[1<=sum(CONTROLEUR_sens2, CONTROLEUR_sens1) & ROUTE_A_dot<=ATTENTE_B_dot] & [SUR_PONT_A_dot<=sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0) & 1<=sum(NB_ATTENTE_B_voitureB4, NB_ATTENTE_B_voitureB3, NB_ATTENTE_B_voitureB2, NB_ATTENTE_B_voitureB1, NB_ATTENTE_B_voitureB0)]]]]

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: (SUR_PONT_A_dot<=sum(COMPTEUR_compteur2, COMPTEUR_compteur1, COMPTEUR_compteur0)) states: 2,714 (3)
abstracting: (ROUTE_A_dot<=ATTENTE_B_dot) states: 1,890 (3)
abstracting: (1<=sum(CONTROLEUR_sens2, CONTROLEUR_sens1)) states: 841
abstracting: (3<=sum(CONTROLEUR_sens2, CONTROLEUR_sens1)) states: 0
-> the formula is FALSE

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

MC time: 0m 0.312sec

checking: A [~ [[SORTI_A_dot<=sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0) & sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0)<=ROUTE_A_dot]] U EF [3<=sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0)]]
normalized: [~ [EG [~ [E [true U 3<=sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0)]]]] & ~ [E [~ [E [true U 3<=sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0)]] U [[SORTI_A_dot<=sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0) & sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0)<=ROUTE_A_dot] & ~ [E [true U 3<=sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0)]]]]]]

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: (sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0)<=ROUTE_A_dot) states: 1,775 (3)
abstracting: (SORTI_A_dot<=sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0)) states: 1,596 (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: (3<=sum(NB_ATTENTE_A_voitureA4, NB_ATTENTE_A_voitureA3, NB_ATTENTE_A_voitureA2, NB_ATTENTE_A_voitureA1, NB_ATTENTE_A_voitureA0)) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.445sec


Total processing time: 0m19.828sec


BK_STOP 1463590832799

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

923 2044
iterations count:2453 (47), effective:176 (3)

initing FirstDep: 0m 0.000sec


iterations count:204 (3), effective:19 (0)

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

iterations count:52 (1), effective:0 (0)
589
iterations count:1822 (35), effective:114 (2)

iterations count:52 (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="BridgeAndVehicles-COL-V04P05N02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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-COL-V04P05N02.tgz
mv BridgeAndVehicles-COL-V04P05N02 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 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 r005kn-ebro-146347672600075"
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 ;