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-2270
Executing tool marcie
Input is BridgeAndVehicles-PT-V20P20N10, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r190su-smll-143330904700333
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433581573333

Model: BridgeAndVehicles-PT-V20P20N10
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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=ReachabilityBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 68 NrTr: 548 NrArc: 4070)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m3sec


RS generation: 2m47sec


-> reachability set: #nodes 1349507 (1.3e+06) #states 6,732,570 (6)



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

checking: sum(maxVal(NB_ATTENTE_B_20), maxVal(NB_ATTENTE_B_19), maxVal(NB_ATTENTE_B_18), maxVal(NB_ATTENTE_B_17), maxVal(NB_ATTENTE_B_16), maxVal(NB_ATTENTE_B_15), maxVal(NB_ATTENTE_B_14), maxVal(NB_ATTENTE_B_13), maxVal(NB_ATTENTE_B_12), maxVal(NB_ATTENTE_B_11), maxVal(NB_ATTENTE_B_10), maxVal(NB_ATTENTE_B_9), maxVal(NB_ATTENTE_B_8), maxVal(NB_ATTENTE_B_7), maxVal(NB_ATTENTE_B_6), maxVal(NB_ATTENTE_B_5), maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=2
normalized: sum(maxVal(NB_ATTENTE_B_20), maxVal(NB_ATTENTE_B_19), maxVal(NB_ATTENTE_B_18), maxVal(NB_ATTENTE_B_17), maxVal(NB_ATTENTE_B_16), maxVal(NB_ATTENTE_B_15), maxVal(NB_ATTENTE_B_14), maxVal(NB_ATTENTE_B_13), maxVal(NB_ATTENTE_B_12), maxVal(NB_ATTENTE_B_11), maxVal(NB_ATTENTE_B_10), maxVal(NB_ATTENTE_B_9), maxVal(NB_ATTENTE_B_8), maxVal(NB_ATTENTE_B_7), maxVal(NB_ATTENTE_B_6), maxVal(NB_ATTENTE_B_5), maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=2

abstracting: (21<=2) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityBounds-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[sum(maxVal(NB_ATTENTE_B_20), maxVal(NB_ATTENTE_B_19), maxVal(NB_ATTENTE_B_18), maxVal(NB_ATTENTE_B_17), maxVal(NB_ATTENTE_B_16), maxVal(NB_ATTENTE_B_15), maxVal(NB_ATTENTE_B_14), maxVal(NB_ATTENTE_B_13), maxVal(NB_ATTENTE_B_12), maxVal(NB_ATTENTE_B_11), maxVal(NB_ATTENTE_B_10), maxVal(NB_ATTENTE_B_9), maxVal(NB_ATTENTE_B_8), maxVal(NB_ATTENTE_B_7), maxVal(NB_ATTENTE_B_6), maxVal(NB_ATTENTE_B_5), maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=1 & [[maxVal(ROUTE_A)<=2 & sum(maxVal(NB_ATTENTE_A_20), maxVal(NB_ATTENTE_A_19), maxVal(NB_ATTENTE_A_18), maxVal(NB_ATTENTE_A_17), maxVal(NB_ATTENTE_A_16), maxVal(NB_ATTENTE_A_15), maxVal(NB_ATTENTE_A_14), maxVal(NB_ATTENTE_A_13), maxVal(NB_ATTENTE_A_12), maxVal(NB_ATTENTE_A_11), maxVal(NB_ATTENTE_A_10), maxVal(NB_ATTENTE_A_9), maxVal(NB_ATTENTE_A_8), maxVal(NB_ATTENTE_A_7), maxVal(NB_ATTENTE_A_6), maxVal(NB_ATTENTE_A_5), maxVal(NB_ATTENTE_A_4), maxVal(NB_ATTENTE_A_3), maxVal(NB_ATTENTE_A_2), maxVal(NB_ATTENTE_A_1), maxVal(NB_ATTENTE_A_0))<=3] & sum(maxVal(NB_ATTENTE_B_20), maxVal(NB_ATTENTE_B_19), maxVal(NB_ATTENTE_B_18), maxVal(NB_ATTENTE_B_17), maxVal(NB_ATTENTE_B_16), maxVal(NB_ATTENTE_B_15), maxVal(NB_ATTENTE_B_14), maxVal(NB_ATTENTE_B_13), maxVal(NB_ATTENTE_B_12), maxVal(NB_ATTENTE_B_11), maxVal(NB_ATTENTE_B_10), maxVal(NB_ATTENTE_B_9), maxVal(NB_ATTENTE_B_8), maxVal(NB_ATTENTE_B_7), maxVal(NB_ATTENTE_B_6), maxVal(NB_ATTENTE_B_5), maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=2]] & maxVal(ROUTE_A)<=2] & [[sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))<=2 & sum(maxVal(NB_ATTENTE_B_20), maxVal(NB_ATTENTE_B_19), maxVal(NB_ATTENTE_B_18), maxVal(NB_ATTENTE_B_17), maxVal(NB_ATTENTE_B_16), maxVal(NB_ATTENTE_B_15), maxVal(NB_ATTENTE_B_14), maxVal(NB_ATTENTE_B_13), maxVal(NB_ATTENTE_B_12), maxVal(NB_ATTENTE_B_11), maxVal(NB_ATTENTE_B_10), maxVal(NB_ATTENTE_B_9), maxVal(NB_ATTENTE_B_8), maxVal(NB_ATTENTE_B_7), maxVal(NB_ATTENTE_B_6), maxVal(NB_ATTENTE_B_5), maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=1] & sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))<=3]] & maxVal(ROUTE_A)<=3]
normalized: [maxVal(ROUTE_A)<=3 & [[maxVal(ROUTE_A)<=2 & [sum(maxVal(NB_ATTENTE_B_20), maxVal(NB_ATTENTE_B_19), maxVal(NB_ATTENTE_B_18), maxVal(NB_ATTENTE_B_17), maxVal(NB_ATTENTE_B_16), maxVal(NB_ATTENTE_B_15), maxVal(NB_ATTENTE_B_14), maxVal(NB_ATTENTE_B_13), maxVal(NB_ATTENTE_B_12), maxVal(NB_ATTENTE_B_11), maxVal(NB_ATTENTE_B_10), maxVal(NB_ATTENTE_B_9), maxVal(NB_ATTENTE_B_8), maxVal(NB_ATTENTE_B_7), maxVal(NB_ATTENTE_B_6), maxVal(NB_ATTENTE_B_5), maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=1 & [sum(maxVal(NB_ATTENTE_B_20), maxVal(NB_ATTENTE_B_19), maxVal(NB_ATTENTE_B_18), maxVal(NB_ATTENTE_B_17), maxVal(NB_ATTENTE_B_16), maxVal(NB_ATTENTE_B_15), maxVal(NB_ATTENTE_B_14), maxVal(NB_ATTENTE_B_13), maxVal(NB_ATTENTE_B_12), maxVal(NB_ATTENTE_B_11), maxVal(NB_ATTENTE_B_10), maxVal(NB_ATTENTE_B_9), maxVal(NB_ATTENTE_B_8), maxVal(NB_ATTENTE_B_7), maxVal(NB_ATTENTE_B_6), maxVal(NB_ATTENTE_B_5), maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=2 & [maxVal(ROUTE_A)<=2 & sum(maxVal(NB_ATTENTE_A_20), maxVal(NB_ATTENTE_A_19), maxVal(NB_ATTENTE_A_18), maxVal(NB_ATTENTE_A_17), maxVal(NB_ATTENTE_A_16), maxVal(NB_ATTENTE_A_15), maxVal(NB_ATTENTE_A_14), maxVal(NB_ATTENTE_A_13), maxVal(NB_ATTENTE_A_12), maxVal(NB_ATTENTE_A_11), maxVal(NB_ATTENTE_A_10), maxVal(NB_ATTENTE_A_9), maxVal(NB_ATTENTE_A_8), maxVal(NB_ATTENTE_A_7), maxVal(NB_ATTENTE_A_6), maxVal(NB_ATTENTE_A_5), maxVal(NB_ATTENTE_A_4), maxVal(NB_ATTENTE_A_3), maxVal(NB_ATTENTE_A_2), maxVal(NB_ATTENTE_A_1), maxVal(NB_ATTENTE_A_0))<=3]]]] & [sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))<=3 & [sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))<=2 & sum(maxVal(NB_ATTENTE_B_20), maxVal(NB_ATTENTE_B_19), maxVal(NB_ATTENTE_B_18), maxVal(NB_ATTENTE_B_17), maxVal(NB_ATTENTE_B_16), maxVal(NB_ATTENTE_B_15), maxVal(NB_ATTENTE_B_14), maxVal(NB_ATTENTE_B_13), maxVal(NB_ATTENTE_B_12), maxVal(NB_ATTENTE_B_11), maxVal(NB_ATTENTE_B_10), maxVal(NB_ATTENTE_B_9), maxVal(NB_ATTENTE_B_8), maxVal(NB_ATTENTE_B_7), maxVal(NB_ATTENTE_B_6), maxVal(NB_ATTENTE_B_5), maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=1]]]]

abstracting: (21<=1) states: 0
abstracting: (2<=2) states: 6,732,570 (6)
abstracting: (2<=3) states: 6,732,570 (6)
abstracting: (21<=3) states: 0
abstracting: (20<=2) states: 0
abstracting: (21<=2) states: 0
abstracting: (21<=1) states: 0
abstracting: (20<=2) states: 0
abstracting: (20<=3) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityBounds-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(SUR_PONT_A)<=2
normalized: maxVal(SUR_PONT_A)<=2

abstracting: (10<=2) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityBounds-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(ROUTE_B)<=3
normalized: maxVal(ROUTE_B)<=3

abstracting: (20<=3) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityBounds-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(SUR_PONT_B)<=2 & sum(maxVal(CONTROLEUR_2), maxVal(CONTROLEUR_1))<=1]
normalized: [maxVal(SUR_PONT_B)<=2 & sum(maxVal(CONTROLEUR_2), maxVal(CONTROLEUR_1))<=1]

abstracting: (2<=1) states: 0
abstracting: (10<=2) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityBounds-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(NB_ATTENTE_B_20), maxVal(NB_ATTENTE_B_19), maxVal(NB_ATTENTE_B_18), maxVal(NB_ATTENTE_B_17), maxVal(NB_ATTENTE_B_16), maxVal(NB_ATTENTE_B_15), maxVal(NB_ATTENTE_B_14), maxVal(NB_ATTENTE_B_13), maxVal(NB_ATTENTE_B_12), maxVal(NB_ATTENTE_B_11), maxVal(NB_ATTENTE_B_10), maxVal(NB_ATTENTE_B_9), maxVal(NB_ATTENTE_B_8), maxVal(NB_ATTENTE_B_7), maxVal(NB_ATTENTE_B_6), maxVal(NB_ATTENTE_B_5), maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=2
normalized: sum(maxVal(NB_ATTENTE_B_20), maxVal(NB_ATTENTE_B_19), maxVal(NB_ATTENTE_B_18), maxVal(NB_ATTENTE_B_17), maxVal(NB_ATTENTE_B_16), maxVal(NB_ATTENTE_B_15), maxVal(NB_ATTENTE_B_14), maxVal(NB_ATTENTE_B_13), maxVal(NB_ATTENTE_B_12), maxVal(NB_ATTENTE_B_11), maxVal(NB_ATTENTE_B_10), maxVal(NB_ATTENTE_B_9), maxVal(NB_ATTENTE_B_8), maxVal(NB_ATTENTE_B_7), maxVal(NB_ATTENTE_B_6), maxVal(NB_ATTENTE_B_5), maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=2

abstracting: (21<=2) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityBounds-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [sum(maxVal(COMPTEUR_10), maxVal(COMPTEUR_9), maxVal(COMPTEUR_8), maxVal(COMPTEUR_7), maxVal(COMPTEUR_6), maxVal(COMPTEUR_5), maxVal(COMPTEUR_4), maxVal(COMPTEUR_3), maxVal(COMPTEUR_2), maxVal(COMPTEUR_1), maxVal(COMPTEUR_0))<=1 & [[sum(maxVal(COMPTEUR_10), maxVal(COMPTEUR_9), maxVal(COMPTEUR_8), maxVal(COMPTEUR_7), maxVal(COMPTEUR_6), maxVal(COMPTEUR_5), maxVal(COMPTEUR_4), maxVal(COMPTEUR_3), maxVal(COMPTEUR_2), maxVal(COMPTEUR_1), maxVal(COMPTEUR_0))<=2 & sum(maxVal(NB_ATTENTE_B_20), maxVal(NB_ATTENTE_B_19), maxVal(NB_ATTENTE_B_18), maxVal(NB_ATTENTE_B_17), maxVal(NB_ATTENTE_B_16), maxVal(NB_ATTENTE_B_15), maxVal(NB_ATTENTE_B_14), maxVal(NB_ATTENTE_B_13), maxVal(NB_ATTENTE_B_12), maxVal(NB_ATTENTE_B_11), maxVal(NB_ATTENTE_B_10), maxVal(NB_ATTENTE_B_9), maxVal(NB_ATTENTE_B_8), maxVal(NB_ATTENTE_B_7), maxVal(NB_ATTENTE_B_6), maxVal(NB_ATTENTE_B_5), maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=3] & maxVal(SORTI_B)<=2]]
normalized: [sum(maxVal(COMPTEUR_10), maxVal(COMPTEUR_9), maxVal(COMPTEUR_8), maxVal(COMPTEUR_7), maxVal(COMPTEUR_6), maxVal(COMPTEUR_5), maxVal(COMPTEUR_4), maxVal(COMPTEUR_3), maxVal(COMPTEUR_2), maxVal(COMPTEUR_1), maxVal(COMPTEUR_0))<=1 & [maxVal(SORTI_B)<=2 & [sum(maxVal(COMPTEUR_10), maxVal(COMPTEUR_9), maxVal(COMPTEUR_8), maxVal(COMPTEUR_7), maxVal(COMPTEUR_6), maxVal(COMPTEUR_5), maxVal(COMPTEUR_4), maxVal(COMPTEUR_3), maxVal(COMPTEUR_2), maxVal(COMPTEUR_1), maxVal(COMPTEUR_0))<=2 & sum(maxVal(NB_ATTENTE_B_20), maxVal(NB_ATTENTE_B_19), maxVal(NB_ATTENTE_B_18), maxVal(NB_ATTENTE_B_17), maxVal(NB_ATTENTE_B_16), maxVal(NB_ATTENTE_B_15), maxVal(NB_ATTENTE_B_14), maxVal(NB_ATTENTE_B_13), maxVal(NB_ATTENTE_B_12), maxVal(NB_ATTENTE_B_11), maxVal(NB_ATTENTE_B_10), maxVal(NB_ATTENTE_B_9), maxVal(NB_ATTENTE_B_8), maxVal(NB_ATTENTE_B_7), maxVal(NB_ATTENTE_B_6), maxVal(NB_ATTENTE_B_5), maxVal(NB_ATTENTE_B_4), maxVal(NB_ATTENTE_B_3), maxVal(NB_ATTENTE_B_2), maxVal(NB_ATTENTE_B_1), maxVal(NB_ATTENTE_B_0))<=3]]]

abstracting: (21<=3) states: 0
abstracting: (11<=2) states: 0
abstracting: (20<=2) states: 0
abstracting: (11<=1) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityBounds-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(ATTENTE_A)<=3 & sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))<=2] & maxVal(SUR_PONT_B)<=3]
normalized: [maxVal(SUR_PONT_B)<=3 & [maxVal(ATTENTE_A)<=3 & sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))<=2]]

abstracting: (2<=2) states: 6,732,570 (6)
abstracting: (20<=3) states: 0
abstracting: (10<=3) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityBounds-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[[maxVal(SORTI_B)<=3 & sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))<=2] & [maxVal(SUR_PONT_A)<=1 & [sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))<=3 & sum(maxVal(CONTROLEUR_2), maxVal(CONTROLEUR_1))<=1]]] & [sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=1 & maxVal(SUR_PONT_A)<=2]] & [maxVal(SUR_PONT_A)<=2 & sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))<=2]] & [maxVal(ROUTE_A)<=2 & maxVal(ROUTE_B)<=1]]
normalized: [[[[[maxVal(SORTI_B)<=3 & sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))<=2] & [maxVal(SUR_PONT_A)<=1 & [sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))<=3 & sum(maxVal(CONTROLEUR_2), maxVal(CONTROLEUR_1))<=1]]] & [sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=1 & maxVal(SUR_PONT_A)<=2]] & [maxVal(SUR_PONT_A)<=2 & sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))<=2]] & [maxVal(ROUTE_A)<=2 & maxVal(ROUTE_B)<=1]]

abstracting: (20<=1) states: 0
abstracting: (20<=2) states: 0
abstracting: (2<=2) states: 6,732,570 (6)
abstracting: (10<=2) states: 0
abstracting: (10<=2) states: 0
abstracting: (2<=1) states: 0
abstracting: (2<=1) states: 0
abstracting: (2<=3) states: 6,732,570 (6)
abstracting: (10<=1) states: 0
abstracting: (2<=2) states: 6,732,570 (6)
abstracting: (20<=3) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityBounds-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(CONTROLEUR_2), maxVal(CONTROLEUR_1))<=1
normalized: sum(maxVal(CONTROLEUR_2), maxVal(CONTROLEUR_1))<=1

abstracting: (2<=1) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityBounds-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(SORTI_B)<=1
normalized: maxVal(SORTI_B)<=1

abstracting: (20<=1) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityBounds-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [sum(maxVal(NB_ATTENTE_A_20), maxVal(NB_ATTENTE_A_19), maxVal(NB_ATTENTE_A_18), maxVal(NB_ATTENTE_A_17), maxVal(NB_ATTENTE_A_16), maxVal(NB_ATTENTE_A_15), maxVal(NB_ATTENTE_A_14), maxVal(NB_ATTENTE_A_13), maxVal(NB_ATTENTE_A_12), maxVal(NB_ATTENTE_A_11), maxVal(NB_ATTENTE_A_10), maxVal(NB_ATTENTE_A_9), maxVal(NB_ATTENTE_A_8), maxVal(NB_ATTENTE_A_7), maxVal(NB_ATTENTE_A_6), maxVal(NB_ATTENTE_A_5), maxVal(NB_ATTENTE_A_4), maxVal(NB_ATTENTE_A_3), maxVal(NB_ATTENTE_A_2), maxVal(NB_ATTENTE_A_1), maxVal(NB_ATTENTE_A_0))<=1 & [[maxVal(SUR_PONT_B)<=2 & sum(maxVal(CONTROLEUR_2), maxVal(CONTROLEUR_1))<=2] & [[[maxVal(SUR_PONT_B)<=2 & [maxVal(SUR_PONT_B)<=2 & maxVal(ROUTE_B)<=3]] & sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))<=3] & [maxVal(SUR_PONT_B)<=2 & [maxVal(ROUTE_A)<=2 & maxVal(SORTI_A)<=3]]]]]
normalized: [sum(maxVal(NB_ATTENTE_A_20), maxVal(NB_ATTENTE_A_19), maxVal(NB_ATTENTE_A_18), maxVal(NB_ATTENTE_A_17), maxVal(NB_ATTENTE_A_16), maxVal(NB_ATTENTE_A_15), maxVal(NB_ATTENTE_A_14), maxVal(NB_ATTENTE_A_13), maxVal(NB_ATTENTE_A_12), maxVal(NB_ATTENTE_A_11), maxVal(NB_ATTENTE_A_10), maxVal(NB_ATTENTE_A_9), maxVal(NB_ATTENTE_A_8), maxVal(NB_ATTENTE_A_7), maxVal(NB_ATTENTE_A_6), maxVal(NB_ATTENTE_A_5), maxVal(NB_ATTENTE_A_4), maxVal(NB_ATTENTE_A_3), maxVal(NB_ATTENTE_A_2), maxVal(NB_ATTENTE_A_1), maxVal(NB_ATTENTE_A_0))<=1 & [[[sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))<=3 & [maxVal(SUR_PONT_B)<=2 & [maxVal(SUR_PONT_B)<=2 & maxVal(ROUTE_B)<=3]]] & [maxVal(SUR_PONT_B)<=2 & [maxVal(ROUTE_A)<=2 & maxVal(SORTI_A)<=3]]] & [maxVal(SUR_PONT_B)<=2 & sum(maxVal(CONTROLEUR_2), maxVal(CONTROLEUR_1))<=2]]]

abstracting: (2<=2) states: 6,732,570 (6)
abstracting: (10<=2) states: 0
abstracting: (20<=3) states: 0
abstracting: (20<=2) states: 0
abstracting: (10<=2) states: 0
abstracting: (20<=3) states: 0
abstracting: (10<=2) states: 0
abstracting: (10<=2) states: 0
abstracting: (2<=3) states: 6,732,570 (6)
abstracting: (21<=1) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityBounds-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=2
normalized: sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=2

abstracting: (2<=2) states: 6,732,570 (6)
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityBounds-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(ATTENTE_B)<=1
normalized: maxVal(ATTENTE_B)<=1

abstracting: (20<=1) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityBounds-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(SORTI_A)<=1
normalized: maxVal(SORTI_A)<=1

abstracting: (20<=1) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityBounds-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(SUR_PONT_A)<=3 & [[[[[maxVal(SORTI_A)<=1 & maxVal(SORTI_A)<=1] & sum(maxVal(COMPTEUR_10), maxVal(COMPTEUR_9), maxVal(COMPTEUR_8), maxVal(COMPTEUR_7), maxVal(COMPTEUR_6), maxVal(COMPTEUR_5), maxVal(COMPTEUR_4), maxVal(COMPTEUR_3), maxVal(COMPTEUR_2), maxVal(COMPTEUR_1), maxVal(COMPTEUR_0))<=1] & [maxVal(SUR_PONT_B)<=2 & sum(maxVal(NB_ATTENTE_A_20), maxVal(NB_ATTENTE_A_19), maxVal(NB_ATTENTE_A_18), maxVal(NB_ATTENTE_A_17), maxVal(NB_ATTENTE_A_16), maxVal(NB_ATTENTE_A_15), maxVal(NB_ATTENTE_A_14), maxVal(NB_ATTENTE_A_13), maxVal(NB_ATTENTE_A_12), maxVal(NB_ATTENTE_A_11), maxVal(NB_ATTENTE_A_10), maxVal(NB_ATTENTE_A_9), maxVal(NB_ATTENTE_A_8), maxVal(NB_ATTENTE_A_7), maxVal(NB_ATTENTE_A_6), maxVal(NB_ATTENTE_A_5), maxVal(NB_ATTENTE_A_4), maxVal(NB_ATTENTE_A_3), maxVal(NB_ATTENTE_A_2), maxVal(NB_ATTENTE_A_1), maxVal(NB_ATTENTE_A_0))<=2]] & [[sum(maxVal(NB_ATTENTE_A_20), maxVal(NB_ATTENTE_A_19), maxVal(NB_ATTENTE_A_18), maxVal(NB_ATTENTE_A_17), maxVal(NB_ATTENTE_A_16), maxVal(NB_ATTENTE_A_15), maxVal(NB_ATTENTE_A_14), maxVal(NB_ATTENTE_A_13), maxVal(NB_ATTENTE_A_12), maxVal(NB_ATTENTE_A_11), maxVal(NB_ATTENTE_A_10), maxVal(NB_ATTENTE_A_9), maxVal(NB_ATTENTE_A_8), maxVal(NB_ATTENTE_A_7), maxVal(NB_ATTENTE_A_6), maxVal(NB_ATTENTE_A_5), maxVal(NB_ATTENTE_A_4), maxVal(NB_ATTENTE_A_3), maxVal(NB_ATTENTE_A_2), maxVal(NB_ATTENTE_A_1), maxVal(NB_ATTENTE_A_0))<=3 & [maxVal(SUR_PONT_A)<=2 & sum(maxVal(CONTROLEUR_2), maxVal(CONTROLEUR_1))<=1]] & [sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=2 & [maxVal(CAPACITE)<=3 & sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))<=1]]]] & [[maxVal(SUR_PONT_A)<=2 & [[maxVal(CAPACITE)<=3 & maxVal(SUR_PONT_A)<=3] & [maxVal(SORTI_B)<=3 & maxVal(ATTENTE_A)<=1]]] & sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=2]]]
normalized: [maxVal(SUR_PONT_A)<=3 & [[sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=2 & [maxVal(SUR_PONT_A)<=2 & [[maxVal(SORTI_B)<=3 & maxVal(ATTENTE_A)<=1] & [maxVal(CAPACITE)<=3 & maxVal(SUR_PONT_A)<=3]]]] & [[[sum(maxVal(CHOIX_2), maxVal(CHOIX_1))<=2 & [maxVal(CAPACITE)<=3 & sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))<=1]] & [sum(maxVal(NB_ATTENTE_A_20), maxVal(NB_ATTENTE_A_19), maxVal(NB_ATTENTE_A_18), maxVal(NB_ATTENTE_A_17), maxVal(NB_ATTENTE_A_16), maxVal(NB_ATTENTE_A_15), maxVal(NB_ATTENTE_A_14), maxVal(NB_ATTENTE_A_13), maxVal(NB_ATTENTE_A_12), maxVal(NB_ATTENTE_A_11), maxVal(NB_ATTENTE_A_10), maxVal(NB_ATTENTE_A_9), maxVal(NB_ATTENTE_A_8), maxVal(NB_ATTENTE_A_7), maxVal(NB_ATTENTE_A_6), maxVal(NB_ATTENTE_A_5), maxVal(NB_ATTENTE_A_4), maxVal(NB_ATTENTE_A_3), maxVal(NB_ATTENTE_A_2), maxVal(NB_ATTENTE_A_1), maxVal(NB_ATTENTE_A_0))<=3 & [maxVal(SUR_PONT_A)<=2 & sum(maxVal(CONTROLEUR_2), maxVal(CONTROLEUR_1))<=1]]] & [[maxVal(SUR_PONT_B)<=2 & sum(maxVal(NB_ATTENTE_A_20), maxVal(NB_ATTENTE_A_19), maxVal(NB_ATTENTE_A_18), maxVal(NB_ATTENTE_A_17), maxVal(NB_ATTENTE_A_16), maxVal(NB_ATTENTE_A_15), maxVal(NB_ATTENTE_A_14), maxVal(NB_ATTENTE_A_13), maxVal(NB_ATTENTE_A_12), maxVal(NB_ATTENTE_A_11), maxVal(NB_ATTENTE_A_10), maxVal(NB_ATTENTE_A_9), maxVal(NB_ATTENTE_A_8), maxVal(NB_ATTENTE_A_7), maxVal(NB_ATTENTE_A_6), maxVal(NB_ATTENTE_A_5), maxVal(NB_ATTENTE_A_4), maxVal(NB_ATTENTE_A_3), maxVal(NB_ATTENTE_A_2), maxVal(NB_ATTENTE_A_1), maxVal(NB_ATTENTE_A_0))<=2] & [sum(maxVal(COMPTEUR_10), maxVal(COMPTEUR_9), maxVal(COMPTEUR_8), maxVal(COMPTEUR_7), maxVal(COMPTEUR_6), maxVal(COMPTEUR_5), maxVal(COMPTEUR_4), maxVal(COMPTEUR_3), maxVal(COMPTEUR_2), maxVal(COMPTEUR_1), maxVal(COMPTEUR_0))<=1 & [maxVal(SORTI_A)<=1 & maxVal(SORTI_A)<=1]]]]]]

abstracting: (20<=1) states: 0
abstracting: (20<=1) states: 0
abstracting: (11<=1) states: 0
abstracting: (21<=2) states: 0
abstracting: (10<=2) states: 0
abstracting: (2<=1) states: 0
abstracting: (10<=2) states: 0
abstracting: (21<=3) states: 0
abstracting: (2<=1) states: 0
abstracting: (20<=3) states: 0
abstracting: (2<=2) states: 6,732,570 (6)
abstracting: (10<=3) states: 0
abstracting: (20<=3) states: 0
abstracting: (20<=1) states: 0
abstracting: (20<=3) states: 0
abstracting: (10<=2) states: 0
abstracting: (2<=2) states: 6,732,570 (6)
abstracting: (10<=3) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityBounds-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 3m21sec


BK_STOP 1433581774711

--------------------
content from stderr:

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: 0m0sec

2800 6975 12350 17070 22547 28891 33235 36390 36869 37229 37799 38229 38909 39449 40019 40649 42586 47835 53584 58521 60639 97656 98676 100708 102100 102182 102280 102431 102562 102704 102838 103653 103678 103720 103759 103801 103849 103902 121029 124618 124618 124568 125205 129156 141905 152048 169804 181996 200859 249133 249403 249673 250013 250123 250303 250483 250663 250933 300416 300420 300371 300406 300420 300425 300444 300422 300414 300342 300292 300305 300335 300336 300368 300374 300388 307320 307380 307432 307640 310148 313960 322950 329420 342016 357700 392850 419391 418779 417623 417313 417522 417544 417575 417637 417608 417649 417412 429805 429507 429404 429898 429224 432808 429224 434320 434768 429224 433481 437904 435980 433908 434052 434085 434123 434141 434150 434185 433979 432247 432680 432845 434137 435905 435551 439191 439919 435551 440231 441005 447789 446249 443729 443790 443913 443959 444000 444037 444102 444008 447561 447837 447837 448177 449339 448913 448913 452609 448913 448913 452123 457043 455855 453479 453536 453652 453695 453762 453777 453828 453742 457890 457874 457874 458894 458538 460826 461442 458538 458538 462702 465462 464718 462858 461646 461810 461856 461906 461938 461966 461977 461835 466343 466343 466478 467148 466632 466632 469152 469152 466632 472230 471708 470200 468594 468681 468751 468775 468806 468832 468842 468763 473521 473479 473479 473967 473433 475233 475449 475377 473433 474141 477303 475899 474387 474484 474550 474571 474599 474622 474629 474567 479571 479493 479415 479689 480051 479155 479155 480595 480391 482459 481759 480259 479281 479398 479449 479502 479510 479550 479527 479461 484644 484572 484612 483988 483988 485164 485108 484828 483800 486182 485492 483928 483534 483622 483673 483683 483702 483716 483739 489121 488902 488879 488218 487378 487378 487378 488026 487642 488279 487619 486359 485537 485531 485518 485565 485471 485541 485422 485385 480676 480611 480584 480306 480808 480240 481152 481200 480240 480698 482675 482096 481328 480740 480725 480707 480688 480725 480637 480605 480579 475718 475668 475643 475357 475861 475897 475357 475951 475938 476909 476563 475843 475393 475390 475377 475392 475330 475356 475270 475244 471128 471062 470930 470760 470700 471060 471052 470980 470578 471351 471060 470516 470380 470383 470355 470336 470333 470275 470279 470075 466756 466679 466469 466449 466337 466337 466463 466404 466349 466227 465987 465837 465815 465802 465817 465755 465781 465695 465669 463442 463162 462895 462130 461874 462268 462260 461868 462268 461295 461507 461152 460600 460592 460592 460592 460592 460592 460627 460598 460166 460168 460141 460066 459976 459976 460172 460156 460124 460432 460360 460152 459936 459936 459931 459903 459881 459865 459824 459793 456487 456399 456124 456109 456100 456100 456030 456030 455512 455702 455598 455492 455474 455463 455463 455463 455463 455498 455475 456303 456121 455971 455450 455366 455567 455360 455360 455580 455017 455070 454894 454624 454620 454620 454620 454620 454620 454643 454623 454349 454339 454333 454281 454350 454359 454355 454275 454267 454488 454416 454280 454241 454231 454203 454184 454181 454133 454127 453999 451473 451272 450620 450522 450362 450531 450524 450492 449714 449459 449330 449058 448992 448975 448975 448975 448994 448975 449000 449296 449663 449495 449019 449086 449110 449063 449005 449005 448647 448476 448404 448275 448242 448242 448242 448259 448242 448265 448245 448927 448732 448615 448208 448285 448297 448198 448196 447849 447712 447640 447544 447470 447453 447453 447453 447453 447453 447453 447453 447901 447757 447381 447343 447339 447420 447404 447365 446880 446824 446740 446647 446616 446627 446616 446616 446637 446616 446619 444088 443956 443549 443554 443538 443514 443482 443421 442553 442709 442593 442499 939339 1207223 1322948
iterations count:552618 (1008), effective:9089 (16)

initing FirstDep: 0m0sec

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-V20P20N10"
export BK_EXAMINATION="ReachabilityBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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-V20P20N10.tgz
mv BridgeAndVehicles-PT-V20P20N10 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is BridgeAndVehicles-PT-V20P20N10, examination is ReachabilityBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r190su-smll-143330904700333"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityBounds" != "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 "ReachabilityBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityBounds.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 '' ReachabilityBounds.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 ;