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-162038167700041.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-V04P05N02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tajo-162038167700041
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 163K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K 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.6K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 23 02:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 02:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 22 11:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 22 11:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 57K 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-V04P05N02-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1620896994901

[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): 36 ms
[2021-05-13 09:09:56] [INFO ] Transformed 28 places.
[2021-05-13 09:09:56] [INFO ] Transformed 52 transitions.
[2021-05-13 09:09:56] [INFO ] Parsed PT model containing 28 places and 52 transitions in 72 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 49 ms.
Incomplete random walk after 100000 steps, including 2297 resets, run finished after 2000 ms. (steps per millisecond=50 ) properties seen :[1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1]
[2021-05-13 09:09:58] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2021-05-13 09:09:58] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-13 09:09:58] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned unsat
[2021-05-13 09:09:58] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2021-05-13 09:09:58] [INFO ] [Real]Absence check using 7 positive place invariants in 5 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 23 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 9 ms returned sat
[2021-05-13 09:09:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:09:59] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-13 09:09:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-13 09:09:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2021-05-13 09:09:59] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 6 ms.
[2021-05-13 09:09:59] [INFO ] Added : 28 causal constraints over 6 iterations in 58 ms. Result :sat
[2021-05-13 09:09:59] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:09:59] [INFO ] [Real]Absence check using 7 positive place invariants in 4 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 4 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 3 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 19 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 13 ms returned sat
[2021-05-13 09:09:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2021-05-13 09:09:59] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 7 ms.
[2021-05-13 09:09:59] [INFO ] Added : 28 causal constraints over 6 iterations in 38 ms. Result :sat
[2021-05-13 09:09:59] [INFO ] [Real]Absence check using 7 positive place invariants in 10 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 3 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 13 ms returned sat
[2021-05-13 09:09:59] [INFO ] [Real]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-13 09:09:59] [INFO ] Deduced a trap composed of 7 places in 31 ms
[2021-05-13 09:09:59] [INFO ] Deduced a trap composed of 6 places in 15 ms
[2021-05-13 09:09:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 58 ms
[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 12 ms returned sat
[2021-05-13 09:09:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-13 09:09:59] [INFO ] Deduced a trap composed of 5 places in 13 ms
[2021-05-13 09:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2021-05-13 09:09:59] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 4 ms.
[2021-05-13 09:09:59] [INFO ] Added : 26 causal constraints over 6 iterations in 32 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 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 14 ms returned sat
[2021-05-13 09:09:59] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2021-05-13 09:09:59] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 5 ms.
[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 11 ms returned sat
[2021-05-13 09:09:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-13 09:09:59] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 4 ms.
[2021-05-13 09:09:59] [INFO ] Added : 27 causal constraints over 6 iterations in 30 ms. Result :sat
[2021-05-13 09:09:59] [INFO ] Deduced a trap composed of 8 places in 13 ms
[2021-05-13 09:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[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 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 10 ms returned sat
[2021-05-13 09:09:59] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2021-05-13 09:09:59] [INFO ] Deduced a trap composed of 6 places in 15 ms
[2021-05-13 09:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[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 3 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 9 ms returned sat
[2021-05-13 09:09:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2021-05-13 09:09:59] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 3 ms.
[2021-05-13 09:09:59] [INFO ] Added : 29 causal constraints over 6 iterations in 29 ms. Result :sat
[2021-05-13 09:09:59] [INFO ] Deduced a trap composed of 5 places in 12 ms
[2021-05-13 09:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2021-05-13 09:09:59] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned unsat
[2021-05-13 09:09:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 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 10 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 12 ms returned sat
[2021-05-13 09:09:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-13 09:10:00] [INFO ] Deduced a trap composed of 5 places in 12 ms
[2021-05-13 09:10:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-13 09:10:00] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 7 ms.
[2021-05-13 09:10:00] [INFO ] Added : 28 causal constraints over 6 iterations in 41 ms. Result :sat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 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 11 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 4 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 11 ms returned sat
[2021-05-13 09:10:00] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2021-05-13 09:10:00] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 6 ms.
[2021-05-13 09:10:00] [INFO ] Added : 27 causal constraints over 6 iterations in 30 ms. Result :sat
[2021-05-13 09:10:00] [INFO ] Deduced a trap composed of 5 places in 13 ms
[2021-05-13 09:10:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned unsat
[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 2 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 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 8 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 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 16 ms returned sat
[2021-05-13 09:10:00] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2021-05-13 09:10:00] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 2 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 14 ms returned sat
[2021-05-13 09:10:00] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-13 09:10:00] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 2 ms.
[2021-05-13 09:10:00] [INFO ] Added : 28 causal constraints over 7 iterations in 37 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 4 ms returned unsat
[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 3 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[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 2 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[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 2 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[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 2 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[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 2 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[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 3 ms returned unsat
[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 3 ms returned unsat
[2021-05-13 09:10:00] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Successfully simplified 66 atomic propositions for a total of 66 simplifications.
[2021-05-13 09:10:00] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-13 09:10:00] [INFO ] Flatten gal took : 30 ms
[2021-05-13 09:10:00] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-13 09:10:00] [INFO ] Flatten gal took : 9 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:10:00] [INFO ] Applying decomposition
[2021-05-13 09:10:00] [INFO ] Flatten gal took : 7 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/graph17115113565352746804.txt, -o, /tmp/graph17115113565352746804.bin, -w, /tmp/graph17115113565352746804.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/graph17115113565352746804.bin, -l, -1, -v, -w, /tmp/graph17115113565352746804.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 09:10:00] [INFO ] Decomposing Gal with order
[2021-05-13 09:10:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 09:10:00] [INFO ] Removed a total of 91 redundant transitions.
[2021-05-13 09:10:00] [INFO ] Flatten gal took : 35 ms
[2021-05-13 09:10:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 2 ms.
[2021-05-13 09:10:00] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 1 ms
[2021-05-13 09:10:00] [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 8 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,2874,0.102697,7500,2,2447,5,13185,6,0,163,13769,0


Converting to forward existential form...Done !
original formula: E(AF(((((((gu0.CHOIX_1+gu0.CHOIX_2)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu0.ATTENTE_A)<=(((((((((((((((((((((gu0.CHOIX_1+gu0.CHOIX_2)+gu0.NB_ATTENTE_B_0)+gu0.NB_ATTENTE_B_1)+gu0.NB_ATTENTE_B_2)+gu0.NB_ATTENTE_B_3)+gu0.NB_ATTENTE_B_4)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu0.SUR_PONT_B)+gu1.VIDANGE_1)+gu1.VIDANGE_2)+gu1.ROUTE_B)+gu2.SORTI_B)+gu2.ROUTE_A)+gu1.SORTI_A)+gu1.NB_ATTENTE_A_0)+gu1.NB_ATTENTE_A_1)+gu1.NB_ATTENTE_A_2)+gu1.NB_ATTENTE_A_3)+gu1.NB_ATTENTE_A_4))) U (EX((((((((((((((gu2.CAPACITE+gu2.SUR_PONT_A)+gu2.ATTENTE_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.ROUTE_A)+gu2.SORTI_B)+gu1.NB_ATTENTE_A_0)+gu1.NB_ATTENTE_A_1)+gu1.NB_ATTENTE_A_2)+gu1.NB_ATTENTE_A_3)+gu1.NB_ATTENTE_A_4)<=((((((gu1.NB_ATTENTE_A_0+gu1.NB_ATTENTE_A_1)+gu1.NB_ATTENTE_A_2)+gu1.NB_ATTENTE_A_3)+gu1.NB_ATTENTE_A_4)+gu2.CAPACITE)+gu1.SORTI_A))) * A(((((((((((((((((((gu2.SUR_PONT_A+gu0.CHOIX_1)+gu0.CHOIX_2)+gu1.NB_ATTENTE_A_0)+gu1.NB_ATTENTE_A_1)+gu1.NB_ATTENTE_A_2)+gu1.NB_ATTENTE_A_3)+gu1.NB_ATTENTE_A_4)+gu0.SUR_PONT_B)+gu1.ROUTE_B)+gu0.NB_ATTENTE_B_0)+gu0.NB_ATTENTE_B_1)+gu0.NB_ATTENTE_B_2)+gu0.NB_ATTENTE_B_3)+gu0.NB_ATTENTE_B_4)+gu2.SORTI_B)+gu0.ATTENTE_A)>1)&&(((((((((((((((gu0.SUR_PONT_B+gu2.ATTENTE_B)+gu1.SORTI_A)+gu2.ROUTE_A)+gu0.CHOIX_1)+gu0.CHOIX_2)+gu2.SORTI_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu0.NB_ATTENTE_B_0)+gu0.NB_ATTENTE_B_1)+gu0.NB_ATTENTE_B_2)+gu0.NB_ATTENTE_B_3)+gu0.NB_ATTENTE_B_4)>2)) U AG(((((((((((((((((((gu1.ROUTE_B+gu0.CONTROLEUR_1)+gu0.CONTROLEUR_2)+gu0.NB_ATTENTE_B_0)+gu0.NB_ATTENTE_B_1)+gu0.NB_ATTENTE_B_2)+gu0.NB_ATTENTE_B_3)+gu0.NB_ATTENTE_B_4)+gu1.VIDANGE_1)+gu1.VIDANGE_2)+gu0.ATTENTE_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.CAPACITE)+gu0.CHOIX_1)+gu0.CHOIX_2)+gu2.SORTI_B)<=(((((((((gu1.NB_ATTENTE_A_0+gu1.NB_ATTENTE_A_1)+gu1.NB_ATTENTE_A_2)+gu1.NB_ATTENTE_A_3)+gu1.NB_ATTENTE_A_4)+gu0.ATTENTE_A)+gu1.SORTI_A)+gu2.ROUTE_A)+gu0.CONTROLEUR_1)+gu0.CONTROLEUR_2))))))
=> equivalent forward existential formula: [(((FwdU(Init,!(EG(!(((((((gu0.CHOIX_1+gu0.CHOIX_2)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu0.ATTENTE_A)<=(((((((((((((((((((((gu0.CHOIX_1+gu0.CHOIX_2)+gu0.NB_ATTENTE_B_0)+gu0.NB_ATTENTE_B_1)+gu0.NB_ATTENTE_B_2)+gu0.NB_ATTENTE_B_3)+gu0.NB_ATTENTE_B_4)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu0.SUR_PONT_B)+gu1.VIDANGE_1)+gu1.VIDANGE_2)+gu1.ROUTE_B)+gu2.SORTI_B)+gu2.ROUTE_A)+gu1.SORTI_A)+gu1.NB_ATTENTE_A_0)+gu1.NB_ATTENTE_A_1)+gu1.NB_ATTENTE_A_2)+gu1.NB_ATTENTE_A_3)+gu1.NB_ATTENTE_A_4)))))) * EX((((((((((((((gu2.CAPACITE+gu2.SUR_PONT_A)+gu2.ATTENTE_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.ROUTE_A)+gu2.SORTI_B)+gu1.NB_ATTENTE_A_0)+gu1.NB_ATTENTE_A_1)+gu1.NB_ATTENTE_A_2)+gu1.NB_ATTENTE_A_3)+gu1.NB_ATTENTE_A_4)<=((((((gu1.NB_ATTENTE_A_0+gu1.NB_ATTENTE_A_1)+gu1.NB_ATTENTE_A_2)+gu1.NB_ATTENTE_A_3)+gu1.NB_ATTENTE_A_4)+gu2.CAPACITE)+gu1.SORTI_A)))) * !(EG(!(!(E(TRUE U !(((((((((((((((((((gu1.ROUTE_B+gu0.CONTROLEUR_1)+gu0.CONTROLEUR_2)+gu0.NB_ATTENTE_B_0)+gu0.NB_ATTENTE_B_1)+gu0.NB_ATTENTE_B_2)+gu0.NB_ATTENTE_B_3)+gu0.NB_ATTENTE_B_4)+gu1.VIDANGE_1)+gu1.VIDANGE_2)+gu0.ATTENTE_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.CAPACITE)+gu0.CHOIX_1)+gu0.CHOIX_2)+gu2.SORTI_B)<=(((((((((gu1.NB_ATTENTE_A_0+gu1.NB_ATTENTE_A_1)+gu1.NB_ATTENTE_A_2)+gu1.NB_ATTENTE_A_3)+gu1.NB_ATTENTE_A_4)+gu0.ATTENTE_A)+gu1.SORTI_A)+gu2.ROUTE_A)+gu0.CONTROLEUR_1)+gu0.CONTROLEUR_2))))))))) * !(E(!(!(E(TRUE U !(((((((((((((((((((gu1.ROUTE_B+gu0.CONTROLEUR_1)+gu0.CONTROLEUR_2)+gu0.NB_ATTENTE_B_0)+gu0.NB_ATTENTE_B_1)+gu0.NB_ATTENTE_B_2)+gu0.NB_ATTENTE_B_3)+gu0.NB_ATTENTE_B_4)+gu1.VIDANGE_1)+gu1.VIDANGE_2)+gu0.ATTENTE_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.CAPACITE)+gu0.CHOIX_1)+gu0.CHOIX_2)+gu2.SORTI_B)<=(((((((((gu1.NB_ATTENTE_A_0+gu1.NB_ATTENTE_A_1)+gu1.NB_ATTENTE_A_2)+gu1.NB_ATTENTE_A_3)+gu1.NB_ATTENTE_A_4)+gu0.ATTENTE_A)+gu1.SORTI_A)+gu2.ROUTE_A)+gu0.CONTROLEUR_1)+gu0.CONTROLEUR_2)))))) U (!(((((((((((((((((((gu2.SUR_PONT_A+gu0.CHOIX_1)+gu0.CHOIX_2)+gu1.NB_ATTENTE_A_0)+gu1.NB_ATTENTE_A_1)+gu1.NB_ATTENTE_A_2)+gu1.NB_ATTENTE_A_3)+gu1.NB_ATTENTE_A_4)+gu0.SUR_PONT_B)+gu1.ROUTE_B)+gu0.NB_ATTENTE_B_0)+gu0.NB_ATTENTE_B_1)+gu0.NB_ATTENTE_B_2)+gu0.NB_ATTENTE_B_3)+gu0.NB_ATTENTE_B_4)+gu2.SORTI_B)+gu0.ATTENTE_A)>1)&&(((((((((((((((gu0.SUR_PONT_B+gu2.ATTENTE_B)+gu1.SORTI_A)+gu2.ROUTE_A)+gu0.CHOIX_1)+gu0.CHOIX_2)+gu2.SORTI_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu0.NB_ATTENTE_B_0)+gu0.NB_ATTENTE_B_1)+gu0.NB_ATTENTE_B_2)+gu0.NB_ATTENTE_B_3)+gu0.NB_ATTENTE_B_4)>2))) * !(!(E(TRUE U !(((((((((((((((((((gu1.ROUTE_B+gu0.CONTROLEUR_1)+gu0.CONTROLEUR_2)+gu0.NB_ATTENTE_B_0)+gu0.NB_ATTENTE_B_1)+gu0.NB_ATTENTE_B_2)+gu0.NB_ATTENTE_B_3)+gu0.NB_ATTENTE_B_4)+gu1.VIDANGE_1)+gu1.VIDANGE_2)+gu0.ATTENTE_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.CAPACITE)+gu0.CHOIX_1)+gu0.CHOIX_2)+gu2.SORTI_B)<=(((((((((gu1.NB_ATTENTE_A_0+gu1.NB_ATTENTE_A_1)+gu1.NB_ATTENTE_A_2)+gu1.NB_ATTENTE_A_3)+gu1.NB_ATTENTE_A_4)+gu0.ATTENTE_A)+gu1.SORTI_A)+gu2.ROUTE_A)+gu0.CONTROLEUR_1)+gu0.CONTROLEUR_2))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions enregistrement_A_1, liberation_A, basculement_1, basculement_2, liberation_B, enregistrement_B_0, altern_cpt_2_1, altern_cpt_2_2, timeout_A_1_1_0_2, timeout_A_2_1_0_2, timeout_B_1_2_4_0, timeout_B_2_2_4_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/3/12/15
(forward)formula 0,0,1.33643,38636,1,0,224,128752,56,80,11091,135641,244
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(TRUE)
=> equivalent forward existential formula: [FwdG(Init,TRUE)] != FALSE
(forward)formula 1,1,1.40564,39788,1,0,224,132373,57,81,11112,142200,246
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AG(EF((A(((gu1.ROUTE_B+gu0.SUR_PONT_B)<=((((((((((((((gu2.SUR_PONT_A+gu0.SUR_PONT_B)+gu1.SORTI_A)+gu2.ROUTE_A)+gu1.VIDANGE_1)+gu1.VIDANGE_2)+gu0.CONTROLEUR_1)+gu0.CONTROLEUR_2)+gu1.NB_ATTENTE_A_0)+gu1.NB_ATTENTE_A_1)+gu1.NB_ATTENTE_A_2)+gu1.NB_ATTENTE_A_3)+gu1.NB_ATTENTE_A_4)+gu0.CHOIX_1)+gu0.CHOIX_2)) U ((((((((gu2.ATTENTE_B+gu2.SUR_PONT_A)+gu0.NB_ATTENTE_B_0)+gu0.NB_ATTENTE_B_1)+gu0.NB_ATTENTE_B_2)+gu0.NB_ATTENTE_B_3)+gu0.NB_ATTENTE_B_4)+gu0.ATTENTE_A)<=(((((((((((((gu2.CAPACITE+gu0.CHOIX_1)+gu0.CHOIX_2)+gu0.SUR_PONT_B)+gu1.VIDANGE_1)+gu1.VIDANGE_2)+gu2.SORTI_B)+gu2.ATTENTE_B)+gu1.SORTI_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu0.CONTROLEUR_1)+gu0.CONTROLEUR_2))) + !(EG(((((gu2.ROUTE_A+gu2.ATTENTE_B)+gu2.SUR_PONT_A)+gu0.ATTENTE_A)<=(((((gu2.ROUTE_A+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.SORTI_B)+gu2.CAPACITE))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!((E(!(((((((((gu2.ATTENTE_B+gu2.SUR_PONT_A)+gu0.NB_ATTENTE_B_0)+gu0.NB_ATTENTE_B_1)+gu0.NB_ATTENTE_B_2)+gu0.NB_ATTENTE_B_3)+gu0.NB_ATTENTE_B_4)+gu0.ATTENTE_A)<=(((((((((((((gu2.CAPACITE+gu0.CHOIX_1)+gu0.CHOIX_2)+gu0.SUR_PONT_B)+gu1.VIDANGE_1)+gu1.VIDANGE_2)+gu2.SORTI_B)+gu2.ATTENTE_B)+gu1.SORTI_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu0.CONTROLEUR_1)+gu0.CONTROLEUR_2))) U (!(((gu1.ROUTE_B+gu0.SUR_PONT_B)<=((((((((((((((gu2.SUR_PONT_A+gu0.SUR_PONT_B)+gu1.SORTI_A)+gu2.ROUTE_A)+gu1.VIDANGE_1)+gu1.VIDANGE_2)+gu0.CONTROLEUR_1)+gu0.CONTROLEUR_2)+gu1.NB_ATTENTE_A_0)+gu1.NB_ATTENTE_A_1)+gu1.NB_ATTENTE_A_2)+gu1.NB_ATTENTE_A_3)+gu1.NB_ATTENTE_A_4)+gu0.CHOIX_1)+gu0.CHOIX_2))) * !(((((((((gu2.ATTENTE_B+gu2.SUR_PONT_A)+gu0.NB_ATTENTE_B_0)+gu0.NB_ATTENTE_B_1)+gu0.NB_ATTENTE_B_2)+gu0.NB_ATTENTE_B_3)+gu0.NB_ATTENTE_B_4)+gu0.ATTENTE_A)<=(((((((((((((gu2.CAPACITE+gu0.CHOIX_1)+gu0.CHOIX_2)+gu0.SUR_PONT_B)+gu1.VIDANGE_1)+gu1.VIDANGE_2)+gu2.SORTI_B)+gu2.ATTENTE_B)+gu1.SORTI_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu0.CONTROLEUR_1)+gu0.CONTROLEUR_2))))) + EG(!(((((((((gu2.ATTENTE_B+gu2.SUR_PONT_A)+gu0.NB_ATTENTE_B_0)+gu0.NB_ATTENTE_B_1)+gu0.NB_ATTENTE_B_2)+gu0.NB_ATTENTE_B_3)+gu0.NB_ATTENTE_B_4)+gu0.ATTENTE_A)<=(((((((((((((gu2.CAPACITE+gu0.CHOIX_1)+gu0.CHOIX_2)+gu0.SUR_PONT_B)+gu1.VIDANGE_1)+gu1.VIDANGE_2)+gu2.SORTI_B)+gu2.ATTENTE_B)+gu1.SORTI_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu0.CONTROLEUR_1)+gu0.CONTROLEUR_2)))))) + !(EG(((((gu2.ROUTE_A+gu2.ATTENTE_B)+gu2.SUR_PONT_A)+gu0.ATTENTE_A)<=(((((gu2.ROUTE_A+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu2.SORTI_B)+gu2.CAPACITE))))))))] != FALSE
(forward)formula 2,0,2.3717,58004,1,0,452,188555,70,209,23998,217913,501
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(AG(AX(EF(((gu0.SUR_PONT_B+gu0.ATTENTE_A)>((((((((((((((gu0.CONTROLEUR_1+gu0.CONTROLEUR_2)+gu2.ATTENTE_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu0.NB_ATTENTE_B_0)+gu0.NB_ATTENTE_B_1)+gu0.NB_ATTENTE_B_2)+gu0.NB_ATTENTE_B_3)+gu0.NB_ATTENTE_B_4)+gu2.CAPACITE)+gu0.CHOIX_1)+gu0.CHOIX_2)+gu2.SUR_PONT_A))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EX(!(E(TRUE U ((gu0.SUR_PONT_B+gu0.ATTENTE_A)>((((((((((((((gu0.CONTROLEUR_1+gu0.CONTROLEUR_2)+gu2.ATTENTE_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu2.COMPTEUR_2)+gu0.NB_ATTENTE_B_0)+gu0.NB_ATTENTE_B_1)+gu0.NB_ATTENTE_B_2)+gu0.NB_ATTENTE_B_3)+gu0.NB_ATTENTE_B_4)+gu2.CAPACITE)+gu0.CHOIX_1)+gu0.CHOIX_2)+gu2.SUR_PONT_A))))))))))] != FALSE
(forward)formula 3,0,2.56945,60908,1,0,526,195743,74,250,26390,226110,597
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(EG(TRUE))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),TRUE)] != FALSE
(forward)formula 4,1,2.56993,60908,1,0,526,195743,74,250,26390,226110,599
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(((((((gu0.SUR_PONT_B+gu1.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_B_3)+gu1.ROUTE_B)+gu1.VIDANGE_2)>((((((((gu2.SORTI_B+gu1.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_B_0)+gu0.NB_ATTENTE_B_1)+gu2.COMPTEUR_0)+gu2.ROUTE_A)+gu1.NB_ATTENTE_A_2)+gu1.SORTI_A)+gu2.SUR_PONT_A))&&((((((gu0.CHOIX_2+gu0.NB_ATTENTE_B_1)+gu0.SUR_PONT_B)+gu0.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_A_1)<4)||(((gu0.CONTROLEUR_2+gu1.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_B_0)>(gu0.NB_ATTENTE_B_1+gu1.NB_ATTENTE_A_2)))))
=> equivalent forward existential formula: [FwdG(Init,!(((((((gu0.SUR_PONT_B+gu1.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_B_3)+gu1.ROUTE_B)+gu1.VIDANGE_2)>((((((((gu2.SORTI_B+gu1.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_B_0)+gu0.NB_ATTENTE_B_1)+gu2.COMPTEUR_0)+gu2.ROUTE_A)+gu1.NB_ATTENTE_A_2)+gu1.SORTI_A)+gu2.SUR_PONT_A))&&((((((gu0.CHOIX_2+gu0.NB_ATTENTE_B_1)+gu0.SUR_PONT_B)+gu0.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_A_1)<4)||(((gu0.CONTROLEUR_2+gu1.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_B_0)>(gu0.NB_ATTENTE_B_1+gu1.NB_ATTENTE_A_2))))))] = FALSE
Hit Full ! (commute/partial/dont) 1/0/14
(forward)formula 5,0,3.16367,70676,1,0,527,221328,82,252,28070,261994,602
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(E((AG((((((((((((gu0.CONTROLEUR_2+gu0.CONTROLEUR_1)+gu0.NB_ATTENTE_B_2)+gu1.VIDANGE_1)+gu0.CHOIX_1)+gu2.COMPTEUR_2)+gu2.ROUTE_A)+gu2.SORTI_B)+gu2.SUR_PONT_A)+gu1.NB_ATTENTE_A_3)<=(((((((gu2.SUR_PONT_A+gu1.NB_ATTENTE_A_1)+gu0.CHOIX_2)+gu2.ATTENTE_B)+gu0.CONTROLEUR_1)+gu0.ATTENTE_A)+gu0.NB_ATTENTE_B_0)+gu2.CAPACITE))||(((gu0.CONTROLEUR_1+gu0.CHOIX_1)+gu0.SUR_PONT_B)>=23))) * EG((((((((((gu2.ATTENTE_B+gu0.NB_ATTENTE_B_3)+gu1.VIDANGE_2)+gu1.SORTI_A)+gu2.CAPACITE)+gu1.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_B_4)+gu0.NB_ATTENTE_B_0)+gu2.COMPTEUR_1)<=4))) U (!(EG((((((gu2.COMPTEUR_1+gu1.NB_ATTENTE_A_3)+gu2.COMPTEUR_0)+gu1.SORTI_A)+gu1.VIDANGE_2)>(gu0.NB_ATTENTE_B_1+gu0.NB_ATTENTE_B_2)))) * ((EF((((((gu1.ROUTE_B+gu0.CONTROLEUR_2)+gu2.COMPTEUR_2)+gu0.CHOIX_1)+gu1.NB_ATTENTE_A_0)<=(((gu0.SUR_PONT_B+gu1.VIDANGE_1)+gu0.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_A_2))) + EG((((((gu1.NB_ATTENTE_A_4+gu1.SORTI_A)+gu2.COMPTEUR_0)+gu1.VIDANGE_1)+gu1.NB_ATTENTE_A_1)<=gu0.NB_ATTENTE_B_2))) + (gu2.ROUTE_A<=((((gu0.CONTROLEUR_2+gu1.SORTI_A)+gu2.ATTENTE_B)+gu0.SUR_PONT_B)+gu0.CHOIX_1))))) U AG(!(A(((((gu2.SUR_PONT_A+gu0.SUR_PONT_B)+gu1.NB_ATTENTE_A_2)+gu1.VIDANGE_2)<=((((gu1.NB_ATTENTE_A_0+gu0.ATTENTE_A)+gu0.NB_ATTENTE_B_3)+gu2.SUR_PONT_A)+gu0.NB_ATTENTE_B_4)) U (((gu0.NB_ATTENTE_B_3+gu0.CHOIX_1)+gu1.ROUTE_B)<=(gu2.COMPTEUR_2+gu1.NB_ATTENTE_A_4))))))
=> equivalent forward existential formula: [(FwdU(Init,E((!(E(TRUE U !((((((((((((gu0.CONTROLEUR_2+gu0.CONTROLEUR_1)+gu0.NB_ATTENTE_B_2)+gu1.VIDANGE_1)+gu0.CHOIX_1)+gu2.COMPTEUR_2)+gu2.ROUTE_A)+gu2.SORTI_B)+gu2.SUR_PONT_A)+gu1.NB_ATTENTE_A_3)<=(((((((gu2.SUR_PONT_A+gu1.NB_ATTENTE_A_1)+gu0.CHOIX_2)+gu2.ATTENTE_B)+gu0.CONTROLEUR_1)+gu0.ATTENTE_A)+gu0.NB_ATTENTE_B_0)+gu2.CAPACITE))||(((gu0.CONTROLEUR_1+gu0.CHOIX_1)+gu0.SUR_PONT_B)>=23))))) * EG((((((((((gu2.ATTENTE_B+gu0.NB_ATTENTE_B_3)+gu1.VIDANGE_2)+gu1.SORTI_A)+gu2.CAPACITE)+gu1.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_B_4)+gu0.NB_ATTENTE_B_0)+gu2.COMPTEUR_1)<=4))) U (!(EG((((((gu2.COMPTEUR_1+gu1.NB_ATTENTE_A_3)+gu2.COMPTEUR_0)+gu1.SORTI_A)+gu1.VIDANGE_2)>(gu0.NB_ATTENTE_B_1+gu0.NB_ATTENTE_B_2)))) * ((E(TRUE U (((((gu1.ROUTE_B+gu0.CONTROLEUR_2)+gu2.COMPTEUR_2)+gu0.CHOIX_1)+gu1.NB_ATTENTE_A_0)<=(((gu0.SUR_PONT_B+gu1.VIDANGE_1)+gu0.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_A_2))) + EG((((((gu1.NB_ATTENTE_A_4+gu1.SORTI_A)+gu2.COMPTEUR_0)+gu1.VIDANGE_1)+gu1.NB_ATTENTE_A_1)<=gu0.NB_ATTENTE_B_2))) + (gu2.ROUTE_A<=((((gu0.CONTROLEUR_2+gu1.SORTI_A)+gu2.ATTENTE_B)+gu0.SUR_PONT_B)+gu0.CHOIX_1)))))) * !(E(TRUE U !(!(!((E(!((((gu0.NB_ATTENTE_B_3+gu0.CHOIX_1)+gu1.ROUTE_B)<=(gu2.COMPTEUR_2+gu1.NB_ATTENTE_A_4))) U (!(((((gu2.SUR_PONT_A+gu0.SUR_PONT_B)+gu1.NB_ATTENTE_A_2)+gu1.VIDANGE_2)<=((((gu1.NB_ATTENTE_A_0+gu0.ATTENTE_A)+gu0.NB_ATTENTE_B_3)+gu2.SUR_PONT_A)+gu0.NB_ATTENTE_B_4))) * !((((gu0.NB_ATTENTE_B_3+gu0.CHOIX_1)+gu1.ROUTE_B)<=(gu2.COMPTEUR_2+gu1.NB_ATTENTE_A_4))))) + EG(!((((gu0.NB_ATTENTE_B_3+gu0.CHOIX_1)+gu1.ROUTE_B)<=(gu2.COMPTEUR_2+gu1.NB_ATTENTE_A_4)))))))))))] != FALSE
(forward)formula 6,0,3.2882,72788,1,0,629,236870,91,307,28208,280433,715
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(EX((((((((gu2.SORTI_B+gu0.NB_ATTENTE_B_4)+gu2.CAPACITE)+gu0.NB_ATTENTE_B_1)+gu2.ROUTE_A)+gu1.NB_ATTENTE_A_2)+gu1.VIDANGE_2)<=8)))
=> equivalent forward existential formula: [FwdG(Init,EX((((((((gu2.SORTI_B+gu0.NB_ATTENTE_B_4)+gu2.CAPACITE)+gu0.NB_ATTENTE_B_1)+gu2.ROUTE_A)+gu1.NB_ATTENTE_A_2)+gu1.VIDANGE_2)<=8)))] != FALSE
dead was empty
(forward)formula 7,0,3.36505,74372,1,0,634,243701,92,310,28451,286762,720
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620897004776

--------------------
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-V04P05N02"
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-V04P05N02, 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-162038167700041"
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 [ "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 ;