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

About the Execution of 2020-gold for BusinessProcesses-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16251.911 3529344.00 3356356.00 129198.20 FF?????????????? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r035-tajo-162038167700090.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tajo-162038167700090
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1620904317247

[2021-05-13 11:11:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 11:11:58] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2021-05-13 11:11:58] [INFO ] Transformed 368 places.
[2021-05-13 11:11:58] [INFO ] Transformed 319 transitions.
[2021-05-13 11:11:58] [INFO ] Found NUPN structural information;
[2021-05-13 11:11:58] [INFO ] Parsed PT model containing 368 places and 319 transitions in 102 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/CTLFireability.xml in 34 ms.
Incomplete random walk after 100000 steps, including 934 resets, run finished after 283 ms. (steps per millisecond=353 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 318 rows 367 cols
[2021-05-13 11:11:59] [INFO ] Computed 57 place invariants in 18 ms
[2021-05-13 11:11:59] [INFO ] [Real]Absence check using 41 positive place invariants in 39 ms returned sat
[2021-05-13 11:11:59] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 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 288 ms returned sat
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 8 places in 202 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 22 places in 125 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 17 places in 132 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 16 places in 124 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 27 places in 112 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 19 places in 103 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 19 places in 95 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 28 places in 92 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 15 places in 124 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 18 places in 111 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 14 places in 119 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 23 places in 113 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 85 places in 98 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 19 places in 108 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 15 places in 118 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 29 places in 129 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 21 places in 119 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 41 places in 110 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 91 places in 106 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 33 places in 110 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 93 places in 150 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 91 places in 122 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 84 places in 115 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 87 places in 131 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 92 places in 118 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 88 places in 109 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 88 places in 105 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 95 places in 84 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 89 places in 78 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 88 places in 103 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 89 places in 104 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 86 places in 104 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 84 places in 130 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 90 places in 105 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 90 places in 101 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 89 places in 118 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 93 places in 104 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 17 places in 109 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 88 places in 102 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 82 places in 96 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 96 places in 98 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 89 places in 96 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 95 places in 109 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 97 places in 95 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 89 places in 90 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 94 places in 95 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 88 places in 84 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 84 places in 83 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 94 places in 124 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 94 places in 127 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 91 places in 101 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 94 places in 97 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 89 places in 108 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 88 places in 110 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 31 places in 126 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 94 places in 109 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 18 places in 114 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 87 places in 110 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 22 places in 106 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 93 places in 110 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 94 places in 96 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 90 places in 88 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 98 places in 92 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 91 places in 110 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 96 places in 146 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 90 places in 103 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 93 places in 107 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 84 places in 128 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 89 places in 111 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 86 places in 98 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 83 places in 102 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 89 places in 92 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 90 places in 78 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 94 places in 76 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 101 places in 117 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 95 places in 73 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 17 places in 76 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 94 places in 107 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 88 places in 87 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 97 places in 85 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 91 places in 79 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 92 places in 87 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 87 places in 82 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 97 places in 86 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 90 places in 80 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 88 places in 75 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 88 places in 75 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 19 places in 54 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 22 places in 55 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 25 places in 52 ms
[2021-05-13 11:12:10] [INFO ] Trap strengthening (SAT) tested/added 91/90 trap constraints in 11104 ms
[2021-05-13 11:12:10] [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 89 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 391 ms returned sat
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 21 places in 134 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 8 places in 133 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 19 places in 128 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 87 places in 128 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 17 places in 125 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 16 places in 118 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 24 places in 148 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 15 places in 104 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 18 places in 98 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 27 places in 109 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 28 places in 104 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 36 places in 101 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 91 places in 153 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 96 places in 94 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 17 places in 140 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 30 places in 92 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 30 places in 89 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 15 places in 104 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 97 places in 87 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 87 places in 117 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 24 places in 110 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 87 places in 123 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 12 places in 108 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 30 places in 84 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 17 places in 130 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 100 places in 82 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 99 places in 107 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 41 places in 101 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 33 places in 105 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 29 places in 116 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 90 places in 107 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 92 places in 102 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 31 places in 131 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 89 places in 138 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 91 places in 130 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 90 places in 104 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 100 places in 145 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 88 places in 123 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 20 places in 131 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 90 places in 140 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 90 places in 110 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 25 places in 145 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 90 places in 113 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 95 places in 112 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 99 places in 109 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 100 places in 105 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 97 places in 100 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 20 places in 100 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 96 places in 98 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 87 places in 100 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 91 places in 113 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 96 places in 80 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 97 places in 90 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 101 places in 105 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 93 places in 137 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 90 places in 127 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 93 places in 108 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 91 places in 106 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 97 places in 135 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 96 places in 100 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 98 places in 93 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 88 places in 91 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 91 places in 99 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 86 places in 97 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 96 places in 97 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 88 places in 97 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 90 places in 104 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 91 places in 120 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 93 places in 104 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 87 places in 102 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 22 places in 96 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 100 places in 96 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 99 places in 98 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 91 places in 126 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 89 places in 99 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 92 places in 97 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 100 places in 151 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 21 places in 97 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 15 places in 95 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 93 places in 98 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 95 places in 88 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 93 places in 75 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 93 places in 74 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 96 places in 74 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 20 places in 71 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 94 places in 70 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 92 places in 74 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 94 places in 82 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 94 places in 103 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 87 places in 93 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 52 places in 68 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 19 places in 51 ms
[2021-05-13 11:12:22] [INFO ] Trap strengthening (SAT) tested/added 93/92 trap constraints in 11269 ms
[2021-05-13 11:12:22] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 24 ms.
[2021-05-13 11:12:23] [INFO ] Added : 209 causal constraints over 42 iterations in 1147 ms. Result :sat
[2021-05-13 11:12:24] [INFO ] [Real]Absence check using 41 positive place invariants in 40 ms returned sat
[2021-05-13 11:12:24] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 9 ms returned sat
[2021-05-13 11:12:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:24] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 8 places in 165 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 25 places in 143 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 17 places in 133 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 8 places in 131 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 10 places in 123 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 30 places in 123 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 93 places in 119 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 17 places in 122 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 18 places in 117 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 47 places in 119 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 19 places in 113 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 27 places in 115 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 31 places in 108 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 93 places in 103 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 41 places in 89 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 17 places in 105 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 28 places in 97 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 88 places in 136 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 20 places in 102 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 92 places in 91 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 89 places in 95 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 30 places in 89 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 32 places in 89 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 92 places in 136 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 38 places in 92 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 41 places in 89 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 87 places in 83 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 90 places in 80 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 89 places in 85 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 91 places in 135 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 94 places in 104 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 27 places in 58 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 34 places in 51 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 29 places in 47 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 53 places in 79 ms
[2021-05-13 11:12:28] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 4295 ms
[2021-05-13 11:12:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:28] [INFO ] [Nat]Absence check using 41 positive place invariants in 39 ms returned sat
[2021-05-13 11:12:28] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2021-05-13 11:12:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:29] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 10 places in 166 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 87 places in 121 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 8 places in 127 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 11 places in 122 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 28 places in 118 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 11 places in 145 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 17 places in 117 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 25 places in 123 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 15 places in 78 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 11 places in 96 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 15 places in 82 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 18 places in 84 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 32 places in 79 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 39 places in 102 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 16 places in 76 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 30 places in 101 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 12 places in 79 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 35 places in 74 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 21 places in 82 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 35 places in 82 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 15 places in 76 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 18 places in 74 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 39 places in 77 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 20 places in 79 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 34 places in 69 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 25 places in 65 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 38 places in 79 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 28 places in 87 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 33 places in 94 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 38 places in 89 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 19 places in 75 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 37 places in 82 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 42 places in 66 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 31 places in 85 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 27 places in 90 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 43 places in 85 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 47 places in 88 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 41 places in 105 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 46 places in 84 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 44 places in 72 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 60 places in 64 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 47 places in 67 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 58 places in 65 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 57 places in 64 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 24 places in 107 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 22 places in 85 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 37 places in 105 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 35 places in 82 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 44 places in 91 ms
[2021-05-13 11:12:34] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 5277 ms
[2021-05-13 11:12:34] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 25 ms.
[2021-05-13 11:12:35] [INFO ] Added : 202 causal constraints over 41 iterations in 1195 ms. Result :sat
[2021-05-13 11:12:36] [INFO ] Flatten gal took : 106 ms
[2021-05-13 11:12:36] [INFO ] Flatten gal took : 26 ms
[2021-05-13 11:12:36] [INFO ] Applying decomposition
[2021-05-13 11:12:36] [INFO ] Flatten gal took : 34 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/graph16406183022448112314.txt, -o, /tmp/graph16406183022448112314.bin, -w, /tmp/graph16406183022448112314.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/graph16406183022448112314.bin, -l, -1, -v, -w, /tmp/graph16406183022448112314.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 11:12:36] [INFO ] Decomposing Gal with order
[2021-05-13 11:12:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:12:36] [INFO ] Removed a total of 70 redundant transitions.
[2021-05-13 11:12:36] [INFO ] Flatten gal took : 109 ms
[2021-05-13 11:12:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-13 11:12:36] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 9 ms
[2021-05-13 11:12:36] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 6 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/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], 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/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 58 ordering constraints for composite.
built 17 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 17 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 15 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 17 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 49 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
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,1.96373,72228,7264,27,102269,538,759,243724,49,897,0


Converting to forward existential form...Done !
original formula: AF(((AG((((i2.i0.u6.p16==1)||(i3.i0.u8.p20==1))||(i11.i3.u70.p172==1))) + EG(((((i17.u108.p367!=1)&&(i8.i0.u54.p137!=1))&&(i15.i0.u31.p77!=1))&&(i11.i3.u70.p172!=1)))) + ((((((((((((((((A((((((((((i11.i1.u65.p160==1)||(i13.i0.u40.p99==1))||(((i8.i1.u43.p106==1)&&(i8.i1.u99.p244==1))&&(i1.u146.p351==1)))||(i3.i0.u9.p23==1))||(i19.u131.p322==1))||(i16.i1.u103.p252==1))||(i1.u4.p11==1))||(i15.i0.u31.p77==1))&&(((i18.u124.p306==1)||(i17.u108.p268==1))||(i18.u122.p301==1))) U ((((((i17.u141.p341==1)||(i17.u149.p357==1))||(i17.u132.p324==1))||(i6.i0.u35.p87==1))||(i9.i1.u89.p216==1))||(((i1.u29.p70==1)&&(i9.i1.u88.p218==1))&&(i17.u108.p367==1)))) * (i4.i1.u67.p162!=1)) * (i8.i0.u0.p0!=1)) * (i10.i0.u59.p147!=1)) * (i0.i1.u107.p261!=1)) * (i16.i0.u148.p356!=1)) * (i8.i0.u54.p136!=1)) * (i5.u25.p63!=1)) * (i17.u111.p278!=1)) * (i17.u143.p345!=1)) * AG(((((((((i5.u26.p65==1)||(i2.i0.u126.p311==1))||(i9.i2.u91.p225==1))||(i17.u138.p336==1))||(i17.u137.p333==1))||(((i7.i1.u50.p127==1)&&(i10.i1.u79.p193==1))&&(i17.u108.p367==1)))||(i17.u113.p283==1))||(i15.i0.u31.p78==1)))) * ((((i0.i1.u106.p262==1)||(i10.i1.u79.p192==1))||(i15.i1.u95.p231==1))||(i17.u117.p291==1))) * (((((((((i7.i1.u51.p130==1)||(i2.i1.u19.p48==1))||(i7.i0.u53.p131==1))||(i13.i0.u40.p98==1))||(i17.u117.p290==1))||(i10.i2.u80.p196==1))||(i17.u143.p346==1))||(((i2.i0.u23.p56==1)&&(i10.i1.u79.p194==1))&&(i2.i0.u126.p310==1)))||(((i0.i0.u47.p118==1)&&(i0.i1.u106.p264==1))&&(i0.i0.u150.p359==1)))) * (((i2.i0.u22.p53!=1)||(i10.i2.u81.p198!=1))||(i17.u108.p367!=1))) * (((i7.i0.u53.p134!=1)||(i7.i2.u87.p214!=1))||(i17.u108.p367!=1))) * (((i15.i0.u33.p81!=1)||(i9.i3.u97.p239!=1))||(i15.i0.u136.p331!=1))) * (((((((((((i17.u114.p285==1)||(i17.u135.p329==1))||(i17.u125.p309==1))||(i17.u137.p333==1))||(i11.i0.u63.p154==1))||(i1.u29.p72==1))||(i9.i1.u89.p216==1))||(i11.i0.u62.p153==1))||(i17.u108.p266==1))||(((i14.i0.u37.p90==1)&&(i0.i1.u106.p263==1))&&(i17.u108.p367==1)))||(((i3.i0.u14.p32==1)&&(i4.i1.u67.p163==1))&&(i17.u108.p367==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !((((i2.i0.u6.p16==1)||(i3.i0.u8.p20==1))||(i11.i3.u70.p172==1))))) + EG(((((i17.u108.p367!=1)&&(i8.i0.u54.p137!=1))&&(i15.i0.u31.p77!=1))&&(i11.i3.u70.p172!=1)))) + ((((((((((((((((!((E(!(((((((i17.u141.p341==1)||(i17.u149.p357==1))||(i17.u132.p324==1))||(i6.i0.u35.p87==1))||(i9.i1.u89.p216==1))||(((i1.u29.p70==1)&&(i9.i1.u88.p218==1))&&(i17.u108.p367==1)))) U (!((((((((((i11.i1.u65.p160==1)||(i13.i0.u40.p99==1))||(((i8.i1.u43.p106==1)&&(i8.i1.u99.p244==1))&&(i1.u146.p351==1)))||(i3.i0.u9.p23==1))||(i19.u131.p322==1))||(i16.i1.u103.p252==1))||(i1.u4.p11==1))||(i15.i0.u31.p77==1))&&(((i18.u124.p306==1)||(i17.u108.p268==1))||(i18.u122.p301==1)))) * !(((((((i17.u141.p341==1)||(i17.u149.p357==1))||(i17.u132.p324==1))||(i6.i0.u35.p87==1))||(i9.i1.u89.p216==1))||(((i1.u29.p70==1)&&(i9.i1.u88.p218==1))&&(i17.u108.p367==1)))))) + EG(!(((((((i17.u141.p341==1)||(i17.u149.p357==1))||(i17.u132.p324==1))||(i6.i0.u35.p87==1))||(i9.i1.u89.p216==1))||(((i1.u29.p70==1)&&(i9.i1.u88.p218==1))&&(i17.u108.p367==1))))))) * (i4.i1.u67.p162!=1)) * (i8.i0.u0.p0!=1)) * (i10.i0.u59.p147!=1)) * (i0.i1.u107.p261!=1)) * (i16.i0.u148.p356!=1)) * (i8.i0.u54.p136!=1)) * (i5.u25.p63!=1)) * (i17.u111.p278!=1)) * (i17.u143.p345!=1)) * !(E(TRUE U !(((((((((i5.u26.p65==1)||(i2.i0.u126.p311==1))||(i9.i2.u91.p225==1))||(i17.u138.p336==1))||(i17.u137.p333==1))||(((i7.i1.u50.p127==1)&&(i10.i1.u79.p193==1))&&(i17.u108.p367==1)))||(i17.u113.p283==1))||(i15.i0.u31.p78==1)))))) * ((((i0.i1.u106.p262==1)||(i10.i1.u79.p192==1))||(i15.i1.u95.p231==1))||(i17.u117.p291==1))) * (((((((((i7.i1.u51.p130==1)||(i2.i1.u19.p48==1))||(i7.i0.u53.p131==1))||(i13.i0.u40.p98==1))||(i17.u117.p290==1))||(i10.i2.u80.p196==1))||(i17.u143.p346==1))||(((i2.i0.u23.p56==1)&&(i10.i1.u79.p194==1))&&(i2.i0.u126.p310==1)))||(((i0.i0.u47.p118==1)&&(i0.i1.u106.p264==1))&&(i0.i0.u150.p359==1)))) * (((i2.i0.u22.p53!=1)||(i10.i2.u81.p198!=1))||(i17.u108.p367!=1))) * (((i7.i0.u53.p134!=1)||(i7.i2.u87.p214!=1))||(i17.u108.p367!=1))) * (((i15.i0.u33.p81!=1)||(i9.i3.u97.p239!=1))||(i15.i0.u136.p331!=1))) * (((((((((((i17.u114.p285==1)||(i17.u135.p329==1))||(i17.u125.p309==1))||(i17.u137.p333==1))||(i11.i0.u63.p154==1))||(i1.u29.p72==1))||(i9.i1.u89.p216==1))||(i11.i0.u62.p153==1))||(i17.u108.p266==1))||(((i14.i0.u37.p90==1)&&(i0.i1.u106.p263==1))&&(i17.u108.p367==1)))||(((i3.i0.u14.p32==1)&&(i4.i1.u67.p163==1))&&(i17.u108.p367==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t244, t256, i0.i0.u46.t189, i0.i1.t92, i0.i1.u106.t93, i1.u29.t223, i1.u42.t197, i2.i0.u20.t241, i2.i0.u22.t237, i2.i1.t243, i2.i1.u21.t239, i3.i0.t250, i3.i0.u8.t264, i3.i0.u14.t253, i3.i1.t255, i3.i1.u15.t251, i3.i2.t62, i3.i2.u116.t66, i4.i0.t259, i4.i0.u10.t261, i4.i1.t172, i4.i1.u67.t173, i5.t233, i5.t231, i5.t229, i5.u27.t227, i5.u28.t225, i6.i0.t211, i6.i0.u34.t213, i6.i1.t120, i6.i1.u92.t121, i7.i0.t182, i7.i0.u48.t185, i7.i1.u50.t181, i7.i2.t132, i7.i2.u87.t133, i8.i1.t108, i8.i1.u99.t109, i8.i2.t104, i8.i2.u101.t105, i9.i1.t128, i9.i1.u88.t129, i9.i2.t124, i9.i2.u90.t125, i9.i3.t112, i9.i3.u97.t113, i10.i1.t148, i10.i1.u79.t149, i10.i2.t144, i10.i2.u81.t145, i10.i3.t136, i10.i3.u85.t137, i11.i1.t175, i11.i1.u64.t176, i11.i2.t168, i11.i2.u68.t169, i11.i3.t164, i11.i3.u70.t165, i11.i4.t160, i11.i4.u73.t161, i12.i0.t247, i12.i0.u16.t249, i12.i1.t156, i12.i1.u75.t157, i12.i2.t152, i12.i2.u77.t153, i13.i0.u40.t201, i13.i1.t140, i13.i1.u83.t141, i14.i0.t205, i14.i0.u37.t207, i14.i1.t96, i14.i1.u105.t97, i15.i0.t217, i15.i0.u31.t219, i15.i1.t116, i15.i1.u94.t117, i16.i0.u44.t193, i16.i1.t100, i16.i1.u103.t101, i17.t76, i17.t74, i17.t71, i17.t69, i17.t64, i17.t60, i17.t58, i17.t53, i17.t49, i17.t40, i17.t36, i17.t33, i17.t31, i17.t28, i17.t26, i17.t23, i17.t21, i17.t18, i17.t15, i17.t12, i17.t9, i17.t6, i17.t3, i17.u108.t1, i18.t51, i18.u122.t55, i19.t44, i19.t42, i19.t38, i19.u127.t46, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/208/110/318
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,719.54,3138176,1,0,4.89578e+06,656,1616,6.53761e+06,108,1115,5161643
FORMULA BusinessProcesses-PT-05-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(EF(((i0.i1.u106.p262==1)||(i16.i1.u102.p251==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.i1.u106.p262==1)||(i16.i1.u102.p251==1)))))] = FALSE
(forward)formula 1,0,729.963,3138176,1,0,4.89578e+06,656,2581,6.53761e+06,135,1115,5485103
FORMULA BusinessProcesses-PT-05-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
ITS-tools command line returned an error code 139
[2021-05-13 11:29:45] [INFO ] Applying decomposition
[2021-05-13 11:29:46] [INFO ] Flatten gal took : 21 ms
[2021-05-13 11:29:46] [INFO ] Decomposing Gal with order
[2021-05-13 11:29:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:29:46] [INFO ] Flatten gal took : 22 ms
[2021-05-13 11:29:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-13 11:29:46] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 7 ms
[2021-05-13 11:29:46] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 4 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/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], 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/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
built 2 ordering constraints for composite.
built 90 ordering constraints for composite.
built 46 ordering constraints for composite.
built 45 ordering constraints for composite.
built 44 ordering constraints for composite.
built 42 ordering constraints for composite.
built 40 ordering constraints for composite.
built 38 ordering constraints for composite.
built 36 ordering constraints for composite.
built 34 ordering constraints for composite.
built 31 ordering constraints for composite.
built 28 ordering constraints for composite.
built 25 ordering constraints for composite.
built 23 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 46 ordering constraints for composite.
built 44 ordering constraints for composite.
built 42 ordering constraints for composite.
built 40 ordering constraints for composite.
built 38 ordering constraints for composite.
built 36 ordering constraints for composite.
built 34 ordering constraints for composite.
built 32 ordering constraints for composite.
built 30 ordering constraints for composite.
built 28 ordering constraints for composite.
built 26 ordering constraints for composite.
built 24 ordering constraints for composite.
built 22 ordering constraints for composite.
built 20 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
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,178.844,2302316,62923,2913,890082,7944,781,2.85977e+07,579,85689,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2021-05-13 11:50:00] [INFO ] Flatten gal took : 714 ms
[2021-05-13 11:50:01] [INFO ] Input system was already deterministic with 318 transitions.
[2021-05-13 11:50:01] [INFO ] Transformed 367 places.
[2021-05-13 11:50:01] [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:50:31] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 6 ms
[2021-05-13 11:50:31] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 9 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/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.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/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.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 14 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,216.541,2430460,2,965718,5,6.80853e+06,6,0,1782,4.83995e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.

BK_STOP 1620907846591

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="CTLFireability"
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 CTLFireability"
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-162038167700090"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;