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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.1K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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.7K 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 85K 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-05-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1620904317663

[2021-05-13 11:11:59] [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:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 11:11:59] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2021-05-13 11:11:59] [INFO ] Transformed 368 places.
[2021-05-13 11:11:59] [INFO ] Transformed 319 transitions.
[2021-05-13 11:11:59] [INFO ] Found NUPN structural information;
[2021-05-13 11:11:59] [INFO ] Parsed PT model containing 368 places and 319 transitions in 101 ms.
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 40 ms.
Incomplete random walk after 100000 steps, including 948 resets, run finished after 1111 ms. (steps per millisecond=90 ) properties seen :[1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1]
// Phase 1: matrix 318 rows 367 cols
[2021-05-13 11:12:00] [INFO ] Computed 57 place invariants in 31 ms
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using 41 positive place invariants in 28 ms returned unsat
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using 41 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using 41 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using 41 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using 41 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using 41 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using 41 positive place invariants in 25 ms returned sat
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2021-05-13 11:12:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2021-05-13 11:12:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:01] [INFO ] [Nat]Absence check using 41 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using 41 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:02] [INFO ] [Real]Absence check using 41 positive place invariants in 23 ms returned sat
[2021-05-13 11:12:02] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-13 11:12:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:02] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 8 places in 151 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 20 places in 132 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 29 places in 128 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 91 places in 149 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 92 places in 106 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 90 places in 125 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 90 places in 128 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 88 places in 97 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 93 places in 77 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 92 places in 80 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 91 places in 78 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 91 places in 138 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 86 places in 83 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 93 places in 97 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 95 places in 96 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 89 places in 81 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 89 places in 133 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 91 places in 117 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 89 places in 129 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 95 places in 95 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 26 places in 153 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 89 places in 107 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 88 places in 99 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 93 places in 87 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 88 places in 89 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 87 places in 91 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 88 places in 137 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 84 places in 89 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 90 places in 119 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 91 places in 104 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 88 places in 97 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 90 places in 114 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 92 places in 86 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 91 places in 90 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 87 places in 86 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 88 places in 184 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 106 places in 385 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 92 places in 71 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 94 places in 242 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 88 places in 207 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 90 places in 180 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 92 places in 136 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 85 places in 416 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 86 places in 158 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 85 places in 227 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 83 places in 114 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 89 places in 128 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 85 places in 173 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 90 places in 305 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 90 places in 172 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 88 places in 170 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 96 places in 127 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 100 places in 99 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 97 places in 93 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 93 places in 163 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 89 places in 151 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 87 places in 113 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 90 places in 95 ms
[2021-05-13 11:12:11] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 9054 ms
[2021-05-13 11:12:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:11] [INFO ] [Nat]Absence check using 41 positive place invariants in 40 ms returned sat
[2021-05-13 11:12:11] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 7 ms returned sat
[2021-05-13 11:12:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:11] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 21 places in 196 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 25 places in 96 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 8 places in 123 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 92 places in 120 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 19 places in 106 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 97 places in 107 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 94 places in 101 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 89 places in 104 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 97 places in 104 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 96 places in 107 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 94 places in 87 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 96 places in 98 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 92 places in 100 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 92 places in 102 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 89 places in 151 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 99 places in 95 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 102 places in 95 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 89 places in 97 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 90 places in 88 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 91 places in 94 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 90 places in 92 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 88 places in 99 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 99 places in 88 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 93 places in 93 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 102 places in 104 ms
[2021-05-13 11:12:14] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3116 ms
[2021-05-13 11:12:14] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 38 ms.
[2021-05-13 11:12:16] [INFO ] Added : 208 causal constraints over 42 iterations in 1333 ms. Result :sat
[2021-05-13 11:12:16] [INFO ] [Real]Absence check using 41 positive place invariants in 48 ms returned unsat
[2021-05-13 11:12:16] [INFO ] [Real]Absence check using 41 positive place invariants in 22 ms returned unsat
[2021-05-13 11:12:16] [INFO ] [Real]Absence check using 41 positive place invariants in 27 ms returned unsat
[2021-05-13 11:12:16] [INFO ] [Real]Absence check using 41 positive place invariants in 34 ms returned sat
[2021-05-13 11:12:16] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 8 ms returned sat
[2021-05-13 11:12:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2021-05-13 11:12:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:17] [INFO ] [Nat]Absence check using 41 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 41 positive place invariants in 24 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 41 positive place invariants in 39 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 41 positive place invariants in 10 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 41 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 41 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 41 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 41 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 41 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 41 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 41 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 41 positive place invariants in 32 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 41 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 41 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 41 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 41 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:19] [INFO ] [Real]Absence check using 41 positive place invariants in 36 ms returned sat
[2021-05-13 11:12:19] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 8 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 366 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 41 positive place invariants in 17 ms returned unsat
[2021-05-13 11:12:19] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned unsat
[2021-05-13 11:12:19] [INFO ] [Real]Absence check using 41 positive place invariants in 40 ms returned sat
[2021-05-13 11:12:19] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 7 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 319 ms returned sat
[2021-05-13 11:12:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:20] [INFO ] [Nat]Absence check using 41 positive place invariants in 21 ms returned unsat
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using 41 positive place invariants in 26 ms returned unsat
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using 41 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using 41 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using 41 positive place invariants in 25 ms returned unsat
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using 41 positive place invariants in 20 ms returned unsat
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using 41 positive place invariants in 35 ms returned sat
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 8 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 374 ms returned sat
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 11 places in 164 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 10 places in 324 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 11 places in 145 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 20 places in 124 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 20 places in 137 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 19 places in 125 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 24 places in 113 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 13 places in 125 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 21 places in 117 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 30 places in 109 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 19 places in 110 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 30 places in 73 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 25 places in 107 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 84 places in 89 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 19 places in 86 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 28 places in 84 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 91 places in 105 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 93 places in 80 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 98 places in 111 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 93 places in 104 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 87 places in 83 ms
[2021-05-13 11:12:23] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2825 ms
[2021-05-13 11:12:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:23] [INFO ] [Nat]Absence check using 41 positive place invariants in 35 ms returned sat
[2021-05-13 11:12:23] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-13 11:12:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:24] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 25 places in 160 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 14 places in 103 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 12 places in 114 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 17 places in 95 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 88 places in 106 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 20 places in 103 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 30 places in 89 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 10 places in 91 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 44 places in 100 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 21 places in 88 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 17 places in 89 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 90 places in 78 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 35 places in 86 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 31 places in 86 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 93 places in 83 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 39 places in 92 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 85 places in 175 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 20 places in 95 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 61 places in 99 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 19 places in 88 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 35 places in 69 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 96 places in 87 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 19 places in 74 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 29 places in 105 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 96 places in 77 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 96 places in 86 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 93 places in 132 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 24 places in 62 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 19 places in 33 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 28 places in 83 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 94 places in 93 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 91 places in 119 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 91 places in 96 ms
[2021-05-13 11:12:27] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 3748 ms
[2021-05-13 11:12:27] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 18 ms.
[2021-05-13 11:12:29] [INFO ] Added : 234 causal constraints over 47 iterations in 1417 ms. Result :sat
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 96 places in 215 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 97 places in 157 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 93 places in 151 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 95 places in 141 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 95 places in 163 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 95 places in 145 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 97 places in 146 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 96 places in 145 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 91 places in 143 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 91 places in 112 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 92 places in 162 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 92 places in 146 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 91 places in 172 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 90 places in 148 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 91 places in 141 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 96 places in 146 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 92 places in 147 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 99 places in 140 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 96 places in 104 ms
[2021-05-13 11:12:33] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4246 ms
[2021-05-13 11:12:33] [INFO ] [Real]Absence check using 41 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:33] [INFO ] [Real]Absence check using 41 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:33] [INFO ] [Real]Absence check using 41 positive place invariants in 30 ms returned sat
[2021-05-13 11:12:33] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 8 ms returned sat
[2021-05-13 11:12:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:34] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 13 places in 167 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 10 places in 133 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 15 places in 173 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 12 places in 147 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 81 places in 139 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 18 places in 79 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 17 places in 78 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 19 places in 106 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 19 places in 116 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 17 places in 117 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 17 places in 112 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 35 places in 80 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 21 places in 115 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 92 places in 110 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 90 places in 108 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 91 places in 106 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 89 places in 105 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 16 places in 32 ms
[2021-05-13 11:12:36] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2265 ms
[2021-05-13 11:12:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:36] [INFO ] [Nat]Absence check using 41 positive place invariants in 46 ms returned sat
[2021-05-13 11:12:36] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 7 ms returned sat
[2021-05-13 11:12:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:36] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 10 places in 152 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 15 places in 104 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 11 places in 103 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 13 places in 117 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 25 places in 114 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 20 places in 122 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 15 places in 124 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 18 places in 102 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 26 places in 91 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 19 places in 100 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 25 places in 98 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 92 places in 90 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 35 places in 104 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 46 places in 83 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 27 places in 87 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 18 places in 96 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 86 places in 88 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 82 places in 87 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 90 places in 87 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 20 places in 88 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 89 places in 88 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 22 places in 86 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 91 places in 89 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 18 places in 79 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 92 places in 86 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 95 places in 89 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 94 places in 90 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 21 places in 74 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 93 places in 78 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 102 places in 70 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 97 places in 90 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 20 places in 90 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 99 places in 111 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 95 places in 104 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 93 places in 75 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 96 places in 108 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 99 places in 99 ms
[2021-05-13 11:12:41] [INFO ] Deduced a trap composed of 97 places in 69 ms
[2021-05-13 11:12:41] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 4121 ms
[2021-05-13 11:12:41] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 13 ms.
[2021-05-13 11:12:42] [INFO ] Added : 249 causal constraints over 50 iterations in 1033 ms. Result :sat
[2021-05-13 11:12:42] [INFO ] Deduced a trap composed of 96 places in 107 ms
[2021-05-13 11:12:42] [INFO ] Deduced a trap composed of 93 places in 132 ms
[2021-05-13 11:12:42] [INFO ] Deduced a trap composed of 91 places in 90 ms
[2021-05-13 11:12:42] [INFO ] Deduced a trap composed of 92 places in 133 ms
[2021-05-13 11:12:42] [INFO ] Deduced a trap composed of 94 places in 131 ms
[2021-05-13 11:12:43] [INFO ] Deduced a trap composed of 97 places in 143 ms
[2021-05-13 11:12:43] [INFO ] Deduced a trap composed of 93 places in 143 ms
[2021-05-13 11:12:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1367 ms
[2021-05-13 11:12:43] [INFO ] [Real]Absence check using 41 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:43] [INFO ] [Real]Absence check using 41 positive place invariants in 20 ms returned unsat
[2021-05-13 11:12:43] [INFO ] [Real]Absence check using 41 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:43] [INFO ] [Real]Absence check using 41 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:43] [INFO ] [Real]Absence check using 41 positive place invariants in 34 ms returned sat
[2021-05-13 11:12:43] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 7 ms returned sat
[2021-05-13 11:12:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:44] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2021-05-13 11:12:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:44] [INFO ] [Nat]Absence check using 41 positive place invariants in 53 ms returned sat
[2021-05-13 11:12:44] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 7 ms returned sat
[2021-05-13 11:12:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:44] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2021-05-13 11:12:45] [INFO ] Deduced a trap composed of 12 places in 155 ms
[2021-05-13 11:12:45] [INFO ] Deduced a trap composed of 23 places in 148 ms
[2021-05-13 11:12:45] [INFO ] Deduced a trap composed of 11 places in 127 ms
[2021-05-13 11:12:45] [INFO ] Deduced a trap composed of 13 places in 115 ms
[2021-05-13 11:12:45] [INFO ] Deduced a trap composed of 21 places in 127 ms
[2021-05-13 11:12:45] [INFO ] Deduced a trap composed of 29 places in 127 ms
[2021-05-13 11:12:45] [INFO ] Deduced a trap composed of 31 places in 128 ms
[2021-05-13 11:12:46] [INFO ] Deduced a trap composed of 15 places in 113 ms
[2021-05-13 11:12:46] [INFO ] Deduced a trap composed of 14 places in 144 ms
[2021-05-13 11:12:46] [INFO ] Deduced a trap composed of 28 places in 118 ms
[2021-05-13 11:12:46] [INFO ] Deduced a trap composed of 86 places in 82 ms
[2021-05-13 11:12:46] [INFO ] Deduced a trap composed of 92 places in 73 ms
[2021-05-13 11:12:46] [INFO ] Deduced a trap composed of 19 places in 88 ms
[2021-05-13 11:12:46] [INFO ] Deduced a trap composed of 26 places in 86 ms
[2021-05-13 11:12:46] [INFO ] Deduced a trap composed of 24 places in 81 ms
[2021-05-13 11:12:46] [INFO ] Deduced a trap composed of 95 places in 85 ms
[2021-05-13 11:12:47] [INFO ] Deduced a trap composed of 90 places in 84 ms
[2021-05-13 11:12:47] [INFO ] Deduced a trap composed of 95 places in 99 ms
[2021-05-13 11:12:47] [INFO ] Deduced a trap composed of 93 places in 106 ms
[2021-05-13 11:12:47] [INFO ] Deduced a trap composed of 93 places in 73 ms
[2021-05-13 11:12:47] [INFO ] Deduced a trap composed of 93 places in 90 ms
[2021-05-13 11:12:47] [INFO ] Deduced a trap composed of 93 places in 84 ms
[2021-05-13 11:12:47] [INFO ] Deduced a trap composed of 90 places in 86 ms
[2021-05-13 11:12:47] [INFO ] Deduced a trap composed of 44 places in 48 ms
[2021-05-13 11:12:47] [INFO ] Deduced a trap composed of 48 places in 48 ms
[2021-05-13 11:12:47] [INFO ] Deduced a trap composed of 33 places in 45 ms
[2021-05-13 11:12:47] [INFO ] Deduced a trap composed of 20 places in 87 ms
[2021-05-13 11:12:48] [INFO ] Deduced a trap composed of 15 places in 83 ms
[2021-05-13 11:12:48] [INFO ] Deduced a trap composed of 88 places in 92 ms
[2021-05-13 11:12:48] [INFO ] Deduced a trap composed of 92 places in 94 ms
[2021-05-13 11:12:48] [INFO ] Deduced a trap composed of 93 places in 83 ms
[2021-05-13 11:12:48] [INFO ] Deduced a trap composed of 25 places in 56 ms
[2021-05-13 11:12:48] [INFO ] Deduced a trap composed of 51 places in 36 ms
[2021-05-13 11:12:48] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 3582 ms
[2021-05-13 11:12:48] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 17 ms.
[2021-05-13 11:12:50] [INFO ] Added : 243 causal constraints over 49 iterations in 1573 ms. Result :sat
[2021-05-13 11:12:50] [INFO ] [Real]Absence check using 41 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:50] [INFO ] [Real]Absence check using 41 positive place invariants in 30 ms returned unsat
Successfully simplified 47 atomic propositions for a total of 48 simplifications.
[2021-05-13 11:12:50] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-13 11:12:50] [INFO ] Flatten gal took : 108 ms
[2021-05-13 11:12:50] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-13 11:12:50] [INFO ] Flatten gal took : 26 ms
FORMULA BusinessProcesses-PT-05-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 11:12:50] [INFO ] Applying decomposition
[2021-05-13 11:12:50] [INFO ] Flatten gal took : 41 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/graph1438125528713980788.txt, -o, /tmp/graph1438125528713980788.bin, -w, /tmp/graph1438125528713980788.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/graph1438125528713980788.bin, -l, -1, -v, -w, /tmp/graph1438125528713980788.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 11:12:51] [INFO ] Decomposing Gal with order
[2021-05-13 11:12:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:12:51] [INFO ] Removed a total of 70 redundant transitions.
[2021-05-13 11:12:51] [INFO ] Flatten gal took : 111 ms
[2021-05-13 11:12:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 30 ms.
[2021-05-13 11:12:51] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 8 ms
[2021-05-13 11:12:51] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 7 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 9 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,2.38391e+17,8.22594,262564,2,124100,5,539913,6,0,1783,1.47358e+06,0


Converting to forward existential form...Done !
original formula: A((AG(((((((gi3.gu54.p250+gi4.gu25.p284)+gi2.gu14.p26)+gi2.gu14.p46)+gi4.gu25.p8)+gi2.gu14.p326)<=((((((gi8.gu69.p215+gi2.gu14.p213)+gi2.gu14.p2)+gi2.gu14.p280)+gi2.gu14.p207)+gi2.gu14.p201)+gi2.gu14.p285))) + (EF((AF(((((((((gi8.gu69.p258+gi8.gu69.p215)+gi8.gu69.p274)+gi8.gu69.p106)+gi4.gu25.p8)+gi8.gu69.p33)+gi8.gu69.p116)+gi8.gu69.p239)<=(((((gi3.gu54.p74+gi8.gu69.p139)+gi8.gu69.p140)+gi8.gu69.p132)+gi8.gu69.p104)+gi8.gu69.p239))) * AX(FALSE))) * ((gi4.gu25.p284==0)||(gi1.gi2.gi7.gu89.p330==1)))) U (EF(((((gi4.gu25.p100+gi4.gu25.p9)>=14)||((((gi7.gu12.p1+gi7.gu12.p127)+gi7.gu12.p126)+gi7.gu12.p214)<=(((((((gi7.gu12.p316+gi7.gu12.p319)+gi7.gu12.p83)+gi3.gu54.p129)+gi7.gu12.p43)+gi7.gu12.p359)+gi7.gu12.p289)+gi7.gu12.p230)))&&((((gi4.gu64.p237+gi4.gu25.p9)+gi4.gu64.p171)>=2)||((gi7.gu99.p86+gi7.gu99.p196)>=25)))) + ((gi0.gu3.p13+gi0.gu3.p18)>(gi0.gu3.p186+gi0.gu3.p19))))
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U ((((gi4.gu25.p100+gi4.gu25.p9)>=14)||((((gi7.gu12.p1+gi7.gu12.p127)+gi7.gu12.p126)+gi7.gu12.p214)<=(((((((gi7.gu12.p316+gi7.gu12.p319)+gi7.gu12.p83)+gi3.gu54.p129)+gi7.gu12.p43)+gi7.gu12.p359)+gi7.gu12.p289)+gi7.gu12.p230)))&&((((gi4.gu64.p237+gi4.gu25.p9)+gi4.gu64.p171)>=2)||((gi7.gu99.p86+gi7.gu99.p196)>=25)))) + ((gi0.gu3.p13+gi0.gu3.p18)>(gi0.gu3.p186+gi0.gu3.p19))))))) * !(E(!((E(TRUE U ((((gi4.gu25.p100+gi4.gu25.p9)>=14)||((((gi7.gu12.p1+gi7.gu12.p127)+gi7.gu12.p126)+gi7.gu12.p214)<=(((((((gi7.gu12.p316+gi7.gu12.p319)+gi7.gu12.p83)+gi3.gu54.p129)+gi7.gu12.p43)+gi7.gu12.p359)+gi7.gu12.p289)+gi7.gu12.p230)))&&((((gi4.gu64.p237+gi4.gu25.p9)+gi4.gu64.p171)>=2)||((gi7.gu99.p86+gi7.gu99.p196)>=25)))) + ((gi0.gu3.p13+gi0.gu3.p18)>(gi0.gu3.p186+gi0.gu3.p19)))) U (!((!(E(TRUE U !(((((((gi3.gu54.p250+gi4.gu25.p284)+gi2.gu14.p26)+gi2.gu14.p46)+gi4.gu25.p8)+gi2.gu14.p326)<=((((((gi8.gu69.p215+gi2.gu14.p213)+gi2.gu14.p2)+gi2.gu14.p280)+gi2.gu14.p207)+gi2.gu14.p201)+gi2.gu14.p285))))) + (E(TRUE U (!(EG(!(((((((((gi8.gu69.p258+gi8.gu69.p215)+gi8.gu69.p274)+gi8.gu69.p106)+gi4.gu25.p8)+gi8.gu69.p33)+gi8.gu69.p116)+gi8.gu69.p239)<=(((((gi3.gu54.p74+gi8.gu69.p139)+gi8.gu69.p140)+gi8.gu69.p132)+gi8.gu69.p104)+gi8.gu69.p239))))) * !(EX(!(FALSE))))) * ((gi4.gu25.p284==0)||(gi1.gi2.gi7.gu89.p330==1))))) * !((E(TRUE U ((((gi4.gu25.p100+gi4.gu25.p9)>=14)||((((gi7.gu12.p1+gi7.gu12.p127)+gi7.gu12.p126)+gi7.gu12.p214)<=(((((((gi7.gu12.p316+gi7.gu12.p319)+gi7.gu12.p83)+gi3.gu54.p129)+gi7.gu12.p43)+gi7.gu12.p359)+gi7.gu12.p289)+gi7.gu12.p230)))&&((((gi4.gu64.p237+gi4.gu25.p9)+gi4.gu64.p171)>=2)||((gi7.gu99.p86+gi7.gu99.p196)>=25)))) + ((gi0.gu3.p13+gi0.gu3.p18)>(gi0.gu3.p186+gi0.gu3.p19))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions gi0.gu24.t219, gi0.gu53.t152, gi0.gu53.t153, gi0.t264, gi1.gi0.gi0.gu8.t253, gi1.gi0.gi1.gu76.t66, gi1.gi0.gi1.t62, gi1.gi1.gi1.gu50.t161, gi1.gi1.gi1.t160, gi1.gi1.gi2.gu51.t157, gi1.gi1.gi2.t156, gi1.gi2.gu29.t201, gi1.gi2.gi0.gu35.t185, gi1.gi2.gi0.t182, gi1.gi2.gi1.gu10.t247, gi1.gi2.gi1.gu48.t164, gi1.gi2.gi1.gu48.t165, gi1.gi2.gi1.t249, gi1.gi2.gi2.gu17.t239, gi1.gi2.gi2.t243, gi1.gi2.gi3.gu55.t148, gi1.gi2.gi4.gu26.t207, gi1.gi2.gi4.t205, gi1.gi2.gi5.gu67.t100, gi1.gi2.gi6.gu59.t125, gi1.gi2.gi6.t124, gi1.gi2.gi7.gu66.t105, gi1.gi2.gi7.gu68.t97, gi1.gi2.gi7.gu71.t1, gi1.gi2.gi7.gu71.t40, gi1.gi2.gi7.gu71.t58, gi1.gi2.gi7.gu71.t74, gi1.gi2.gi7.t76, gi1.gi2.gi7.t71, gi1.gi2.gi7.t60, gi1.gi2.gi7.t53, gi1.gi2.gi7.t36, gi1.gi2.gi7.t33, gi1.gi2.gi7.t31, gi1.gi2.gi7.t28, gi1.gi2.gi7.t26, gi1.gi2.gi7.t21, gi1.gi2.gi7.t18, gi1.gi2.gi7.t15, gi1.gi2.gi7.t12, gi1.gi2.gi7.t9, gi1.gi2.gi7.t6, gi1.gi2.gi7.t3, gi1.gi2.gi8.gu82.t51, gi1.gi2.gi8.t55, gi1.gi2.gi9.gu22.t227, gi1.gi2.gi9.gu84.t46, gi1.gi2.gi9.t44, gi1.gi2.gi9.t38, gi1.t244, gi2.gu7.t259, gi2.gu57.t136, gi2.t261, gi2.t241, gi2.t137, gi3.t223, gi4.gu25.t169, gi4.gu25.t176, gi5.gu33.t140, gi5.gu33.t141, gi5.gu33.t225, gi5.gu70.t93, gi5.t233, gi5.t231, gi5.t229, gi5.t92, gi6.gu46.t173, gi6.gu58.t128, gi6.gu62.t117, gi6.gu65.t108, gi6.gu65.t109, gi6.t172, gi6.t116, gi7.gu12.t181, gi7.gu12.t213, gi7.gu56.t144, gi7.gu56.t145, gi7.gu61.t121, gi7.t211, gi7.t120, gi8.gu9.t251, gi8.gu69.t189, gi8.gu69.t197, gi8.t255, gi8.t112, t23, t42, t64, t96, t101, t104, t113, t129, t132, t133, t149, t168, t175, t190, t217, t237, t250, t256, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/206/108/314
Detected timeout of ITS tools.
[2021-05-13 11:33:08] [INFO ] Applying decomposition
[2021-05-13 11:33:08] [INFO ] Flatten gal took : 20 ms
[2021-05-13 11:33:08] [INFO ] Decomposing Gal with order
[2021-05-13 11:33:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:33:08] [INFO ] Flatten gal took : 25 ms
[2021-05-13 11:33:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-13 11:33:09] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 23 ms
[2021-05-13 11:33:09] [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 9 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,2.38391e+17,45.5408,937856,2,614847,5,2.20795e+06,6,0,1782,4.18854e+06,0


Converting to forward existential form...Done !
original formula: A((AG(((((((gi0.gi1.gi0.gi0.gi0.gu76.p250+gu80.p284)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu20.p26)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu23.p46)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu119.p8)+gu80.p326)<=((((((gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu69.p215+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu69.p213)+gi0.gi0.gu112.p2)+gu80.p280)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu68.p207)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu67.p201)+gu80.p285))) + (EF((AF(((((((((gi0.gi1.gi0.gu78.p258+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu69.p215)+gu80.p274)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu31.p106)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu119.p8)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu21.p33)+gi0.gi0.gi0.gi0.gi0.gu33.p116)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gu74.p239)<=(((((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu26.p74+gi0.gi1.gi0.gi0.gi0.gi0.gu86.p139)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gu85.p140)+gi0.gi0.gu36.p132)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu31.p104)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gu74.p239))) * AX(FALSE))) * ((gu80.p284==0)||(gu80.p330==1)))) U (EF(((((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu30.p100+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu120.p9)>=14)||((((gi0.gu111.p1+gi0.gi0.gi0.gu35.p127)+gi0.gi0.gi0.gi0.gu34.p126)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu69.p214)<=(((((((gu80.p316+gu80.p319)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu28.p83)+gi0.gi0.gi0.gu35.p129)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu22.p43)+gu80.p359)+gu80.p289)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu72.p230)))&&((((gi0.gi1.gi0.gi0.gi0.gi0.gi0.gu74.p237+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu120.p9)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu61.p171)>=2)||((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu28.p86+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu66.p196)>=25)))) + ((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu102.p13+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu113.p18)>(gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu64.p186+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu19.p19))))
Detected timeout of ITS tools.
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U ((((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu30.p100+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu120.p9)>=14)||((((gi0.gu111.p1+gi0.gi0.gi0.gu35.p127)+gi0.gi0.gi0.gi0.gu34.p126)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu69.p214)<=(((((((gu80.p316+gu80.p319)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu28.p83)+gi0.gi0.gi0.gu35.p129)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu22.p43)+gu80.p359)+gu80.p289)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu72.p230)))&&((((gi0.gi1.gi0.gi0.gi0.gi0.gi0.gu74.p237+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu120.p9)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu61.p171)>=2)||((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu28.p86+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu66.p196)>=25)))) + ((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu102.p13+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu113.p18)>(gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu64.p186+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu19.p19))))))) * !(E(!((E(TRUE U ((((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu30.p100+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu120.p9)>=14)||((((gi0.gu111.p1+gi0.gi0.gi0.gu35.p127)+gi0.gi0.gi0.gi0.gu34.p126)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu69.p214)<=(((((((gu80.p316+gu80.p319)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu28.p83)+gi0.gi0.gi0.gu35.p129)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu22.p43)+gu80.p359)+gu80.p289)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu72.p230)))&&((((gi0.gi1.gi0.gi0.gi0.gi0.gi0.gu74.p237+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu120.p9)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:176)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:342)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:185)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:161)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:326)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:392)
at fr.lip6.move.gal.application.ITSRunner$ITSInterpreter.run(ITSRunner.java:180)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-13 11:53:28] [INFO ] Flatten gal took : 449 ms
[2021-05-13 11:53:29] [INFO ] Input system was already deterministic with 318 transitions.
[2021-05-13 11:53:29] [INFO ] Transformed 367 places.
[2021-05-13 11:53:29] [INFO ] Transformed 318 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-13 11:53:59] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 7 ms
[2021-05-13 11:53:59] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 7 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, --load-order, /home/mcc/execution/model.ord, --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 --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 9 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,2.38391e+17,166.592,2427164,2,965718,5,6.80853e+06,6,0,1782,4.83995e+06,0


Converting to forward existential form...Done !

BK_TIME_CONFINEMENT_REACHED

--------------------
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-05"
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-05, 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-162038167700089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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