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.r026-tajo-162038143900474.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 itstools
Input is BusinessProcesses-PT-20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900474
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K 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.8K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 192K 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-20-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620765838781

Running Version 0
[2021-05-11 20:44:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-11 20:44:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 20:44:00] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2021-05-11 20:44:00] [INFO ] Transformed 782 places.
[2021-05-11 20:44:00] [INFO ] Transformed 697 transitions.
[2021-05-11 20:44:00] [INFO ] Found NUPN structural information;
[2021-05-11 20:44:00] [INFO ] Parsed PT model containing 782 places and 697 transitions in 137 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 63 places in 20 ms
Reduce places removed 63 places and 59 transitions.
Support contains 434 out of 719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 46 place count 673 transition count 606
Iterating global reduction 1 with 32 rules applied. Total rules applied 78 place count 673 transition count 606
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 86 place count 665 transition count 598
Iterating global reduction 1 with 8 rules applied. Total rules applied 94 place count 665 transition count 598
Applied a total of 94 rules in 79 ms. Remains 665 /719 variables (removed 54) and now considering 598/638 (removed 40) transitions.
// Phase 1: matrix 598 rows 665 cols
[2021-05-11 20:44:00] [INFO ] Computed 107 place invariants in 30 ms
[2021-05-11 20:44:01] [INFO ] Implicit Places using invariants in 288 ms returned []
// Phase 1: matrix 598 rows 665 cols
[2021-05-11 20:44:01] [INFO ] Computed 107 place invariants in 15 ms
[2021-05-11 20:44:01] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
// Phase 1: matrix 598 rows 665 cols
[2021-05-11 20:44:01] [INFO ] Computed 107 place invariants in 10 ms
[2021-05-11 20:44:01] [INFO ] Dead Transitions using invariants and state equation in 346 ms returned []
Finished structural reductions, in 1 iterations. Remains : 665/719 places, 598/638 transitions.
[2021-05-11 20:44:02] [INFO ] Flatten gal took : 75 ms
[2021-05-11 20:44:02] [INFO ] Flatten gal took : 37 ms
[2021-05-11 20:44:02] [INFO ] Input system was already deterministic with 598 transitions.
Incomplete random walk after 100000 steps, including 506 resets, run finished after 446 ms. (steps per millisecond=224 ) properties (out of 83) seen :75
Running SMT prover for 8 properties.
// Phase 1: matrix 598 rows 665 cols
[2021-05-11 20:44:02] [INFO ] Computed 107 place invariants in 9 ms
[2021-05-11 20:44:02] [INFO ] [Real]Absence check using 64 positive place invariants in 25 ms returned sat
[2021-05-11 20:44:02] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 14 ms returned sat
[2021-05-11 20:44:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:03] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 7 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 155 places in 223 ms of which 2 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 158 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 50 places in 155 ms of which 1 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 152 places in 148 ms of which 1 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 157 places in 202 ms of which 1 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 154 places in 196 ms of which 0 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 148 places in 174 ms of which 1 ms to minimize.
[2021-05-11 20:44:05] [INFO ] Deduced a trap composed of 186 places in 238 ms of which 1 ms to minimize.
[2021-05-11 20:44:05] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 1 ms to minimize.
[2021-05-11 20:44:05] [INFO ] Deduced a trap composed of 130 places in 163 ms of which 1 ms to minimize.
[2021-05-11 20:44:05] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:44:06] [INFO ] Deduced a trap composed of 168 places in 186 ms of which 0 ms to minimize.
[2021-05-11 20:44:06] [INFO ] Deduced a trap composed of 170 places in 144 ms of which 0 ms to minimize.
[2021-05-11 20:44:06] [INFO ] Deduced a trap composed of 169 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:44:06] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:44:06] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 0 ms to minimize.
[2021-05-11 20:44:07] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 1 ms to minimize.
[2021-05-11 20:44:07] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 1 ms to minimize.
[2021-05-11 20:44:07] [INFO ] Deduced a trap composed of 145 places in 172 ms of which 5 ms to minimize.
[2021-05-11 20:44:07] [INFO ] Deduced a trap composed of 138 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:44:07] [INFO ] Deduced a trap composed of 139 places in 179 ms of which 1 ms to minimize.
[2021-05-11 20:44:08] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 1 ms to minimize.
[2021-05-11 20:44:08] [INFO ] Deduced a trap composed of 137 places in 148 ms of which 1 ms to minimize.
[2021-05-11 20:44:08] [INFO ] Deduced a trap composed of 145 places in 177 ms of which 1 ms to minimize.
[2021-05-11 20:44:08] [INFO ] Deduced a trap composed of 145 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:44:08] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 1 ms to minimize.
[2021-05-11 20:44:08] [INFO ] Deduced a trap composed of 151 places in 195 ms of which 1 ms to minimize.
[2021-05-11 20:44:09] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 0 ms to minimize.
[2021-05-11 20:44:09] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 0 ms to minimize.
[2021-05-11 20:44:09] [INFO ] Deduced a trap composed of 43 places in 205 ms of which 0 ms to minimize.
[2021-05-11 20:44:09] [INFO ] Deduced a trap composed of 152 places in 175 ms of which 1 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 171 places in 181 ms of which 2 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 147 places in 193 ms of which 4 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 142 places in 176 ms of which 0 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 143 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:44:11] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:44:11] [INFO ] Deduced a trap composed of 156 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:44:11] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 0 ms to minimize.
[2021-05-11 20:44:11] [INFO ] Deduced a trap composed of 147 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:44:11] [INFO ] Deduced a trap composed of 153 places in 210 ms of which 1 ms to minimize.
[2021-05-11 20:44:12] [INFO ] Deduced a trap composed of 149 places in 191 ms of which 0 ms to minimize.
[2021-05-11 20:44:12] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 1 ms to minimize.
[2021-05-11 20:44:12] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 0 ms to minimize.
[2021-05-11 20:44:12] [INFO ] Deduced a trap composed of 146 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:44:13] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 1 ms to minimize.
[2021-05-11 20:44:13] [INFO ] Deduced a trap composed of 166 places in 154 ms of which 0 ms to minimize.
[2021-05-11 20:44:13] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 0 ms to minimize.
[2021-05-11 20:44:13] [INFO ] Deduced a trap composed of 158 places in 167 ms of which 1 ms to minimize.
[2021-05-11 20:44:13] [INFO ] Deduced a trap composed of 146 places in 202 ms of which 0 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 144 places in 228 ms of which 0 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 148 places in 175 ms of which 1 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 148 places in 202 ms of which 1 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 149 places in 174 ms of which 1 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 147 places in 164 ms of which 0 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 154 places in 189 ms of which 1 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 154 places in 176 ms of which 0 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 159 places in 185 ms of which 0 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 147 places in 190 ms of which 0 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 1 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 152 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 144 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 158 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 149 places in 180 ms of which 3 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 0 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 14070 ms
[2021-05-11 20:44:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:44:17] [INFO ] [Nat]Absence check using 64 positive place invariants in 26 ms returned sat
[2021-05-11 20:44:17] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 12 ms returned sat
[2021-05-11 20:44:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:17] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 0 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 155 places in 183 ms of which 0 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 0 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 1 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 1 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 152 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 157 places in 169 ms of which 1 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 154 places in 204 ms of which 0 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 148 places in 193 ms of which 1 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 186 places in 165 ms of which 1 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 132 places in 198 ms of which 1 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 146 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 151 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 0 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 139 places in 194 ms of which 0 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 144 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 0 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 144 places in 195 ms of which 1 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 1 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 1 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 142 places in 171 ms of which 0 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 0 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 1 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 143 places in 200 ms of which 1 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 1 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 153 places in 196 ms of which 0 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 147 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 153 places in 193 ms of which 0 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 157 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 156 places in 172 ms of which 0 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 134 places in 179 ms of which 0 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 0 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 159 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 158 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 163 places in 205 ms of which 1 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 1 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 146 places in 159 ms of which 1 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 154 places in 187 ms of which 1 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 157 places in 176 ms of which 1 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 144 places in 167 ms of which 1 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 150 places in 169 ms of which 1 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 149 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 150 places in 178 ms of which 0 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 153 places in 195 ms of which 0 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 136 places in 200 ms of which 1 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 143 places in 194 ms of which 0 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 1 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 0 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 149 places in 173 ms of which 1 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 149 places in 181 ms of which 1 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 154 places in 187 ms of which 1 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 153 places in 109 ms of which 1 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 136 places in 193 ms of which 1 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 152 places in 178 ms of which 1 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 143 places in 186 ms of which 1 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 1 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 131 places in 191 ms of which 1 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 154 places in 180 ms of which 1 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 151 places in 153 ms of which 0 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 157 places in 174 ms of which 1 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 143 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 148 places in 175 ms of which 1 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 154 places in 175 ms of which 1 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 143 places in 181 ms of which 0 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 151 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 149 places in 157 ms of which 0 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 148 places in 179 ms of which 1 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 159 places in 181 ms of which 1 ms to minimize.
[2021-05-11 20:44:33] [INFO ] Deduced a trap composed of 149 places in 183 ms of which 1 ms to minimize.
[2021-05-11 20:44:33] [INFO ] Deduced a trap composed of 153 places in 174 ms of which 1 ms to minimize.
[2021-05-11 20:44:33] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:44:33] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 1 ms to minimize.
[2021-05-11 20:44:33] [INFO ] Deduced a trap composed of 154 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:44:34] [INFO ] Deduced a trap composed of 153 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:44:34] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 0 ms to minimize.
[2021-05-11 20:44:34] [INFO ] Deduced a trap composed of 153 places in 169 ms of which 0 ms to minimize.
[2021-05-11 20:44:34] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 0 ms to minimize.
[2021-05-11 20:44:35] [INFO ] Deduced a trap composed of 144 places in 207 ms of which 0 ms to minimize.
[2021-05-11 20:44:35] [INFO ] Deduced a trap composed of 144 places in 188 ms of which 1 ms to minimize.
[2021-05-11 20:44:35] [INFO ] Deduced a trap composed of 145 places in 189 ms of which 0 ms to minimize.
[2021-05-11 20:44:35] [INFO ] Deduced a trap composed of 144 places in 193 ms of which 1 ms to minimize.
[2021-05-11 20:44:36] [INFO ] Deduced a trap composed of 150 places in 180 ms of which 0 ms to minimize.
[2021-05-11 20:44:36] [INFO ] Deduced a trap composed of 153 places in 182 ms of which 1 ms to minimize.
[2021-05-11 20:44:36] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2021-05-11 20:44:36] [INFO ] Deduced a trap composed of 164 places in 181 ms of which 1 ms to minimize.
[2021-05-11 20:44:36] [INFO ] Deduced a trap composed of 149 places in 162 ms of which 1 ms to minimize.
[2021-05-11 20:44:37] [INFO ] Deduced a trap composed of 143 places in 197 ms of which 0 ms to minimize.
[2021-05-11 20:44:37] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 1 ms to minimize.
[2021-05-11 20:44:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-11 20:44:37] [INFO ] [Real]Absence check using 64 positive place invariants in 26 ms returned sat
[2021-05-11 20:44:37] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 11 ms returned sat
[2021-05-11 20:44:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:37] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2021-05-11 20:44:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:44:37] [INFO ] [Nat]Absence check using 64 positive place invariants in 30 ms returned sat
[2021-05-11 20:44:37] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 13 ms returned sat
[2021-05-11 20:44:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:38] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2021-05-11 20:44:38] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 1 ms to minimize.
[2021-05-11 20:44:38] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 1 ms to minimize.
[2021-05-11 20:44:38] [INFO ] Deduced a trap composed of 140 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:44:39] [INFO ] Deduced a trap composed of 150 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:44:39] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 0 ms to minimize.
[2021-05-11 20:44:39] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2021-05-11 20:44:39] [INFO ] Deduced a trap composed of 148 places in 194 ms of which 0 ms to minimize.
[2021-05-11 20:44:39] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 1 ms to minimize.
[2021-05-11 20:44:40] [INFO ] Deduced a trap composed of 155 places in 175 ms of which 0 ms to minimize.
[2021-05-11 20:44:40] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 0 ms to minimize.
[2021-05-11 20:44:40] [INFO ] Deduced a trap composed of 154 places in 216 ms of which 1 ms to minimize.
[2021-05-11 20:44:40] [INFO ] Deduced a trap composed of 159 places in 185 ms of which 1 ms to minimize.
[2021-05-11 20:44:40] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2021-05-11 20:44:40] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:44:41] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2021-05-11 20:44:41] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 0 ms to minimize.
[2021-05-11 20:44:41] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2021-05-11 20:44:41] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 0 ms to minimize.
[2021-05-11 20:44:41] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3150 ms
[2021-05-11 20:44:41] [INFO ] Computed and/alt/rep : 559/914/559 causal constraints (skipped 38 transitions) in 55 ms.
[2021-05-11 20:44:45] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 1 ms to minimize.
[2021-05-11 20:44:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2021-05-11 20:44:45] [INFO ] Added : 403 causal constraints over 81 iterations in 4115 ms. Result :sat
[2021-05-11 20:44:45] [INFO ] [Real]Absence check using 64 positive place invariants in 46 ms returned sat
[2021-05-11 20:44:45] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 11 ms returned sat
[2021-05-11 20:44:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:45] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2021-05-11 20:44:46] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 1 ms to minimize.
[2021-05-11 20:44:46] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 1 ms to minimize.
[2021-05-11 20:44:46] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 1 ms to minimize.
[2021-05-11 20:44:46] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 0 ms to minimize.
[2021-05-11 20:44:46] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2021-05-11 20:44:47] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 1 ms to minimize.
[2021-05-11 20:44:47] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 1 ms to minimize.
[2021-05-11 20:44:47] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 0 ms to minimize.
[2021-05-11 20:44:47] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 1 ms to minimize.
[2021-05-11 20:44:48] [INFO ] Deduced a trap composed of 120 places in 197 ms of which 1 ms to minimize.
[2021-05-11 20:44:48] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 1 ms to minimize.
[2021-05-11 20:44:48] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 1 ms to minimize.
[2021-05-11 20:44:48] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 1 ms to minimize.
[2021-05-11 20:44:48] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 0 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Deduced a trap composed of 112 places in 171 ms of which 1 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 0 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Deduced a trap composed of 111 places in 179 ms of which 1 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 0 ms to minimize.
[2021-05-11 20:44:50] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 1 ms to minimize.
[2021-05-11 20:44:50] [INFO ] Deduced a trap composed of 113 places in 158 ms of which 0 ms to minimize.
[2021-05-11 20:44:50] [INFO ] Deduced a trap composed of 119 places in 165 ms of which 1 ms to minimize.
[2021-05-11 20:44:50] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:44:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 23 trap constraints in 4917 ms
[2021-05-11 20:44:50] [INFO ] [Real]Absence check using 64 positive place invariants in 20 ms returned sat
[2021-05-11 20:44:50] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 24 ms returned sat
[2021-05-11 20:44:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:51] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2021-05-11 20:44:51] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 1 ms to minimize.
[2021-05-11 20:44:51] [INFO ] Deduced a trap composed of 142 places in 221 ms of which 1 ms to minimize.
[2021-05-11 20:44:51] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 1 ms to minimize.
[2021-05-11 20:44:52] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 1 ms to minimize.
[2021-05-11 20:44:52] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 1 ms to minimize.
[2021-05-11 20:44:52] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 1 ms to minimize.
[2021-05-11 20:44:52] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 1 ms to minimize.
[2021-05-11 20:44:52] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 1 ms to minimize.
[2021-05-11 20:44:53] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 1 ms to minimize.
[2021-05-11 20:44:53] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 1 ms to minimize.
[2021-05-11 20:44:53] [INFO ] Deduced a trap composed of 148 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:44:53] [INFO ] Deduced a trap composed of 153 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:44:53] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 0 ms to minimize.
[2021-05-11 20:44:54] [INFO ] Deduced a trap composed of 153 places in 197 ms of which 0 ms to minimize.
[2021-05-11 20:44:54] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 1 ms to minimize.
[2021-05-11 20:44:54] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 0 ms to minimize.
[2021-05-11 20:44:54] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 1 ms to minimize.
[2021-05-11 20:44:55] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 1 ms to minimize.
[2021-05-11 20:44:55] [INFO ] Deduced a trap composed of 136 places in 188 ms of which 1 ms to minimize.
[2021-05-11 20:44:55] [INFO ] Deduced a trap composed of 154 places in 189 ms of which 1 ms to minimize.
[2021-05-11 20:44:55] [INFO ] Deduced a trap composed of 130 places in 181 ms of which 0 ms to minimize.
[2021-05-11 20:44:56] [INFO ] Deduced a trap composed of 150 places in 179 ms of which 0 ms to minimize.
[2021-05-11 20:44:56] [INFO ] Deduced a trap composed of 133 places in 165 ms of which 0 ms to minimize.
[2021-05-11 20:44:56] [INFO ] Deduced a trap composed of 136 places in 182 ms of which 0 ms to minimize.
[2021-05-11 20:44:56] [INFO ] Deduced a trap composed of 135 places in 160 ms of which 0 ms to minimize.
[2021-05-11 20:44:56] [INFO ] Deduced a trap composed of 153 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:44:56] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 1 ms to minimize.
[2021-05-11 20:44:57] [INFO ] Deduced a trap composed of 132 places in 158 ms of which 2 ms to minimize.
[2021-05-11 20:44:57] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 0 ms to minimize.
[2021-05-11 20:44:57] [INFO ] Deduced a trap composed of 134 places in 158 ms of which 0 ms to minimize.
[2021-05-11 20:44:57] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 0 ms to minimize.
[2021-05-11 20:44:57] [INFO ] Deduced a trap composed of 134 places in 195 ms of which 1 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 129 places in 192 ms of which 0 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 142 places in 186 ms of which 1 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 139 places in 164 ms of which 0 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 132 places in 172 ms of which 0 ms to minimize.
[2021-05-11 20:44:59] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 1 ms to minimize.
[2021-05-11 20:44:59] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 0 ms to minimize.
[2021-05-11 20:44:59] [INFO ] Deduced a trap composed of 128 places in 193 ms of which 0 ms to minimize.
[2021-05-11 20:44:59] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 0 ms to minimize.
[2021-05-11 20:44:59] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 0 ms to minimize.
[2021-05-11 20:45:00] [INFO ] Deduced a trap composed of 147 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:45:00] [INFO ] Deduced a trap composed of 127 places in 153 ms of which 0 ms to minimize.
[2021-05-11 20:45:00] [INFO ] Deduced a trap composed of 142 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:45:00] [INFO ] Deduced a trap composed of 145 places in 160 ms of which 0 ms to minimize.
[2021-05-11 20:45:00] [INFO ] Deduced a trap composed of 157 places in 188 ms of which 1 ms to minimize.
[2021-05-11 20:45:01] [INFO ] Deduced a trap composed of 151 places in 188 ms of which 1 ms to minimize.
[2021-05-11 20:45:01] [INFO ] Deduced a trap composed of 145 places in 166 ms of which 0 ms to minimize.
[2021-05-11 20:45:01] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:45:01] [INFO ] Deduced a trap composed of 129 places in 175 ms of which 1 ms to minimize.
[2021-05-11 20:45:02] [INFO ] Deduced a trap composed of 142 places in 195 ms of which 1 ms to minimize.
[2021-05-11 20:45:02] [INFO ] Deduced a trap composed of 130 places in 155 ms of which 1 ms to minimize.
[2021-05-11 20:45:02] [INFO ] Deduced a trap composed of 140 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:45:02] [INFO ] Deduced a trap composed of 148 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:45:02] [INFO ] Deduced a trap composed of 151 places in 191 ms of which 1 ms to minimize.
[2021-05-11 20:45:03] [INFO ] Deduced a trap composed of 142 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:45:03] [INFO ] Deduced a trap composed of 142 places in 183 ms of which 0 ms to minimize.
[2021-05-11 20:45:03] [INFO ] Deduced a trap composed of 148 places in 194 ms of which 0 ms to minimize.
[2021-05-11 20:45:03] [INFO ] Deduced a trap composed of 135 places in 185 ms of which 0 ms to minimize.
[2021-05-11 20:45:03] [INFO ] Deduced a trap composed of 127 places in 187 ms of which 0 ms to minimize.
[2021-05-11 20:45:04] [INFO ] Deduced a trap composed of 139 places in 186 ms of which 1 ms to minimize.
[2021-05-11 20:45:04] [INFO ] Deduced a trap composed of 137 places in 189 ms of which 0 ms to minimize.
[2021-05-11 20:45:04] [INFO ] Deduced a trap composed of 138 places in 178 ms of which 1 ms to minimize.
[2021-05-11 20:45:04] [INFO ] Deduced a trap composed of 142 places in 159 ms of which 0 ms to minimize.
[2021-05-11 20:45:04] [INFO ] Deduced a trap composed of 144 places in 178 ms of which 1 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 152 places in 184 ms of which 0 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 133 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 0 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 133 places in 128 ms of which 0 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:45:06] [INFO ] Deduced a trap composed of 133 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:45:06] [INFO ] Deduced a trap composed of 141 places in 165 ms of which 1 ms to minimize.
[2021-05-11 20:45:06] [INFO ] Deduced a trap composed of 129 places in 167 ms of which 0 ms to minimize.
[2021-05-11 20:45:06] [INFO ] Deduced a trap composed of 133 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:45:06] [INFO ] Deduced a trap composed of 139 places in 151 ms of which 0 ms to minimize.
[2021-05-11 20:45:07] [INFO ] Deduced a trap composed of 133 places in 182 ms of which 1 ms to minimize.
[2021-05-11 20:45:07] [INFO ] Deduced a trap composed of 134 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:45:07] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 1 ms to minimize.
[2021-05-11 20:45:07] [INFO ] Deduced a trap composed of 132 places in 174 ms of which 0 ms to minimize.
[2021-05-11 20:45:07] [INFO ] Deduced a trap composed of 128 places in 161 ms of which 0 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 133 places in 169 ms of which 1 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 137 places in 175 ms of which 0 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 149 places in 167 ms of which 1 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 149 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 143 places in 174 ms of which 0 ms to minimize.
[2021-05-11 20:45:09] [INFO ] Deduced a trap composed of 147 places in 144 ms of which 1 ms to minimize.
[2021-05-11 20:45:09] [INFO ] Deduced a trap composed of 133 places in 145 ms of which 1 ms to minimize.
[2021-05-11 20:45:09] [INFO ] Deduced a trap composed of 140 places in 181 ms of which 1 ms to minimize.
[2021-05-11 20:45:09] [INFO ] Deduced a trap composed of 126 places in 189 ms of which 1 ms to minimize.
[2021-05-11 20:45:09] [INFO ] Deduced a trap composed of 134 places in 167 ms of which 0 ms to minimize.
[2021-05-11 20:45:10] [INFO ] Deduced a trap composed of 136 places in 187 ms of which 0 ms to minimize.
[2021-05-11 20:45:10] [INFO ] Deduced a trap composed of 139 places in 180 ms of which 1 ms to minimize.
[2021-05-11 20:45:10] [INFO ] Deduced a trap composed of 145 places in 186 ms of which 1 ms to minimize.
[2021-05-11 20:45:10] [INFO ] Deduced a trap composed of 138 places in 190 ms of which 0 ms to minimize.
[2021-05-11 20:45:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-11 20:45:10] [INFO ] [Real]Absence check using 64 positive place invariants in 26 ms returned sat
[2021-05-11 20:45:10] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 13 ms returned sat
[2021-05-11 20:45:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:45:11] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2021-05-11 20:45:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:45:11] [INFO ] [Nat]Absence check using 64 positive place invariants in 27 ms returned sat
[2021-05-11 20:45:11] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 13 ms returned sat
[2021-05-11 20:45:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:45:11] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2021-05-11 20:45:11] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2021-05-11 20:45:11] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 0 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 0 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 0 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 0 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 0 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1850 ms
[2021-05-11 20:45:13] [INFO ] Computed and/alt/rep : 559/914/559 causal constraints (skipped 38 transitions) in 24 ms.
[2021-05-11 20:45:17] [INFO ] Added : 383 causal constraints over 77 iterations in 3661 ms. Result :sat
[2021-05-11 20:45:17] [INFO ] [Real]Absence check using 64 positive place invariants in 23 ms returned sat
[2021-05-11 20:45:17] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 12 ms returned sat
[2021-05-11 20:45:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:45:17] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2021-05-11 20:45:17] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2021-05-11 20:45:17] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2021-05-11 20:45:18] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2021-05-11 20:45:18] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2021-05-11 20:45:18] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:45:18] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2021-05-11 20:45:18] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2021-05-11 20:45:18] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2021-05-11 20:45:18] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2021-05-11 20:45:18] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2021-05-11 20:45:18] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2021-05-11 20:45:18] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1351 ms
[2021-05-11 20:45:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:45:19] [INFO ] [Nat]Absence check using 64 positive place invariants in 26 ms returned sat
[2021-05-11 20:45:19] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 11 ms returned sat
[2021-05-11 20:45:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:45:19] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2021-05-11 20:45:19] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
[2021-05-11 20:45:19] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2021-05-11 20:45:19] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2021-05-11 20:45:19] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:45:20] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 1 ms to minimize.
[2021-05-11 20:45:20] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2021-05-11 20:45:20] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 0 ms to minimize.
[2021-05-11 20:45:20] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2021-05-11 20:45:20] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2021-05-11 20:45:20] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2021-05-11 20:45:20] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2021-05-11 20:45:20] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1246 ms
[2021-05-11 20:45:20] [INFO ] Computed and/alt/rep : 559/914/559 causal constraints (skipped 38 transitions) in 42 ms.
[2021-05-11 20:45:23] [INFO ] Added : 358 causal constraints over 72 iterations in 2449 ms. Result :sat
[2021-05-11 20:45:23] [INFO ] [Real]Absence check using 64 positive place invariants in 27 ms returned sat
[2021-05-11 20:45:23] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 14 ms returned sat
[2021-05-11 20:45:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:45:23] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2021-05-11 20:45:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:45:23] [INFO ] [Nat]Absence check using 64 positive place invariants in 27 ms returned sat
[2021-05-11 20:45:23] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 12 ms returned sat
[2021-05-11 20:45:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:45:23] [INFO ] [Nat]Absence check using state equation in 197 ms returned unsat
[2021-05-11 20:45:23] [INFO ] [Real]Absence check using 64 positive place invariants in 19 ms returned sat
[2021-05-11 20:45:23] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 11 ms returned sat
[2021-05-11 20:45:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:45:24] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2021-05-11 20:45:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:45:24] [INFO ] [Nat]Absence check using 64 positive place invariants in 32 ms returned sat
[2021-05-11 20:45:24] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 16 ms returned sat
[2021-05-11 20:45:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:45:24] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2021-05-11 20:45:24] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:45:25] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2021-05-11 20:45:25] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2021-05-11 20:45:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 525 ms
[2021-05-11 20:45:25] [INFO ] Computed and/alt/rep : 559/914/559 causal constraints (skipped 38 transitions) in 33 ms.
[2021-05-11 20:45:27] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 1 ms to minimize.
[2021-05-11 20:45:28] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 0 ms to minimize.
[2021-05-11 20:45:28] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 0 ms to minimize.
[2021-05-11 20:45:28] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2021-05-11 20:45:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 723 ms
[2021-05-11 20:45:28] [INFO ] Added : 354 causal constraints over 72 iterations in 3578 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 665 transition count 501
Reduce places removed 97 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 105 rules applied. Total rules applied 202 place count 568 transition count 493
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 210 place count 560 transition count 493
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 117 Pre rules applied. Total rules applied 210 place count 560 transition count 376
Deduced a syphon composed of 117 places in 2 ms
Ensure Unique test removed 20 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 464 place count 423 transition count 376
Discarding 77 places :
Symmetric choice reduction at 3 with 77 rule applications. Total rules 541 place count 346 transition count 299
Iterating global reduction 3 with 77 rules applied. Total rules applied 618 place count 346 transition count 299
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 618 place count 346 transition count 293
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 631 place count 339 transition count 293
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 843 place count 232 transition count 188
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 844 place count 232 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 845 place count 232 transition count 187
Applied a total of 845 rules in 263 ms. Remains 232 /665 variables (removed 433) and now considering 187/598 (removed 411) transitions.
[2021-05-11 20:45:29] [INFO ] Flatten gal took : 31 ms
[2021-05-11 20:45:29] [INFO ] Flatten gal took : 34 ms
[2021-05-11 20:45:29] [INFO ] Input system was already deterministic with 187 transitions.
[2021-05-11 20:45:29] [INFO ] Flatten gal took : 30 ms
[2021-05-11 20:45:29] [INFO ] Flatten gal took : 16 ms
[2021-05-11 20:45:29] [INFO ] Time to serialize gal into /tmp/CTLFireability11295604194301059806.gal : 35 ms
[2021-05-11 20:45:29] [INFO ] Time to serialize properties into /tmp/CTLFireability693037785372669953.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11295604194301059806.gal, -t, CGAL, -ctl, /tmp/CTLFireability693037785372669953.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.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11295604194301059806.gal -t CGAL -ctl /tmp/CTLFireability693037785372669953.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 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,4.27919e+14,18.0832,455412,2,140090,5,1.62025e+06,6,0,1116,2.11167e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2021-05-11 20:45:59] [INFO ] Flatten gal took : 10 ms
[2021-05-11 20:45:59] [INFO ] Applying decomposition
[2021-05-11 20:45:59] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7948197185453514004.txt, -o, /tmp/graph7948197185453514004.bin, -w, /tmp/graph7948197185453514004.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7948197185453514004.bin, -l, -1, -v, -w, /tmp/graph7948197185453514004.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:45:59] [INFO ] Decomposing Gal with order
[2021-05-11 20:45:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:45:59] [INFO ] Removed a total of 110 redundant transitions.
[2021-05-11 20:45:59] [INFO ] Flatten gal took : 58 ms
[2021-05-11 20:45:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 16 ms.
[2021-05-11 20:45:59] [INFO ] Time to serialize gal into /tmp/CTLFireability2183486895419152053.gal : 6 ms
[2021-05-11 20:45:59] [INFO ] Time to serialize properties into /tmp/CTLFireability5792503976363755373.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability2183486895419152053.gal, -t, CGAL, -ctl, /tmp/CTLFireability5792503976363755373.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability2183486895419152053.gal -t CGAL -ctl /tmp/CTLFireability5792503976363755373.ctl
No direction supplied, using forward translation only.
Parsed 1 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,4.27919e+14,2.69975,75036,1995,504,131799,4779,704,372832,194,12683,0


Converting to forward existential form...Done !
original formula: (EG(EF((EG(A(((((i0.u2.p48==1)&&(i0.u60.p582==1))||(i6.u34.p769==1))||(i11.i1.i2.u65.p677==1)) U (((((i5.u30.p358==1)||(i4.u22.p304==1))||(i7.u11.p215==1))||(i5.u68.p707==1))||(i9.u1.p27==1)))) * (((((AF(((((i0.u4.p64==1)&&(i0.u60.p582==1))||(((i7.u12.p214==1)&&(i7.u48.p511==1))&&(i11.i1.i2.u71.p747==1)))||(i8.u15.p248==1))) * AG(((((i5.u30.p357==1)||(i4.u21.p290==1))||(i5.u6.p132==1))||(i6.u35.p429==1)))) + (((i1.u5.p122==1)&&(i1.u37.p442==1))&&(i1.u61.p618==1))) + (i10.u41.p483==1)) + (i4.u22.p305==1)) + ((i5.u68.p707==0)&&((u32.p106==0)||(i6.u34.p109==0))))))) + E((((((((i11.i1.i0.u24.p0==1)||(i11.i1.i2.u71.p649==1))||(i4.u18.p272==1))||(((i0.u3.p40==1)&&(i1.u27.p387==1))&&(i0.u60.p581==1)))||(i1.u23.p319==1))||(i11.i1.i2.u71.p727==1))||(((u33.p102==1)&&(u33.p422==1))&&(u33.p761==1))) U ((((((((i4.u21.p289==1)&&(i4.u58.p561==1))&&(i11.i1.i2.u71.p747==1))||(i7.u47.p513==1))||(i11.i1.i0.u24.p322==1))||(i4.u0.p8==1))||(i7.u48.p510==1))||(i11.i1.i2.u69.p708==1))))
=> equivalent forward existential formula: ([FwdG(Init,E(TRUE U (EG(!((E(!((((((i5.u30.p358==1)||(i4.u22.p304==1))||(i7.u11.p215==1))||(i5.u68.p707==1))||(i9.u1.p27==1))) U (!(((((i0.u2.p48==1)&&(i0.u60.p582==1))||(i6.u34.p769==1))||(i11.i1.i2.u65.p677==1))) * !((((((i5.u30.p358==1)||(i4.u22.p304==1))||(i7.u11.p215==1))||(i5.u68.p707==1))||(i9.u1.p27==1))))) + EG(!((((((i5.u30.p358==1)||(i4.u22.p304==1))||(i7.u11.p215==1))||(i5.u68.p707==1))||(i9.u1.p27==1))))))) * (((((!(EG(!(((((i0.u4.p64==1)&&(i0.u60.p582==1))||(((i7.u12.p214==1)&&(i7.u48.p511==1))&&(i11.i1.i2.u71.p747==1)))||(i8.u15.p248==1))))) * !(E(TRUE U !(((((i5.u30.p357==1)||(i4.u21.p290==1))||(i5.u6.p132==1))||(i6.u35.p429==1)))))) + (((i1.u5.p122==1)&&(i1.u37.p442==1))&&(i1.u61.p618==1))) + (i10.u41.p483==1)) + (i4.u22.p305==1)) + ((i5.u68.p707==0)&&((u32.p106==0)||(i6.u34.p109==0)))))))] != FALSE + [(FwdU(Init,(((((((i11.i1.i0.u24.p0==1)||(i11.i1.i2.u71.p649==1))||(i4.u18.p272==1))||(((i0.u3.p40==1)&&(i1.u27.p387==1))&&(i0.u60.p581==1)))||(i1.u23.p319==1))||(i11.i1.i2.u71.p727==1))||(((u33.p102==1)&&(u33.p422==1))&&(u33.p761==1)))) * ((((((((i4.u21.p289==1)&&(i4.u58.p561==1))&&(i11.i1.i2.u71.p747==1))||(i7.u47.p513==1))||(i11.i1.i0.u24.p322==1))||(i4.u0.p8==1))||(i7.u48.p510==1))||(i11.i1.i2.u69.p708==1)))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t36, t65, t69, t76, t77, t78, t87, t88, t91, t92, t93, t94, t119, t120, t130, t132, t134, t136, t142, t150, t151, t158, t162, t163, t165, t166, t168, t169, t171, t173, i1.u23.t73, i4.u22.t20, i4.u18.t72, i4.u21.t23, i5.t143, i5.u6.t70, i5.u30.t17, i6.u35.t74, i7.t13, i7.u11.t25, i7.u12.t80, i7.u48.t14, i8.u15.t71, i10.u9.t79, i10.u41.t16, i11.t172, i11.t170, i11.i1.i0.u24.t18, i11.i1.i2.t6, i11.i1.i2.t3, i11.i1.i2.u71.t1, i11.i1.i2.u71.t7, i11.i1.i2.u71.t95, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :25/96/53/174
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
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
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
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
Detected timeout of ITS tools.
Graph (trivial) has 339 edges and 665 vertex of which 7 / 665 are part of one of the 1 SCC in 12 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 658 transition count 475
Reduce places removed 115 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 121 rules applied. Total rules applied 237 place count 543 transition count 469
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 243 place count 537 transition count 469
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 243 place count 537 transition count 369
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 462 place count 418 transition count 369
Discarding 71 places :
Symmetric choice reduction at 3 with 71 rule applications. Total rules 533 place count 347 transition count 298
Iterating global reduction 3 with 71 rules applied. Total rules applied 604 place count 347 transition count 298
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 604 place count 347 transition count 295
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 611 place count 343 transition count 295
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 841 place count 227 transition count 181
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 845 place count 225 transition count 183
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 850 place count 225 transition count 183
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 851 place count 224 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 852 place count 223 transition count 182
Applied a total of 852 rules in 143 ms. Remains 223 /665 variables (removed 442) and now considering 182/598 (removed 416) transitions.
[2021-05-11 20:46:30] [INFO ] Flatten gal took : 16 ms
[2021-05-11 20:46:30] [INFO ] Flatten gal took : 15 ms
[2021-05-11 20:46:30] [INFO ] Input system was already deterministic with 182 transitions.
[2021-05-11 20:46:30] [INFO ] Flatten gal took : 13 ms
[2021-05-11 20:46:30] [INFO ] Flatten gal took : 13 ms
[2021-05-11 20:46:30] [INFO ] Time to serialize gal into /tmp/CTLFireability2392492725550923094.gal : 2 ms
[2021-05-11 20:46:30] [INFO ] Time to serialize properties into /tmp/CTLFireability8593599234185879113.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability2392492725550923094.gal, -t, CGAL, -ctl, /tmp/CTLFireability8593599234185879113.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.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability2392492725550923094.gal -t CGAL -ctl /tmp/CTLFireability8593599234185879113.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 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,4.66964e+12,9.23377,195372,2,63021,5,905416,6,0,1069,573700,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2021-05-11 20:47:00] [INFO ] Flatten gal took : 23 ms
[2021-05-11 20:47:00] [INFO ] Applying decomposition
[2021-05-11 20:47:00] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12738058577438870079.txt, -o, /tmp/graph12738058577438870079.bin, -w, /tmp/graph12738058577438870079.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12738058577438870079.bin, -l, -1, -v, -w, /tmp/graph12738058577438870079.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:47:00] [INFO ] Decomposing Gal with order
[2021-05-11 20:47:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:47:00] [INFO ] Removed a total of 194 redundant transitions.
[2021-05-11 20:47:00] [INFO ] Flatten gal took : 28 ms
[2021-05-11 20:47:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 8 ms.
[2021-05-11 20:47:00] [INFO ] Time to serialize gal into /tmp/CTLFireability16910162529259079949.gal : 4 ms
[2021-05-11 20:47:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13221540653090784648.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability16910162529259079949.gal, -t, CGAL, -ctl, /tmp/CTLFireability13221540653090784648.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability16910162529259079949.gal -t CGAL -ctl /tmp/CTLFireability13221540653090784648.ctl
No direction supplied, using forward translation only.
Parsed 1 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,4.66964e+12,1.28225,40624,1397,440,61044,3104,671,183017,145,11755,0


Converting to forward existential form...Done !
original formula: AG(!(E(EG((((((((i10.u0.p32==1)||(i4.u36.p420==1))||(i11.u78.p745==1))||(i0.u2.p57==1))||(((i4.u8.p102==1)&&(i4.u36.p422==1))&&(i5.u63.p608==1)))||(i10.u10.p123==1))||(i11.u79.p659==1))) U A(AF(((((((i10.u11.p129==1)||(i11.u69.p671==1))||(i3.u35.p70==1))||(i6.u46.p493==1))||(i7.i0.i0.u17.p216==1))||(i9.u1.p46==1))) U ((((((i7.i1.i1.u39.p438==1)||(((i3.u35.p105==1)&&(i3.u35.p417==1))&&(i3.u35.p749==1)))||(((i5.u7.p96==1)&&(i5.u37.p427==1))&&(i5.u63.p611==1)))&&(i11.u75.p726==1))&&(((i11.u79.p713==1)||(i2.u32.p403==1))||(i9.u29.p384==1)))&&((((((i1.u12.p181==1)&&(i1.u13.p184==1))||(i8.u24.p272==1))||(i1.u12.p182==1))||(i0.u23.p269==1))||(i11.u79.p610==1)))))))
=> equivalent forward existential formula: [((FwdU(FwdU(Init,TRUE),EG((((((((i10.u0.p32==1)||(i4.u36.p420==1))||(i11.u78.p745==1))||(i0.u2.p57==1))||(((i4.u8.p102==1)&&(i4.u36.p422==1))&&(i5.u63.p608==1)))||(i10.u10.p123==1))||(i11.u79.p659==1)))) * !(EG(!(((((((i7.i1.i1.u39.p438==1)||(((i3.u35.p105==1)&&(i3.u35.p417==1))&&(i3.u35.p749==1)))||(((i5.u7.p96==1)&&(i5.u37.p427==1))&&(i5.u63.p611==1)))&&(i11.u75.p726==1))&&(((i11.u79.p713==1)||(i2.u32.p403==1))||(i9.u29.p384==1)))&&((((((i1.u12.p181==1)&&(i1.u13.p184==1))||(i8.u24.p272==1))||(i1.u12.p182==1))||(i0.u23.p269==1))||(i11.u79.p610==1))))))) * !(E(!(((((((i7.i1.i1.u39.p438==1)||(((i3.u35.p105==1)&&(i3.u35.p417==1))&&(i3.u35.p749==1)))||(((i5.u7.p96==1)&&(i5.u37.p427==1))&&(i5.u63.p611==1)))&&(i11.u75.p726==1))&&(((i11.u79.p713==1)||(i2.u32.p403==1))||(i9.u29.p384==1)))&&((((((i1.u12.p181==1)&&(i1.u13.p184==1))||(i8.u24.p272==1))||(i1.u12.p182==1))||(i0.u23.p269==1))||(i11.u79.p610==1)))) U (!(!(EG(!(((((((i10.u11.p129==1)||(i11.u69.p671==1))||(i3.u35.p70==1))||(i6.u46.p493==1))||(i7.i0.i0.u17.p216==1))||(i9.u1.p46==1)))))) * !(((((((i7.i1.i1.u39.p438==1)||(((i3.u35.p105==1)&&(i3.u35.p417==1))&&(i3.u35.p749==1)))||(((i5.u7.p96==1)&&(i5.u37.p427==1))&&(i5.u63.p611==1)))&&(i11.u75.p726==1))&&(((i11.u79.p713==1)||(i2.u32.p403==1))||(i9.u29.p384==1)))&&((((((i1.u12.p181==1)&&(i1.u13.p184==1))||(i8.u24.p272==1))||(i1.u12.p182==1))||(i0.u23.p269==1))||(i11.u79.p610==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t91, t92, t93, t101, t102, t103, t104, t134, t140, t142, t143, t146, t148, t149, t150, t151, t152, t153, t155, t156, t157, t158, t159, t160, t161, t162, t163, t171, i2.u32.t19, i3.u35.t25, i4.u36.t17, i4.u36.t96, i6.u46.t14, i6.u15.t94, i7.i0.i0.u17.t84, i7.i1.i1.u39.t16, i8.u24.t86, i9.u1.t129, i9.u1.t130, i9.u29.t87, i11.t7, i11.t4, i11.t2, i11.u79.t5, i11.u79.t8, i11.u79.t88, i11.u79.t105, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :27/95/47/169
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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 a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an 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
(forward)formula 0,1,7.87134,174064,1,0,268960,7351,3592,661431,996,38672,468365
FORMULA BusinessProcesses-PT-20-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Reduce places removed 1 places and 1 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 664 transition count 494
Reduce places removed 103 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 109 rules applied. Total rules applied 212 place count 561 transition count 488
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 218 place count 555 transition count 488
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 126 Pre rules applied. Total rules applied 218 place count 555 transition count 362
Deduced a syphon composed of 126 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 273 rules applied. Total rules applied 491 place count 408 transition count 362
Discarding 83 places :
Symmetric choice reduction at 3 with 83 rule applications. Total rules 574 place count 325 transition count 279
Iterating global reduction 3 with 83 rules applied. Total rules applied 657 place count 325 transition count 279
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 657 place count 325 transition count 272
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 673 place count 316 transition count 272
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 897 place count 203 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 898 place count 203 transition count 160
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 900 place count 202 transition count 163
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 906 place count 202 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 907 place count 201 transition count 162
Applied a total of 907 rules in 181 ms. Remains 201 /665 variables (removed 464) and now considering 162/598 (removed 436) transitions.
[2021-05-11 20:47:08] [INFO ] Flatten gal took : 33 ms
[2021-05-11 20:47:08] [INFO ] Flatten gal took : 11 ms
[2021-05-11 20:47:08] [INFO ] Input system was already deterministic with 162 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
FORMULA BusinessProcesses-PT-20-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Graph (trivial) has 368 edges and 665 vertex of which 7 / 665 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 134 place count 658 transition count 457
Reduce places removed 133 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 134 rules applied. Total rules applied 268 place count 525 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 269 place count 524 transition count 456
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 269 place count 524 transition count 353
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 495 place count 401 transition count 353
Discarding 84 places :
Symmetric choice reduction at 3 with 84 rule applications. Total rules 579 place count 317 transition count 269
Iterating global reduction 3 with 84 rules applied. Total rules applied 663 place count 317 transition count 269
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 663 place count 317 transition count 261
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 681 place count 307 transition count 261
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 909 place count 192 transition count 148
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 915 place count 189 transition count 154
Applied a total of 915 rules in 49 ms. Remains 189 /665 variables (removed 476) and now considering 154/598 (removed 444) transitions.
[2021-05-11 20:47:08] [INFO ] Flatten gal took : 8 ms
[2021-05-11 20:47:08] [INFO ] Flatten gal took : 12 ms
[2021-05-11 20:47:08] [INFO ] Input system was already deterministic with 154 transitions.
Finished random walk after 520 steps, including 94 resets, run visited all 1 properties in 7 ms. (steps per millisecond=74 )
FORMULA BusinessProcesses-PT-20-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Graph (trivial) has 370 edges and 665 vertex of which 7 / 665 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 134 place count 658 transition count 457
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 267 place count 525 transition count 457
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 267 place count 525 transition count 351
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 501 place count 397 transition count 351
Discarding 83 places :
Symmetric choice reduction at 2 with 83 rule applications. Total rules 584 place count 314 transition count 268
Iterating global reduction 2 with 83 rules applied. Total rules applied 667 place count 314 transition count 268
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 667 place count 314 transition count 261
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 683 place count 305 transition count 261
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 911 place count 190 transition count 148
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 917 place count 187 transition count 154
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 918 place count 186 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 919 place count 185 transition count 153
Applied a total of 919 rules in 85 ms. Remains 185 /665 variables (removed 480) and now considering 153/598 (removed 445) transitions.
[2021-05-11 20:47:08] [INFO ] Flatten gal took : 38 ms
[2021-05-11 20:47:08] [INFO ] Flatten gal took : 15 ms
[2021-05-11 20:47:08] [INFO ] Input system was already deterministic with 153 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
FORMULA BusinessProcesses-PT-20-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 664 transition count 505
Reduce places removed 92 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 102 rules applied. Total rules applied 194 place count 572 transition count 495
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 204 place count 562 transition count 495
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 204 place count 562 transition count 386
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 436 place count 439 transition count 386
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 515 place count 360 transition count 307
Iterating global reduction 3 with 79 rules applied. Total rules applied 594 place count 360 transition count 307
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 594 place count 360 transition count 301
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 608 place count 352 transition count 301
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 806 place count 252 transition count 203
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 810 place count 250 transition count 209
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 814 place count 250 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 815 place count 249 transition count 208
Applied a total of 815 rules in 73 ms. Remains 249 /665 variables (removed 416) and now considering 208/598 (removed 390) transitions.
[2021-05-11 20:47:08] [INFO ] Flatten gal took : 11 ms
[2021-05-11 20:47:08] [INFO ] Flatten gal took : 8 ms
[2021-05-11 20:47:08] [INFO ] Input system was already deterministic with 208 transitions.
[2021-05-11 20:47:08] [INFO ] Flatten gal took : 8 ms
[2021-05-11 20:47:08] [INFO ] Flatten gal took : 7 ms
[2021-05-11 20:47:08] [INFO ] Time to serialize gal into /tmp/CTLFireability5265381387837913456.gal : 1 ms
[2021-05-11 20:47:08] [INFO ] Time to serialize properties into /tmp/CTLFireability8164729137269072299.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability5265381387837913456.gal, -t, CGAL, -ctl, /tmp/CTLFireability8164729137269072299.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.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability5265381387837913456.gal -t CGAL -ctl /tmp/CTLFireability8164729137269072299.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 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.59957e+13,4.13338,100272,2,24630,5,360557,6,0,1203,397506,0


Converting to forward existential form...Done !
original formula: A(EF((!(EG(((((p600==0)&&((p112==0)||(p115==0)))&&(p627==0))&&(p281==0)))) + ((((((((((((p131==1)||(p18==1))||(p359==1))||(p539==1))||(p70==1))||(p414==1))||(p10==1))||(p11==1))||((p765==1)&&(p768==1)))||(((p111==1)&&(p422==1))&&(p608==1)))&&(((((((((p3==1)||(p655==1))||(p604==1))||(p435==1))||(p52==1))||(p29==1))||(p440==1))||((p203==1)&&(p206==1)))||(((p267==1)&&(p412==1))&&(p714==1))))&&(((((((((((p763==1)||(p98==1))||(p575==1))||(p232==1))||(p11==1))||(p474==1))||(p251==1))||(p212==1))||(p440==1))||(((p239==1)&&(p531==1))&&(p747==1)))||(((p252==1)&&(p416==1))&&(p747==1)))))) U EG(AG(E((((((((p597==1)||(p583==1))||(p598==1))||(p194==1))||(p744==1))||(p37==1))||(((p252==1)&&(p416==1))&&(p747==1))) U EF((p353==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!(E(TRUE U !(E((((((((p597==1)||(p583==1))||(p598==1))||(p194==1))||(p744==1))||(p37==1))||(((p252==1)&&(p416==1))&&(p747==1))) U E(TRUE U (p353==1))))))))))) * !(E(!(EG(!(E(TRUE U !(E((((((((p597==1)||(p583==1))||(p598==1))||(p194==1))||(p744==1))||(p37==1))||(((p252==1)&&(p416==1))&&(p747==1))) U E(TRUE U (p353==1)))))))) U (!(E(TRUE U (!(EG(((((p600==0)&&((p112==0)||(p115==0)))&&(p627==0))&&(p281==0)))) + ((((((((((((p131==1)||(p18==1))||(p359==1))||(p539==1))||(p70==1))||(p414==1))||(p10==1))||(p11==1))||((p765==1)&&(p768==1)))||(((p111==1)&&(p422==1))&&(p608==1)))&&(((((((((p3==1)||(p655==1))||(p604==1))||(p435==1))||(p52==1))||(p29==1))||(p440==1))||((p203==1)&&(p206==1)))||(((p267==1)&&(p412==1))&&(p714==1))))&&(((((((((((p763==1)||(p98==1))||(p575==1))||(p232==1))||(p11==1))||(p474==1))||(p251==1))||(p212==1))||(p440==1))||(((p239==1)&&(p531==1))&&(p747==1)))||(((p252==1)&&(p416==1))&&(p747==1))))))) * !(EG(!(E(TRUE U !(E((((((((p597==1)||(p583==1))||(p598==1))||(p194==1))||(p744==1))||(p37==1))||(((p252==1)&&(p416==1))&&(p747==1))) U E(TRUE U (p353==1))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t12, t18, t19, t20, t21, t22, t25, t33, t38, t87, t88, t89, t93, t94, t95, t97, t98, t99, t100, t102, t108, t110, t112, t113, t124, t126, t139, t140, t141, t143, t144, t145, t152, t153, t155, t161, t162, t166, t167, t168, t169, t171, t172, t173, t174, t184, t185, t186, t187, t194, t195, t198, t199, t200, t201, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/115/57/208
Detected timeout of ITS tools.
[2021-05-11 20:47:38] [INFO ] Flatten gal took : 8 ms
[2021-05-11 20:47:38] [INFO ] Applying decomposition
[2021-05-11 20:47:38] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13295040640516318747.txt, -o, /tmp/graph13295040640516318747.bin, -w, /tmp/graph13295040640516318747.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13295040640516318747.bin, -l, -1, -v, -w, /tmp/graph13295040640516318747.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:47:39] [INFO ] Decomposing Gal with order
[2021-05-11 20:47:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:47:39] [INFO ] Removed a total of 163 redundant transitions.
[2021-05-11 20:47:39] [INFO ] Flatten gal took : 26 ms
[2021-05-11 20:47:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 9 ms.
[2021-05-11 20:47:39] [INFO ] Time to serialize gal into /tmp/CTLFireability17754256605655086978.gal : 3 ms
[2021-05-11 20:47:39] [INFO ] Time to serialize properties into /tmp/CTLFireability8304681708423460325.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability17754256605655086978.gal, -t, CGAL, -ctl, /tmp/CTLFireability8304681708423460325.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability17754256605655086978.gal -t CGAL -ctl /tmp/CTLFireability8304681708423460325.ctl
No direction supplied, using forward translation only.
Parsed 1 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.59957e+13,7.5671,159604,2492,589,336987,3707,821,503160,187,8105,0


Converting to forward existential form...Done !
original formula: A(EF((!(EG(((((u43.p600==0)&&((i6.u9.p112==0)||(u43.p115==0)))&&(i5.u72.p627==0))&&(i0.u29.p281==0)))) + ((((((((((((i5.u11.p131==1)||(i1.i1.u24.p18==1))||(i3.i0.u34.p359==1))||(i10.i2.u62.p539==1))||(u41.p70==1))||(u41.p414==1))||(i0.u1.p10==1))||(i0.u1.p11==1))||((u41.p765==1)&&(u43.p768==1)))||(((i6.u8.p111==1)&&(i6.u42.p422==1))&&(i6.u5.p608==1)))&&(((((((((i10.i0.u32.p3==1)||(i3.i1.u73.p655==1))||(u41.p604==1))||(i8.i1.u45.p435==1))||(i11.i0.u4.p52==1))||(i8.i0.u3.p29==1))||(i8.i1.u46.p440==1))||((i4.i0.u18.p203==1)&&(i4.i0.u19.p206==1)))||(((i0.u28.p267==1)&&(i0.u40.p412==1))&&(i0.u77.p714==1))))&&(((((((((((i6.u83.p763==1)||(u43.p98==1))||(i11.i1.u81.p575==1))||(i13.i2.u23.p232==1))||(i0.u1.p11==1))||(i12.u49.p474==1))||(i1.i0.u26.p251==1))||(i13.i3.u20.p212==1))||(i8.i1.u46.p440==1))||(((i1.i1.u25.p239==1)&&(i1.i0.u60.p531==1))&&(i11.i1.u81.p747==1)))||(((i1.i0.u27.p252==1)&&(u41.p416==1))&&(i11.i1.u81.p747==1)))))) U EG(AG(E((((((((i11.i1.u81.p597==1)||(i11.i1.u69.p583==1))||(i6.u70.p598==1))||(i4.i1.u17.p194==1))||(i10.i2.u80.p744==1))||(i11.i0.u4.p37==1))||(((i1.i0.u27.p252==1)&&(u41.p416==1))&&(i11.i1.u81.p747==1))) U EF((i3.i0.u33.p353==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!(E(TRUE U !(E((((((((i11.i1.u81.p597==1)||(i11.i1.u69.p583==1))||(i6.u70.p598==1))||(i4.i1.u17.p194==1))||(i10.i2.u80.p744==1))||(i11.i0.u4.p37==1))||(((i1.i0.u27.p252==1)&&(u41.p416==1))&&(i11.i1.u81.p747==1))) U E(TRUE U (i3.i0.u33.p353==1))))))))))) * !(E(!(EG(!(E(TRUE U !(E((((((((i11.i1.u81.p597==1)||(i11.i1.u69.p583==1))||(i6.u70.p598==1))||(i4.i1.u17.p194==1))||(i10.i2.u80.p744==1))||(i11.i0.u4.p37==1))||(((i1.i0.u27.p252==1)&&(u41.p416==1))&&(i11.i1.u81.p747==1))) U E(TRUE U (i3.i0.u33.p353==1)))))))) U (!(E(TRUE U (!(EG(((((u43.p600==0)&&((i6.u9.p112==0)||(u43.p115==0)))&&(i5.u72.p627==0))&&(i0.u29.p281==0)))) + ((((((((((((i5.u11.p131==1)||(i1.i1.u24.p18==1))||(i3.i0.u34.p359==1))||(i10.i2.u62.p539==1))||(u41.p70==1))||(u41.p414==1))||(i0.u1.p10==1))||(i0.u1.p11==1))||((u41.p765==1)&&(u43.p768==1)))||(((i6.u8.p111==1)&&(i6.u42.p422==1))&&(i6.u5.p608==1)))&&(((((((((i10.i0.u32.p3==1)||(i3.i1.u73.p655==1))||(u41.p604==1))||(i8.i1.u45.p435==1))||(i11.i0.u4.p52==1))||(i8.i0.u3.p29==1))||(i8.i1.u46.p440==1))||((i4.i0.u18.p203==1)&&(i4.i0.u19.p206==1)))||(((i0.u28.p267==1)&&(i0.u40.p412==1))&&(i0.u77.p714==1))))&&(((((((((((i6.u83.p763==1)||(u43.p98==1))||(i11.i1.u81.p575==1))||(i13.i2.u23.p232==1))||(i0.u1.p11==1))||(i12.u49.p474==1))||(i1.i0.u26.p251==1))||(i13.i3.u20.p212==1))||(i8.i1.u46.p440==1))||(((i1.i1.u25.p239==1)&&(i1.i0.u60.p531==1))&&(i11.i1.u81.p747==1)))||(((i1.i0.u27.p252==1)&&(u41.p416==1))&&(i11.i1.u81.p747==1))))))) * !(EG(!(E(TRUE U !(E((((((((i11.i1.u81.p597==1)||(i11.i1.u69.p583==1))||(i6.u70.p598==1))||(i4.i1.u17.p194==1))||(i10.i2.u80.p744==1))||(i11.i0.u4.p37==1))||(((i1.i0.u27.p252==1)&&(u41.p416==1))&&(i11.i1.u81.p747==1))) U E(TRUE U (i3.i0.u33.p353==1))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t20, t21, t87, t97, t98, t102, t108, t110, t112, t124, t126, t139, t140, t141, t143, t144, t145, t152, t153, t155, t161, t162, t166, t167, t169, t171, t172, t173, t174, t194, u41.t38, u41.t93, i0.u1.t25, i1.i0.u27.t100, i1.i1.u25.t99, i3.i0.u34.t22, i4.i0.t89, i4.i1.u17.t88, i5.u11.t33, i8.i1.u45.t19, i8.i1.u46.t18, i10.i2.u62.t95, i11.t201, i11.t187, i11.i0.t199, i11.i0.u4.t184, i11.i0.u4.t185, i11.i1.u81.t12, i11.i1.u81.t113, i12.u49.t94, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :30/110/52/192
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local 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
Detected timeout of ITS tools.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 665 transition count 516
Reduce places removed 82 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 96 rules applied. Total rules applied 178 place count 583 transition count 502
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 192 place count 569 transition count 502
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 114 Pre rules applied. Total rules applied 192 place count 569 transition count 388
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 436 place count 439 transition count 388
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 504 place count 371 transition count 320
Iterating global reduction 3 with 68 rules applied. Total rules applied 572 place count 371 transition count 320
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 572 place count 371 transition count 315
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 584 place count 364 transition count 315
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 760 place count 275 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 761 place count 275 transition count 227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 763 place count 274 transition count 230
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 766 place count 274 transition count 230
Applied a total of 766 rules in 75 ms. Remains 274 /665 variables (removed 391) and now considering 230/598 (removed 368) transitions.
[2021-05-11 20:48:09] [INFO ] Flatten gal took : 9 ms
[2021-05-11 20:48:09] [INFO ] Flatten gal took : 9 ms
[2021-05-11 20:48:09] [INFO ] Input system was already deterministic with 230 transitions.
[2021-05-11 20:48:09] [INFO ] Flatten gal took : 13 ms
[2021-05-11 20:48:09] [INFO ] Flatten gal took : 16 ms
[2021-05-11 20:48:09] [INFO ] Time to serialize gal into /tmp/CTLFireability11593290181175453671.gal : 2 ms
[2021-05-11 20:48:09] [INFO ] Time to serialize properties into /tmp/CTLFireability2079320399241759967.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11593290181175453671.gal, -t, CGAL, -ctl, /tmp/CTLFireability2079320399241759967.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.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11593290181175453671.gal -t CGAL -ctl /tmp/CTLFireability2079320399241759967.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 20:48:39] [INFO ] Flatten gal took : 9 ms
[2021-05-11 20:48:39] [INFO ] Applying decomposition
[2021-05-11 20:48:39] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3104109975401793370.txt, -o, /tmp/graph3104109975401793370.bin, -w, /tmp/graph3104109975401793370.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3104109975401793370.bin, -l, -1, -v, -w, /tmp/graph3104109975401793370.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:48:39] [INFO ] Decomposing Gal with order
[2021-05-11 20:48:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:48:39] [INFO ] Removed a total of 251 redundant transitions.
[2021-05-11 20:48:39] [INFO ] Flatten gal took : 30 ms
[2021-05-11 20:48:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 39 ms.
[2021-05-11 20:48:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13659854276575243056.gal : 4 ms
[2021-05-11 20:48:39] [INFO ] Time to serialize properties into /tmp/CTLFireability4307497202494156068.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability13659854276575243056.gal, -t, CGAL, -ctl, /tmp/CTLFireability4307497202494156068.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability13659854276575243056.gal -t CGAL -ctl /tmp/CTLFireability4307497202494156068.ctl
No direction supplied, using forward translation only.
Parsed 1 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,4.78801e+16,3.38481,92572,3009,110,161739,1401,1025,433754,102,6960,0


Converting to forward existential form...Done !
original formula: EG((((!(AF(((((((((((((((i3.i0.u40.p390==1)||(i4.u86.p751==1))||(i6.i1.u57.p498==1))||(i6.i1.u18.p212==1))||(((i6.i0.u14.p180==1)&&(i6.i0.u53.p476==1))&&(i9.i1.u85.p747==1)))||(i3.i1.u38.p362==1))||(i8.i0.u48.p434==1))||(i1.i1.u28.p272==1))||(i4.u4.p85==1))||(i9.i1.u82.p700==1))||(((i10.i1.u32.p289==1)&&(i10.i1.u70.p561==1))&&(i9.i1.u85.p747==1)))||(i5.i2.u27.p269==1))||(i0.i0.u87.p596==1))||(i5.i1.u25.p14==1)))) + !(EF(((((((i1.i1.u29.p275==0)&&(((i4.u9.p102==0)||(i4.u45.p422==0))||(i4.u77.p608==0)))&&(i3.i1.u39.p364==0))&&(i1.i2.u31.p286==0))&&(((i0.i0.u5.p108==0)||(i0.i0.u46.p427==0))||(i4.u77.p611==0)))&&(((i4.u9.p99==0)||(i4.u44.p417==0))||(i4.u74.p749==0)))))) + ((i9.i0.u11.p33==0)&&(((i1.i0.u33.p295==0)||(i1.i0.u71.p566==0))||(i9.i1.u85.p747==0)))) * ((!(EF(((((((((((i7.i0.u21.p227==1)&&(i7.i1.u63.p526==1))&&(i9.i1.u85.p747==1))||(i9.i1.u72.p607==1))||(i6.i1.u1.p22==1))||(i8.i1.u64.p530==1))||(i9.i0.u51.p444==1))||(i10.i0.u67.p548==1))&&(((i3.i0.u37.p359==1)||(i10.i2.u84.p744==1))||(i2.u35.p344==1)))&&(((((((((((((((i3.i0.u40.p389==1)||(i4.u4.p85==1))||(i8.i0.u49.p435==1))||(i3.i0.u12.p132==1))||(((i6.i2.u16.p195==1)&&(i6.i2.u54.p482==1))&&(i6.i2.u80.p666==1)))||(i9.i1.u72.p672==1))||(((i4.u9.p99==1)&&(i4.u44.p417==1))&&(i4.u77.p605==1)))||(((i4.u77.p86==1)&&(i0.i0.u46.p427==1))&&(i0.i0.u87.p755==1)))||(((i4.u9.p99==1)&&(i4.u44.p417==1))&&(i0.i1.u88.p764==1)))||(i7.i1.u81.p699==1))||(i9.i1.u72.p732==1))||(i10.i1.u70.p560==1))||(i10.i2.u34.p302==1))||(i7.i0.u61.p514==1))||(i2.u36.p347==1))))) + (((((i7.i1.u23.p242==0)&&(i2.u52.p473==0))&&(i5.i2.u43.p409==0))&&(((i3.i1.u13.p170==0)||(i2.u52.p471==0))||(i9.i1.u85.p747==0)))&&(((i4.u77.p80==0)||(i4.u44.p417==0))||(i4.u75.p758==0)))) + (((((((((i8.i0.u48.p438==0)&&(i9.i1.u85.p569==0))&&(i9.i0.u11.p33==0))&&(i4.u4.p82==0))&&(i9.i1.u72.p590==0))&&(i5.i0.u2.p57==0))&&(i7.i2.u22.p234==0))&&(i5.i1.u24.p254==0))&&(i0.i1.u76.p599==0)))))
=> equivalent forward existential formula: [FwdG(Init,(((!(!(EG(!(((((((((((((((i3.i0.u40.p390==1)||(i4.u86.p751==1))||(i6.i1.u57.p498==1))||(i6.i1.u18.p212==1))||(((i6.i0.u14.p180==1)&&(i6.i0.u53.p476==1))&&(i9.i1.u85.p747==1)))||(i3.i1.u38.p362==1))||(i8.i0.u48.p434==1))||(i1.i1.u28.p272==1))||(i4.u4.p85==1))||(i9.i1.u82.p700==1))||(((i10.i1.u32.p289==1)&&(i10.i1.u70.p561==1))&&(i9.i1.u85.p747==1)))||(i5.i2.u27.p269==1))||(i0.i0.u87.p596==1))||(i5.i1.u25.p14==1)))))) + !(E(TRUE U ((((((i1.i1.u29.p275==0)&&(((i4.u9.p102==0)||(i4.u45.p422==0))||(i4.u77.p608==0)))&&(i3.i1.u39.p364==0))&&(i1.i2.u31.p286==0))&&(((i0.i0.u5.p108==0)||(i0.i0.u46.p427==0))||(i4.u77.p611==0)))&&(((i4.u9.p99==0)||(i4.u44.p417==0))||(i4.u74.p749==0)))))) + ((i9.i0.u11.p33==0)&&(((i1.i0.u33.p295==0)||(i1.i0.u71.p566==0))||(i9.i1.u85.p747==0)))) * ((!(E(TRUE U ((((((((((i7.i0.u21.p227==1)&&(i7.i1.u63.p526==1))&&(i9.i1.u85.p747==1))||(i9.i1.u72.p607==1))||(i6.i1.u1.p22==1))||(i8.i1.u64.p530==1))||(i9.i0.u51.p444==1))||(i10.i0.u67.p548==1))&&(((i3.i0.u37.p359==1)||(i10.i2.u84.p744==1))||(i2.u35.p344==1)))&&(((((((((((((((i3.i0.u40.p389==1)||(i4.u4.p85==1))||(i8.i0.u49.p435==1))||(i3.i0.u12.p132==1))||(((i6.i2.u16.p195==1)&&(i6.i2.u54.p482==1))&&(i6.i2.u80.p666==1)))||(i9.i1.u72.p672==1))||(((i4.u9.p99==1)&&(i4.u44.p417==1))&&(i4.u77.p605==1)))||(((i4.u77.p86==1)&&(i0.i0.u46.p427==1))&&(i0.i0.u87.p755==1)))||(((i4.u9.p99==1)&&(i4.u44.p417==1))&&(i0.i1.u88.p764==1)))||(i7.i1.u81.p699==1))||(i9.i1.u72.p732==1))||(i10.i1.u70.p560==1))||(i10.i2.u34.p302==1))||(i7.i0.u61.p514==1))||(i2.u36.p347==1))))) + (((((i7.i1.u23.p242==0)&&(i2.u52.p473==0))&&(i5.i2.u43.p409==0))&&(((i3.i1.u13.p170==0)||(i2.u52.p471==0))||(i9.i1.u85.p747==0)))&&(((i4.u77.p80==0)||(i4.u44.p417==0))||(i4.u75.p758==0)))) + (((((((((i8.i0.u48.p438==0)&&(i9.i1.u85.p569==0))&&(i9.i0.u11.p33==0))&&(i4.u4.p82==0))&&(i9.i1.u72.p590==0))&&(i5.i0.u2.p57==0))&&(i7.i2.u22.p234==0))&&(i5.i1.u24.p254==0))&&(i0.i1.u76.p599==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t51, t52, t63, t122, t124, t125, t138, t142, t143, t148, t149, t151, t156, t166, t168, t178, t179, t181, t182, t198, t199, t201, t203, t205, t206, t207, t208, t221, i1.i0.u33.t131, i1.i1.u28.t114, i1.i2.u31.t116, i2.u52.t26, i3.i0.u12.t111, i3.i0.u37.t30, i3.i0.u40.t31, i3.i0.u40.t118, i3.i1.u13.t126, i3.i1.u39.t117, i4.t123, i4.u4.t109, i4.u4.t110, i5.i1.u24.t112, i5.i2.u43.t119, i6.i1.u17.t128, i6.i1.u57.t23, i7.i0.u21.t129, i7.i0.u61.t21, i7.i1.u23.t38, i7.i2.u22.t40, i8.i0.t28, i8.i0.u49.t29, i8.i1.u64.t20, i9.t202, i9.t165, i9.i0.u51.t120, i9.i1.t4, i9.i1.t212, i9.i1.u72.t2, i9.i1.u72.t6, i9.i1.u72.t8, i9.i1.u72.t15, i9.i1.u85.t0, i9.i1.u85.t152, i10.i0.u67.t19, i10.i1.u32.t130, i10.i1.u70.t17, i10.i2.u34.t34, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :28/120/68/216
Detected timeout of ITS tools.
[2021-05-11 20:49:09] [INFO ] Flatten gal took : 22 ms
[2021-05-11 20:49:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-20-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 20:49:09] [INFO ] Flatten gal took : 18 ms
[2021-05-11 20:49:09] [INFO ] Applying decomposition
[2021-05-11 20:49:09] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4324706180469862056.txt, -o, /tmp/graph4324706180469862056.bin, -w, /tmp/graph4324706180469862056.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4324706180469862056.bin, -l, -1, -v, -w, /tmp/graph4324706180469862056.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:49:09] [INFO ] Decomposing Gal with order
[2021-05-11 20:49:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:49:09] [INFO ] Removed a total of 262 redundant transitions.
[2021-05-11 20:49:09] [INFO ] Flatten gal took : 36 ms
[2021-05-11 20:49:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-11 20:49:09] [INFO ] Time to serialize gal into /tmp/CTLFireability14171652234855966563.gal : 4 ms
[2021-05-11 20:49:09] [INFO ] Time to serialize properties into /tmp/CTLFireability17475928477826710219.ctl : 8 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability14171652234855966563.gal, -t, CGAL, -ctl, /tmp/CTLFireability17475928477826710219.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability14171652234855966563.gal -t CGAL -ctl /tmp/CTLFireability17475928477826710219.ctl
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 21:10:53] [INFO ] Applying decomposition
[2021-05-11 21:10:53] [INFO ] Flatten gal took : 16 ms
[2021-05-11 21:10:53] [INFO ] Decomposing Gal with order
[2021-05-11 21:10:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 21:10:53] [INFO ] Removed a total of 119 redundant transitions.
[2021-05-11 21:10:53] [INFO ] Flatten gal took : 34 ms
[2021-05-11 21:10:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 288 labels/synchronizations in 291 ms.
[2021-05-11 21:10:53] [INFO ] Time to serialize gal into /tmp/CTLFireability15569972319821148379.gal : 9 ms
[2021-05-11 21:10:53] [INFO ] Time to serialize properties into /tmp/CTLFireability4073288615471422487.ctl : 7 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability15569972319821148379.gal, -t, CGAL, -ctl, /tmp/CTLFireability4073288615471422487.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability15569972319821148379.gal -t CGAL -ctl /tmp/CTLFireability4073288615471422487.ctl
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 21:32:38] [INFO ] Flatten gal took : 370 ms
[2021-05-11 21:32:40] [INFO ] Input system was already deterministic with 598 transitions.
[2021-05-11 21:32:40] [INFO ] Transformed 665 places.
[2021-05-11 21:32:40] [INFO ] Transformed 598 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//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/bin//..//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-11 21:33:10] [INFO ] Time to serialize gal into /tmp/CTLFireability4380424105804956423.gal : 6 ms
[2021-05-11 21:33:10] [INFO ] Time to serialize properties into /tmp/CTLFireability4636601888401713922.ctl : 31 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability4380424105804956423.gal, -t, CGAL, -ctl, /tmp/CTLFireability4636601888401713922.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.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability4380424105804956423.gal -t CGAL -ctl /tmp/CTLFireability4636601888401713922.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 11 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-20"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-20, 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 r026-tajo-162038143900474"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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