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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K 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.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 63K 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 BusinessProcesses-PT-03-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1620904315574

[2021-05-13 11:11:57] [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 11:11:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 11:11:57] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2021-05-13 11:11:57] [INFO ] Transformed 274 places.
[2021-05-13 11:11:57] [INFO ] Transformed 237 transitions.
[2021-05-13 11:11:57] [INFO ] Found NUPN structural information;
[2021-05-13 11:11:57] [INFO ] Parsed PT model containing 274 places and 237 transitions in 109 ms.
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 39 ms.
Incomplete random walk after 100000 steps, including 1187 resets, run finished after 1590 ms. (steps per millisecond=62 ) properties seen :[0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1]
// Phase 1: matrix 236 rows 273 cols
[2021-05-13 11:11:58] [INFO ] Computed 43 place invariants in 21 ms
[2021-05-13 11:11:59] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned unsat
[2021-05-13 11:11:59] [INFO ] [Real]Absence check using 31 positive place invariants in 23 ms returned sat
[2021-05-13 11:11:59] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 8 ms returned sat
[2021-05-13 11:11:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:11:59] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2021-05-13 11:11:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:11:59] [INFO ] [Nat]Absence check using 31 positive place invariants in 44 ms returned sat
[2021-05-13 11:11:59] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-13 11:11:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:11:59] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 9 places in 129 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 10 places in 84 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 12 places in 76 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 12 places in 74 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 23 places in 73 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 14 places in 67 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 27 places in 65 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 34 places in 58 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 71 places in 59 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 28 places in 59 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 43 places in 61 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 72 places in 64 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 15 places in 61 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 75 places in 64 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 69 places in 61 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 71 places in 63 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 68 places in 64 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 69 places in 61 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 43 places in 74 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 78 places in 58 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 40 places in 63 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 39 places in 58 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 73 places in 56 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 79 places in 58 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 8 places in 60 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 25 places in 70 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 38 places in 59 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 67 places in 63 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 32 places in 58 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 79 places in 53 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 48 places in 33 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 20 places in 19 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 19 places in 17 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 20 places in 53 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 73 places in 57 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 20 places in 16 ms
[2021-05-13 11:12:02] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 2574 ms
[2021-05-13 11:12:02] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 16 ms.
[2021-05-13 11:12:03] [INFO ] Added : 166 causal constraints over 34 iterations in 696 ms. Result :sat
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 73 places in 80 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 79 places in 80 ms
[2021-05-13 11:12:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2021-05-13 11:12:03] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned unsat
[2021-05-13 11:12:03] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2021-05-13 11:12:03] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-13 11:12:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:03] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2021-05-13 11:12:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:03] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:03] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned unsat
[2021-05-13 11:12:03] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:03] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:03] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned unsat
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using 31 positive place invariants in 26 ms returned unsat
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned unsat
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-13 11:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 8 places in 72 ms
[2021-05-13 11:12:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 81 ms
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned unsat
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using 31 positive place invariants in 23 ms returned sat
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-13 11:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-13 11:12:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:04] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned unsat
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned unsat
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned unsat
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned unsat
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 10 ms returned sat
[2021-05-13 11:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-13 11:12:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:05] [INFO ] [Nat]Absence check using 31 positive place invariants in 30 ms returned sat
[2021-05-13 11:12:05] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-13 11:12:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:05] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 20 places in 150 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 68 places in 101 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 11 places in 98 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 68 places in 102 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 11 places in 198 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 8 places in 115 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 16 places in 89 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 25 places in 77 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 72 places in 65 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 28 places in 65 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 34 places in 81 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 73 places in 61 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 20 places in 70 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 70 places in 77 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 28 places in 76 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 75 places in 74 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 19 places in 77 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 30 places in 76 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 75 places in 80 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 77 places in 72 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 72 places in 87 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 71 places in 73 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 30 places in 67 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 75 places in 59 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 73 places in 58 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 71 places in 66 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 24 places in 83 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 33 places in 65 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 31 places in 76 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 37 places in 74 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 73 places in 66 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 71 places in 62 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 74 places in 63 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 77 places in 65 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 76 places in 61 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 74 places in 61 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 78 places in 59 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 77 places in 100 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 77 places in 74 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 80 places in 64 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 70 places in 61 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 75 places in 73 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 72 places in 97 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 77 places in 97 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 78 places in 77 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 72 places in 73 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 68 places in 74 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 27 places in 98 ms
[2021-05-13 11:12:10] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 4483 ms
[2021-05-13 11:12:10] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 19 ms.
[2021-05-13 11:12:10] [INFO ] Added : 107 causal constraints over 22 iterations in 515 ms. Result :sat
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 73 places in 103 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 71 places in 80 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 75 places in 91 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 69 places in 96 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 63 places in 73 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 67 places in 88 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 70 places in 85 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 66 places in 71 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 71 places in 64 ms
[2021-05-13 11:12:11] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1076 ms
[2021-05-13 11:12:11] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:11] [INFO ] [Real]Absence check using 31 positive place invariants in 27 ms returned sat
[2021-05-13 11:12:11] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2021-05-13 11:12:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:12] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2021-05-13 11:12:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:12] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:12] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:12] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:12] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:12] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:12] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:12] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2021-05-13 11:12:12] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-13 11:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:12] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2021-05-13 11:12:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:12] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:12] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:12] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:12] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:12] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 31 positive place invariants in 45 ms returned sat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 15 ms returned sat
[2021-05-13 11:12:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2021-05-13 11:12:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:13] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 31 positive place invariants in 26 ms returned unsat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:14] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:14] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:14] [INFO ] [Real]Absence check using 31 positive place invariants in 26 ms returned sat
[2021-05-13 11:12:14] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2021-05-13 11:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:14] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2021-05-13 11:12:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:14] [INFO ] [Nat]Absence check using 31 positive place invariants in 33 ms returned sat
[2021-05-13 11:12:14] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-13 11:12:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:14] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 13 places in 125 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 8 places in 91 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 13 places in 120 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 20 places in 79 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 14 places in 109 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 21 places in 105 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 43 places in 79 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 15 places in 105 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 14 places in 88 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 37 places in 75 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 20 places in 62 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 28 places in 72 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 43 places in 61 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 36 places in 77 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 20 places in 47 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 23 places in 52 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 20 places in 56 ms
[2021-05-13 11:12:16] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1592 ms
[2021-05-13 11:12:16] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 11 ms.
[2021-05-13 11:12:17] [INFO ] Added : 172 causal constraints over 35 iterations in 708 ms. Result :sat
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 73 places in 95 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 75 places in 95 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 74 places in 75 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 71 places in 121 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 74 places in 81 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 73 places in 83 ms
[2021-05-13 11:12:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 754 ms
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:19] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:19] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:19] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:19] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2021-05-13 11:12:19] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2021-05-13 11:12:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:19] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2021-05-13 11:12:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:19] [INFO ] [Nat]Absence check using 31 positive place invariants in 90 ms returned sat
[2021-05-13 11:12:19] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-13 11:12:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:19] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 8 places in 56 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 15 places in 87 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 8 places in 85 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 19 places in 82 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 22 places in 64 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 12 places in 58 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 12 places in 56 ms
[2021-05-13 11:12:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 565 ms
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-13 11:12:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2021-05-13 11:12:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:20] [INFO ] [Nat]Absence check using 31 positive place invariants in 77 ms returned sat
[2021-05-13 11:12:20] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-13 11:12:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:21] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 14 places in 88 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 8 places in 107 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 14 places in 76 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 11 places in 79 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 24 places in 73 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 76 places in 80 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 70 places in 76 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 70 places in 72 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 83 places in 71 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 76 places in 69 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 72 places in 68 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 78 places in 98 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 81 places in 68 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 75 places in 65 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 69 places in 63 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 75 places in 61 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 76 places in 58 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 75 places in 61 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 74 places in 58 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 70 places in 58 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 70 places in 62 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 68 places in 107 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 70 places in 71 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 76 places in 68 ms
[2021-05-13 11:12:23] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2077 ms
[2021-05-13 11:12:23] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 10 ms.
[2021-05-13 11:12:23] [INFO ] Added : 168 causal constraints over 35 iterations in 673 ms. Result :sat
[2021-05-13 11:12:23] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:23] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:24] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:24] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:24] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned unsat
Successfully simplified 68 atomic propositions for a total of 68 simplifications.
[2021-05-13 11:12:24] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-13 11:12:24] [INFO ] Flatten gal took : 61 ms
[2021-05-13 11:12:24] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-13 11:12:24] [INFO ] Flatten gal took : 21 ms
FORMULA BusinessProcesses-PT-03-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 11:12:24] [INFO ] Applying decomposition
[2021-05-13 11:12:24] [INFO ] Flatten gal took : 17 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/graph18050158908999859020.txt, -o, /tmp/graph18050158908999859020.bin, -w, /tmp/graph18050158908999859020.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/graph18050158908999859020.bin, -l, -1, -v, -w, /tmp/graph18050158908999859020.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 11:12:24] [INFO ] Decomposing Gal with order
[2021-05-13 11:12:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:12:24] [INFO ] Removed a total of 49 redundant transitions.
[2021-05-13 11:12:24] [INFO ] Flatten gal took : 69 ms
[2021-05-13 11:12:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 13 ms.
[2021-05-13 11:12:24] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 9 ms
[2021-05-13 11:12:24] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 1 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,1.4794e+13,9.69038,299388,2,248264,5,1.04922e+06,6,0,1324,478080,0


Converting to forward existential form...Done !
original formula: (AG(EX(EF(((((((((((gi5.gu50.p238+gi5.gu20.p154)+gi5.gu50.p255)+gi6.gu45.p209)+gi4.gu27.p26)+gi5.gu50.p13)+gi5.gu50.p98)+gi5.gu50.p115)+gi5.gu50.p119)+gi5.gu50.p217)<=1)))) * EF(AX(FALSE)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(E(TRUE U ((((((((((gi5.gu50.p238+gi5.gu20.p154)+gi5.gu50.p255)+gi6.gu45.p209)+gi4.gu27.p26)+gi5.gu50.p13)+gi5.gu50.p98)+gi5.gu50.p115)+gi5.gu50.p119)+gi5.gu50.p217)<=1)))))] = FALSE * [(Init * !(E(TRUE U !(EX(!(FALSE))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions gi0.gu47.t71, gi0.gu56.t49, gi0.gu56.t130, gi0.gu56.t131, gi0.gu56.t136, gi0.gu56.t144, gi0.t72, gi1.gi0.gi0.gu6.t182, gi1.gi0.gi0.gu7.t180, gi1.gi0.gi0.gu7.t184, gi1.gi0.gi0.t186, gi1.gi0.gi1.gu26.t124, gi1.gi0.gi1.t123, gi1.gi0.gi2.gu11.t162, gi1.gi0.gi2.gu14.t148, gi1.gi0.gi2.gu25.t127, gi1.gi0.gi2.gu25.t128, gi1.gi0.gi2.gu32.t115, gi1.gi0.gi2.gu35.t107, gi1.gi0.gi2.gu35.t108, gi1.gi0.gi2.gu40.t96, gi1.gi0.gi2.gu44.t84, gi1.gi0.gi2.gu48.t1, gi1.gi0.gi2.gu48.t6, gi1.gi0.gi2.gu48.t18, gi1.gi0.gi2.gu48.t47, gi1.gi0.gi2.gu48.t55, gi1.gi0.gi2.t51, gi1.gi0.gi2.t36, gi1.gi0.gi2.t33, gi1.gi0.gi2.t23, gi1.gi0.gi2.t21, gi1.gi0.gi2.t12, gi1.gi0.gi2.t3, gi1.gi0.gi3.gu52.t44, gi1.gi0.gi3.t38, gi1.gi1.gi1.gu31.t120, gi1.gi1.gi1.t119, gi1.gi1.gi2.gu36.t104, gi1.gi1.gi2.t103, gi2.gu38.t99, gi2.gu38.t100, gi2.gu46.t76, gi2.t75, gi3.gu13.t152, gi3.gu42.t91, gi4.gu27.t80, gi4.t172, gi5.gu17.t140, gi5.gu41.t193, gi5.t166, gi5.t163, gi5.t137, gi6.gu2.t178, gi6.gu3.t195, gi6.t191, t9, t28, t42, t53, t65, t67, t79, t83, t87, t88, t92, t95, t111, t112, t116, t141, t156, t157, t160, t168, t169, t179, t187, t190, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/150/80/230
(forward)formula 0,0,848.712,6175640,1,0,534,4.93236e+07,14,233,4510,2.1834e+07,63
FORMULA BusinessProcesses-PT-03-CTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2021-05-13 11:32:34] [INFO ] Applying decomposition
[2021-05-13 11:32:34] [INFO ] Flatten gal took : 13 ms
[2021-05-13 11:32:34] [INFO ] Decomposing Gal with order
[2021-05-13 11:32:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:32:34] [INFO ] Flatten gal took : 15 ms
[2021-05-13 11:32:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-13 11:32:34] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 10 ms
[2021-05-13 11:32:34] [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 7 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,1.4794e+13,4.85984,113972,2,78451,5,274505,6,0,1324,506243,0


Converting to forward existential form...Done !
original formula: EG(E(((!(E(((((((gi0.gi1.gi0.gu58.p191+gi0.gi1.gi0.gi0.gi0.gi0.gu55.p173)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu52.p157)+gu60.p263)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gu65.p108)+gu60.p225)<=((gi0.gi1.gu59.p193+gu60.p205)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu52.p157)) U ((((gi0.gi0.gi0.gi0.gi0.gu85.p5+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu19.p49)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu19.p44)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gu54.p169)<=((((gu60.p235+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gu53.p162)+gi0.gi0.gu28.p100)+gi0.gi1.gi0.gi0.gi0.gi0.gu55.p176)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu15.p18)))) * !(EG(((((((((gi0.gi1.gi0.gi0.gu57.p182+gu60.p225)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu16.p22)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu17.p32)+gu60.p242)+gi0.gi1.gi0.gi0.gu57.p185)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu22.p64)+gu60.p206)<=((((gu60.p257+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu44.p120)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu44.p117)+gu60.p201)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu22.p68))))) * !(EX((((((((((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu20.p50+gu60.p241)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu22.p65)+gu60.p252)+gu60.p255)+gu60.p198)+gi0.gi0.gu28.p101)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu19.p43)+gu60.p265)<=(gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu19.p44+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu47.p134))))) U AG(EX(((gu60.p263+gu60.p270)<=(((((gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu48.p138+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu16.p27)+gu60.p252)+gi0.gi0.gu82.p2)+gu60.p199)+gi0.gi1.gi0.gi0.gu57.p185))))))
=> equivalent forward existential formula: [FwdG(Init,E(((!(E(((((((gi0.gi1.gi0.gu58.p191+gi0.gi1.gi0.gi0.gi0.gi0.gu55.p173)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu52.p157)+gu60.p263)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gu65.p108)+gu60.p225)<=((gi0.gi1.gu59.p193+gu60.p205)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu52.p157)) U ((((gi0.gi0.gi0.gi0.gi0.gu85.p5+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu19.p49)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu19.p44)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gu54.p169)<=((((gu60.p235+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gu53.p162)+gi0.gi0.gu28.p100)+gi0.gi1.gi0.gi0.gi0.gi0.gu55.p176)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu15.p18)))) * !(EG(((((((((gi0.gi1.gi0.gi0.gu57.p182+gu60.p225)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu16.p22)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu17.p32)+gu60.p242)+gi0.gi1.gi0.gi0.gu57.p185)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu22.p64)+gu60.p206)<=((((gu60.p257+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu44.p120)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu44.p117)+gu60.p201)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu22.p68))))) * !(EX((((((((((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu20.p50+gu60.p241)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu22.p65)+gu60.p252)+gu60.p255)+gu60.p198)+gi0.gi0.gu28.p101)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu19.p43)+gu60.p265)<=(gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu19.p44+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu47.p134))))) U !(E(TRUE U !(EX(((gu60.p263+gu60.p270)<=(((((gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu48.p138+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu16.p27)+gu60.p252)+gi0.gi0.gu82.p2)+gu60.p199)+gi0.gi1.gi0.gi0.gu57.p185))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions gu60.t1, gu60.t3, gu60.t6, gu60.t9, gu60.t12, gu60.t15, gu60.t18, gu60.t21, gu60.t23, gu60.t26, gu60.t28, gu60.t31, gu60.t33, gu60.t36, gu60.t38, gu60.t40, gu60.t42, gu60.t44, gu60.t47, gu60.t49, gu60.t51, gu60.t53, gu60.t55, gi0.gi0.gi0.gu27.t136, gi0.gi0.gi0.gi0.gu26.t140, gi0.gi0.gi0.gi0.gi0.gu25.t144, gi0.gi0.gi0.gi0.gi0.gi0.gu24.t148, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu23.t152, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu22.t156, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu21.t160, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu21.t162, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu20.t166, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu20.t168, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu19.t172, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu19.t174, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu18.t178, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu17.t180, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu17.t182, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu17.t184, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu17.t186, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu15.t191, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu15.t193, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu15.t195, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu16.t190, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.t187, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.t179, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.t169, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.t163, gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.t157, gi0.gi0.gi0.gi0.gi0.t141, gi0.gi0.gi0.gi0.t137, gi0.gi1.gu59.t71, gi0.gi1.gu59.t72, gi0.gi1.gi0.gu58.t75, gi0.gi1.gi0.gu58.t76, gi0.gi1.gi0.gi0.gu57.t79, gi0.gi1.gi0.gi0.gu57.t80, gi0.gi1.gi0.gi0.gi0.gu56.t83, gi0.gi1.gi0.gi0.gi0.gu56.t84, gi0.gi1.gi0.gi0.gi0.gi0.gu55.t87, gi0.gi1.gi0.gi0.gi0.gi0.gu55.t88, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gu54.t91, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gu54.t92, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gu53.t95, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gu53.t96, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu52.t99, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu52.t100, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu51.t103, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu51.t104, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu50.t107, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu50.t108, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu49.t111, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu49.t112, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu48.t115, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu48.t116, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu47.t119, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu47.t120, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu46.t123, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu46.t124, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu44.t130, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu44.t131, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu45.t127, gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu45.t128, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/153/83/236
(forward)formula 0,0,590.064,3896836,1,0,609,2.02402e+07,21,241,4342,1.96356e+07,65
FORMULA BusinessProcesses-PT-03-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(!(EX(TRUE)))
=> equivalent forward existential formula: [(EY(EY(Init)) * TRUE)] = FALSE
(forward)formula 1,0,590.092,3896836,1,0,609,2.02402e+07,21,241,4576,1.96356e+07,67
FORMULA BusinessProcesses-PT-03-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 2,0,590.094,3896836,1,0,609,2.02402e+07,21,241,4576,1.96356e+07,67
FORMULA BusinessProcesses-PT-03-CTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(EF(EX(TRUE)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EX(TRUE))))] = FALSE
(forward)formula 3,0,591.521,3896836,1,0,609,2.02402e+07,21,241,4707,1.96356e+07,75
FORMULA BusinessProcesses-PT-03-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AG(EF((((((((((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu20.p52+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu49.p144)+gi0.gi0.gi0.gi0.gi0.gu25.p84)+gi0.gi0.gi0.gi0.gi0.gu25.p83)+gu60.p242)+gu60.p241)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu17.p32)+gi0.gi1.gu59.p193)<=(gu60.p214+gi0.gi0.gi0.gu27.p95))||((((gu60.p225+gi0.gi0.gu28.p101)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu87.p7)+gi0.gi1.gi0.gi0.gi0.gu56.p181)<=(((((((gu60.p221+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu23.p75)+gu60.p266)+gu60.p210)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gu53.p162)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu52.p159)+gi0.gi1.gi0.gi0.gu57.p182)+gi0.gi0.gi0.gi0.gu26.p91))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U (((((((((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu20.p52+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu49.p144)+gi0.gi0.gi0.gi0.gi0.gu25.p84)+gi0.gi0.gi0.gi0.gi0.gu25.p83)+gu60.p242)+gu60.p241)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu17.p32)+gi0.gi1.gu59.p193)<=(gu60.p214+gi0.gi0.gi0.gu27.p95))||((((gu60.p225+gi0.gi0.gu28.p101)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu87.p7)+gi0.gi1.gi0.gi0.gi0.gu56.p181)<=(((((((gu60.p221+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu23.p75)+gu60.p266)+gu60.p210)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gu53.p162)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu52.p159)+gi0.gi1.gi0.gi0.gu57.p182)+gi0.gi0.gi0.gi0.gu26.p91))))))))] != FALSE
(forward)formula 4,1,593.276,3896836,1,0,609,2.02402e+07,22,241,4864,1.96356e+07,81
FORMULA BusinessProcesses-PT-03-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(EF(AX(FALSE))) + (EG((EF((((((((((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu15.p17+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu22.p67)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu18.p38)+gu60.p206)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu89.p9)+gu60.p222)+gu60.p235)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu48.p137)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu15.p19)<=(((((gu60.p268+gi0.gi1.gi0.gi0.gu57.p186)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu68.p109)+gu60.p223)+gi0.gi1.gu90.p102)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gu53.p166))) + ((((((((((gi0.gi0.gu28.p99+gi0.gi0.gi0.gu83.p3)+gi0.gi0.gi0.gi0.gi0.gu25.p85)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu18.p41)+gu60.p205)+gu60.p265)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu45.p124)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu51.p154)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu48.p139)+gi0.gi1.gi0.gi0.gi0.gi0.gu55.p176)>=1))) * !(EF((((((((((((gi0.gi1.gi0.gi0.gi0.gi0.gi0.gu54.p167+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu46.p129)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu18.p41)+gu60.p254)+gi0.gi0.gu82.p2)+gi0.gu81.p1)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu49.p144)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu16.p23)+gu60.p224)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu50.p149)>(((((gu60.p202+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu16.p26)+gi0.gi1.gi0.gi0.gu57.p185)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu19.p43)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu21.p60)+gu60.p243))&&(((gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu48.p139+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu16.p22)+gu60.p206)>((((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu23.p73+gu60.p231)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu49.p143)+gu60.p202)+gu60.p262)))))))
=> equivalent forward existential formula: ([((Init * !(!(E(TRUE U !(EX(!(FALSE))))))) * !(EG((E(TRUE U (((((((((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu15.p17+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu22.p67)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu18.p38)+gu60.p206)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu89.p9)+gu60.p222)+gu60.p235)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu48.p137)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu15.p19)<=(((((gu60.p268+gi0.gi1.gi0.gi0.gu57.p186)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu68.p109)+gu60.p223)+gi0.gi1.gu90.p102)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gu53.p166))) + ((((((((((gi0.gi0.gu28.p99+gi0.gi0.gi0.gu83.p3)+gi0.gi0.gi0.gi0.gi0.gu25.p85)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu18.p41)+gu60.p205)+gu60.p265)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu45.p124)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu51.p154)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu48.p139)+gi0.gi1.gi0.gi0.gi0.gi0.gu55.p176)>=1)))))] = FALSE * [(FwdU((Init * !(!(E(TRUE U !(EX(!(FALSE))))))),TRUE) * (((((((((((gi0.gi1.gi0.gi0.gi0.gi0.gi0.gu54.p167+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu46.p129)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu18.p41)+gu60.p254)+gi0.gi0.gu82.p2)+gi0.gu81.p1)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu49.p144)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu16.p23)+gu60.p224)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu50.p149)>(((((gu60.p202+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu16.p26)+gi0.gi1.gi0.gi0.gu57.p185)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu19.p43)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu21.p60)+gu60.p243))&&(((gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu48.p139+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu16.p22)+gu60.p206)>((((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu23.p73+gu60.p231)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu49.p143)+gu60.p202)+gu60.p262))))] = FALSE)
(forward)formula 5,0,596.311,3896836,1,0,609,2.02402e+07,27,241,5560,1.96356e+07,84
FORMULA BusinessProcesses-PT-03-CTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((AF((((((((gi0.gi1.gi0.gi0.gi0.gi0.gu55.p175+gu60.p254)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu50.p147)+gu60.p239)+gu60.p241)+gu60.p225)+gu60.p262)>gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu88.p8)) * EG(!(AX((((((((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu15.p21+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu22.p67)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu20.p51)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gu54.p168)+gi0.gi1.gu59.p194)+gi0.gu81.p1)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu45.p122)<=(((((((((gi0.gi1.gi0.gu58.p187+gu60.p235)+gu60.p209)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu49.p145)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu22.p65)+gu60.p206)+gi0.gi1.gi0.gi0.gu57.p184)+gu60.p263)+gu60.p236)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu20.p51)))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EG(!((((((((gi0.gi1.gi0.gi0.gi0.gi0.gu55.p175+gu60.p254)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu50.p147)+gu60.p239)+gu60.p241)+gu60.p225)+gu60.p262)>gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu88.p8))))),!(!(EX(!((((((((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu15.p21+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu22.p67)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu20.p51)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gu54.p168)+gi0.gi1.gu59.p194)+gi0.gu81.p1)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu45.p122)<=(((((((((gi0.gi1.gi0.gu58.p187+gu60.p235)+gu60.p209)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu49.p145)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu22.p65)+gu60.p206)+gi0.gi1.gi0.gi0.gu57.p184)+gu60.p263)+gu60.p236)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu20.p51)))))))] != FALSE
(forward)formula 6,1,727.19,4484512,1,0,677,2.3728e+07,13,315,3753,2.11763e+07,36
FORMULA BusinessProcesses-PT-03-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1620906283843

--------------------
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="BusinessProcesses-PT-03"
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 BusinessProcesses-PT-03, 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-162038167700085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-03.tgz
mv BusinessProcesses-PT-03 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 ;