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

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

=== Now, execution of the tool begins

BK_START 1494894803841

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: 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.258sec

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


RS generation: 0m 0.025sec


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



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

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

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

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (CAPACITE<=SORTI_A)
states: 68
-> the formula is TRUE

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

MC time: 0m 0.121sec

checking: EF [2<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]
normalized: E [true U 2<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]

abstracting: (2<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0))
states: 0
-> the formula is FALSE

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

MC time: 0m 0.036sec

checking: AG [~ [[sum(CONTROLEUR_2, CONTROLEUR_1)<=ATTENTE_A & [3<=sum(VIDANGE_2, VIDANGE_1) & 3<=SUR_PONT_A]]]]
normalized: ~ [E [true U [sum(CONTROLEUR_2, CONTROLEUR_1)<=ATTENTE_A & [3<=sum(VIDANGE_2, VIDANGE_1) & 3<=SUR_PONT_A]]]]

abstracting: (3<=SUR_PONT_A)
states: 0
abstracting: (3<=sum(VIDANGE_2, VIDANGE_1))
states: 0
abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=ATTENTE_A)
states: 2,589 (3)
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.072sec

checking: AG [~ [[[SUR_PONT_A<=ROUTE_B | 1<=SORTI_A] & [1<=sum(VIDANGE_2, VIDANGE_1) & 3<=SUR_PONT_A]]]]
normalized: ~ [E [true U [[1<=sum(VIDANGE_2, VIDANGE_1) & 3<=SUR_PONT_A] & [SUR_PONT_A<=ROUTE_B | 1<=SORTI_A]]]]

abstracting: (1<=SORTI_A)
states: 2,108 (3)
abstracting: (SUR_PONT_A<=ROUTE_B)
states: 2,608 (3)
abstracting: (3<=SUR_PONT_A)
states: 0
abstracting: (1<=sum(VIDANGE_2, VIDANGE_1))
states: 712
-> the formula is TRUE

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

MC time: 0m 0.040sec

checking: AG [[2<=SORTI_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)]]
normalized: ~ [E [true U ~ [[2<=SORTI_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)]]]]

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: (2<=SORTI_A)
states: 1,278 (3)
-> the formula is TRUE

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

MC time: 0m 0.038sec

checking: EF [[[~ [3<=CAPACITE] & [SORTI_B<=CAPACITE | sum(CONTROLEUR_2, CONTROLEUR_1)<=ROUTE_B]] & ~ [[sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=CAPACITE & 2<=ROUTE_B]]]]
normalized: E [true U [~ [[sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=CAPACITE & 2<=ROUTE_B]] & [[SORTI_B<=CAPACITE | sum(CONTROLEUR_2, CONTROLEUR_1)<=ROUTE_B] & ~ [3<=CAPACITE]]]]

abstracting: (3<=CAPACITE)
states: 2,874 (3)
abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=ROUTE_B)
states: 2,565 (3)
abstracting: (SORTI_B<=CAPACITE)
states: 2,862 (3)
abstracting: (2<=ROUTE_B)
states: 934
abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=CAPACITE)
states: 2,874 (3)
-> the formula is FALSE

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

MC time: 0m 0.089sec

checking: AG [[[sum(CHOIX_2, CHOIX_1)<=sum(VIDANGE_2, VIDANGE_1) | [3<=ATTENTE_A | 1<=sum(CHOIX_2, CHOIX_1)]] | sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=ATTENTE_A]]
normalized: ~ [E [true U ~ [[sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=ATTENTE_A | [sum(CHOIX_2, CHOIX_1)<=sum(VIDANGE_2, VIDANGE_1) | [3<=ATTENTE_A | 1<=sum(CHOIX_2, CHOIX_1)]]]]]]

abstracting: (1<=sum(CHOIX_2, CHOIX_1))
states: 1,321 (3)
abstracting: (3<=ATTENTE_A)
states: 420
abstracting: (sum(CHOIX_2, CHOIX_1)<=sum(VIDANGE_2, VIDANGE_1))
states: 1,553 (3)
abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=ATTENTE_A)
states: 1,862 (3)
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.118sec

checking: EF [[[~ [1<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)] & ~ [sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=SUR_PONT_A]] & [~ [ATTENTE_A<=SUR_PONT_A] & ATTENTE_A<=ROUTE_B]]]
normalized: E [true U [[ATTENTE_A<=ROUTE_B & ~ [ATTENTE_A<=SUR_PONT_A]] & [~ [sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=SUR_PONT_A] & ~ [1<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)]]]]

abstracting: (1<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0))
states: 2,874 (3)
abstracting: (sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=SUR_PONT_A)
states: 628
abstracting: (ATTENTE_A<=SUR_PONT_A)
states: 1,236 (3)
abstracting: (ATTENTE_A<=ROUTE_B)
states: 1,778 (3)
-> the formula is FALSE

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

MC time: 0m 0.080sec

checking: EF [[[[sum(VIDANGE_2, VIDANGE_1)<=ROUTE_B & CAPACITE<=sum(CHOIX_2, CHOIX_1)] & [1<=SUR_PONT_B | 2<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]] & ~ [[3<=ROUTE_B | 3<=sum(CONTROLEUR_2, CONTROLEUR_1)]]]]
normalized: E [true U [~ [[3<=ROUTE_B | 3<=sum(CONTROLEUR_2, CONTROLEUR_1)]] & [[1<=SUR_PONT_B | 2<=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)<=ROUTE_B & CAPACITE<=sum(CHOIX_2, CHOIX_1)]]]]

abstracting: (CAPACITE<=sum(CHOIX_2, CHOIX_1))
states: 0
abstracting: (sum(VIDANGE_2, VIDANGE_1)<=ROUTE_B)
states: 2,594 (3)
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: (1<=SUR_PONT_B)
states: 628
abstracting: (3<=sum(CONTROLEUR_2, CONTROLEUR_1))
states: 0
abstracting: (3<=ROUTE_B)
states: 371
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.160sec

checking: EF [[3<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) & [[3<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0) | sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=SORTI_A] & 3<=sum(CONTROLEUR_2, CONTROLEUR_1)]]]
normalized: E [true U [3<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) & [3<=sum(CONTROLEUR_2, CONTROLEUR_1) & [3<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0) | sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=SORTI_A]]]]

abstracting: (sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=SORTI_A)
states: 2,108 (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: (3<=sum(CONTROLEUR_2, CONTROLEUR_1))
states: 0
abstracting: (3<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0))
states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.117sec

checking: EF [[sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=sum(CHOIX_2, CHOIX_1) & [[SORTI_A<=SORTI_B & ATTENTE_B<=CAPACITE] & [2<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) & 3<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]]]]
normalized: E [true U [sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=sum(CHOIX_2, CHOIX_1) & [[SORTI_A<=SORTI_B & ATTENTE_B<=CAPACITE] & [2<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) & 3<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]]]]

abstracting: (3<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0))
states: 0
abstracting: (2<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0))
states: 0
abstracting: (ATTENTE_B<=CAPACITE)
states: 2,866 (3)
abstracting: (SORTI_A<=SORTI_B)
states: 1,832 (3)
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=sum(CHOIX_2, CHOIX_1))
states: 1,321 (3)
-> the formula is FALSE

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

MC time: 0m 0.043sec

checking: EF [[[[sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=sum(CHOIX_2, CHOIX_1) | 3<=sum(VIDANGE_2, VIDANGE_1)] & [sum(VIDANGE_2, VIDANGE_1)<=ROUTE_A & 3<=SORTI_A]] & [[2<=ROUTE_A & sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=SUR_PONT_B] & 3<=ATTENTE_B]]]
normalized: E [true U [[[sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=sum(CHOIX_2, CHOIX_1) | 3<=sum(VIDANGE_2, VIDANGE_1)] & [sum(VIDANGE_2, VIDANGE_1)<=ROUTE_A & 3<=SORTI_A]] & [3<=ATTENTE_B & [2<=ROUTE_A & sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=SUR_PONT_B]]]]

abstracting: (sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=SUR_PONT_B)
states: 628
abstracting: (2<=ROUTE_A)
states: 940
abstracting: (3<=ATTENTE_B)
states: 426
abstracting: (3<=SORTI_A)
states: 574
abstracting: (sum(VIDANGE_2, VIDANGE_1)<=ROUTE_A)
states: 2,595 (3)
abstracting: (3<=sum(VIDANGE_2, VIDANGE_1))
states: 0
abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=sum(CHOIX_2, CHOIX_1))
states: 1,321 (3)
-> the formula is FALSE

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

MC time: 0m 0.121sec

checking: EF [[[[sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=SORTI_A | sum(CHOIX_2, CHOIX_1)<=SORTI_B] & SORTI_A<=SUR_PONT_A] & [[SORTI_B<=SUR_PONT_B & sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=sum(CONTROLEUR_2, CONTROLEUR_1)] & ~ [sum(CHOIX_2, CHOIX_1)<=SUR_PONT_A]]]]
normalized: E [true U [[~ [sum(CHOIX_2, CHOIX_1)<=SUR_PONT_A] & [SORTI_B<=SUR_PONT_B & sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=sum(CONTROLEUR_2, CONTROLEUR_1)]] & [SORTI_A<=SUR_PONT_A & [sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=SORTI_A | sum(CHOIX_2, CHOIX_1)<=SORTI_B]]]]

abstracting: (sum(CHOIX_2, CHOIX_1)<=SORTI_B)
states: 2,550 (3)
abstracting: (sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=SORTI_A)
states: 2,108 (3)
abstracting: (SORTI_A<=SUR_PONT_A)
states: 986
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=sum(CONTROLEUR_2, CONTROLEUR_1))
states: 841
abstracting: (SORTI_B<=SUR_PONT_B)
states: 986
abstracting: (sum(CHOIX_2, CHOIX_1)<=SUR_PONT_A)
states: 1,843 (3)
-> the formula is FALSE

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

MC time: 0m 0.115sec

checking: AG [[[[SUR_PONT_B<=SORTI_A | 1<=SORTI_B] & SORTI_A<=SUR_PONT_A] | [[sum(CONTROLEUR_2, CONTROLEUR_1)<=sum(CONTROLEUR_2, CONTROLEUR_1) & sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)] | [ATTENTE_A<=ATTENTE_B | sum(CONTROLEUR_2, CONTROLEUR_1)<=ATTENTE_A]]]]
normalized: ~ [E [true U ~ [[[[ATTENTE_A<=ATTENTE_B | sum(CONTROLEUR_2, CONTROLEUR_1)<=ATTENTE_A] | [sum(CONTROLEUR_2, CONTROLEUR_1)<=sum(CONTROLEUR_2, CONTROLEUR_1) & sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]] | [SORTI_A<=SUR_PONT_A & [SUR_PONT_B<=SORTI_A | 1<=SORTI_B]]]]]]

abstracting: (1<=SORTI_B)
states: 2,108 (3)
abstracting: (SUR_PONT_B<=SORTI_A)
states: 2,662 (3)
abstracting: (SORTI_A<=SUR_PONT_A)
states: 986
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=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: (sum(CONTROLEUR_2, CONTROLEUR_1)<=sum(CONTROLEUR_2, CONTROLEUR_1))
states: 2,874 (3)
abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=ATTENTE_A)
states: 2,589 (3)
abstracting: (ATTENTE_A<=ATTENTE_B)
states: 1,836 (3)
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

totally nodes used: 48714 (4.9e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 58553 171341 229894
used/not used/entry size/cache size: 204603 66904261 16 1024MB
basic ops cache: hits/miss/sum: 32455 92160 124615
used/not used/entry size/cache size: 154998 16622218 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 896 896
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 2644 8265 10909
used/not used/entry size/cache size: 8265 8380343 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 67063228
1 44433
2 981
3 89
4 64
5 22
6 15
7 2
8 2
9 3
>= 10 25

Total processing time: 0m 8.385sec


BK_STOP 1494894812314

--------------------
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:4237 (81), effective:365 (7)

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-PT-V04P05N02"
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/S_BridgeAndVehicles-PT-V04P05N02.tgz
mv S_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 S_BridgeAndVehicles-PT-V04P05N02, 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 r081-csrt-149441064400439"
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 ;