fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r033-tajo-167813685600166
Last Updated
May 14, 2023

About the Execution of Marcie for BridgeAndVehicles-PT-V04P05N02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5447.859 8530.00 8050.00 0.00 TFFFTTFTTFTFFFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r033-tajo-167813685600166.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is BridgeAndVehicles-PT-V04P05N02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r033-tajo-167813685600166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 9.5K Feb 25 12:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 12:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 25 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 25 12:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 25 12:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 37K Mar 5 18:22 model.pnml

--------------------
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-PT-V04P05N02-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678295890278

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V04P05N02
Not applying reductions.
Model is PT
ReachabilityCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
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: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

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


RS generation: 0m 0.016sec


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



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

checking: EF [57<=ROUTE_A]
normalized: E [true U 57<=ROUTE_A]

abstracting: (57<=ROUTE_A)
states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

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

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [5<=SORTI_B]
normalized: E [true U 5<=SORTI_B]

abstracting: (5<=SORTI_B)
states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [79<=sum(CHOIX_2, CHOIX_1)]
normalized: E [true U 79<=sum(CHOIX_2, CHOIX_1)]

abstracting: (79<=sum(CHOIX_2, CHOIX_1))
states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

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

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

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[SORTI_A<=5 | COMPTEUR_0<=SUR_PONT_A]]
normalized: ~ [E [true U ~ [[SORTI_A<=5 | COMPTEUR_0<=SUR_PONT_A]]]]

abstracting: (COMPTEUR_0<=SUR_PONT_A)
states: 2,049 (3)
abstracting: (SORTI_A<=5)
states: 2,874 (3)
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: EF [~ [[[CHOIX_1<=1 | ~ [[5<=NB_ATTENTE_A_1 & [[NB_ATTENTE_A_2<=3 | ~ [4<=VIDANGE_2]] | ~ [[4<=NB_ATTENTE_B_0 | CONTROLEUR_2<=4]]]]]] | 1<=NB_ATTENTE_B_1]]]
normalized: E [true U ~ [[[~ [[[~ [[4<=NB_ATTENTE_B_0 | CONTROLEUR_2<=4]] | [~ [4<=VIDANGE_2] | NB_ATTENTE_A_2<=3]] & 5<=NB_ATTENTE_A_1]] | CHOIX_1<=1] | 1<=NB_ATTENTE_B_1]]]

abstracting: (1<=NB_ATTENTE_B_1)
states: 854
abstracting: (CHOIX_1<=1)
states: 2,874 (3)
abstracting: (5<=NB_ATTENTE_A_1)
states: 0
abstracting: (NB_ATTENTE_A_2<=3)
states: 2,874 (3)
abstracting: (4<=VIDANGE_2)
states: 0
abstracting: (CONTROLEUR_2<=4)
states: 2,874 (3)
abstracting: (4<=NB_ATTENTE_B_0)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EF [[[5<=NB_ATTENTE_B_0 & [[1<=NB_ATTENTE_A_0 | NB_ATTENTE_B_1<=COMPTEUR_0] | [2<=NB_ATTENTE_B_0 | [[1<=NB_ATTENTE_B_1 | [ROUTE_A<=CHOIX_2 & ~ [[NB_ATTENTE_B_1<=SORTI_A | COMPTEUR_1<=2]]]] | NB_ATTENTE_B_0<=1]]]] | ~ [[[~ [3<=NB_ATTENTE_B_3] | [[[VIDANGE_2<=2 & SUR_PONT_B<=1] | [ATTENTE_B<=NB_ATTENTE_B_0 & 3<=CONTROLEUR_2]] | [NB_ATTENTE_A_2<=4 & [ATTENTE_B<=0 & ATTENTE_B<=5]]]] | ATTENTE_B<=NB_ATTENTE_B_2]]]]
normalized: E [true U [~ [[[[[[ATTENTE_B<=0 & ATTENTE_B<=5] & NB_ATTENTE_A_2<=4] | [[ATTENTE_B<=NB_ATTENTE_B_0 & 3<=CONTROLEUR_2] | [VIDANGE_2<=2 & SUR_PONT_B<=1]]] | ~ [3<=NB_ATTENTE_B_3]] | ATTENTE_B<=NB_ATTENTE_B_2]] | [[[[[[~ [[NB_ATTENTE_B_1<=SORTI_A | COMPTEUR_1<=2]] & ROUTE_A<=CHOIX_2] | 1<=NB_ATTENTE_B_1] | NB_ATTENTE_B_0<=1] | 2<=NB_ATTENTE_B_0] | [1<=NB_ATTENTE_A_0 | NB_ATTENTE_B_1<=COMPTEUR_0]] & 5<=NB_ATTENTE_B_0]]]

abstracting: (5<=NB_ATTENTE_B_0)
states: 0
abstracting: (NB_ATTENTE_B_1<=COMPTEUR_0)
states: 2,333 (3)
abstracting: (1<=NB_ATTENTE_A_0)
states: 1,012 (3)
abstracting: (2<=NB_ATTENTE_B_0)
states: 0
abstracting: (NB_ATTENTE_B_0<=1)
states: 2,874 (3)
abstracting: (1<=NB_ATTENTE_B_1)
states: 854
abstracting: (ROUTE_A<=CHOIX_2)
states: 1,282 (3)
abstracting: (COMPTEUR_1<=2)
states: 2,874 (3)
abstracting: (NB_ATTENTE_B_1<=SORTI_A)
states: 2,650 (3)
abstracting: (ATTENTE_B<=NB_ATTENTE_B_2)
states: 1,000 (3)
abstracting: (3<=NB_ATTENTE_B_3)
states: 0
abstracting: (SUR_PONT_B<=1)
states: 2,714 (3)
abstracting: (VIDANGE_2<=2)
states: 2,874 (3)
abstracting: (3<=CONTROLEUR_2)
states: 0
abstracting: (ATTENTE_B<=NB_ATTENTE_B_0)
states: 1,000 (3)
abstracting: (NB_ATTENTE_A_2<=4)
states: 2,874 (3)
abstracting: (ATTENTE_B<=5)
states: 2,874 (3)
abstracting: (ATTENTE_B<=0)
states: 1,000 (3)
-> the formula is FALSE

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

MC time: 0m 0.011sec

checking: EF [~ [[[ATTENTE_B<=69 | [~ [[sum(CHOIX_2, CHOIX_1)<=SUR_PONT_A & [[~ [90<=SUR_PONT_A] | ~ [1<=ROUTE_A]] & ~ [sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=SUR_PONT_A]]]] & [SUR_PONT_A<=SUR_PONT_A | 96<=sum(VIDANGE_2, VIDANGE_1)]]] & ~ [[~ [[~ [[[36<=sum(CHOIX_2, CHOIX_1) & CAPACITE<=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)<=53]]] | ~ [81<=sum(CONTROLEUR_2, CONTROLEUR_1)]]] | ~ [[[ROUTE_B<=59 & ROUTE_B<=40] | 25<=ATTENTE_B]]]]]]]
normalized: E [true U ~ [[~ [[~ [[[ROUTE_B<=59 & ROUTE_B<=40] | 25<=ATTENTE_B]] | ~ [[~ [81<=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)<=53] | [36<=sum(CHOIX_2, CHOIX_1) & CAPACITE<=sum(CONTROLEUR_2, CONTROLEUR_1)]]]]]]] & [[[SUR_PONT_A<=SUR_PONT_A | 96<=sum(VIDANGE_2, VIDANGE_1)] & ~ [[[~ [sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=SUR_PONT_A] & [~ [1<=ROUTE_A] | ~ [90<=SUR_PONT_A]]] & sum(CHOIX_2, CHOIX_1)<=SUR_PONT_A]]] | ATTENTE_B<=69]]]]

abstracting: (ATTENTE_B<=69)
states: 2,874 (3)
abstracting: (sum(CHOIX_2, CHOIX_1)<=SUR_PONT_A)
states: 1,843 (3)
abstracting: (90<=SUR_PONT_A)
states: 0
abstracting: (1<=ROUTE_A)
states: 1,775 (3)
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=SUR_PONT_A)
states: 628
abstracting: (96<=sum(VIDANGE_2, VIDANGE_1))
states: 0
abstracting: (SUR_PONT_A<=SUR_PONT_A)
states: 2,874 (3)
abstracting: (CAPACITE<=sum(CONTROLEUR_2, CONTROLEUR_1))
states: 0
abstracting: (36<=sum(CHOIX_2, CHOIX_1))
states: 0
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=53)
states: 2,874 (3)
abstracting: (81<=sum(CONTROLEUR_2, CONTROLEUR_1))
states: 0
abstracting: (25<=ATTENTE_B)
states: 0
abstracting: (ROUTE_B<=40)
states: 2,874 (3)
abstracting: (ROUTE_B<=59)
states: 2,874 (3)
-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.264sec

checking: AG [[[[~ [[[~ [[[NB_ATTENTE_A_3<=ROUTE_A | SUR_PONT_B<=SORTI_A] | [CHOIX_2<=1 | 2<=NB_ATTENTE_A_1]]] | ~ [5<=COMPTEUR_2]] | [[[[ATTENTE_B<=COMPTEUR_0 & ATTENTE_A<=4] & 5<=NB_ATTENTE_A_4] | [[1<=COMPTEUR_0 & NB_ATTENTE_B_0<=2] | ~ [NB_ATTENTE_B_2<=COMPTEUR_1]]] & ~ [[~ [5<=ATTENTE_B] & ~ [NB_ATTENTE_B_3<=ROUTE_A]]]]]] & 2<=COMPTEUR_1] | [NB_ATTENTE_B_4<=4 & [[NB_ATTENTE_A_3<=4 | [[NB_ATTENTE_A_2<=NB_ATTENTE_A_4 | [ROUTE_A<=1 | COMPTEUR_2<=5]] | [~ [[CHOIX_2<=4 & NB_ATTENTE_A_3<=SUR_PONT_A]] | ~ [NB_ATTENTE_B_1<=1]]]] & ~ [[~ [[~ [VIDANGE_1<=4] | [CHOIX_1<=5 | COMPTEUR_0<=4]]] & COMPTEUR_1<=0]]]]] | ATTENTE_B<=5]]
normalized: ~ [E [true U ~ [[[[[~ [[~ [[[CHOIX_1<=5 | COMPTEUR_0<=4] | ~ [VIDANGE_1<=4]]] & COMPTEUR_1<=0]] & [[[~ [NB_ATTENTE_B_1<=1] | ~ [[CHOIX_2<=4 & NB_ATTENTE_A_3<=SUR_PONT_A]]] | [[ROUTE_A<=1 | COMPTEUR_2<=5] | NB_ATTENTE_A_2<=NB_ATTENTE_A_4]] | NB_ATTENTE_A_3<=4]] & NB_ATTENTE_B_4<=4] | [~ [[[~ [[~ [NB_ATTENTE_B_3<=ROUTE_A] & ~ [5<=ATTENTE_B]]] & [[~ [NB_ATTENTE_B_2<=COMPTEUR_1] | [1<=COMPTEUR_0 & NB_ATTENTE_B_0<=2]] | [[ATTENTE_B<=COMPTEUR_0 & ATTENTE_A<=4] & 5<=NB_ATTENTE_A_4]]] | [~ [5<=COMPTEUR_2] | ~ [[[CHOIX_2<=1 | 2<=NB_ATTENTE_A_1] | [NB_ATTENTE_A_3<=ROUTE_A | SUR_PONT_B<=SORTI_A]]]]]] & 2<=COMPTEUR_1]] | ATTENTE_B<=5]]]]

abstracting: (ATTENTE_B<=5)
states: 2,874 (3)
abstracting: (2<=COMPTEUR_1)
states: 0
abstracting: (SUR_PONT_B<=SORTI_A)
states: 2,662 (3)
abstracting: (NB_ATTENTE_A_3<=ROUTE_A)
states: 2,670 (3)
abstracting: (2<=NB_ATTENTE_A_1)
states: 0
abstracting: (CHOIX_2<=1)
states: 2,874 (3)
abstracting: (5<=COMPTEUR_2)
states: 0
abstracting: (5<=NB_ATTENTE_A_4)
states: 0
abstracting: (ATTENTE_A<=4)
states: 2,874 (3)
abstracting: (ATTENTE_B<=COMPTEUR_0)
states: 1,313 (3)
abstracting: (NB_ATTENTE_B_0<=2)
states: 2,874 (3)
abstracting: (1<=COMPTEUR_0)
states: 1,033 (3)
abstracting: (NB_ATTENTE_B_2<=COMPTEUR_1)
states: 2,454 (3)
abstracting: (5<=ATTENTE_B)
states: 0
abstracting: (NB_ATTENTE_B_3<=ROUTE_A)
states: 2,754 (3)
abstracting: (NB_ATTENTE_B_4<=4)
states: 2,874 (3)
abstracting: (NB_ATTENTE_A_3<=4)
states: 2,874 (3)
abstracting: (NB_ATTENTE_A_2<=NB_ATTENTE_A_4)
states: 2,283 (3)
abstracting: (COMPTEUR_2<=5)
states: 2,874 (3)
abstracting: (ROUTE_A<=1)
states: 1,934 (3)
abstracting: (NB_ATTENTE_A_3<=SUR_PONT_A)
states: 2,602 (3)
abstracting: (CHOIX_2<=4)
states: 2,874 (3)
abstracting: (NB_ATTENTE_B_1<=1)
states: 2,874 (3)
abstracting: (COMPTEUR_1<=0)
states: 2,033 (3)
abstracting: (VIDANGE_1<=4)
states: 2,874 (3)
abstracting: (COMPTEUR_0<=4)
states: 2,874 (3)
abstracting: (CHOIX_1<=5)
states: 2,874 (3)
-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: AG [[[~ [44<=ROUTE_A] | ~ [[[~ [[~ [[18<=SUR_PONT_B & sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=47]] & ~ [[SORTI_A<=39 & 43<=CAPACITE]]]] | [[[~ [SUR_PONT_B<=ATTENTE_B] & ~ [SUR_PONT_A<=51]] & 40<=sum(CHOIX_2, CHOIX_1)] | ROUTE_A<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]] & [[~ [SUR_PONT_B<=SUR_PONT_A] | sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=86] | 79<=ROUTE_A]]]] | [~ [CAPACITE<=0] | [sum(CHOIX_2, CHOIX_1)<=SORTI_A | [~ [7<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)] & [SUR_PONT_A<=32 | [[[SUR_PONT_B<=ROUTE_B | [SUR_PONT_B<=67 & 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)<=35] | SORTI_A<=27]] & [[66<=ROUTE_A | [sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=44 | sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=SUR_PONT_A]] & sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=ATTENTE_A]]]]]]]]
normalized: ~ [E [true U ~ [[[[sum(CHOIX_2, CHOIX_1)<=SORTI_A | [[SUR_PONT_A<=32 | [[sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=ATTENTE_A & [66<=ROUTE_A | [sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=44 | sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=SUR_PONT_A]]] & [[SORTI_A<=27 | ~ [sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=35]] & [SUR_PONT_B<=ROUTE_B | [SUR_PONT_B<=67 & ATTENTE_A<=SUR_PONT_A]]]]] & ~ [7<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]]] | ~ [CAPACITE<=0]] | [~ [[[79<=ROUTE_A | [sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=86 | ~ [SUR_PONT_B<=SUR_PONT_A]]] & [[ROUTE_A<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) | [40<=sum(CHOIX_2, CHOIX_1) & [~ [SUR_PONT_A<=51] & ~ [SUR_PONT_B<=ATTENTE_B]]]] | ~ [[~ [[SORTI_A<=39 & 43<=CAPACITE]] & ~ [[18<=SUR_PONT_B & sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=47]]]]]]] | ~ [44<=ROUTE_A]]]]]]

abstracting: (44<=ROUTE_A)
states: 0
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=47)
states: 2,874 (3)
abstracting: (18<=SUR_PONT_B)
states: 0
abstracting: (43<=CAPACITE)
states: 0
abstracting: (SORTI_A<=39)
states: 2,874 (3)
abstracting: (SUR_PONT_B<=ATTENTE_B)
states: 2,550 (3)
abstracting: (SUR_PONT_A<=51)
states: 2,874 (3)
abstracting: (40<=sum(CHOIX_2, CHOIX_1))
states: 0
abstracting: (ROUTE_A<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0))
states: 1,934 (3)
abstracting: (SUR_PONT_B<=SUR_PONT_A)
states: 2,246 (3)
abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=86)
states: 2,874 (3)
abstracting: (79<=ROUTE_A)
states: 0
abstracting: (CAPACITE<=0)
states: 0
abstracting: (7<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0))
states: 0
abstracting: (ATTENTE_A<=SUR_PONT_A)
states: 1,236 (3)
abstracting: (SUR_PONT_B<=67)
states: 2,874 (3)
abstracting: (SUR_PONT_B<=ROUTE_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)<=35)
states: 2,874 (3)
abstracting: (SORTI_A<=27)
states: 2,874 (3)
abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=SUR_PONT_A)
states: 628
abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=44)
states: 2,874 (3)
abstracting: (66<=ROUTE_A)
states: 0
abstracting: (sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=ATTENTE_A)
states: 1,862 (3)
abstracting: (SUR_PONT_A<=32)
states: 2,874 (3)
abstracting: (sum(CHOIX_2, CHOIX_1)<=SORTI_A)
states: 2,550 (3)
-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.372sec

checking: AG [[[COMPTEUR_1<=1 | [5<=CHOIX_2 & [ROUTE_A<=2 & [[~ [[CONTROLEUR_2<=4 & NB_ATTENTE_B_2<=0]] & ~ [[~ [1<=SORTI_B] | [ATTENTE_B<=ROUTE_B | NB_ATTENTE_B_0<=5]]]] | [[[[1<=ROUTE_B | NB_ATTENTE_B_3<=4] | [NB_ATTENTE_B_4<=1 | 3<=NB_ATTENTE_B_1]] | [[5<=ROUTE_B | 5<=ROUTE_B] | ~ [NB_ATTENTE_B_4<=NB_ATTENTE_B_2]]] & [[~ [1<=CONTROLEUR_1] | VIDANGE_1<=NB_ATTENTE_A_4] | [~ [COMPTEUR_0<=SUR_PONT_A] & CHOIX_2<=SUR_PONT_A]]]]]]] | [~ [[[[[COMPTEUR_2<=1 | SORTI_B<=VIDANGE_2] & [SUR_PONT_A<=VIDANGE_1 | COMPTEUR_2<=CAPACITE]] & [5<=SORTI_A | ~ [SUR_PONT_B<=0]]] | ~ [[[ATTENTE_A<=4 | 1<=CHOIX_2] | 3<=SORTI_B]]]] & [~ [[[[[~ [5<=SUR_PONT_B] | 4<=NB_ATTENTE_B_4] & ~ [NB_ATTENTE_A_4<=ROUTE_A]] & 4<=CHOIX_2] & [[[2<=NB_ATTENTE_A_1 & ~ [CHOIX_1<=5]] | NB_ATTENTE_B_0<=4] & [CHOIX_1<=3 & [[NB_ATTENTE_B_3<=4 & COMPTEUR_1<=0] & SUR_PONT_A<=SORTI_A]]]]] & [1<=COMPTEUR_0 | [[ROUTE_A<=2 & [[~ [2<=COMPTEUR_1] | [ATTENTE_A<=NB_ATTENTE_B_1 & SORTI_B<=NB_ATTENTE_A_1]] & 3<=ATTENTE_A]] & [COMPTEUR_2<=NB_ATTENTE_B_4 | ~ [ROUTE_B<=4]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[1<=ROUTE_B | NB_ATTENTE_B_3<=4] | [NB_ATTENTE_B_4<=1 | 3<=NB_ATTENTE_B_1]] | [~ [NB_ATTENTE_B_4<=NB_ATTENTE_B_2] | [5<=ROUTE_B | 5<=ROUTE_B]]] & [[CHOIX_2<=SUR_PONT_A & ~ [COMPTEUR_0<=SUR_PONT_A]] | [VIDANGE_1<=NB_ATTENTE_A_4 | ~ [1<=CONTROLEUR_1]]]] | [~ [[CONTROLEUR_2<=4 & NB_ATTENTE_B_2<=0]] & ~ [[[ATTENTE_B<=ROUTE_B | NB_ATTENTE_B_0<=5] | ~ [1<=SORTI_B]]]]] & ROUTE_A<=2] & 5<=CHOIX_2] | COMPTEUR_1<=1] | [~ [[[[[SUR_PONT_A<=VIDANGE_1 | COMPTEUR_2<=CAPACITE] & [COMPTEUR_2<=1 | SORTI_B<=VIDANGE_2]] & [5<=SORTI_A | ~ [SUR_PONT_B<=0]]] | ~ [[3<=SORTI_B | [ATTENTE_A<=4 | 1<=CHOIX_2]]]]] & [[1<=COMPTEUR_0 | [[COMPTEUR_2<=NB_ATTENTE_B_4 | ~ [ROUTE_B<=4]] & [ROUTE_A<=2 & [3<=ATTENTE_A & [[ATTENTE_A<=NB_ATTENTE_B_1 & SORTI_B<=NB_ATTENTE_A_1] | ~ [2<=COMPTEUR_1]]]]]] & ~ [[[[CHOIX_1<=3 & [SUR_PONT_A<=SORTI_A & [NB_ATTENTE_B_3<=4 & COMPTEUR_1<=0]]] & [NB_ATTENTE_B_0<=4 | [2<=NB_ATTENTE_A_1 & ~ [CHOIX_1<=5]]]] & [4<=CHOIX_2 & [~ [NB_ATTENTE_A_4<=ROUTE_A] & [4<=NB_ATTENTE_B_4 | ~ [5<=SUR_PONT_B]]]]]]]]]]]]

abstracting: (5<=SUR_PONT_B)
states: 0
abstracting: (4<=NB_ATTENTE_B_4)
states: 0
abstracting: (NB_ATTENTE_A_4<=ROUTE_A)
states: 2,766 (3)
abstracting: (4<=CHOIX_2)
states: 0
abstracting: (CHOIX_1<=5)
states: 2,874 (3)
abstracting: (2<=NB_ATTENTE_A_1)
states: 0
abstracting: (NB_ATTENTE_B_0<=4)
states: 2,874 (3)
abstracting: (COMPTEUR_1<=0)
states: 2,033 (3)
abstracting: (NB_ATTENTE_B_3<=4)
states: 2,874 (3)
abstracting: (SUR_PONT_A<=SORTI_A)
states: 2,584 (3)
abstracting: (CHOIX_1<=3)
states: 2,874 (3)
abstracting: (2<=COMPTEUR_1)
states: 0
abstracting: (SORTI_B<=NB_ATTENTE_A_1)
states: 1,024 (3)
abstracting: (ATTENTE_A<=NB_ATTENTE_B_1)
states: 1,263 (3)
abstracting: (3<=ATTENTE_A)
states: 420
abstracting: (ROUTE_A<=2)
states: 2,494 (3)
abstracting: (ROUTE_B<=4)
states: 2,874 (3)
abstracting: (COMPTEUR_2<=NB_ATTENTE_B_4)
states: 1,898 (3)
abstracting: (1<=COMPTEUR_0)
states: 1,033 (3)
abstracting: (1<=CHOIX_2)
states: 658
abstracting: (ATTENTE_A<=4)
states: 2,874 (3)
abstracting: (3<=SORTI_B)
states: 574
abstracting: (SUR_PONT_B<=0)
states: 2,246 (3)
abstracting: (5<=SORTI_A)
states: 0
abstracting: (SORTI_B<=VIDANGE_2)
states: 862
abstracting: (COMPTEUR_2<=1)
states: 2,874 (3)
abstracting: (COMPTEUR_2<=CAPACITE)
states: 2,874 (3)
abstracting: (SUR_PONT_A<=VIDANGE_1)
states: 2,246 (3)
abstracting: (COMPTEUR_1<=1)
states: 2,874 (3)
abstracting: (5<=CHOIX_2)
states: 0
abstracting: (ROUTE_A<=2)
states: 2,494 (3)
abstracting: (1<=SORTI_B)
states: 2,108 (3)
abstracting: (NB_ATTENTE_B_0<=5)
states: 2,874 (3)
abstracting: (ATTENTE_B<=ROUTE_B)
states: 1,705 (3)
abstracting: (NB_ATTENTE_B_2<=0)
states: 2,280 (3)
abstracting: (CONTROLEUR_2<=4)
states: 2,874 (3)
abstracting: (1<=CONTROLEUR_1)
states: 423
abstracting: (VIDANGE_1<=NB_ATTENTE_A_4)
states: 2,552 (3)
abstracting: (COMPTEUR_0<=SUR_PONT_A)
states: 2,049 (3)
abstracting: (CHOIX_2<=SUR_PONT_A)
states: 2,216 (3)
abstracting: (5<=ROUTE_B)
states: 0
abstracting: (5<=ROUTE_B)
states: 0
abstracting: (NB_ATTENTE_B_4<=NB_ATTENTE_B_2)
states: 2,763 (3)
abstracting: (3<=NB_ATTENTE_B_1)
states: 0
abstracting: (NB_ATTENTE_B_4<=1)
states: 2,874 (3)
abstracting: (NB_ATTENTE_B_3<=4)
states: 2,874 (3)
abstracting: (1<=ROUTE_B)
states: 1,772 (3)
-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: AG [[CAPACITE<=46 | [[[[[[[~ [SORTI_B<=SUR_PONT_B] | sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=72] | [[2<=SUR_PONT_B & sum(CONTROLEUR_2, CONTROLEUR_1)<=SUR_PONT_A] | ATTENTE_A<=72]] & SUR_PONT_B<=SUR_PONT_A] | ~ [[[SUR_PONT_B<=SUR_PONT_B & ATTENTE_B<=sum(VIDANGE_2, VIDANGE_1)] | 5<=sum(CHOIX_2, CHOIX_1)]]] & [[[[~ [42<=SUR_PONT_B] | ~ [SORTI_A<=19]] & [~ [CAPACITE<=SORTI_A] & [SUR_PONT_B<=ATTENTE_A & CAPACITE<=sum(CONTROLEUR_2, CONTROLEUR_1)]]] | [[[ROUTE_B<=55 | SUR_PONT_A<=16] | [47<=sum(VIDANGE_2, VIDANGE_1) & sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=ATTENTE_A]] | ~ [[ROUTE_B<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) & SORTI_B<=33]]]] & ROUTE_B<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]] & ATTENTE_A<=14] & [ROUTE_A<=43 | [[~ [CAPACITE<=27] & ~ [17<=SUR_PONT_A]] | ~ [sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=ROUTE_B]]]]]]
normalized: ~ [E [true U ~ [[CAPACITE<=46 | [[ATTENTE_A<=14 & [[[SUR_PONT_B<=SUR_PONT_A & [[sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=72 | ~ [SORTI_B<=SUR_PONT_B]] | [ATTENTE_A<=72 | [2<=SUR_PONT_B & sum(CONTROLEUR_2, CONTROLEUR_1)<=SUR_PONT_A]]]] | ~ [[5<=sum(CHOIX_2, CHOIX_1) | [SUR_PONT_B<=SUR_PONT_B & ATTENTE_B<=sum(VIDANGE_2, VIDANGE_1)]]]] & [ROUTE_B<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) & [[[~ [SORTI_A<=19] | ~ [42<=SUR_PONT_B]] & [[SUR_PONT_B<=ATTENTE_A & CAPACITE<=sum(CONTROLEUR_2, CONTROLEUR_1)] & ~ [CAPACITE<=SORTI_A]]] | [~ [[ROUTE_B<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) & SORTI_B<=33]] | [[ROUTE_B<=55 | SUR_PONT_A<=16] | [47<=sum(VIDANGE_2, VIDANGE_1) & sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=ATTENTE_A]]]]]]] & [ROUTE_A<=43 | [[~ [17<=SUR_PONT_A] & ~ [CAPACITE<=27]] | ~ [sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=ROUTE_B]]]]]]]]

abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=ROUTE_B)
states: 1,772 (3)
abstracting: (CAPACITE<=27)
states: 2,874 (3)
abstracting: (17<=SUR_PONT_A)
states: 0
abstracting: (ROUTE_A<=43)
states: 2,874 (3)
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=ATTENTE_A)
states: 1,862 (3)
abstracting: (47<=sum(VIDANGE_2, VIDANGE_1))
states: 0
abstracting: (SUR_PONT_A<=16)
states: 2,874 (3)
abstracting: (ROUTE_B<=55)
states: 2,874 (3)
abstracting: (SORTI_B<=33)
states: 2,874 (3)
abstracting: (ROUTE_B<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0))
states: 1,940 (3)
abstracting: (CAPACITE<=SORTI_A)
states: 68
abstracting: (CAPACITE<=sum(CONTROLEUR_2, CONTROLEUR_1))
states: 0
abstracting: (SUR_PONT_B<=ATTENTE_A)
states: 2,626 (3)
abstracting: (42<=SUR_PONT_B)
states: 0
abstracting: (SORTI_A<=19)
states: 2,874 (3)
abstracting: (ROUTE_B<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0))
states: 1,940 (3)
abstracting: (ATTENTE_B<=sum(VIDANGE_2, VIDANGE_1))
states: 1,217 (3)
abstracting: (SUR_PONT_B<=SUR_PONT_B)
states: 2,874 (3)
abstracting: (5<=sum(CHOIX_2, CHOIX_1))
states: 0
abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=SUR_PONT_A)
states: 2,163 (3)
abstracting: (2<=SUR_PONT_B)
states: 160
abstracting: (ATTENTE_A<=72)
states: 2,874 (3)
abstracting: (SORTI_B<=SUR_PONT_B)
states: 986
abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=72)
states: 2,874 (3)
abstracting: (SUR_PONT_B<=SUR_PONT_A)
states: 2,246 (3)
abstracting: (ATTENTE_A<=14)
states: 2,874 (3)
abstracting: (CAPACITE<=46)
states: 2,874 (3)
-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.296sec

checking: AG [[[[[[[sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=49 & [[[53<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) & ROUTE_B<=15] | [sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=22 | SORTI_A<=47]] | [[ROUTE_A<=69 | sum(CONTROLEUR_2, CONTROLEUR_1)<=SUR_PONT_A] & [sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0) | sum(CHOIX_2, CHOIX_1)<=sum(CONTROLEUR_2, CONTROLEUR_1)]]]] | SORTI_A<=SUR_PONT_A] | [[[~ [[62<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) & sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=2]] & [~ [SUR_PONT_A<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)] & [88<=ATTENTE_A & ATTENTE_B<=42]]] | ~ [sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=48]] | [[95<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) | [[CAPACITE<=ROUTE_A | ATTENTE_B<=ATTENTE_B] | ~ [sum(CONTROLEUR_2, CONTROLEUR_1)<=ATTENTE_B]]] & [~ [3<=ATTENTE_A] | [[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) & sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=57] | [SUR_PONT_A<=SUR_PONT_B | ATTENTE_B<=18]]]]]] & ~ [[[sum(CHOIX_2, CHOIX_1)<=78 & [~ [CAPACITE<=31] & 39<=ROUTE_B]] | [[[[SUR_PONT_B<=10 | sum(VIDANGE_2, VIDANGE_1)<=SORTI_A] | [99<=ROUTE_B & SORTI_B<=31]] | [[ATTENTE_B<=58 | 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)] & 40<=sum(VIDANGE_2, VIDANGE_1)]] | [~ [[25<=sum(VIDANGE_2, VIDANGE_1) | 61<=SORTI_A]] | [[66<=sum(VIDANGE_2, VIDANGE_1) & ROUTE_A<=14] | [87<=sum(CHOIX_2, CHOIX_1) & sum(VIDANGE_2, VIDANGE_1)<=sum(CHOIX_2, CHOIX_1)]]]]]]] | [[~ [[sum(CHOIX_2, CHOIX_1)<=16 | sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=6]] | sum(VIDANGE_2, VIDANGE_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)] & sum(CONTROLEUR_2, CONTROLEUR_1)<=26]] | SUR_PONT_B<=sum(VIDANGE_2, VIDANGE_1)]]
normalized: ~ [E [true U ~ [[SUR_PONT_B<=sum(VIDANGE_2, VIDANGE_1) | [[sum(CONTROLEUR_2, CONTROLEUR_1)<=26 & [sum(VIDANGE_2, VIDANGE_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) | ~ [[sum(CHOIX_2, CHOIX_1)<=16 | sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=6]]]] | [~ [[[[[[87<=sum(CHOIX_2, CHOIX_1) & sum(VIDANGE_2, VIDANGE_1)<=sum(CHOIX_2, CHOIX_1)] | [66<=sum(VIDANGE_2, VIDANGE_1) & ROUTE_A<=14]] | ~ [[25<=sum(VIDANGE_2, VIDANGE_1) | 61<=SORTI_A]]] | [[40<=sum(VIDANGE_2, VIDANGE_1) & [ATTENTE_B<=58 | 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)]] | [[99<=ROUTE_B & SORTI_B<=31] | [SUR_PONT_B<=10 | sum(VIDANGE_2, VIDANGE_1)<=SORTI_A]]]] | [sum(CHOIX_2, CHOIX_1)<=78 & [39<=ROUTE_B & ~ [CAPACITE<=31]]]]] & [[[[[[SUR_PONT_A<=SUR_PONT_B | ATTENTE_B<=18] | [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) & sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=57]] | ~ [3<=ATTENTE_A]] & [95<=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)<=ATTENTE_B] | [CAPACITE<=ROUTE_A | ATTENTE_B<=ATTENTE_B]]]] | [~ [sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=48] | [[[88<=ATTENTE_A & ATTENTE_B<=42] & ~ [SUR_PONT_A<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)]] & ~ [[62<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) & sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=2]]]]] | [SORTI_A<=SUR_PONT_A | [sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=49 & [[[sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0) | sum(CHOIX_2, CHOIX_1)<=sum(CONTROLEUR_2, CONTROLEUR_1)] & [ROUTE_A<=69 | sum(CONTROLEUR_2, CONTROLEUR_1)<=SUR_PONT_A]] | [[sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=22 | SORTI_A<=47] | [53<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) & ROUTE_B<=15]]]]]]]]]]]]

abstracting: (ROUTE_B<=15)
states: 2,874 (3)
abstracting: (53<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0))
states: 0
abstracting: (SORTI_A<=47)
states: 2,874 (3)
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=22)
states: 2,874 (3)
abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=SUR_PONT_A)
states: 2,163 (3)
abstracting: (ROUTE_A<=69)
states: 2,874 (3)
abstracting: (sum(CHOIX_2, CHOIX_1)<=sum(CONTROLEUR_2, CONTROLEUR_1))
states: 1,553 (3)
abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=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_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=49)
states: 2,874 (3)
abstracting: (SORTI_A<=SUR_PONT_A)
states: 986
abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=2)
states: 2,874 (3)
abstracting: (62<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0))
states: 0
abstracting: (SUR_PONT_A<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0))
states: 2,714 (3)
abstracting: (ATTENTE_B<=42)
states: 2,874 (3)
abstracting: (88<=ATTENTE_A)
states: 0
abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=48)
states: 2,874 (3)
abstracting: (ATTENTE_B<=ATTENTE_B)
states: 2,874 (3)
abstracting: (CAPACITE<=ROUTE_A)
states: 48
abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=ATTENTE_B)
states: 2,593 (3)
abstracting: (95<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0))
states: 0
abstracting: (3<=ATTENTE_A)
states: 420
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=57)
states: 2,874 (3)
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=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: (ATTENTE_B<=18)
states: 2,874 (3)
abstracting: (SUR_PONT_A<=SUR_PONT_B)
states: 2,246 (3)
abstracting: (CAPACITE<=31)
states: 2,874 (3)
abstracting: (39<=ROUTE_B)
states: 0
abstracting: (sum(CHOIX_2, CHOIX_1)<=78)
states: 2,874 (3)
abstracting: (sum(VIDANGE_2, VIDANGE_1)<=SORTI_A)
states: 2,651 (3)
abstracting: (SUR_PONT_B<=10)
states: 2,874 (3)
abstracting: (SORTI_B<=31)
states: 2,874 (3)
abstracting: (99<=ROUTE_B)
states: 0
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)
abstracting: (ATTENTE_B<=58)
states: 2,874 (3)
abstracting: (40<=sum(VIDANGE_2, VIDANGE_1))
states: 0
abstracting: (61<=SORTI_A)
states: 0
abstracting: (25<=sum(VIDANGE_2, VIDANGE_1))
states: 0
abstracting: (ROUTE_A<=14)
states: 2,874 (3)
abstracting: (66<=sum(VIDANGE_2, VIDANGE_1))
states: 0
abstracting: (sum(VIDANGE_2, VIDANGE_1)<=sum(CHOIX_2, CHOIX_1))
states: 2,162 (3)
abstracting: (87<=sum(CHOIX_2, CHOIX_1))
states: 0
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=6)
states: 2,874 (3)
abstracting: (sum(CHOIX_2, CHOIX_1)<=16)
states: 2,874 (3)
abstracting: (sum(VIDANGE_2, VIDANGE_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0))
states: 2,874 (3)
abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=26)
states: 2,874 (3)
abstracting: (SUR_PONT_B<=sum(VIDANGE_2, VIDANGE_1))
states: 2,374 (3)
-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.925sec

checking: EF [[[~ [sum(CONTROLEUR_2, CONTROLEUR_1)<=33] & ROUTE_A<=1] & [~ [[~ [[[~ [[31<=SORTI_B & 73<=sum(CHOIX_2, CHOIX_1)]] & [[sum(CONTROLEUR_2, CONTROLEUR_1)<=48 & 9<=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 & 3<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]]] | [[[sum(CONTROLEUR_2, CONTROLEUR_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) | sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=17] | 7<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)] & ~ [[sum(CHOIX_2, CHOIX_1)<=19 & ATTENTE_A<=ROUTE_A]]]]] | [sum(CHOIX_2, CHOIX_1)<=sum(CHOIX_2, CHOIX_1) | ~ [[~ [SUR_PONT_A<=sum(VIDANGE_2, VIDANGE_1)] & sum(VIDANGE_2, VIDANGE_1)<=ATTENTE_A]]]]] & [[[[SORTI_B<=sum(CONTROLEUR_2, CONTROLEUR_1) | [[~ [ATTENTE_A<=88] | ~ [sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=58]] & ROUTE_A<=3]] & [[[[CAPACITE<=94 | SUR_PONT_B<=sum(VIDANGE_2, VIDANGE_1)] & [89<=SORTI_A | 96<=SUR_PONT_A]] | SORTI_B<=38] | [[~ [ROUTE_B<=CAPACITE] | ~ [26<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]] | [[SUR_PONT_A<=10 | ROUTE_B<=37] & [CAPACITE<=ROUTE_B & SORTI_B<=99]]]]] & [~ [[[[ATTENTE_B<=ATTENTE_B & SORTI_B<=68] & [sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=sum(CONTROLEUR_2, CONTROLEUR_1) & ATTENTE_A<=SORTI_A]] & ~ [[ATTENTE_A<=29 & 23<=SUR_PONT_B]]]] & [[29<=ROUTE_B & [~ [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)<=20 | 11<=SUR_PONT_B]]] | ~ [[[SORTI_B<=SUR_PONT_A & 90<=ATTENTE_B] & [SORTI_A<=69 | 94<=CAPACITE]]]]]] & [[[sum(CONTROLEUR_2, CONTROLEUR_1)<=sum(CHOIX_2, CHOIX_1) | [[[ATTENTE_A<=98 | sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=40] & [sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=5 & sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=58]] & ~ [[66<=SORTI_A & 16<=SORTI_A]]]] & ROUTE_B<=ATTENTE_B] & [~ [[~ [5<=ATTENTE_B] | [[SUR_PONT_B<=ATTENTE_B | sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=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)<=1 & sum(CONTROLEUR_2, CONTROLEUR_1)<=ATTENTE_B]]]] | ~ [[[[sum(VIDANGE_2, VIDANGE_1)<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) & sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=ROUTE_A] | [ROUTE_B<=8 | 93<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]] & [[CAPACITE<=83 | SORTI_A<=22] | [SORTI_B<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0) & 91<=ROUTE_A]]]]]]]]]]
normalized: E [true U [[[[[~ [[[[SORTI_B<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0) & 91<=ROUTE_A] | [CAPACITE<=83 | SORTI_A<=22]] & [[ROUTE_B<=8 | 93<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)] | [sum(VIDANGE_2, VIDANGE_1)<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) & sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=ROUTE_A]]]] | ~ [[[[sum(CONTROLEUR_2, CONTROLEUR_1)<=1 & sum(CONTROLEUR_2, CONTROLEUR_1)<=ATTENTE_B] & [SUR_PONT_B<=ATTENTE_B | sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]] | ~ [5<=ATTENTE_B]]]] & [ROUTE_B<=ATTENTE_B & [sum(CONTROLEUR_2, CONTROLEUR_1)<=sum(CHOIX_2, CHOIX_1) | [~ [[66<=SORTI_A & 16<=SORTI_A]] & [[sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=5 & sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=58] & [ATTENTE_A<=98 | sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=40]]]]]] & [[[~ [[[SORTI_A<=69 | 94<=CAPACITE] & [SORTI_B<=SUR_PONT_A & 90<=ATTENTE_B]]] | [29<=ROUTE_B & [[sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=20 | 11<=SUR_PONT_B] & ~ [SUR_PONT_B<=2]]]] & ~ [[~ [[ATTENTE_A<=29 & 23<=SUR_PONT_B]] & [[sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=sum(CONTROLEUR_2, CONTROLEUR_1) & ATTENTE_A<=SORTI_A] & [ATTENTE_B<=ATTENTE_B & SORTI_B<=68]]]]] & [[[[[CAPACITE<=ROUTE_B & SORTI_B<=99] & [SUR_PONT_A<=10 | ROUTE_B<=37]] | [~ [26<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)] | ~ [ROUTE_B<=CAPACITE]]] | [SORTI_B<=38 | [[89<=SORTI_A | 96<=SUR_PONT_A] & [CAPACITE<=94 | SUR_PONT_B<=sum(VIDANGE_2, VIDANGE_1)]]]] & [SORTI_B<=sum(CONTROLEUR_2, CONTROLEUR_1) | [ROUTE_A<=3 & [~ [sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=58] | ~ [ATTENTE_A<=88]]]]]]] & ~ [[[sum(CHOIX_2, CHOIX_1)<=sum(CHOIX_2, CHOIX_1) | ~ [[sum(VIDANGE_2, VIDANGE_1)<=ATTENTE_A & ~ [SUR_PONT_A<=sum(VIDANGE_2, VIDANGE_1)]]]] | ~ [[[~ [[sum(CHOIX_2, CHOIX_1)<=19 & ATTENTE_A<=ROUTE_A]] & [7<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0) | [sum(CONTROLEUR_2, CONTROLEUR_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) | sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=17]]] | [[[sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=SUR_PONT_A & 3<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)] & [sum(CONTROLEUR_2, CONTROLEUR_1)<=48 & 9<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)]] & ~ [[31<=SORTI_B & 73<=sum(CHOIX_2, CHOIX_1)]]]]]]]] & [ROUTE_A<=1 & ~ [sum(CONTROLEUR_2, CONTROLEUR_1)<=33]]]]

abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=33)
states: 2,874 (3)
abstracting: (ROUTE_A<=1)
states: 1,934 (3)
abstracting: (73<=sum(CHOIX_2, CHOIX_1))
states: 0
abstracting: (31<=SORTI_B)
states: 0
abstracting: (9<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0))
states: 0
abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=48)
states: 2,874 (3)
abstracting: (3<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0))
states: 0
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: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=17)
states: 2,874 (3)
abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0))
states: 2,874 (3)
abstracting: (7<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0))
states: 0
abstracting: (ATTENTE_A<=ROUTE_A)
states: 1,711 (3)
abstracting: (sum(CHOIX_2, CHOIX_1)<=19)
states: 2,874 (3)
abstracting: (SUR_PONT_A<=sum(VIDANGE_2, VIDANGE_1))
states: 2,374 (3)
abstracting: (sum(VIDANGE_2, VIDANGE_1)<=ATTENTE_A)
states: 2,636 (3)
abstracting: (sum(CHOIX_2, CHOIX_1)<=sum(CHOIX_2, CHOIX_1))
states: 2,874 (3)
abstracting: (ATTENTE_A<=88)
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)<=58)
states: 2,874 (3)
abstracting: (ROUTE_A<=3)
states: 2,790 (3)
abstracting: (SORTI_B<=sum(CONTROLEUR_2, CONTROLEUR_1))
states: 1,012 (3)
abstracting: (SUR_PONT_B<=sum(VIDANGE_2, VIDANGE_1))
states: 2,374 (3)
abstracting: (CAPACITE<=94)
states: 2,874 (3)
abstracting: (96<=SUR_PONT_A)
states: 0
abstracting: (89<=SORTI_A)
states: 0
abstracting: (SORTI_B<=38)
states: 2,874 (3)
abstracting: (ROUTE_B<=CAPACITE)
states: 2,866 (3)
abstracting: (26<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0))
states: 0
abstracting: (ROUTE_B<=37)
states: 2,874 (3)
abstracting: (SUR_PONT_A<=10)
states: 2,874 (3)
abstracting: (SORTI_B<=99)
states: 2,874 (3)
abstracting: (CAPACITE<=ROUTE_B)
states: 48
abstracting: (SORTI_B<=68)
states: 2,874 (3)
abstracting: (ATTENTE_B<=ATTENTE_B)
states: 2,874 (3)
abstracting: (ATTENTE_A<=SORTI_A)
states: 1,884 (3)
abstracting: (sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=sum(CONTROLEUR_2, CONTROLEUR_1))
states: 841
abstracting: (23<=SUR_PONT_B)
states: 0
abstracting: (ATTENTE_A<=29)
states: 2,874 (3)
abstracting: (SUR_PONT_B<=2)
states: 2,874 (3)
abstracting: (11<=SUR_PONT_B)
states: 0
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=20)
states: 2,874 (3)
abstracting: (29<=ROUTE_B)
states: 0
abstracting: (90<=ATTENTE_B)
states: 0
abstracting: (SORTI_B<=SUR_PONT_A)
states: 990
abstracting: (94<=CAPACITE)
states: 0
abstracting: (SORTI_A<=69)
states: 2,874 (3)
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=40)
states: 2,874 (3)
abstracting: (ATTENTE_A<=98)
states: 2,874 (3)
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=58)
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)<=5)
states: 2,874 (3)
abstracting: (16<=SORTI_A)
states: 0
abstracting: (66<=SORTI_A)
states: 0
abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=sum(CHOIX_2, CHOIX_1))
states: 2,033 (3)
abstracting: (ROUTE_B<=ATTENTE_B)
states: 1,807 (3)
abstracting: (5<=ATTENTE_B)
states: 0
abstracting: (sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_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: (SUR_PONT_B<=ATTENTE_B)
states: 2,550 (3)
abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=ATTENTE_B)
states: 2,593 (3)
abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=1)
states: 2,874 (3)
abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=ROUTE_A)
states: 1,775 (3)
abstracting: (sum(VIDANGE_2, VIDANGE_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: (93<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0))
states: 0
abstracting: (ROUTE_B<=8)
states: 2,874 (3)
abstracting: (SORTI_A<=22)
states: 2,874 (3)
abstracting: (CAPACITE<=83)
states: 2,874 (3)
abstracting: (91<=ROUTE_A)
states: 0
abstracting: (SORTI_B<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0))
states: 1,596 (3)
-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V04P05N02-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.988sec

totally nodes used: 31098 (3.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 20135 65392 85527
used/not used/entry size/cache size: 64407 67044457 16 1024MB
basic ops cache: hits/miss/sum: 44169 252610 296779
used/not used/entry size/cache size: 310345 16466871 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 3414 3414
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 6464 21032 27496
used/not used/entry size/cache size: 21032 8367576 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 67078990
1 28988
2 781
3 36
4 22
5 17
6 8
7 6
8 2
9 4
>= 10 10

Total processing time: 0m 8.476sec


BK_STOP 1678295898808

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


initing FirstDep: 0m 0.000sec


iterations count:2852 (54), effective:176 (3)

initing FirstDep: 0m 0.000sec

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V04P05N02"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marcie"
echo " Input is 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 r033-tajo-167813685600166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V04P05N02.tgz
mv BridgeAndVehicles-PT-V04P05N02 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;