fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r035-tajo-162038167700043
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for BridgeAndVehicles-PT-V10P10N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2750.688 272025.00 288392.00 122.10 TTFTFFTFFTFFTFTT 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/mcc2021-input.r035-tajo-162038167700043.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is BridgeAndVehicles-PT-V10P10N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tajo-162038167700043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 40K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 221K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 133K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 539K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Mar 23 02:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 23 02:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Mar 22 11:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 22 11:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 311K May 5 16:51 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-V10P10N10-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1620896994857

[2021-05-13 09:09:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 09:09:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:09:56] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2021-05-13 09:09:56] [INFO ] Transformed 48 places.
[2021-05-13 09:09:56] [INFO ] Transformed 288 transitions.
[2021-05-13 09:09:56] [INFO ] Parsed PT model containing 48 places and 288 transitions in 117 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 43 ms.
Incomplete random walk after 100000 steps, including 1110 resets, run finished after 1924 ms. (steps per millisecond=51 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0]
[2021-05-13 09:09:58] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2021-05-13 09:09:58] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-13 09:09:58] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned unsat
[2021-05-13 09:09:58] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2021-05-13 09:09:58] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned sat
[2021-05-13 09:09:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:09:58] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-13 09:09:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:09:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2021-05-13 09:09:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:09:58] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-13 09:09:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 09:09:58] [INFO ] [Nat]Added 22 Read/Feed constraints in 12 ms returned sat
[2021-05-13 09:09:59] [INFO ] Deduced a trap composed of 5 places in 87 ms
[2021-05-13 09:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2021-05-13 09:09:59] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 23 ms.
[2021-05-13 09:09:59] [INFO ] Added : 69 causal constraints over 14 iterations in 269 ms. Result :sat
[2021-05-13 09:09:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:09:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:09:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:09:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:09:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:09:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 09:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:09:59] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-13 09:09:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:09:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 09:09:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:09:59] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-13 09:09:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 11 ms returned sat
[2021-05-13 09:09:59] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 15 ms.
[2021-05-13 09:09:59] [INFO ] Added : 78 causal constraints over 16 iterations in 248 ms. Result :sat
[2021-05-13 09:09:59] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2021-05-13 09:09:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 09:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:09:59] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-13 09:09:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:09:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2021-05-13 09:09:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:09:59] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2021-05-13 09:09:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2021-05-13 09:09:59] [INFO ] Deduced a trap composed of 15 places in 39 ms
[2021-05-13 09:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2021-05-13 09:09:59] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 14 ms.
[2021-05-13 09:10:00] [INFO ] Added : 82 causal constraints over 17 iterations in 252 ms. Result :sat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 09:10:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-13 09:10:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:10:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 09:10:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:10:00] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-13 09:10:00] [INFO ] [Nat]Added 22 Read/Feed constraints in 6 ms returned sat
[2021-05-13 09:10:00] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 15 ms.
[2021-05-13 09:10:00] [INFO ] Added : 80 causal constraints over 19 iterations in 289 ms. Result :sat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2021-05-13 09:10:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-13 09:10:00] [INFO ] [Real]Added 22 Read/Feed constraints in 4 ms returned sat
[2021-05-13 09:10:00] [INFO ] Deduced a trap composed of 14 places in 51 ms
[2021-05-13 09:10:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2021-05-13 09:10:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:10:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2021-05-13 09:10:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:10:00] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-13 09:10:00] [INFO ] [Nat]Added 22 Read/Feed constraints in 6 ms returned sat
[2021-05-13 09:10:00] [INFO ] Deduced a trap composed of 15 places in 39 ms
[2021-05-13 09:10:00] [INFO ] Deduced a trap composed of 14 places in 29 ms
[2021-05-13 09:10:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2021-05-13 09:10:00] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 13 ms.
[2021-05-13 09:10:01] [INFO ] Added : 65 causal constraints over 15 iterations in 232 ms. Result :sat
[2021-05-13 09:10:01] [INFO ] Deduced a trap composed of 5 places in 25 ms
[2021-05-13 09:10:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 09:10:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-13 09:10:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:10:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 09:10:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:10:01] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-13 09:10:01] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2021-05-13 09:10:01] [INFO ] Deduced a trap composed of 15 places in 41 ms
[2021-05-13 09:10:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2021-05-13 09:10:01] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 13 ms.
[2021-05-13 09:10:01] [INFO ] Added : 58 causal constraints over 12 iterations in 164 ms. Result :sat
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned unsat
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 09:10:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:10:01] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-13 09:10:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:10:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 09:10:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:10:01] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-13 09:10:01] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat
[2021-05-13 09:10:01] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 13 ms.
[2021-05-13 09:10:02] [INFO ] Added : 60 causal constraints over 14 iterations in 300 ms. Result :sat
[2021-05-13 09:10:02] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 09:10:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:10:02] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-13 09:10:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:10:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 09:10:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:10:02] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-13 09:10:02] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat
[2021-05-13 09:10:02] [INFO ] Deduced a trap composed of 5 places in 44 ms
[2021-05-13 09:10:02] [INFO ] Deduced a trap composed of 6 places in 43 ms
[2021-05-13 09:10:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2021-05-13 09:10:02] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 11 ms.
[2021-05-13 09:10:02] [INFO ] Added : 82 causal constraints over 18 iterations in 296 ms. Result :sat
[2021-05-13 09:10:02] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:10:02] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2021-05-13 09:10:02] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 09:10:02] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 09:10:02] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:10:02] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:10:02] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 09:10:02] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:10:02] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:10:02] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 09:10:02] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:10:02] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:10:02] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 09:10:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:10:02] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-13 09:10:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:10:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 09:10:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:10:02] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2021-05-13 09:10:02] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat
[2021-05-13 09:10:02] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 27 ms.
[2021-05-13 09:10:03] [INFO ] Added : 84 causal constraints over 17 iterations in 334 ms. Result :sat
[2021-05-13 09:10:03] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2021-05-13 09:10:03] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 09:10:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:10:03] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-13 09:10:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:10:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 09:10:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:10:03] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-13 09:10:03] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat
[2021-05-13 09:10:03] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 13 ms.
[2021-05-13 09:10:03] [INFO ] Added : 76 causal constraints over 16 iterations in 459 ms. Result :sat
[2021-05-13 09:10:03] [INFO ] Deduced a trap composed of 5 places in 83 ms
[2021-05-13 09:10:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2021-05-13 09:10:03] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 09:10:03] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:10:03] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:10:03] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:10:03] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:10:04] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:10:04] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:10:04] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 09:10:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:10:04] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-13 09:10:04] [INFO ] [Real]Added 22 Read/Feed constraints in 4 ms returned sat
[2021-05-13 09:10:04] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 11 ms.
[2021-05-13 09:10:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:10:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 09:10:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:10:04] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2021-05-13 09:10:04] [INFO ] [Nat]Added 22 Read/Feed constraints in 10 ms returned sat
[2021-05-13 09:10:04] [INFO ] Deduced a trap composed of 15 places in 34 ms
[2021-05-13 09:10:04] [INFO ] Deduced a trap composed of 14 places in 31 ms
[2021-05-13 09:10:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 78 ms
[2021-05-13 09:10:04] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 12 ms.
[2021-05-13 09:10:04] [INFO ] Added : 82 causal constraints over 17 iterations in 307 ms. Result :sat
[2021-05-13 09:10:04] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
Successfully simplified 48 atomic propositions for a total of 48 simplifications.
[2021-05-13 09:10:04] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 09:10:04] [INFO ] Flatten gal took : 78 ms
[2021-05-13 09:10:04] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-13 09:10:04] [INFO ] Flatten gal took : 25 ms
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:10:04] [INFO ] Applying decomposition
[2021-05-13 09:10:04] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph12735327805508641242.txt, -o, /tmp/graph12735327805508641242.bin, -w, /tmp/graph12735327805508641242.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph12735327805508641242.bin, -l, -1, -v, -w, /tmp/graph12735327805508641242.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 09:10:05] [INFO ] Decomposing Gal with order
[2021-05-13 09:10:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 09:10:05] [INFO ] Removed a total of 693 redundant transitions.
[2021-05-13 09:10:05] [INFO ] Flatten gal took : 170 ms
[2021-05-13 09:10:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 20 ms.
[2021-05-13 09:10:05] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 2 ms
[2021-05-13 09:10:05] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,0.895456,29236,2,37874,5,120233,6,0,296,70041,0


Converting to forward existential form...Done !
original formula: AF(EX((((((((((((((((((gu0.SORTI_A+gu1.SORTI_B)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu0.CAPACITE)>=27) + EG((gu1.SORTI_B<=((gu0.SUR_PONT_B+gu2.ATTENTE_A)+gu1.SUR_PONT_A))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((((((((((((((((((gu0.SORTI_A+gu1.SORTI_B)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu0.CAPACITE)>=27) + EG((gu1.SORTI_B<=((gu0.SUR_PONT_B+gu2.ATTENTE_A)+gu1.SUR_PONT_A)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions enregistrement_A_10, liberation_A, basculement_1, basculement_2, liberation_B, enregistrement_B_0, decision_2_3, decision_1_4, timeout_A_1_2_0_10, timeout_B_2_10_9_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/2/10/12
(forward)formula 0,1,20.183,556368,1,0,384,2.9375e+06,49,193,2788,3.12741e+06,348
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (((AG(((((((((((((((((((((((((((((((((gu2.VIDANGE_1+gu2.VIDANGE_2)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu2.CONTROLEUR_1)+gu2.CONTROLEUR_2)+gu0.ATTENTE_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu0.CAPACITE)+gu0.SUR_PONT_B)+gu0.ROUTE_A)+gu0.SORTI_A)+gu1.SORTI_B)<=gu0.ROUTE_B)) + !(EG(TRUE))) + !(EX(EG(E((((((((((((((((((((((((((((((((gu0.ATTENTE_B+gu2.ATTENTE_A)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu0.CAPACITE)+gu0.ROUTE_A)+gu2.CONTROLEUR_1)+gu2.CONTROLEUR_2)+gu0.SUR_PONT_B)>=14) U ((((gu1.SUR_PONT_A+gu0.SORTI_A)+gu2.VIDANGE_1)+gu2.VIDANGE_2)<=8)))))) + EG(TRUE))
=> equivalent forward existential formula: [FwdG(EY(((Init * !(EG(TRUE))) * !((!(E(TRUE U !(((((((((((((((((((((((((((((((((gu2.VIDANGE_1+gu2.VIDANGE_2)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu2.CONTROLEUR_1)+gu2.CONTROLEUR_2)+gu0.ATTENTE_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu0.CAPACITE)+gu0.SUR_PONT_B)+gu0.ROUTE_A)+gu0.SORTI_A)+gu1.SORTI_B)<=gu0.ROUTE_B)))) + !(EG(TRUE)))))),E((((((((((((((((((((((((((((((((gu0.ATTENTE_B+gu2.ATTENTE_A)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu0.CAPACITE)+gu0.ROUTE_A)+gu2.CONTROLEUR_1)+gu2.CONTROLEUR_2)+gu0.SUR_PONT_B)>=14) U ((((gu1.SUR_PONT_A+gu0.SORTI_A)+gu2.VIDANGE_1)+gu2.VIDANGE_2)<=8)))] = FALSE
dead was empty
(forward)formula 1,1,39.4672,975684,1,0,719,5.1223e+06,61,371,48539,5.36266e+06,778
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AX(!(EG(AX((((((((((((((((((((((((((((((((gu2.CONTROLEUR_1+gu2.CONTROLEUR_2)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu2.ATTENTE_A)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu0.ATTENTE_B)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu0.SUR_PONT_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)<=5)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EX(!((((((((((((((((((((((((((((((((gu2.CONTROLEUR_1+gu2.CONTROLEUR_2)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu2.ATTENTE_A)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu0.ATTENTE_B)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu0.SUR_PONT_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)<=5)))))] = FALSE
(forward)formula 2,0,48.0684,1108340,1,0,989,5.82339e+06,66,554,65981,6.25116e+06,962
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG(EF(((((gu2.ATTENTE_A+gu0.SORTI_A)+gu0.ATTENTE_B)>=5)||((((((((((((((((((((((((((((((((((((((((gu0.ROUTE_B+gu0.CAPACITE)+gu0.SORTI_A)+gu1.SUR_PONT_A)+gu2.ATTENTE_A)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu0.SUR_PONT_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu0.ROUTE_A)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)>=27))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((gu2.ATTENTE_A+gu0.SORTI_A)+gu0.ATTENTE_B)>=5)||((((((((((((((((((((((((((((((((((((((((gu0.ROUTE_B+gu0.CAPACITE)+gu0.SORTI_A)+gu1.SUR_PONT_A)+gu2.ATTENTE_A)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu0.SUR_PONT_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu0.ROUTE_A)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)>=27)))))] = FALSE
(forward)formula 3,1,53.3845,1194072,1,0,1007,6.10651e+06,67,564,85776,6.52631e+06,988
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (EG(E(((EF((((((((((((((((((((((((((((((((gu2.COMPTEUR_0+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu1.SORTI_B)+gu2.ATTENTE_A)+gu2.CONTROLEUR_1)+gu2.CONTROLEUR_2)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu0.CAPACITE)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu1.CHOIX_1)+gu1.CHOIX_2)>=20)) * AX(((((((((((((((((((((((gu1.NB_ATTENTE_B_0+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu2.CONTROLEUR_1)+gu2.CONTROLEUR_2)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu0.ATTENTE_B)+gu0.SORTI_A)+gu0.SUR_PONT_B)+gu0.ROUTE_A)+gu1.SUR_PONT_A)<=17))) * AF(((gu0.SORTI_A+gu0.CAPACITE)>=1))) U ((EG((((((((gu2.CONTROLEUR_1+gu2.CONTROLEUR_2)+gu1.SUR_PONT_A)+gu0.ROUTE_A)+gu2.ATTENTE_A)+gu0.SORTI_A)+gu0.CAPACITE)<=(((((((((((((gu0.CAPACITE+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu1.SUR_PONT_A)+gu0.ROUTE_B))) * EG(((gu0.ROUTE_A+gu0.SUR_PONT_B)<=((((((((((((((((((((((((((((((((((((((((((gu2.CONTROLEUR_1+gu2.CONTROLEUR_2)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu2.ATTENTE_A)+gu0.ATTENTE_B)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.SORTI_B)+gu0.SUR_PONT_B)))) * (((((((((((((((((((((((((gu0.SORTI_A+gu1.SUR_PONT_A)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.SORTI_B)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)<=((((((((((((((((((((((((gu1.CHOIX_1+gu1.CHOIX_2)+gu1.SUR_PONT_A)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10))))) * AF(AG((((((((((((((((((gu1.CHOIX_1+gu1.CHOIX_2)+gu0.ATTENTE_B)+gu1.SUR_PONT_A)+gu0.ROUTE_B)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.SORTI_B)>20))))
=> equivalent forward existential formula: ([(Init * !(EG(E(((E(TRUE U (((((((((((((((((((((((((((((((gu2.COMPTEUR_0+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu1.SORTI_B)+gu2.ATTENTE_A)+gu2.CONTROLEUR_1)+gu2.CONTROLEUR_2)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu0.CAPACITE)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu1.CHOIX_1)+gu1.CHOIX_2)>=20)) * !(EX(!(((((((((((((((((((((((gu1.NB_ATTENTE_B_0+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu2.CONTROLEUR_1)+gu2.CONTROLEUR_2)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu0.ATTENTE_B)+gu0.SORTI_A)+gu0.SUR_PONT_B)+gu0.ROUTE_A)+gu1.SUR_PONT_A)<=17))))) * !(EG(!(((gu0.SORTI_A+gu0.CAPACITE)>=1))))) U ((EG((((((((gu2.CONTROLEUR_1+gu2.CONTROLEUR_2)+gu1.SUR_PONT_A)+gu0.ROUTE_A)+gu2.ATTENTE_A)+gu0.SORTI_A)+gu0.CAPACITE)<=(((((((((((((gu0.CAPACITE+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu1.SUR_PONT_A)+gu0.ROUTE_B))) * EG(((gu0.ROUTE_A+gu0.SUR_PONT_B)<=((((((((((((((((((((((((((((((((((((((((((gu2.CONTROLEUR_1+gu2.CONTROLEUR_2)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu2.ATTENTE_A)+gu0.ATTENTE_B)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.SORTI_B)+gu0.SUR_PONT_B)))) * (((((((((((((((((((((((((gu0.SORTI_A+gu1.SUR_PONT_A)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.SORTI_B)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)<=((((((((((((((((((((((((gu1.CHOIX_1+gu1.CHOIX_2)+gu1.SUR_PONT_A)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)))))))] = FALSE * [FwdG(Init,!(!(E(TRUE U !((((((((((((((((((gu1.CHOIX_1+gu1.CHOIX_2)+gu0.ATTENTE_B)+gu1.SUR_PONT_A)+gu0.ROUTE_B)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.SORTI_B)>20))))))] = FALSE)
(forward)formula 4,0,54.4844,1223572,1,0,1012,6.13348e+06,70,568,86100,6.55921e+06,1001
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: A(E((((((((((((((((((((((((((((((((((gu0.SORTI_A+gu0.SUR_PONT_B)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu0.CAPACITE)+gu0.ROUTE_B)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.SORTI_B)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu0.ATTENTE_B)<=12) + E(E((((((((((((((((((((gu0.CAPACITE+gu0.ROUTE_A)+gu2.ATTENTE_A)+gu1.SUR_PONT_A)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu0.ROUTE_B)+gu0.SUR_PONT_B)<=((((((((((((((((((((((((((((((((((((((gu0.ATTENTE_B+gu0.CAPACITE)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.SORTI_B)+gu0.ROUTE_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu0.ROUTE_A)+gu0.SUR_PONT_B)) U ((((((((((((((((((((((((((((((((((((gu2.COMPTEUR_0+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu1.SUR_PONT_A)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu1.SORTI_B)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu2.ATTENTE_A)<=((((((gu2.CONTROLEUR_1+gu2.CONTROLEUR_2)+gu0.SUR_PONT_B)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu0.ROUTE_B)+gu1.SORTI_B))) U (((((((((((((((((((((gu0.ATTENTE_B+gu1.SUR_PONT_A)+gu2.ATTENTE_A)+gu0.ROUTE_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu2.CONTROLEUR_1)+gu2.CONTROLEUR_2)+gu0.SUR_PONT_B)+gu1.SORTI_B)<=((((((((((((((((((gu2.VIDANGE_1+gu2.VIDANGE_2)+gu0.ROUTE_B)+gu0.SORTI_A)+gu0.ATTENTE_B)+gu0.ROUTE_A)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)))) U EX(TRUE)) U ((((((((((((((((((((((((((((((((gu1.NB_ATTENTE_B_0+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu2.CONTROLEUR_1)+gu2.CONTROLEUR_2)+gu0.ROUTE_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu0.SORTI_A)+gu1.SORTI_B)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu0.ROUTE_B)<=6))
=> equivalent forward existential formula: [((Init * !(EG(!(((((((((((((((((((((((((((((((((gu1.NB_ATTENTE_B_0+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu2.CONTROLEUR_1)+gu2.CONTROLEUR_2)+gu0.ROUTE_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu0.SORTI_A)+gu1.SORTI_B)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu0.ROUTE_B)<=6))))) * !(E(!(((((((((((((((((((((((((((((((((gu1.NB_ATTENTE_B_0+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu2.CONTROLEUR_1)+gu2.CONTROLEUR_2)+gu0.ROUTE_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu0.SORTI_A)+gu1.SORTI_B)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu0.ROUTE_B)<=6)) U (!(E((((((((((((((((((((((((((((((((((gu0.SORTI_A+gu0.SUR_PONT_B)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu0.CAPACITE)+gu0.ROUTE_B)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.SORTI_B)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu0.ATTENTE_B)<=12) + E(E((((((((((((((((((((gu0.CAPACITE+gu0.ROUTE_A)+gu2.ATTENTE_A)+gu1.SUR_PONT_A)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu0.ROUTE_B)+gu0.SUR_PONT_B)<=((((((((((((((((((((((((((((((((((((((gu0.ATTENTE_B+gu0.CAPACITE)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.SORTI_B)+gu0.ROUTE_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu0.ROUTE_A)+gu0.SUR_PONT_B)) U ((((((((((((((((((((((((((((((((((((gu2.COMPTEUR_0+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu1.SUR_PONT_A)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu1.SORTI_B)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu2.ATTENTE_A)<=((((((gu2.CONTROLEUR_1+gu2.CONTROLEUR_2)+gu0.SUR_PONT_B)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu0.ROUTE_B)+gu1.SORTI_B))) U (((((((((((((((((((((gu0.ATTENTE_B+gu1.SUR_PONT_A)+gu2.ATTENTE_A)+gu0.ROUTE_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu2.CONTROLEUR_1)+gu2.CONTROLEUR_2)+gu0.SUR_PONT_B)+gu1.SORTI_B)<=((((((((((((((((((gu2.VIDANGE_1+gu2.VIDANGE_2)+gu0.ROUTE_B)+gu0.SORTI_A)+gu0.ATTENTE_B)+gu0.ROUTE_A)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)))) U EX(TRUE))) * !(((((((((((((((((((((((((((((((((gu1.NB_ATTENTE_B_0+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu2.CONTROLEUR_1)+gu2.CONTROLEUR_2)+gu0.ROUTE_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu0.SORTI_A)+gu1.SORTI_B)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu0.ROUTE_B)<=6))))))] != FALSE
(forward)formula 5,0,161.692,2210240,1,0,1843,1.09073e+07,13,1064,3152,1.1959e+07,277
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (!(AX(FALSE)) * EF(EG(TRUE)))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(!(EX(!(FALSE))))),TRUE),TRUE)] != FALSE
(forward)formula 6,1,162.417,2210240,1,0,1843,1.09073e+07,17,1064,3304,1.1959e+07,285
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AF((((((((((((((((((((((((((((((((((((((((gu0.CAPACITE+gu1.SORTI_B)+gu0.SUR_PONT_B)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu1.SUR_PONT_A)+gu0.SORTI_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)<=((((((((((((((((gu1.NB_ATTENTE_B_0+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.SUR_PONT_A)+gu0.SUR_PONT_B)+gu2.ATTENTE_A)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu0.ROUTE_B)) + ((EF((((((((((((((((((((((((((((((((gu2.VIDANGE_1+gu2.VIDANGE_2)+gu0.ROUTE_A)+gu0.ROUTE_B)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu0.SUR_PONT_B)+gu0.CAPACITE)+gu2.ATTENTE_A)+gu0.SORTI_A)+gu1.SUR_PONT_A)<=(((((((((((((((((((((((((gu1.CHOIX_1+gu1.CHOIX_2)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu1.SORTI_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu0.ROUTE_A))) * EF((((((((((((((((((((((((((((((gu0.SORTI_A+gu0.CAPACITE)+gu0.ROUTE_A)+gu1.SORTI_B)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu2.ATTENTE_A)+gu0.SUR_PONT_B)+gu0.ROUTE_B)<=(((gu0.ROUTE_B+gu0.CAPACITE)+gu0.ATTENTE_B)+gu0.ROUTE_A)))) * (((((((((((((((((((((((((((((gu1.SUR_PONT_A+gu2.CONTROLEUR_1)+gu2.CONTROLEUR_2)+gu0.SORTI_A)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu0.SUR_PONT_B)+gu1.SORTI_B)+gu0.ROUTE_B)<12))))
=> equivalent forward existential formula: [FwdG(Init,!((((((((((((((((((((((((((((((((((((((((gu0.CAPACITE+gu1.SORTI_B)+gu0.SUR_PONT_B)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu1.SUR_PONT_A)+gu0.SORTI_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)<=((((((((((((((((gu1.NB_ATTENTE_B_0+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.SUR_PONT_A)+gu0.SUR_PONT_B)+gu2.ATTENTE_A)+gu2.VIDANGE_1)+gu2.VIDANGE_2)+gu0.ROUTE_B)) + ((E(TRUE U (((((((((((((((((((((((((((((((gu2.VIDANGE_1+gu2.VIDANGE_2)+gu0.ROUTE_A)+gu0.ROUTE_B)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu0.SUR_PONT_B)+gu0.CAPACITE)+gu2.ATTENTE_A)+gu0.SORTI_A)+gu1.SUR_PONT_A)<=(((((((((((((((((((((((((gu1.CHOIX_1+gu1.CHOIX_2)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu1.SORTI_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.COMPTEUR_3)+gu2.COMPTEUR_4)+gu2.COMPTEUR_5)+gu2.COMPTEUR_6)+gu2.COMPTEUR_7)+gu2.COMPTEUR_8)+gu2.COMPTEUR_9)+gu2.COMPTEUR_10)+gu0.ROUTE_A))) * E(TRUE U (((((((((((((((((((((((((((((gu0.SORTI_A+gu0.CAPACITE)+gu0.ROUTE_A)+gu1.SORTI_B)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu2.ATTENTE_A)+gu0.SUR_PONT_B)+gu0.ROUTE_B)<=(((gu0.ROUTE_B+gu0.CAPACITE)+gu0.ATTENTE_B)+gu0.ROUTE_A)))) * (((((((((((((((((((((((((((((gu1.SUR_PONT_A+gu2.CONTROLEUR_1)+gu2.CONTROLEUR_2)+gu0.SORTI_A)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu0.SUR_PONT_B)+gu1.SORTI_B)+gu0.ROUTE_B)<12)))))] = FALSE
(forward)formula 7,0,193.086,2210240,1,0,1843,1.09073e+07,29,1064,195254,1.1959e+07,832
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF((EG(((((((((gu0.NB_ATTENTE_A_3+gu0.ATTENTE_B)+gu0.NB_ATTENTE_A_7)+gu0.ROUTE_A)+gu2.COMPTEUR_3)+gu1.CHOIX_1)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_3)<=13)) * ((((((((gu2.COMPTEUR_0+gu2.COMPTEUR_9)+gu1.NB_ATTENTE_B_5)+gu2.COMPTEUR_6)+gu1.CHOIX_2)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_10)<=(gu2.CONTROLEUR_1+gu2.COMPTEUR_0)) + (A(EG(((((((((gu1.NB_ATTENTE_B_5+gu0.ROUTE_A)+gu0.SORTI_A)+gu1.NB_ATTENTE_B_7)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_9)+gu0.CAPACITE)+gu2.VIDANGE_2)<=7)) U ((gu2.COMPTEUR_9+gu2.COMPTEUR_2)<=(((((((gu0.NB_ATTENTE_A_1+gu0.ATTENTE_B)+gu2.COMPTEUR_2)+gu0.SORTI_A)+gu0.NB_ATTENTE_A_6)+gu1.SORTI_B)+gu1.NB_ATTENTE_B_5)+gu0.NB_ATTENTE_A_4))) * (!(AX(((((gu2.ATTENTE_A+gu0.NB_ATTENTE_A_1)+gu2.COMPTEUR_2)+gu1.NB_ATTENTE_B_7)>=2))) + ((((gu1.NB_ATTENTE_B_2+gu2.COMPTEUR_2)+gu0.NB_ATTENTE_A_4)+gu2.COMPTEUR_3)<=(((((((((gu1.SUR_PONT_A+gu0.NB_ATTENTE_A_3)+gu2.CONTROLEUR_1)+gu1.CHOIX_2)+gu1.SORTI_B)+gu2.COMPTEUR_3)+gu1.NB_ATTENTE_B_6)+gu0.NB_ATTENTE_A_4)+gu0.CAPACITE)+gu0.NB_ATTENTE_A_0)))))))
=> equivalent forward existential formula: [FwdG(Init,!((EG(((((((((gu0.NB_ATTENTE_A_3+gu0.ATTENTE_B)+gu0.NB_ATTENTE_A_7)+gu0.ROUTE_A)+gu2.COMPTEUR_3)+gu1.CHOIX_1)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_3)<=13)) * ((((((((gu2.COMPTEUR_0+gu2.COMPTEUR_9)+gu1.NB_ATTENTE_B_5)+gu2.COMPTEUR_6)+gu1.CHOIX_2)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_10)<=(gu2.CONTROLEUR_1+gu2.COMPTEUR_0)) + (!((E(!(((gu2.COMPTEUR_9+gu2.COMPTEUR_2)<=(((((((gu0.NB_ATTENTE_A_1+gu0.ATTENTE_B)+gu2.COMPTEUR_2)+gu0.SORTI_A)+gu0.NB_ATTENTE_A_6)+gu1.SORTI_B)+gu1.NB_ATTENTE_B_5)+gu0.NB_ATTENTE_A_4))) U (!(EG(((((((((gu1.NB_ATTENTE_B_5+gu0.ROUTE_A)+gu0.SORTI_A)+gu1.NB_ATTENTE_B_7)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_9)+gu0.CAPACITE)+gu2.VIDANGE_2)<=7))) * !(((gu2.COMPTEUR_9+gu2.COMPTEUR_2)<=(((((((gu0.NB_ATTENTE_A_1+gu0.ATTENTE_B)+gu2.COMPTEUR_2)+gu0.SORTI_A)+gu0.NB_ATTENTE_A_6)+gu1.SORTI_B)+gu1.NB_ATTENTE_B_5)+gu0.NB_ATTENTE_A_4))))) + EG(!(((gu2.COMPTEUR_9+gu2.COMPTEUR_2)<=(((((((gu0.NB_ATTENTE_A_1+gu0.ATTENTE_B)+gu2.COMPTEUR_2)+gu0.SORTI_A)+gu0.NB_ATTENTE_A_6)+gu1.SORTI_B)+gu1.NB_ATTENTE_B_5)+gu0.NB_ATTENTE_A_4)))))) * (!(!(EX(!(((((gu2.ATTENTE_A+gu0.NB_ATTENTE_A_1)+gu2.COMPTEUR_2)+gu1.NB_ATTENTE_B_7)>=2))))) + ((((gu1.NB_ATTENTE_B_2+gu2.COMPTEUR_2)+gu0.NB_ATTENTE_A_4)+gu2.COMPTEUR_3)<=(((((((((gu1.SUR_PONT_A+gu0.NB_ATTENTE_A_3)+gu2.CONTROLEUR_1)+gu1.CHOIX_2)+gu1.SORTI_B)+gu2.COMPTEUR_3)+gu1.NB_ATTENTE_B_6)+gu0.NB_ATTENTE_A_4)+gu0.CAPACITE)+gu0.NB_ATTENTE_A_0))))))))] = FALSE
dead was empty
(forward)formula 8,1,208.437,2210240,1,0,1843,1.09073e+07,46,1064,198310,1.1959e+07,1366
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: !(EG(!(AG((((((((gu2.COMPTEUR_8+gu2.CONTROLEUR_1)+gu2.COMPTEUR_4)+gu2.COMPTEUR_1)+gu1.NB_ATTENTE_B_6)+gu0.NB_ATTENTE_A_8)+gu1.NB_ATTENTE_B_9)<=((((gu1.NB_ATTENTE_B_4+gu2.COMPTEUR_6)+gu2.COMPTEUR_5)+gu2.COMPTEUR_8)+gu1.NB_ATTENTE_B_3))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((((((gu2.COMPTEUR_8+gu2.CONTROLEUR_1)+gu2.COMPTEUR_4)+gu2.COMPTEUR_1)+gu1.NB_ATTENTE_B_6)+gu0.NB_ATTENTE_A_8)+gu1.NB_ATTENTE_B_9)<=((((gu1.NB_ATTENTE_B_4+gu2.COMPTEUR_6)+gu2.COMPTEUR_5)+gu2.COMPTEUR_8)+gu1.NB_ATTENTE_B_3)))))))] = FALSE
(forward)formula 9,0,221.839,2210240,1,0,1843,1.09073e+07,51,1064,198407,1.1959e+07,1672
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EX(EF((!(AF((((((((gu2.VIDANGE_2+gu0.ATTENTE_B)+gu1.NB_ATTENTE_B_2)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_8)+gu1.NB_ATTENTE_B_6)+gu0.SORTI_A)<=9))) + EG((((gu1.NB_ATTENTE_B_7+gu2.VIDANGE_2)+gu0.NB_ATTENTE_A_9)<=((((((gu0.ROUTE_B+gu2.COMPTEUR_10)+gu1.NB_ATTENTE_B_8)+gu0.ATTENTE_B)+gu1.NB_ATTENTE_B_4)+gu2.COMPTEUR_6)+gu1.NB_ATTENTE_B_0))))))
=> equivalent forward existential formula: ([FwdG(FwdU(EY(Init),TRUE),!((((((((gu2.VIDANGE_2+gu0.ATTENTE_B)+gu1.NB_ATTENTE_B_2)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_8)+gu1.NB_ATTENTE_B_6)+gu0.SORTI_A)<=9)))] != FALSE + [FwdG(FwdU(EY(Init),TRUE),(((gu1.NB_ATTENTE_B_7+gu2.VIDANGE_2)+gu0.NB_ATTENTE_A_9)<=((((((gu0.ROUTE_B+gu2.COMPTEUR_10)+gu1.NB_ATTENTE_B_8)+gu0.ATTENTE_B)+gu1.NB_ATTENTE_B_4)+gu2.COMPTEUR_6)+gu1.NB_ATTENTE_B_0)))] != FALSE)
Hit Full ! (commute/partial/dont) 3/0/9
(forward)formula 10,1,223.138,2210240,1,0,1843,1.09073e+07,59,1064,198492,1.1959e+07,1677
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EX(EX(!(EG(TRUE))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(EG(TRUE)))] != FALSE
(forward)formula 11,0,231.604,2210240,1,0,1878,1.09073e+07,59,1110,198492,1.1959e+07,2001
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AX(EG(EF((((((((((gu1.NB_ATTENTE_B_8+gu1.NB_ATTENTE_B_9)+gu2.COMPTEUR_3)+gu2.COMPTEUR_5)+gu2.CONTROLEUR_2)+gu1.SUR_PONT_A)+gu0.NB_ATTENTE_A_4)+gu1.NB_ATTENTE_B_6)+gu0.NB_ATTENTE_A_1)<=((gu1.NB_ATTENTE_B_5+gu0.NB_ATTENTE_A_2)+gu2.COMPTEUR_1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(E(TRUE U (((((((((gu1.NB_ATTENTE_B_8+gu1.NB_ATTENTE_B_9)+gu2.COMPTEUR_3)+gu2.COMPTEUR_5)+gu2.CONTROLEUR_2)+gu1.SUR_PONT_A)+gu0.NB_ATTENTE_A_4)+gu1.NB_ATTENTE_B_6)+gu0.NB_ATTENTE_A_1)<=((gu1.NB_ATTENTE_B_5+gu0.NB_ATTENTE_A_2)+gu2.COMPTEUR_1))))))] = FALSE
(forward)formula 12,1,259.716,2512956,1,0,2435,1.33267e+07,63,1521,198609,1.51263e+07,2603
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************


BK_STOP 1620897266882

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-V10P10N10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="gold2020"
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-4028"
echo " Executing tool gold2020"
echo " Input is BridgeAndVehicles-PT-V10P10N10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r035-tajo-162038167700043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V10P10N10.tgz
mv BridgeAndVehicles-PT-V10P10N10 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;