Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r026-smll-171620167100130.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is AutoFlight-PT-05b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167100130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 22:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 113K May 18 16:42 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 AutoFlight-PT-05b-CTLFireability-2024-00
FORMULA_NAME AutoFlight-PT-05b-CTLFireability-2024-01
FORMULA_NAME AutoFlight-PT-05b-CTLFireability-2024-02
FORMULA_NAME AutoFlight-PT-05b-CTLFireability-2024-03
FORMULA_NAME AutoFlight-PT-05b-CTLFireability-2024-04
FORMULA_NAME AutoFlight-PT-05b-CTLFireability-2024-05
FORMULA_NAME AutoFlight-PT-05b-CTLFireability-2024-06
FORMULA_NAME AutoFlight-PT-05b-CTLFireability-2024-07
FORMULA_NAME AutoFlight-PT-05b-CTLFireability-2024-08
FORMULA_NAME AutoFlight-PT-05b-CTLFireability-2024-09
FORMULA_NAME AutoFlight-PT-05b-CTLFireability-2024-10
FORMULA_NAME AutoFlight-PT-05b-CTLFireability-2024-11
FORMULA_NAME AutoFlight-PT-05b-CTLFireability-2023-12
FORMULA_NAME AutoFlight-PT-05b-CTLFireability-2023-13
FORMULA_NAME AutoFlight-PT-05b-CTLFireability-2023-14
FORMULA_NAME AutoFlight-PT-05b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716258292086

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 02:24:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 02:24:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 02:24:54] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2024-05-21 02:24:55] [INFO ] Transformed 482 places.
[2024-05-21 02:24:55] [INFO ] Transformed 480 transitions.
[2024-05-21 02:24:55] [INFO ] Found NUPN structural information;
[2024-05-21 02:24:55] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 540 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Support contains 83 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 480/480 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 433 transition count 431
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 433 transition count 431
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 106 place count 433 transition count 423
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 123 place count 416 transition count 406
Iterating global reduction 1 with 17 rules applied. Total rules applied 140 place count 416 transition count 406
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 415 transition count 405
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 415 transition count 405
Applied a total of 142 rules in 245 ms. Remains 415 /482 variables (removed 67) and now considering 405/480 (removed 75) transitions.
// Phase 1: matrix 405 rows 415 cols
[2024-05-21 02:24:55] [INFO ] Computed 34 invariants in 46 ms
[2024-05-21 02:24:56] [INFO ] Implicit Places using invariants in 763 ms returned []
[2024-05-21 02:24:56] [INFO ] Invariant cache hit.
[2024-05-21 02:24:56] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
Running 404 sub problems to find dead transitions.
[2024-05-21 02:24:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (OVERLAPS) 1/415 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 02:25:07] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 31 ms to minimize.
[2024-05-21 02:25:07] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 4 ms to minimize.
[2024-05-21 02:25:08] [INFO ] Deduced a trap composed of 62 places in 125 ms of which 2 ms to minimize.
[2024-05-21 02:25:08] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-05-21 02:25:08] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-05-21 02:25:08] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 3 ms to minimize.
[2024-05-21 02:25:08] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 3 ms to minimize.
[2024-05-21 02:25:08] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 3 ms to minimize.
[2024-05-21 02:25:08] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 3 ms to minimize.
[2024-05-21 02:25:09] [INFO ] Deduced a trap composed of 70 places in 224 ms of which 5 ms to minimize.
[2024-05-21 02:25:09] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 5 ms to minimize.
[2024-05-21 02:25:09] [INFO ] Deduced a trap composed of 55 places in 197 ms of which 4 ms to minimize.
[2024-05-21 02:25:09] [INFO ] Deduced a trap composed of 57 places in 185 ms of which 4 ms to minimize.
[2024-05-21 02:25:10] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 3 ms to minimize.
[2024-05-21 02:25:10] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 4 ms to minimize.
[2024-05-21 02:25:10] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 4 ms to minimize.
[2024-05-21 02:25:10] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 4 ms to minimize.
[2024-05-21 02:25:10] [INFO ] Deduced a trap composed of 67 places in 195 ms of which 4 ms to minimize.
[2024-05-21 02:25:11] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 4 ms to minimize.
[2024-05-21 02:25:11] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 02:25:15] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-21 02:25:15] [INFO ] Deduced a trap composed of 108 places in 97 ms of which 3 ms to minimize.
[2024-05-21 02:25:15] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-21 02:25:15] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 2 ms to minimize.
[2024-05-21 02:25:15] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 2 ms to minimize.
[2024-05-21 02:25:16] [INFO ] Deduced a trap composed of 60 places in 129 ms of which 3 ms to minimize.
[2024-05-21 02:25:16] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 3 ms to minimize.
[2024-05-21 02:25:16] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 3 ms to minimize.
[2024-05-21 02:25:16] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 3 ms to minimize.
[2024-05-21 02:25:16] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 3 ms to minimize.
[2024-05-21 02:25:16] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 2 ms to minimize.
[2024-05-21 02:25:17] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 3 ms to minimize.
[2024-05-21 02:25:17] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 3 ms to minimize.
[2024-05-21 02:25:17] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 4 ms to minimize.
[2024-05-21 02:25:17] [INFO ] Deduced a trap composed of 28 places in 256 ms of which 5 ms to minimize.
[2024-05-21 02:25:18] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 4 ms to minimize.
[2024-05-21 02:25:18] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 3 ms to minimize.
[2024-05-21 02:25:18] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-05-21 02:25:18] [INFO ] Deduced a trap composed of 72 places in 155 ms of which 5 ms to minimize.
[2024-05-21 02:25:19] [INFO ] Deduced a trap composed of 58 places in 238 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 02:25:20] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 5 ms to minimize.
[2024-05-21 02:25:20] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 3 ms to minimize.
[2024-05-21 02:25:20] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 5 ms to minimize.
[2024-05-21 02:25:21] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 3 ms to minimize.
[2024-05-21 02:25:21] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 3 ms to minimize.
[2024-05-21 02:25:21] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 3 ms to minimize.
[2024-05-21 02:25:21] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 3 ms to minimize.
[2024-05-21 02:25:21] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 4 ms to minimize.
[2024-05-21 02:25:22] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 4 ms to minimize.
[2024-05-21 02:25:22] [INFO ] Deduced a trap composed of 61 places in 209 ms of which 5 ms to minimize.
[2024-05-21 02:25:22] [INFO ] Deduced a trap composed of 63 places in 217 ms of which 6 ms to minimize.
[2024-05-21 02:25:22] [INFO ] Deduced a trap composed of 57 places in 218 ms of which 5 ms to minimize.
[2024-05-21 02:25:22] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 4 ms to minimize.
[2024-05-21 02:25:23] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 4 ms to minimize.
[2024-05-21 02:25:23] [INFO ] Deduced a trap composed of 29 places in 250 ms of which 5 ms to minimize.
[2024-05-21 02:25:23] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 3 ms to minimize.
[2024-05-21 02:25:24] [INFO ] Deduced a trap composed of 65 places in 214 ms of which 8 ms to minimize.
[2024-05-21 02:25:24] [INFO ] Deduced a trap composed of 102 places in 219 ms of which 4 ms to minimize.
[2024-05-21 02:25:24] [INFO ] Deduced a trap composed of 105 places in 203 ms of which 5 ms to minimize.
[2024-05-21 02:25:24] [INFO ] Deduced a trap composed of 97 places in 202 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 02:25:25] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 3 ms to minimize.
[2024-05-21 02:25:25] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 3 ms to minimize.
[2024-05-21 02:25:25] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 3 ms to minimize.
[2024-05-21 02:25:25] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 4 ms to minimize.
[2024-05-21 02:25:25] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 3 ms to minimize.
[2024-05-21 02:25:26] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 5 ms to minimize.
[2024-05-21 02:25:26] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/820 variables, and 101 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/415 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (OVERLAPS) 1/415 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 02:25:34] [INFO ] Deduced a trap composed of 70 places in 249 ms of which 5 ms to minimize.
[2024-05-21 02:25:34] [INFO ] Deduced a trap composed of 49 places in 253 ms of which 5 ms to minimize.
[2024-05-21 02:25:34] [INFO ] Deduced a trap composed of 38 places in 246 ms of which 5 ms to minimize.
[2024-05-21 02:25:35] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 4 ms to minimize.
[2024-05-21 02:25:36] [INFO ] Deduced a trap composed of 83 places in 169 ms of which 4 ms to minimize.
[2024-05-21 02:25:36] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 3 ms to minimize.
[2024-05-21 02:25:36] [INFO ] Deduced a trap composed of 75 places in 161 ms of which 3 ms to minimize.
[2024-05-21 02:25:36] [INFO ] Deduced a trap composed of 50 places in 160 ms of which 4 ms to minimize.
[2024-05-21 02:25:36] [INFO ] Deduced a trap composed of 57 places in 156 ms of which 3 ms to minimize.
[2024-05-21 02:25:36] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 3 ms to minimize.
[2024-05-21 02:25:37] [INFO ] Deduced a trap composed of 77 places in 213 ms of which 5 ms to minimize.
[2024-05-21 02:25:37] [INFO ] Deduced a trap composed of 62 places in 214 ms of which 5 ms to minimize.
[2024-05-21 02:25:37] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 4 ms to minimize.
[2024-05-21 02:25:37] [INFO ] Deduced a trap composed of 57 places in 213 ms of which 5 ms to minimize.
[2024-05-21 02:25:38] [INFO ] Deduced a trap composed of 60 places in 197 ms of which 4 ms to minimize.
[2024-05-21 02:25:38] [INFO ] Deduced a trap composed of 34 places in 210 ms of which 4 ms to minimize.
[2024-05-21 02:25:38] [INFO ] Deduced a trap composed of 77 places in 176 ms of which 4 ms to minimize.
[2024-05-21 02:25:38] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 4 ms to minimize.
[2024-05-21 02:25:38] [INFO ] Deduced a trap composed of 76 places in 179 ms of which 4 ms to minimize.
[2024-05-21 02:25:39] [INFO ] Deduced a trap composed of 78 places in 215 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 02:25:40] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 3 ms to minimize.
[2024-05-21 02:25:41] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 3 ms to minimize.
[2024-05-21 02:25:41] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 3 ms to minimize.
[2024-05-21 02:25:41] [INFO ] Deduced a trap composed of 80 places in 259 ms of which 5 ms to minimize.
[2024-05-21 02:25:41] [INFO ] Deduced a trap composed of 41 places in 249 ms of which 5 ms to minimize.
[2024-05-21 02:25:42] [INFO ] Deduced a trap composed of 46 places in 236 ms of which 5 ms to minimize.
[2024-05-21 02:25:42] [INFO ] Deduced a trap composed of 71 places in 242 ms of which 5 ms to minimize.
[2024-05-21 02:25:42] [INFO ] Deduced a trap composed of 48 places in 241 ms of which 5 ms to minimize.
[2024-05-21 02:25:42] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 3 ms to minimize.
[2024-05-21 02:25:42] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 3 ms to minimize.
[2024-05-21 02:25:43] [INFO ] Deduced a trap composed of 71 places in 239 ms of which 5 ms to minimize.
[2024-05-21 02:25:43] [INFO ] Deduced a trap composed of 68 places in 205 ms of which 4 ms to minimize.
[2024-05-21 02:25:44] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 02:25:45] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 3 ms to minimize.
[2024-05-21 02:25:45] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 3 ms to minimize.
[2024-05-21 02:25:45] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 3 ms to minimize.
[2024-05-21 02:25:46] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 3 ms to minimize.
[2024-05-21 02:25:46] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 02:25:46] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 19/140 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-21 02:25:50] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 4 ms to minimize.
[2024-05-21 02:25:50] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 3 ms to minimize.
[2024-05-21 02:25:51] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 3 ms to minimize.
[2024-05-21 02:25:52] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 5 ms to minimize.
[2024-05-21 02:25:53] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 4 ms to minimize.
[2024-05-21 02:25:53] [INFO ] Deduced a trap composed of 73 places in 227 ms of which 5 ms to minimize.
[2024-05-21 02:25:54] [INFO ] Deduced a trap composed of 69 places in 233 ms of which 5 ms to minimize.
[2024-05-21 02:25:54] [INFO ] Deduced a trap composed of 70 places in 230 ms of which 5 ms to minimize.
[2024-05-21 02:25:55] [INFO ] Deduced a trap composed of 74 places in 222 ms of which 5 ms to minimize.
[2024-05-21 02:25:56] [INFO ] Deduced a trap composed of 80 places in 257 ms of which 6 ms to minimize.
[2024-05-21 02:25:56] [INFO ] Deduced a trap composed of 71 places in 258 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 415/820 variables, and 151 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/415 constraints, PredecessorRefiner: 0/404 constraints, Known Traps: 117/117 constraints]
After SMT, in 60271ms problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 60309ms
Starting structural reductions in LTL mode, iteration 1 : 415/482 places, 405/480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62062 ms. Remains : 415/482 places, 405/480 transitions.
Support contains 83 out of 415 places after structural reductions.
[2024-05-21 02:25:57] [INFO ] Flatten gal took : 119 ms
[2024-05-21 02:25:57] [INFO ] Flatten gal took : 53 ms
[2024-05-21 02:25:57] [INFO ] Input system was already deterministic with 405 transitions.
RANDOM walk for 40000 steps (160 resets) in 2680 ms. (14 steps per ms) remains 16/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
[2024-05-21 02:25:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 338/366 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 25/391 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 24/415 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 405/820 variables, 415/449 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/820 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/820 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 449 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1679 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 338/366 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 02:26:01] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 3 ms to minimize.
[2024-05-21 02:26:01] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 3 ms to minimize.
[2024-05-21 02:26:01] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-21 02:26:01] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-05-21 02:26:01] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 2 ms to minimize.
[2024-05-21 02:26:01] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 25/391 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 02:26:02] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-21 02:26:02] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 24/415 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 02:26:02] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 3 ms to minimize.
[2024-05-21 02:26:02] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 3 ms to minimize.
[2024-05-21 02:26:02] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-05-21 02:26:03] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 3 ms to minimize.
[2024-05-21 02:26:03] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 3 ms to minimize.
[2024-05-21 02:26:03] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 10 ms to minimize.
[2024-05-21 02:26:03] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 3 ms to minimize.
[2024-05-21 02:26:03] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-05-21 02:26:03] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 2 ms to minimize.
[2024-05-21 02:26:03] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 2 ms to minimize.
[2024-05-21 02:26:03] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 3 ms to minimize.
[2024-05-21 02:26:03] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 2 ms to minimize.
[2024-05-21 02:26:04] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 3 ms to minimize.
[2024-05-21 02:26:04] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 3 ms to minimize.
[2024-05-21 02:26:04] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
[2024-05-21 02:26:04] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 2 ms to minimize.
[2024-05-21 02:26:04] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 2 ms to minimize.
[2024-05-21 02:26:04] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 5 ms to minimize.
[2024-05-21 02:26:05] [INFO ] Deduced a trap composed of 86 places in 312 ms of which 6 ms to minimize.
[2024-05-21 02:26:05] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 02:26:05] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 3 ms to minimize.
[2024-05-21 02:26:05] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 4 ms to minimize.
[2024-05-21 02:26:05] [INFO ] Deduced a trap composed of 73 places in 166 ms of which 4 ms to minimize.
SMT process timed out in 6759ms, After SMT, problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 405/405 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 415 transition count 291
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 132 rules applied. Total rules applied 246 place count 301 transition count 273
Reduce places removed 9 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 17 rules applied. Total rules applied 263 place count 292 transition count 265
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 271 place count 284 transition count 265
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 271 place count 284 transition count 214
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 373 place count 233 transition count 214
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 386 place count 220 transition count 201
Iterating global reduction 4 with 13 rules applied. Total rules applied 399 place count 220 transition count 201
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 399 place count 220 transition count 197
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 407 place count 216 transition count 197
Performed 59 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 525 place count 157 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 526 place count 157 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 527 place count 157 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 529 place count 156 transition count 129
Free-agglomeration rule applied 17 times.
Iterating global reduction 5 with 17 rules applied. Total rules applied 546 place count 156 transition count 112
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 563 place count 139 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 564 place count 138 transition count 111
Applied a total of 564 rules in 203 ms. Remains 138 /415 variables (removed 277) and now considering 111/405 (removed 294) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 138/415 places, 111/405 transitions.
RANDOM walk for 40000 steps (831 resets) in 828 ms. (48 steps per ms) remains 8/16 properties
BEST_FIRST walk for 40003 steps (151 resets) in 154 ms. (258 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (151 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (107 resets) in 174 ms. (228 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (149 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (150 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (150 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (158 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (116 resets) in 88 ms. (449 steps per ms) remains 6/7 properties
// Phase 1: matrix 111 rows 138 cols
[2024-05-21 02:26:06] [INFO ] Computed 34 invariants in 2 ms
[2024-05-21 02:26:06] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 41/60 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 66/126 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 12/138 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 111/249 variables, 138/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 31/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/249 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 203 constraints, problems are : Problem set: 0 solved, 6 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 41/60 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 66/126 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:26:07] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-21 02:26:07] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-05-21 02:26:07] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-21 02:26:07] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 12/138 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:26:07] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 111/249 variables, 138/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 31/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 6/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:26:07] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-21 02:26:07] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 2 ms to minimize.
[2024-05-21 02:26:07] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 2 ms to minimize.
[2024-05-21 02:26:07] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/249 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 218 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1119 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 1391ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 5 properties in 133 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 111/111 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 138 transition count 93
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 120 transition count 93
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 36 place count 120 transition count 85
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 52 place count 112 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 110 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 110 transition count 83
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 56 place count 110 transition count 82
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 109 transition count 82
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 72 place count 102 transition count 75
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 102 transition count 71
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 98 transition count 71
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 98 transition count 71
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 88 place count 94 transition count 67
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 94 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 93 transition count 66
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 56 rules applied. Total rules applied 149 place count 70 transition count 33
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 182 place count 37 transition count 33
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 182 place count 37 transition count 21
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 206 place count 25 transition count 21
Applied a total of 206 rules in 41 ms. Remains 25 /138 variables (removed 113) and now considering 21/111 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 25/138 places, 21/111 transitions.
RANDOM walk for 72 steps (0 resets) in 4 ms. (14 steps per ms) remains 0/1 properties
[2024-05-21 02:26:08] [INFO ] Flatten gal took : 26 ms
[2024-05-21 02:26:08] [INFO ] Flatten gal took : 28 ms
[2024-05-21 02:26:08] [INFO ] Input system was already deterministic with 405 transitions.
Computed a total of 119 stabilizing places and 119 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 415/415 places, 405/405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 414 transition count 263
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 159 rules applied. Total rules applied 300 place count 273 transition count 245
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 312 place count 263 transition count 243
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 315 place count 261 transition count 242
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 315 place count 261 transition count 192
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 415 place count 211 transition count 192
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 431 place count 195 transition count 176
Iterating global reduction 4 with 16 rules applied. Total rules applied 447 place count 195 transition count 176
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 447 place count 195 transition count 169
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 461 place count 188 transition count 169
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 583 place count 127 transition count 108
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 591 place count 127 transition count 100
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 607 place count 119 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 608 place count 118 transition count 91
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 11 rules applied. Total rules applied 619 place count 110 transition count 88
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 622 place count 107 transition count 88
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 622 place count 107 transition count 83
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 632 place count 102 transition count 83
Applied a total of 632 rules in 79 ms. Remains 102 /415 variables (removed 313) and now considering 83/405 (removed 322) transitions.
// Phase 1: matrix 83 rows 102 cols
[2024-05-21 02:26:08] [INFO ] Computed 26 invariants in 1 ms
[2024-05-21 02:26:08] [INFO ] Implicit Places using invariants in 108 ms returned [42, 59, 76, 81, 86, 90, 101]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 112 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 95/415 places, 83/405 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 90 transition count 78
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 90 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 89 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 89 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 88 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 88 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 87 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 87 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 86 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 86 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 85 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 85 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 83 transition count 71
Applied a total of 24 rules in 24 ms. Remains 83 /95 variables (removed 12) and now considering 71/83 (removed 12) transitions.
// Phase 1: matrix 71 rows 83 cols
[2024-05-21 02:26:08] [INFO ] Computed 19 invariants in 1 ms
[2024-05-21 02:26:08] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 02:26:08] [INFO ] Invariant cache hit.
[2024-05-21 02:26:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 02:26:08] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 83/415 places, 71/405 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 406 ms. Remains : 83/415 places, 71/405 transitions.
[2024-05-21 02:26:08] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:26:08] [INFO ] Flatten gal took : 6 ms
[2024-05-21 02:26:08] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-21 02:26:08] [INFO ] Flatten gal took : 6 ms
[2024-05-21 02:26:08] [INFO ] Flatten gal took : 6 ms
[2024-05-21 02:26:08] [INFO ] Time to serialize gal into /tmp/CTLFireability17685247564057981653.gal : 2 ms
[2024-05-21 02:26:08] [INFO ] Time to serialize properties into /tmp/CTLFireability9771130226980099717.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17685247564057981653.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9771130226980099717.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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.11507e+08,0.041537,4108,2,412,5,2856,6,0,398,3633,0


Converting to forward existential form...Done !
original formula: AG((!(A((p181==1) U EF(EG((p477==1))))) * EG((p112==0))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(E(TRUE U EG((p477==1))))))) * !(E(!(E(TRUE U EG((p477==1)))) U (!((p181==1)) * !(E(...240
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t12, t66, t67, t68, Intersection with reachable at each step enabled. (destroyed/re...188
(forward)formula 0,0,1.69428,60588,1,0,516,363866,164,237,2278,413005,569
FORMULA AutoFlight-PT-05b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 405/405 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 395 transition count 385
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 395 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 395 transition count 384
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 388 transition count 377
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 388 transition count 377
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 385 transition count 374
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 385 transition count 374
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 383 transition count 372
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 383 transition count 372
Applied a total of 65 rules in 40 ms. Remains 383 /415 variables (removed 32) and now considering 372/405 (removed 33) transitions.
// Phase 1: matrix 372 rows 383 cols
[2024-05-21 02:26:10] [INFO ] Computed 34 invariants in 4 ms
[2024-05-21 02:26:10] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-21 02:26:10] [INFO ] Invariant cache hit.
[2024-05-21 02:26:11] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2024-05-21 02:26:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/383 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-05-21 02:26:19] [INFO ] Deduced a trap composed of 21 places in 365 ms of which 6 ms to minimize.
[2024-05-21 02:26:20] [INFO ] Deduced a trap composed of 54 places in 349 ms of which 6 ms to minimize.
[2024-05-21 02:26:20] [INFO ] Deduced a trap composed of 16 places in 363 ms of which 7 ms to minimize.
[2024-05-21 02:26:20] [INFO ] Deduced a trap composed of 58 places in 345 ms of which 6 ms to minimize.
[2024-05-21 02:26:21] [INFO ] Deduced a trap composed of 18 places in 320 ms of which 5 ms to minimize.
[2024-05-21 02:26:21] [INFO ] Deduced a trap composed of 55 places in 311 ms of which 6 ms to minimize.
[2024-05-21 02:26:21] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 5 ms to minimize.
[2024-05-21 02:26:22] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 5 ms to minimize.
[2024-05-21 02:26:22] [INFO ] Deduced a trap composed of 70 places in 295 ms of which 5 ms to minimize.
[2024-05-21 02:26:22] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 5 ms to minimize.
[2024-05-21 02:26:22] [INFO ] Deduced a trap composed of 60 places in 243 ms of which 5 ms to minimize.
[2024-05-21 02:26:23] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 5 ms to minimize.
[2024-05-21 02:26:23] [INFO ] Deduced a trap composed of 67 places in 251 ms of which 5 ms to minimize.
[2024-05-21 02:26:23] [INFO ] Deduced a trap composed of 62 places in 247 ms of which 5 ms to minimize.
[2024-05-21 02:26:24] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 4 ms to minimize.
[2024-05-21 02:26:24] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 5 ms to minimize.
[2024-05-21 02:26:24] [INFO ] Deduced a trap composed of 30 places in 246 ms of which 5 ms to minimize.
[2024-05-21 02:26:24] [INFO ] Deduced a trap composed of 75 places in 222 ms of which 5 ms to minimize.
[2024-05-21 02:26:24] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 5 ms to minimize.
[2024-05-21 02:26:25] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-05-21 02:26:30] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 5 ms to minimize.
[2024-05-21 02:26:30] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 5 ms to minimize.
[2024-05-21 02:26:30] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 5 ms to minimize.
[2024-05-21 02:26:31] [INFO ] Deduced a trap composed of 67 places in 225 ms of which 4 ms to minimize.
[2024-05-21 02:26:31] [INFO ] Deduced a trap composed of 25 places in 290 ms of which 5 ms to minimize.
[2024-05-21 02:26:32] [INFO ] Deduced a trap composed of 59 places in 304 ms of which 5 ms to minimize.
[2024-05-21 02:26:32] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 5 ms to minimize.
[2024-05-21 02:26:32] [INFO ] Deduced a trap composed of 29 places in 219 ms of which 5 ms to minimize.
[2024-05-21 02:26:33] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-21 02:26:33] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 4 ms to minimize.
[2024-05-21 02:26:33] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 3 ms to minimize.
[2024-05-21 02:26:33] [INFO ] Deduced a trap composed of 83 places in 243 ms of which 4 ms to minimize.
[2024-05-21 02:26:33] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 4 ms to minimize.
[2024-05-21 02:26:34] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 4 ms to minimize.
[2024-05-21 02:26:34] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 4 ms to minimize.
[2024-05-21 02:26:34] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 4 ms to minimize.
[2024-05-21 02:26:34] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 4 ms to minimize.
[2024-05-21 02:26:35] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 3 ms to minimize.
[2024-05-21 02:26:35] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 4 ms to minimize.
[2024-05-21 02:26:35] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-05-21 02:26:36] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-21 02:26:36] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 3 ms to minimize.
[2024-05-21 02:26:37] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 3 ms to minimize.
[2024-05-21 02:26:37] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 3 ms to minimize.
[2024-05-21 02:26:37] [INFO ] Deduced a trap composed of 56 places in 186 ms of which 4 ms to minimize.
[2024-05-21 02:26:37] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-05-21 02:26:38] [INFO ] Deduced a trap composed of 59 places in 140 ms of which 3 ms to minimize.
[2024-05-21 02:26:38] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 3 ms to minimize.
[2024-05-21 02:26:38] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 3 ms to minimize.
[2024-05-21 02:26:38] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2024-05-21 02:26:38] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 4 ms to minimize.
[2024-05-21 02:26:40] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 4 ms to minimize.
[2024-05-21 02:26:40] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-05-21 02:26:40] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 3 ms to minimize.
[2024-05-21 02:26:41] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/755 variables, and 89 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/383 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/383 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 55/89 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-05-21 02:26:47] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 4 ms to minimize.
[2024-05-21 02:26:47] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 4 ms to minimize.
[2024-05-21 02:26:47] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 4 ms to minimize.
[2024-05-21 02:26:47] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 4 ms to minimize.
[2024-05-21 02:26:48] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 4 ms to minimize.
[2024-05-21 02:26:48] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 5 ms to minimize.
[2024-05-21 02:26:48] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 4 ms to minimize.
[2024-05-21 02:26:48] [INFO ] Deduced a trap composed of 61 places in 186 ms of which 4 ms to minimize.
[2024-05-21 02:26:49] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 4 ms to minimize.
[2024-05-21 02:26:49] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 3 ms to minimize.
[2024-05-21 02:26:50] [INFO ] Deduced a trap composed of 61 places in 166 ms of which 3 ms to minimize.
[2024-05-21 02:26:50] [INFO ] Deduced a trap composed of 65 places in 140 ms of which 4 ms to minimize.
[2024-05-21 02:26:50] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 3 ms to minimize.
[2024-05-21 02:26:52] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 4 ms to minimize.
[2024-05-21 02:26:52] [INFO ] Deduced a trap composed of 78 places in 166 ms of which 4 ms to minimize.
[2024-05-21 02:26:52] [INFO ] Deduced a trap composed of 77 places in 158 ms of which 3 ms to minimize.
[2024-05-21 02:26:52] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 4 ms to minimize.
[2024-05-21 02:26:53] [INFO ] Deduced a trap composed of 73 places in 215 ms of which 4 ms to minimize.
[2024-05-21 02:26:53] [INFO ] Deduced a trap composed of 60 places in 202 ms of which 5 ms to minimize.
[2024-05-21 02:26:54] [INFO ] Deduced a trap composed of 40 places in 240 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-05-21 02:26:55] [INFO ] Deduced a trap composed of 60 places in 211 ms of which 5 ms to minimize.
[2024-05-21 02:26:56] [INFO ] Deduced a trap composed of 59 places in 179 ms of which 4 ms to minimize.
[2024-05-21 02:26:56] [INFO ] Deduced a trap composed of 72 places in 166 ms of which 3 ms to minimize.
[2024-05-21 02:26:58] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-05-21 02:27:01] [INFO ] Deduced a trap composed of 28 places in 225 ms of which 5 ms to minimize.
[2024-05-21 02:27:02] [INFO ] Deduced a trap composed of 50 places in 160 ms of which 4 ms to minimize.
[2024-05-21 02:27:02] [INFO ] Deduced a trap composed of 76 places in 173 ms of which 4 ms to minimize.
[2024-05-21 02:27:05] [INFO ] Deduced a trap composed of 75 places in 187 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-05-21 02:27:07] [INFO ] Deduced a trap composed of 65 places in 294 ms of which 5 ms to minimize.
[2024-05-21 02:27:08] [INFO ] Deduced a trap composed of 77 places in 169 ms of which 4 ms to minimize.
[2024-05-21 02:27:08] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/755 variables, and 120 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/383 constraints, PredecessorRefiner: 0/371 constraints, Known Traps: 86/86 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 383/415 places, 372/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60739 ms. Remains : 383/415 places, 372/405 transitions.
[2024-05-21 02:27:11] [INFO ] Flatten gal took : 34 ms
[2024-05-21 02:27:11] [INFO ] Flatten gal took : 36 ms
[2024-05-21 02:27:11] [INFO ] Input system was already deterministic with 372 transitions.
[2024-05-21 02:27:11] [INFO ] Flatten gal took : 33 ms
[2024-05-21 02:27:11] [INFO ] Flatten gal took : 32 ms
[2024-05-21 02:27:11] [INFO ] Time to serialize gal into /tmp/CTLFireability8732212569147779985.gal : 13 ms
[2024-05-21 02:27:11] [INFO ] Time to serialize properties into /tmp/CTLFireability2457008284011940050.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8732212569147779985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2457008284011940050.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 02:27:41] [INFO ] Flatten gal took : 19 ms
[2024-05-21 02:27:41] [INFO ] Applying decomposition
[2024-05-21 02:27:41] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2039424797268317139.txt' '-o' '/tmp/graph2039424797268317139.bin' '-w' '/tmp/graph2039424797268317139.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2039424797268317139.bin' '-l' '-1' '-v' '-w' '/tmp/graph2039424797268317139.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:27:41] [INFO ] Decomposing Gal with order
[2024-05-21 02:27:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:27:41] [INFO ] Removed a total of 69 redundant transitions.
[2024-05-21 02:27:42] [INFO ] Flatten gal took : 92 ms
[2024-05-21 02:27:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-21 02:27:42] [INFO ] Time to serialize gal into /tmp/CTLFireability8623560424423794661.gal : 12 ms
[2024-05-21 02:27:42] [INFO ] Time to serialize properties into /tmp/CTLFireability16026154914043492359.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8623560424423794661.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16026154914043492359.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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,9.17762e+27,3.28862,89748,10594,28,176693,329,727,269545,46,792,0


Converting to forward existential form...Done !
original formula: A((EF(!(((i1.i1.u31.p91==1)&&(i1.i1.u119.p378==1)))) * ((A((i22.u127.p408==1) U (i15.i0.u81.p281!=1)) + (i10.u54.p185==1)) + (E((!(((i7.u...520
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!((!(EX(!(((i1.i1.u31.p91==1)&&(i1.i1.u119.p378==1))))) + !(EG(!(E((i20.u117.p372==1) U (i...954
Reverse transition relation is NOT exact ! Due to transitions t127, t130, t141, t144, t154, t157, t188, t195, t220, t243, t265, t280, t359, t360, t361, t36...975
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 415/415 places, 405/405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 414 transition count 262
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 161 rules applied. Total rules applied 303 place count 272 transition count 243
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 314 place count 262 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 315 place count 261 transition count 242
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 315 place count 261 transition count 191
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 417 place count 210 transition count 191
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 436 place count 191 transition count 172
Iterating global reduction 4 with 19 rules applied. Total rules applied 455 place count 191 transition count 172
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 455 place count 191 transition count 164
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 471 place count 183 transition count 164
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 577 place count 130 transition count 111
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 585 place count 130 transition count 103
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 601 place count 122 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 602 place count 121 transition count 94
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 11 rules applied. Total rules applied 613 place count 113 transition count 91
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 616 place count 110 transition count 91
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 616 place count 110 transition count 86
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 626 place count 105 transition count 86
Applied a total of 626 rules in 46 ms. Remains 105 /415 variables (removed 310) and now considering 86/405 (removed 319) transitions.
// Phase 1: matrix 86 rows 105 cols
[2024-05-21 02:28:12] [INFO ] Computed 26 invariants in 2 ms
[2024-05-21 02:28:12] [INFO ] Implicit Places using invariants in 128 ms returned [43, 60, 77, 89, 98, 104]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 129 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 99/415 places, 86/405 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 95 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 95 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 94 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 94 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 93 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 93 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 92 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 92 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 91 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 91 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 90 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 90 transition count 77
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 87 transition count 74
Applied a total of 24 rules in 12 ms. Remains 87 /99 variables (removed 12) and now considering 74/86 (removed 12) transitions.
// Phase 1: matrix 74 rows 87 cols
[2024-05-21 02:28:12] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 02:28:12] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 02:28:12] [INFO ] Invariant cache hit.
[2024-05-21 02:28:12] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-21 02:28:12] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 87/415 places, 74/405 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 395 ms. Remains : 87/415 places, 74/405 transitions.
[2024-05-21 02:28:12] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:28:12] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:28:12] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-21 02:28:12] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:28:12] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:28:12] [INFO ] Time to serialize gal into /tmp/CTLFireability9035563844637916526.gal : 2 ms
[2024-05-21 02:28:12] [INFO ] Time to serialize properties into /tmp/CTLFireability9486151270764352836.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9035563844637916526.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9486151270764352836.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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,1.86138e+08,0.054462,4436,2,600,5,4235,6,0,417,4628,0


Converting to forward existential form...Done !
original formula: AF(AG(!(E((((p421==1)&&(p217==1))&&(p18==1)) U !(EG(((p453==1)&&(p478==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(E((((p421==1)&&(p217==1))&&(p18==1)) U !(EG(((p453==1)&&(p478==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t53, t58, t62, t64, t71, t72, Intersection with reachable at each step enabled. (des...197
(forward)formula 0,0,0.608779,16932,1,0,269,72451,181,115,2631,56873,314
FORMULA AutoFlight-PT-05b-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 405/405 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 390 transition count 380
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 390 transition count 380
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 390 transition count 378
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 380 transition count 368
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 380 transition count 368
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 377 transition count 365
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 377 transition count 365
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 375 transition count 363
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 375 transition count 363
Applied a total of 82 rules in 33 ms. Remains 375 /415 variables (removed 40) and now considering 363/405 (removed 42) transitions.
// Phase 1: matrix 363 rows 375 cols
[2024-05-21 02:28:13] [INFO ] Computed 34 invariants in 4 ms
[2024-05-21 02:28:13] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-21 02:28:13] [INFO ] Invariant cache hit.
[2024-05-21 02:28:13] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-05-21 02:28:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 02:28:23] [INFO ] Deduced a trap composed of 49 places in 376 ms of which 6 ms to minimize.
[2024-05-21 02:28:23] [INFO ] Deduced a trap composed of 17 places in 351 ms of which 7 ms to minimize.
[2024-05-21 02:28:23] [INFO ] Deduced a trap composed of 62 places in 357 ms of which 6 ms to minimize.
[2024-05-21 02:28:24] [INFO ] Deduced a trap composed of 65 places in 334 ms of which 5 ms to minimize.
[2024-05-21 02:28:24] [INFO ] Deduced a trap composed of 56 places in 310 ms of which 6 ms to minimize.
[2024-05-21 02:28:24] [INFO ] Deduced a trap composed of 58 places in 309 ms of which 5 ms to minimize.
[2024-05-21 02:28:25] [INFO ] Deduced a trap composed of 55 places in 323 ms of which 11 ms to minimize.
[2024-05-21 02:28:25] [INFO ] Deduced a trap composed of 19 places in 290 ms of which 6 ms to minimize.
[2024-05-21 02:28:25] [INFO ] Deduced a trap composed of 17 places in 289 ms of which 6 ms to minimize.
[2024-05-21 02:28:25] [INFO ] Deduced a trap composed of 65 places in 283 ms of which 5 ms to minimize.
[2024-05-21 02:28:26] [INFO ] Deduced a trap composed of 56 places in 275 ms of which 5 ms to minimize.
[2024-05-21 02:28:26] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 5 ms to minimize.
[2024-05-21 02:28:26] [INFO ] Deduced a trap composed of 60 places in 233 ms of which 7 ms to minimize.
[2024-05-21 02:28:27] [INFO ] Deduced a trap composed of 22 places in 284 ms of which 6 ms to minimize.
[2024-05-21 02:28:27] [INFO ] Deduced a trap composed of 64 places in 291 ms of which 6 ms to minimize.
[2024-05-21 02:28:27] [INFO ] Deduced a trap composed of 62 places in 272 ms of which 6 ms to minimize.
[2024-05-21 02:28:27] [INFO ] Deduced a trap composed of 20 places in 279 ms of which 5 ms to minimize.
[2024-05-21 02:28:28] [INFO ] Deduced a trap composed of 57 places in 261 ms of which 5 ms to minimize.
[2024-05-21 02:28:28] [INFO ] Deduced a trap composed of 62 places in 224 ms of which 5 ms to minimize.
[2024-05-21 02:28:28] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 02:28:33] [INFO ] Deduced a trap composed of 15 places in 285 ms of which 5 ms to minimize.
[2024-05-21 02:28:33] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 5 ms to minimize.
[2024-05-21 02:28:34] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 5 ms to minimize.
[2024-05-21 02:28:34] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 5 ms to minimize.
[2024-05-21 02:28:34] [INFO ] Deduced a trap composed of 31 places in 248 ms of which 5 ms to minimize.
[2024-05-21 02:28:34] [INFO ] Deduced a trap composed of 61 places in 227 ms of which 5 ms to minimize.
[2024-05-21 02:28:35] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 5 ms to minimize.
[2024-05-21 02:28:35] [INFO ] Deduced a trap composed of 16 places in 284 ms of which 5 ms to minimize.
[2024-05-21 02:28:35] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 4 ms to minimize.
[2024-05-21 02:28:36] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 4 ms to minimize.
[2024-05-21 02:28:36] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 4 ms to minimize.
[2024-05-21 02:28:36] [INFO ] Deduced a trap composed of 82 places in 268 ms of which 5 ms to minimize.
[2024-05-21 02:28:37] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 4 ms to minimize.
[2024-05-21 02:28:37] [INFO ] Deduced a trap composed of 57 places in 270 ms of which 5 ms to minimize.
[2024-05-21 02:28:37] [INFO ] Deduced a trap composed of 57 places in 172 ms of which 4 ms to minimize.
[2024-05-21 02:28:38] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 4 ms to minimize.
[2024-05-21 02:28:38] [INFO ] Deduced a trap composed of 59 places in 172 ms of which 4 ms to minimize.
[2024-05-21 02:28:38] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 3 ms to minimize.
[2024-05-21 02:28:38] [INFO ] Deduced a trap composed of 62 places in 232 ms of which 5 ms to minimize.
[2024-05-21 02:28:39] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-21 02:28:39] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 5 ms to minimize.
[2024-05-21 02:28:40] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 4 ms to minimize.
[2024-05-21 02:28:40] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 4 ms to minimize.
[2024-05-21 02:28:40] [INFO ] Deduced a trap composed of 63 places in 179 ms of which 4 ms to minimize.
[2024-05-21 02:28:40] [INFO ] Deduced a trap composed of 65 places in 214 ms of which 4 ms to minimize.
[2024-05-21 02:28:40] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 4 ms to minimize.
[2024-05-21 02:28:41] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 4 ms to minimize.
[2024-05-21 02:28:41] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 4 ms to minimize.
[2024-05-21 02:28:41] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 4 ms to minimize.
[2024-05-21 02:28:41] [INFO ] Deduced a trap composed of 36 places in 199 ms of which 4 ms to minimize.
[2024-05-21 02:28:42] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 4 ms to minimize.
[2024-05-21 02:28:42] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 4 ms to minimize.
[2024-05-21 02:28:43] [INFO ] Deduced a trap composed of 59 places in 240 ms of which 4 ms to minimize.
[2024-05-21 02:28:43] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 4 ms to minimize.
[2024-05-21 02:28:43] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 4 ms to minimize.
[2024-05-21 02:28:43] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 4 ms to minimize.
[2024-05-21 02:28:44] [INFO ] Deduced a trap composed of 69 places in 158 ms of which 4 ms to minimize.
SMT process timed out in 30167ms, After SMT, problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 30175ms
Starting structural reductions in LTL mode, iteration 1 : 375/415 places, 363/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30924 ms. Remains : 375/415 places, 363/405 transitions.
[2024-05-21 02:28:44] [INFO ] Flatten gal took : 19 ms
[2024-05-21 02:28:44] [INFO ] Flatten gal took : 20 ms
[2024-05-21 02:28:44] [INFO ] Input system was already deterministic with 363 transitions.
[2024-05-21 02:28:44] [INFO ] Flatten gal took : 25 ms
[2024-05-21 02:28:44] [INFO ] Flatten gal took : 20 ms
[2024-05-21 02:28:44] [INFO ] Time to serialize gal into /tmp/CTLFireability14700753866448256332.gal : 4 ms
[2024-05-21 02:28:44] [INFO ] Time to serialize properties into /tmp/CTLFireability4953539549308872437.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14700753866448256332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4953539549308872437.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 02:29:14] [INFO ] Flatten gal took : 11 ms
[2024-05-21 02:29:14] [INFO ] Applying decomposition
[2024-05-21 02:29:14] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10080322901523349525.txt' '-o' '/tmp/graph10080322901523349525.bin' '-w' '/tmp/graph10080322901523349525.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10080322901523349525.bin' '-l' '-1' '-v' '-w' '/tmp/graph10080322901523349525.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:29:14] [INFO ] Decomposing Gal with order
[2024-05-21 02:29:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:29:14] [INFO ] Removed a total of 73 redundant transitions.
[2024-05-21 02:29:14] [INFO ] Flatten gal took : 32 ms
[2024-05-21 02:29:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 02:29:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8806996000577759829.gal : 6 ms
[2024-05-21 02:29:14] [INFO ] Time to serialize properties into /tmp/CTLFireability5921002123770017522.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8806996000577759829.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5921002123770017522.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,5.89155e+27,0.852417,23776,4244,20,43626,315,627,51839,35,649,0


Converting to forward existential form...Done !
original formula: EX(EG(AG((i6.u27.p85==0))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(E(TRUE U !((i6.u27.p85==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t123, t126, t149, t152, t190, t212, t227, t234, t249, t256, t350, t351, t352, t354, t355, i0....836
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 405/405 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 393 transition count 383
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 393 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 393 transition count 381
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 54 place count 385 transition count 373
Iterating global reduction 1 with 8 rules applied. Total rules applied 62 place count 385 transition count 373
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 382 transition count 370
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 382 transition count 370
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 380 transition count 368
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 380 transition count 368
Applied a total of 72 rules in 38 ms. Remains 380 /415 variables (removed 35) and now considering 368/405 (removed 37) transitions.
// Phase 1: matrix 368 rows 380 cols
[2024-05-21 02:29:44] [INFO ] Computed 34 invariants in 5 ms
[2024-05-21 02:29:44] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-21 02:29:44] [INFO ] Invariant cache hit.
[2024-05-21 02:29:45] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2024-05-21 02:29:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 02:29:54] [INFO ] Deduced a trap composed of 21 places in 334 ms of which 7 ms to minimize.
[2024-05-21 02:29:55] [INFO ] Deduced a trap composed of 58 places in 323 ms of which 6 ms to minimize.
[2024-05-21 02:29:55] [INFO ] Deduced a trap composed of 53 places in 318 ms of which 6 ms to minimize.
[2024-05-21 02:29:55] [INFO ] Deduced a trap composed of 16 places in 300 ms of which 5 ms to minimize.
[2024-05-21 02:29:56] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 6 ms to minimize.
[2024-05-21 02:29:56] [INFO ] Deduced a trap composed of 77 places in 290 ms of which 5 ms to minimize.
[2024-05-21 02:29:56] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 5 ms to minimize.
[2024-05-21 02:29:57] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 5 ms to minimize.
[2024-05-21 02:29:57] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 5 ms to minimize.
[2024-05-21 02:29:57] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 5 ms to minimize.
[2024-05-21 02:29:58] [INFO ] Deduced a trap composed of 59 places in 258 ms of which 5 ms to minimize.
[2024-05-21 02:29:58] [INFO ] Deduced a trap composed of 25 places in 217 ms of which 5 ms to minimize.
[2024-05-21 02:29:58] [INFO ] Deduced a trap composed of 28 places in 265 ms of which 4 ms to minimize.
[2024-05-21 02:29:58] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 4 ms to minimize.
[2024-05-21 02:29:59] [INFO ] Deduced a trap composed of 52 places in 239 ms of which 4 ms to minimize.
[2024-05-21 02:29:59] [INFO ] Deduced a trap composed of 57 places in 257 ms of which 4 ms to minimize.
[2024-05-21 02:29:59] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 5 ms to minimize.
[2024-05-21 02:29:59] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 5 ms to minimize.
[2024-05-21 02:30:00] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 5 ms to minimize.
[2024-05-21 02:30:00] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 02:30:05] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 5 ms to minimize.
[2024-05-21 02:30:05] [INFO ] Deduced a trap composed of 61 places in 269 ms of which 5 ms to minimize.
[2024-05-21 02:30:06] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 5 ms to minimize.
[2024-05-21 02:30:06] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 5 ms to minimize.
[2024-05-21 02:30:06] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 4 ms to minimize.
[2024-05-21 02:30:06] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 5 ms to minimize.
[2024-05-21 02:30:07] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 4 ms to minimize.
[2024-05-21 02:30:07] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 3 ms to minimize.
[2024-05-21 02:30:07] [INFO ] Deduced a trap composed of 18 places in 264 ms of which 5 ms to minimize.
[2024-05-21 02:30:07] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 5 ms to minimize.
[2024-05-21 02:30:08] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 4 ms to minimize.
[2024-05-21 02:30:08] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 4 ms to minimize.
[2024-05-21 02:30:08] [INFO ] Deduced a trap composed of 56 places in 207 ms of which 4 ms to minimize.
[2024-05-21 02:30:09] [INFO ] Deduced a trap composed of 54 places in 279 ms of which 5 ms to minimize.
[2024-05-21 02:30:09] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 5 ms to minimize.
[2024-05-21 02:30:09] [INFO ] Deduced a trap composed of 66 places in 225 ms of which 4 ms to minimize.
[2024-05-21 02:30:09] [INFO ] Deduced a trap composed of 65 places in 215 ms of which 5 ms to minimize.
[2024-05-21 02:30:10] [INFO ] Deduced a trap composed of 28 places in 235 ms of which 4 ms to minimize.
[2024-05-21 02:30:10] [INFO ] Deduced a trap composed of 29 places in 219 ms of which 4 ms to minimize.
[2024-05-21 02:30:10] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 02:30:11] [INFO ] Deduced a trap composed of 53 places in 272 ms of which 5 ms to minimize.
[2024-05-21 02:30:11] [INFO ] Deduced a trap composed of 56 places in 254 ms of which 5 ms to minimize.
[2024-05-21 02:30:12] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 5 ms to minimize.
[2024-05-21 02:30:12] [INFO ] Deduced a trap composed of 29 places in 234 ms of which 5 ms to minimize.
[2024-05-21 02:30:13] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 4 ms to minimize.
[2024-05-21 02:30:13] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 5 ms to minimize.
[2024-05-21 02:30:13] [INFO ] Deduced a trap composed of 62 places in 171 ms of which 4 ms to minimize.
[2024-05-21 02:30:13] [INFO ] Deduced a trap composed of 78 places in 172 ms of which 4 ms to minimize.
[2024-05-21 02:30:14] [INFO ] Deduced a trap composed of 79 places in 167 ms of which 3 ms to minimize.
[2024-05-21 02:30:14] [INFO ] Deduced a trap composed of 71 places in 175 ms of which 4 ms to minimize.
[2024-05-21 02:30:14] [INFO ] Deduced a trap composed of 80 places in 166 ms of which 4 ms to minimize.
[2024-05-21 02:30:14] [INFO ] Deduced a trap composed of 73 places in 181 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/748 variables, and 86 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/380 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 52/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 02:30:21] [INFO ] Deduced a trap composed of 67 places in 250 ms of which 4 ms to minimize.
[2024-05-21 02:30:21] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 4 ms to minimize.
[2024-05-21 02:30:22] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 3 ms to minimize.
[2024-05-21 02:30:22] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 4 ms to minimize.
[2024-05-21 02:30:22] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 5 ms to minimize.
[2024-05-21 02:30:23] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 4 ms to minimize.
[2024-05-21 02:30:23] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-05-21 02:30:23] [INFO ] Deduced a trap composed of 82 places in 198 ms of which 4 ms to minimize.
[2024-05-21 02:30:23] [INFO ] Deduced a trap composed of 80 places in 190 ms of which 4 ms to minimize.
[2024-05-21 02:30:24] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 4 ms to minimize.
[2024-05-21 02:30:24] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 3 ms to minimize.
[2024-05-21 02:30:24] [INFO ] Deduced a trap composed of 80 places in 168 ms of which 4 ms to minimize.
[2024-05-21 02:30:24] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 02:30:29] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 4 ms to minimize.
[2024-05-21 02:30:29] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 5 ms to minimize.
[2024-05-21 02:30:29] [INFO ] Deduced a trap composed of 71 places in 209 ms of which 4 ms to minimize.
[2024-05-21 02:30:31] [INFO ] Deduced a trap composed of 79 places in 179 ms of which 4 ms to minimize.
[2024-05-21 02:30:32] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 3 ms to minimize.
[2024-05-21 02:30:33] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 02:30:36] [INFO ] Deduced a trap composed of 81 places in 166 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 02:30:41] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 4 ms to minimize.
[2024-05-21 02:30:41] [INFO ] Deduced a trap composed of 62 places in 205 ms of which 4 ms to minimize.
[2024-05-21 02:30:41] [INFO ] Deduced a trap composed of 66 places in 199 ms of which 4 ms to minimize.
[2024-05-21 02:30:41] [INFO ] Deduced a trap composed of 64 places in 195 ms of which 4 ms to minimize.
[2024-05-21 02:30:41] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 4 ms to minimize.
[2024-05-21 02:30:42] [INFO ] Deduced a trap composed of 59 places in 304 ms of which 5 ms to minimize.
[2024-05-21 02:30:43] [INFO ] Deduced a trap composed of 70 places in 196 ms of which 4 ms to minimize.
[2024-05-21 02:30:43] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 4 ms to minimize.
[2024-05-21 02:30:44] [INFO ] Deduced a trap composed of 76 places in 181 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/748 variables, and 115 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/380 constraints, PredecessorRefiner: 0/367 constraints, Known Traps: 81/81 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 380/415 places, 368/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60952 ms. Remains : 380/415 places, 368/405 transitions.
[2024-05-21 02:30:45] [INFO ] Flatten gal took : 18 ms
[2024-05-21 02:30:45] [INFO ] Flatten gal took : 17 ms
[2024-05-21 02:30:45] [INFO ] Input system was already deterministic with 368 transitions.
[2024-05-21 02:30:45] [INFO ] Flatten gal took : 17 ms
[2024-05-21 02:30:45] [INFO ] Flatten gal took : 16 ms
[2024-05-21 02:30:45] [INFO ] Time to serialize gal into /tmp/CTLFireability13990242595265458111.gal : 3 ms
[2024-05-21 02:30:45] [INFO ] Time to serialize properties into /tmp/CTLFireability12719415373184469863.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13990242595265458111.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12719415373184469863.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 02:31:15] [INFO ] Flatten gal took : 9 ms
[2024-05-21 02:31:15] [INFO ] Applying decomposition
[2024-05-21 02:31:15] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13928059594389909015.txt' '-o' '/tmp/graph13928059594389909015.bin' '-w' '/tmp/graph13928059594389909015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13928059594389909015.bin' '-l' '-1' '-v' '-w' '/tmp/graph13928059594389909015.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:31:15] [INFO ] Decomposing Gal with order
[2024-05-21 02:31:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:31:15] [INFO ] Removed a total of 71 redundant transitions.
[2024-05-21 02:31:15] [INFO ] Flatten gal took : 26 ms
[2024-05-21 02:31:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 02:31:15] [INFO ] Time to serialize gal into /tmp/CTLFireability2338322610439653182.gal : 5 ms
[2024-05-21 02:31:15] [INFO ] Time to serialize properties into /tmp/CTLFireability17072032503590415630.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2338322610439653182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17072032503590415630.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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,6.64049e+27,0.886867,23604,5631,14,43507,239,658,47914,31,540,0


Converting to forward existential form...Done !
original formula: AG(((E(EX((i14.u71.p251==1)) U (i11.u51.p179==1)) + AX(!(E((i7.u40.p139==1) U (i12.u62.p223==1))))) + AX((i20.u127.p403==0))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((E(EX((i14.u71.p251==1)) U (i11.u51.p179==1)) + !(EX(!(!(E((i7.u40.p139==1) U (i12.u62...207
Reverse transition relation is NOT exact ! Due to transitions t116, t129, t142, t152, t166, t195, t210, t217, t239, t261, t276, t355, t357, t359, t360, i1....878
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 405/405 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 391 transition count 381
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 391 transition count 381
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 391 transition count 379
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 58 place count 383 transition count 371
Iterating global reduction 1 with 8 rules applied. Total rules applied 66 place count 383 transition count 371
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 381 transition count 369
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 381 transition count 369
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 380 transition count 368
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 380 transition count 368
Applied a total of 72 rules in 33 ms. Remains 380 /415 variables (removed 35) and now considering 368/405 (removed 37) transitions.
// Phase 1: matrix 368 rows 380 cols
[2024-05-21 02:31:45] [INFO ] Computed 34 invariants in 3 ms
[2024-05-21 02:31:46] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 02:31:46] [INFO ] Invariant cache hit.
[2024-05-21 02:31:46] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2024-05-21 02:31:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 02:31:56] [INFO ] Deduced a trap composed of 21 places in 341 ms of which 6 ms to minimize.
[2024-05-21 02:31:56] [INFO ] Deduced a trap composed of 54 places in 288 ms of which 6 ms to minimize.
[2024-05-21 02:31:57] [INFO ] Deduced a trap composed of 16 places in 258 ms of which 5 ms to minimize.
[2024-05-21 02:31:57] [INFO ] Deduced a trap composed of 25 places in 285 ms of which 5 ms to minimize.
[2024-05-21 02:31:57] [INFO ] Deduced a trap composed of 26 places in 280 ms of which 5 ms to minimize.
[2024-05-21 02:31:58] [INFO ] Deduced a trap composed of 20 places in 201 ms of which 4 ms to minimize.
[2024-05-21 02:31:58] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 4 ms to minimize.
[2024-05-21 02:31:58] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 4 ms to minimize.
[2024-05-21 02:31:58] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 4 ms to minimize.
[2024-05-21 02:31:58] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 4 ms to minimize.
[2024-05-21 02:31:59] [INFO ] Deduced a trap composed of 63 places in 284 ms of which 6 ms to minimize.
[2024-05-21 02:31:59] [INFO ] Deduced a trap composed of 54 places in 266 ms of which 5 ms to minimize.
[2024-05-21 02:32:00] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 5 ms to minimize.
[2024-05-21 02:32:00] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 5 ms to minimize.
[2024-05-21 02:32:00] [INFO ] Deduced a trap composed of 66 places in 232 ms of which 5 ms to minimize.
[2024-05-21 02:32:00] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 4 ms to minimize.
[2024-05-21 02:32:01] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 4 ms to minimize.
[2024-05-21 02:32:01] [INFO ] Deduced a trap composed of 16 places in 258 ms of which 5 ms to minimize.
[2024-05-21 02:32:02] [INFO ] Deduced a trap composed of 20 places in 285 ms of which 5 ms to minimize.
[2024-05-21 02:32:03] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 02:32:08] [INFO ] Deduced a trap composed of 67 places in 219 ms of which 4 ms to minimize.
[2024-05-21 02:32:08] [INFO ] Deduced a trap composed of 29 places in 219 ms of which 4 ms to minimize.
[2024-05-21 02:32:09] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 4 ms to minimize.
[2024-05-21 02:32:09] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 3 ms to minimize.
[2024-05-21 02:32:09] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 4 ms to minimize.
[2024-05-21 02:32:09] [INFO ] Deduced a trap composed of 28 places in 201 ms of which 5 ms to minimize.
[2024-05-21 02:32:10] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 3 ms to minimize.
[2024-05-21 02:32:10] [INFO ] Deduced a trap composed of 62 places in 216 ms of which 5 ms to minimize.
[2024-05-21 02:32:10] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 4 ms to minimize.
[2024-05-21 02:32:12] [INFO ] Deduced a trap composed of 22 places in 266 ms of which 5 ms to minimize.
[2024-05-21 02:32:13] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 02:32:15] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 5 ms to minimize.
[2024-05-21 02:32:16] [INFO ] Deduced a trap composed of 60 places in 221 ms of which 5 ms to minimize.
[2024-05-21 02:32:16] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/748 variables, and 68 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/380 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 02:32:22] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 4 ms to minimize.
[2024-05-21 02:32:22] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 4 ms to minimize.
[2024-05-21 02:32:22] [INFO ] Deduced a trap composed of 63 places in 228 ms of which 5 ms to minimize.
[2024-05-21 02:32:23] [INFO ] Deduced a trap composed of 62 places in 237 ms of which 5 ms to minimize.
[2024-05-21 02:32:23] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 5 ms to minimize.
[2024-05-21 02:32:23] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 5 ms to minimize.
[2024-05-21 02:32:23] [INFO ] Deduced a trap composed of 68 places in 234 ms of which 5 ms to minimize.
[2024-05-21 02:32:24] [INFO ] Deduced a trap composed of 76 places in 227 ms of which 4 ms to minimize.
[2024-05-21 02:32:24] [INFO ] Deduced a trap composed of 63 places in 295 ms of which 5 ms to minimize.
[2024-05-21 02:32:25] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 4 ms to minimize.
[2024-05-21 02:32:25] [INFO ] Deduced a trap composed of 55 places in 238 ms of which 5 ms to minimize.
[2024-05-21 02:32:25] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 3 ms to minimize.
[2024-05-21 02:32:26] [INFO ] Deduced a trap composed of 60 places in 206 ms of which 4 ms to minimize.
[2024-05-21 02:32:26] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 4 ms to minimize.
[2024-05-21 02:32:26] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 5 ms to minimize.
[2024-05-21 02:32:26] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 4 ms to minimize.
[2024-05-21 02:32:26] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 3 ms to minimize.
[2024-05-21 02:32:27] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 3 ms to minimize.
[2024-05-21 02:32:27] [INFO ] Deduced a trap composed of 79 places in 152 ms of which 3 ms to minimize.
[2024-05-21 02:32:27] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 02:32:28] [INFO ] Deduced a trap composed of 60 places in 165 ms of which 4 ms to minimize.
[2024-05-21 02:32:29] [INFO ] Deduced a trap composed of 55 places in 154 ms of which 3 ms to minimize.
[2024-05-21 02:32:29] [INFO ] Deduced a trap composed of 72 places in 153 ms of which 3 ms to minimize.
[2024-05-21 02:32:29] [INFO ] Deduced a trap composed of 57 places in 155 ms of which 4 ms to minimize.
[2024-05-21 02:32:29] [INFO ] Deduced a trap composed of 76 places in 145 ms of which 3 ms to minimize.
[2024-05-21 02:32:29] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 3 ms to minimize.
[2024-05-21 02:32:29] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 3 ms to minimize.
[2024-05-21 02:32:30] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 3 ms to minimize.
[2024-05-21 02:32:30] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 3 ms to minimize.
[2024-05-21 02:32:30] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 3 ms to minimize.
[2024-05-21 02:32:30] [INFO ] Deduced a trap composed of 68 places in 126 ms of which 3 ms to minimize.
[2024-05-21 02:32:30] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 4 ms to minimize.
[2024-05-21 02:32:31] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 3 ms to minimize.
[2024-05-21 02:32:31] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 4 ms to minimize.
[2024-05-21 02:32:32] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 4 ms to minimize.
[2024-05-21 02:32:33] [INFO ] Deduced a trap composed of 46 places in 167 ms of which 4 ms to minimize.
[2024-05-21 02:32:33] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 4 ms to minimize.
[2024-05-21 02:32:33] [INFO ] Deduced a trap composed of 72 places in 182 ms of which 4 ms to minimize.
[2024-05-21 02:32:33] [INFO ] Deduced a trap composed of 73 places in 169 ms of which 3 ms to minimize.
[2024-05-21 02:32:34] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 02:32:35] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 4 ms to minimize.
[2024-05-21 02:32:36] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 3 ms to minimize.
[2024-05-21 02:32:36] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 4 ms to minimize.
[2024-05-21 02:32:39] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 02:32:44] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 02:32:46] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 3 ms to minimize.
SMT process timed out in 60191ms, After SMT, problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Starting structural reductions in LTL mode, iteration 1 : 380/415 places, 368/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60952 ms. Remains : 380/415 places, 368/405 transitions.
[2024-05-21 02:32:46] [INFO ] Flatten gal took : 13 ms
[2024-05-21 02:32:46] [INFO ] Flatten gal took : 13 ms
[2024-05-21 02:32:46] [INFO ] Input system was already deterministic with 368 transitions.
[2024-05-21 02:32:46] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:32:46] [INFO ] Flatten gal took : 13 ms
[2024-05-21 02:32:46] [INFO ] Time to serialize gal into /tmp/CTLFireability11627051240182373187.gal : 5 ms
[2024-05-21 02:32:46] [INFO ] Time to serialize properties into /tmp/CTLFireability1850754110814832099.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11627051240182373187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1850754110814832099.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 02:33:17] [INFO ] Flatten gal took : 8 ms
[2024-05-21 02:33:17] [INFO ] Applying decomposition
[2024-05-21 02:33:17] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9444190444182474987.txt' '-o' '/tmp/graph9444190444182474987.bin' '-w' '/tmp/graph9444190444182474987.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9444190444182474987.bin' '-l' '-1' '-v' '-w' '/tmp/graph9444190444182474987.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:33:17] [INFO ] Decomposing Gal with order
[2024-05-21 02:33:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:33:17] [INFO ] Removed a total of 73 redundant transitions.
[2024-05-21 02:33:17] [INFO ] Flatten gal took : 23 ms
[2024-05-21 02:33:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 02:33:17] [INFO ] Time to serialize gal into /tmp/CTLFireability9253684927924717841.gal : 5 ms
[2024-05-21 02:33:17] [INFO ] Time to serialize properties into /tmp/CTLFireability5131457549691878454.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9253684927924717841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5131457549691878454.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,6.65984e+27,1.09454,34856,6703,19,62511,260,655,96786,36,487,0


Converting to forward existential form...Done !
original formula: AF((AG(((((i11.u52.p175==1)&&(i4.u101.p337==1))||(i10.u38.p128==1)) + AX((i21.u126.p393==1)))) * (i1.u68.p239==1)))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(((((i11.u52.p175==1)&&(i4.u101.p337==1))||(i10.u38.p128==1)) + !(EX(!((i21.u126.p393=...196
Reverse transition relation is NOT exact ! Due to transitions t114, t124, t127, t150, t184, t191, t213, t239, t261, t276, t355, t356, t357, t358, t359, t36...883
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 an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 405/405 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 392 transition count 382
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 392 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 392 transition count 381
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 382 transition count 371
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 382 transition count 371
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 379 transition count 368
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 379 transition count 368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 378 transition count 367
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 378 transition count 367
Applied a total of 75 rules in 30 ms. Remains 378 /415 variables (removed 37) and now considering 367/405 (removed 38) transitions.
// Phase 1: matrix 367 rows 378 cols
[2024-05-21 02:33:47] [INFO ] Computed 34 invariants in 2 ms
[2024-05-21 02:33:47] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-21 02:33:47] [INFO ] Invariant cache hit.
[2024-05-21 02:33:47] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2024-05-21 02:33:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-21 02:33:57] [INFO ] Deduced a trap composed of 59 places in 352 ms of which 6 ms to minimize.
[2024-05-21 02:33:57] [INFO ] Deduced a trap composed of 16 places in 319 ms of which 6 ms to minimize.
[2024-05-21 02:33:57] [INFO ] Deduced a trap composed of 17 places in 325 ms of which 6 ms to minimize.
[2024-05-21 02:33:58] [INFO ] Deduced a trap composed of 73 places in 319 ms of which 6 ms to minimize.
[2024-05-21 02:33:58] [INFO ] Deduced a trap composed of 57 places in 309 ms of which 5 ms to minimize.
[2024-05-21 02:33:58] [INFO ] Deduced a trap composed of 21 places in 326 ms of which 6 ms to minimize.
[2024-05-21 02:33:59] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 5 ms to minimize.
[2024-05-21 02:33:59] [INFO ] Deduced a trap composed of 52 places in 290 ms of which 5 ms to minimize.
[2024-05-21 02:33:59] [INFO ] Deduced a trap composed of 18 places in 271 ms of which 5 ms to minimize.
[2024-05-21 02:34:00] [INFO ] Deduced a trap composed of 26 places in 245 ms of which 5 ms to minimize.
[2024-05-21 02:34:00] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 3 ms to minimize.
[2024-05-21 02:34:00] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 4 ms to minimize.
[2024-05-21 02:34:00] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 3 ms to minimize.
[2024-05-21 02:34:01] [INFO ] Deduced a trap composed of 20 places in 279 ms of which 5 ms to minimize.
[2024-05-21 02:34:01] [INFO ] Deduced a trap composed of 26 places in 300 ms of which 5 ms to minimize.
[2024-05-21 02:34:01] [INFO ] Deduced a trap composed of 28 places in 261 ms of which 4 ms to minimize.
[2024-05-21 02:34:02] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 5 ms to minimize.
[2024-05-21 02:34:02] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 4 ms to minimize.
[2024-05-21 02:34:02] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 5 ms to minimize.
[2024-05-21 02:34:02] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-21 02:34:08] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 5 ms to minimize.
[2024-05-21 02:34:08] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 3 ms to minimize.
[2024-05-21 02:34:09] [INFO ] Deduced a trap composed of 68 places in 209 ms of which 4 ms to minimize.
[2024-05-21 02:34:09] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 5 ms to minimize.
[2024-05-21 02:34:09] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 5 ms to minimize.
[2024-05-21 02:34:10] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 5 ms to minimize.
[2024-05-21 02:34:11] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 5 ms to minimize.
[2024-05-21 02:34:11] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 6 ms to minimize.
[2024-05-21 02:34:12] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 4 ms to minimize.
[2024-05-21 02:34:13] [INFO ] Deduced a trap composed of 35 places in 260 ms of which 4 ms to minimize.
[2024-05-21 02:34:13] [INFO ] Deduced a trap composed of 61 places in 252 ms of which 5 ms to minimize.
[2024-05-21 02:34:13] [INFO ] Deduced a trap composed of 76 places in 245 ms of which 5 ms to minimize.
[2024-05-21 02:34:13] [INFO ] Deduced a trap composed of 62 places in 218 ms of which 5 ms to minimize.
[2024-05-21 02:34:14] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 3 ms to minimize.
[2024-05-21 02:34:14] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 4 ms to minimize.
[2024-05-21 02:34:14] [INFO ] Deduced a trap composed of 76 places in 196 ms of which 5 ms to minimize.
[2024-05-21 02:34:15] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 4 ms to minimize.
[2024-05-21 02:34:15] [INFO ] Deduced a trap composed of 75 places in 188 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 18/72 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-21 02:34:17] [INFO ] Deduced a trap composed of 58 places in 287 ms of which 5 ms to minimize.
[2024-05-21 02:34:18] [INFO ] Deduced a trap composed of 57 places in 266 ms of which 5 ms to minimize.
SMT process timed out in 30171ms, After SMT, problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 30179ms
Starting structural reductions in LTL mode, iteration 1 : 378/415 places, 367/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30883 ms. Remains : 378/415 places, 367/405 transitions.
[2024-05-21 02:34:18] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:34:18] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:34:18] [INFO ] Input system was already deterministic with 367 transitions.
[2024-05-21 02:34:18] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:34:18] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:34:18] [INFO ] Time to serialize gal into /tmp/CTLFireability1584731498884115358.gal : 3 ms
[2024-05-21 02:34:18] [INFO ] Time to serialize properties into /tmp/CTLFireability918439390223008960.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1584731498884115358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability918439390223008960.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 02:34:48] [INFO ] Flatten gal took : 7 ms
[2024-05-21 02:34:48] [INFO ] Applying decomposition
[2024-05-21 02:34:48] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10611338261264901527.txt' '-o' '/tmp/graph10611338261264901527.bin' '-w' '/tmp/graph10611338261264901527.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10611338261264901527.bin' '-l' '-1' '-v' '-w' '/tmp/graph10611338261264901527.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:34:48] [INFO ] Decomposing Gal with order
[2024-05-21 02:34:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:34:48] [INFO ] Removed a total of 76 redundant transitions.
[2024-05-21 02:34:48] [INFO ] Flatten gal took : 20 ms
[2024-05-21 02:34:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2024-05-21 02:34:48] [INFO ] Time to serialize gal into /tmp/CTLFireability13976324180870361808.gal : 5 ms
[2024-05-21 02:34:48] [INFO ] Time to serialize properties into /tmp/CTLFireability5623872956075062717.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13976324180870361808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5623872956075062717.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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,6.98968e+27,1.74138,47376,4530,14,95939,215,729,125118,31,453,0


Converting to forward existential form...Done !
original formula: EF(AG(((EF((i8.u42.p149==0)) + AX(((i6.u22.p75==1)&&(i21.i0.u143.p438==1)))) + (AF((i7.i0.u29.p94==1)) * ((i11.i1.u64.p232==0)||(i1.i1.u7...170
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((E(TRUE U (i8.u42.p149==0)) + !(EX(!(((i6.u22.p75==1)&&(i21.i0.u143.p438==1)))...252
Reverse transition relation is NOT exact ! Due to transitions t123, t126, t149, t152, t183, t190, t205, t212, t236, t260, t275, t354, t355, t356, t357, t35...930
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 415/415 places, 405/405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 414 transition count 268
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 154 rules applied. Total rules applied 290 place count 278 transition count 250
Reduce places removed 9 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 14 rules applied. Total rules applied 304 place count 269 transition count 245
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 309 place count 264 transition count 245
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 52 Pre rules applied. Total rules applied 309 place count 264 transition count 193
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 413 place count 212 transition count 193
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 432 place count 193 transition count 174
Iterating global reduction 4 with 19 rules applied. Total rules applied 451 place count 193 transition count 174
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 451 place count 193 transition count 168
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 463 place count 187 transition count 168
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 575 place count 131 transition count 112
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 582 place count 131 transition count 105
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 596 place count 124 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 597 place count 124 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 599 place count 123 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 600 place count 122 transition count 95
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 10 rules applied. Total rules applied 610 place count 115 transition count 92
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 613 place count 112 transition count 92
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 613 place count 112 transition count 88
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 621 place count 108 transition count 88
Applied a total of 621 rules in 47 ms. Remains 108 /415 variables (removed 307) and now considering 88/405 (removed 317) transitions.
// Phase 1: matrix 88 rows 108 cols
[2024-05-21 02:35:18] [INFO ] Computed 27 invariants in 1 ms
[2024-05-21 02:35:18] [INFO ] Implicit Places using invariants in 123 ms returned [46, 83, 88, 94, 98, 102, 107]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 124 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 101/415 places, 88/405 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 96 transition count 83
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 96 transition count 83
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 0 with 4 rules applied. Total rules applied 14 place count 94 transition count 81
Applied a total of 14 rules in 5 ms. Remains 94 /101 variables (removed 7) and now considering 81/88 (removed 7) transitions.
// Phase 1: matrix 81 rows 94 cols
[2024-05-21 02:35:18] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 02:35:18] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 02:35:18] [INFO ] Invariant cache hit.
[2024-05-21 02:35:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 02:35:18] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 94/415 places, 81/405 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 510 ms. Remains : 94/415 places, 81/405 transitions.
[2024-05-21 02:35:18] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:35:18] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:35:18] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-21 02:35:18] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:35:18] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:35:18] [INFO ] Time to serialize gal into /tmp/CTLFireability17620471530013504461.gal : 1 ms
[2024-05-21 02:35:18] [INFO ] Time to serialize properties into /tmp/CTLFireability8969543309187319075.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17620471530013504461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8969543309187319075.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,1.19439e+09,0.058343,4476,2,526,5,3754,6,0,456,4273,0


Converting to forward existential form...Done !
original formula: EG(AF(((((p217==0)||(p370==0))||((p163==0)||(p254==1)))||((p250==1)||((p195==1)&&(p391==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((((p217==0)||(p370==0))||((p163==0)||(p254==1)))||((p250==1)||((p195==1)&&(p391==1))))))))] !...162
Reverse transition relation is NOT exact ! Due to transitions t77, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,0.371633,10812,1,0,185,39370,185,77,2717,23407,267
FORMULA AutoFlight-PT-05b-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 415/415 places, 405/405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 145 place count 414 transition count 259
Reduce places removed 145 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 164 rules applied. Total rules applied 309 place count 269 transition count 240
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 319 place count 259 transition count 240
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 319 place count 259 transition count 189
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 421 place count 208 transition count 189
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 439 place count 190 transition count 171
Iterating global reduction 3 with 18 rules applied. Total rules applied 457 place count 190 transition count 171
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 457 place count 190 transition count 163
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 473 place count 182 transition count 163
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 589 place count 124 transition count 105
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 597 place count 124 transition count 97
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 613 place count 116 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 614 place count 115 transition count 88
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 11 rules applied. Total rules applied 625 place count 107 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 628 place count 104 transition count 85
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 628 place count 104 transition count 80
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 638 place count 99 transition count 80
Applied a total of 638 rules in 48 ms. Remains 99 /415 variables (removed 316) and now considering 80/405 (removed 325) transitions.
// Phase 1: matrix 80 rows 99 cols
[2024-05-21 02:35:19] [INFO ] Computed 26 invariants in 2 ms
[2024-05-21 02:35:19] [INFO ] Implicit Places using invariants in 183 ms returned [41, 58, 75, 80, 85, 89, 93, 98]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 184 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 91/415 places, 80/405 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 85 transition count 74
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 85 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 84 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 84 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 83 transition count 72
Applied a total of 16 rules in 8 ms. Remains 83 /91 variables (removed 8) and now considering 72/80 (removed 8) transitions.
// Phase 1: matrix 72 rows 83 cols
[2024-05-21 02:35:19] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 02:35:19] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 02:35:19] [INFO ] Invariant cache hit.
[2024-05-21 02:35:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 02:35:19] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 83/415 places, 72/405 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 580 ms. Remains : 83/415 places, 72/405 transitions.
[2024-05-21 02:35:19] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:35:19] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:35:19] [INFO ] Input system was already deterministic with 72 transitions.
[2024-05-21 02:35:19] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:35:19] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:35:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1162948639411483697.gal : 1 ms
[2024-05-21 02:35:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16816089763399668927.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1162948639411483697.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16816089763399668927.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16816089763399668927.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 27
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :27 after 243
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :243 after 124416
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :124416 after 360666
Reachability property AutoFlight-PT-05b-CTLFireability-2024-08 is true.
FORMULA AutoFlight-PT-05b-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,558148,0.064659,4248,2,382,11,1562,6,0,401,801,0
Total reachable state count : 558148

Verifying 1 reachability properties.
Reachability property AutoFlight-PT-05b-CTLFireability-2024-08 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-05b-CTLFireability-2024-08,1,0.065439,4248,2,84,11,1562,7,0,404,801,0
ITS tools runner thread asked to quit. Dying gracefully.
RANDOM walk for 40000 steps (1868 resets) in 434 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (168 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2398516 steps, run timeout after 3001 ms. (steps per millisecond=799 ) properties seen :0 out of 1
Probabilistic random walk after 2398516 steps, saw 345424 distinct states, run finished after 3007 ms. (steps per millisecond=797 ) properties seen :0
Starting structural reductions in SI_CTL mode, iteration 0 : 415/415 places, 405/405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 145 place count 414 transition count 259
Reduce places removed 145 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 164 rules applied. Total rules applied 309 place count 269 transition count 240
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 320 place count 259 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 321 place count 258 transition count 239
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 321 place count 258 transition count 188
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 423 place count 207 transition count 188
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 441 place count 189 transition count 170
Iterating global reduction 4 with 18 rules applied. Total rules applied 459 place count 189 transition count 170
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 459 place count 189 transition count 163
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 473 place count 182 transition count 163
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 585 place count 126 transition count 107
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 593 place count 126 transition count 99
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 609 place count 118 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 610 place count 117 transition count 90
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 10 rules applied. Total rules applied 620 place count 110 transition count 87
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 623 place count 107 transition count 87
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 623 place count 107 transition count 83
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 631 place count 103 transition count 83
Applied a total of 631 rules in 35 ms. Remains 103 /415 variables (removed 312) and now considering 83/405 (removed 322) transitions.
// Phase 1: matrix 83 rows 103 cols
[2024-05-21 02:35:23] [INFO ] Computed 27 invariants in 1 ms
[2024-05-21 02:35:23] [INFO ] Implicit Places using invariants in 99 ms returned [44, 61, 78, 84, 89, 93, 97, 102]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 101 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 95/415 places, 83/405 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 89 transition count 77
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 89 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 88 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 88 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 87 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 87 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 86 transition count 74
Applied a total of 18 rules in 7 ms. Remains 86 /95 variables (removed 9) and now considering 74/83 (removed 9) transitions.
// Phase 1: matrix 74 rows 86 cols
[2024-05-21 02:35:23] [INFO ] Computed 19 invariants in 1 ms
[2024-05-21 02:35:23] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 02:35:23] [INFO ] Invariant cache hit.
[2024-05-21 02:35:23] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-21 02:35:23] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 86/415 places, 74/405 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 364 ms. Remains : 86/415 places, 74/405 transitions.
[2024-05-21 02:35:23] [INFO ] Flatten gal took : 2 ms
[2024-05-21 02:35:23] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:35:23] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-21 02:35:23] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:35:23] [INFO ] Flatten gal took : 6 ms
[2024-05-21 02:35:23] [INFO ] Time to serialize gal into /tmp/CTLFireability10150894368035188246.gal : 1 ms
[2024-05-21 02:35:23] [INFO ] Time to serialize properties into /tmp/CTLFireability8557425017981462939.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10150894368035188246.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8557425017981462939.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,7.46496e+07,0.067522,5496,2,688,5,7851,6,0,413,9983,0


Converting to forward existential form...Done !
original formula: EG(AF(((p12==1) + EG(A((p138==1) U (p202==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((p12==1) + EG(!((E(!((p202==1)) U (!((p138==1)) * !((p202==1)))) + EG(!((p202==1)))))))))))] ...163
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t59, t64, t71, t72, Intersection with reachable at each step enabled. (destroyed/rev...187
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.98171,227300,1,0,1041,1.36099e+06,189,578,2532,1.49457e+06,1081
FORMULA AutoFlight-PT-05b-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 405/405 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 398 transition count 388
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 398 transition count 388
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 398 transition count 386
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 393 transition count 381
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 393 transition count 381
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 391 transition count 379
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 391 transition count 379
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 390 transition count 378
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 390 transition count 378
Applied a total of 52 rules in 27 ms. Remains 390 /415 variables (removed 25) and now considering 378/405 (removed 27) transitions.
// Phase 1: matrix 378 rows 390 cols
[2024-05-21 02:35:31] [INFO ] Computed 34 invariants in 3 ms
[2024-05-21 02:35:31] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-21 02:35:31] [INFO ] Invariant cache hit.
[2024-05-21 02:35:32] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2024-05-21 02:35:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (OVERLAPS) 1/390 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-21 02:35:41] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-05-21 02:35:42] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 4 ms to minimize.
[2024-05-21 02:35:42] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 3 ms to minimize.
[2024-05-21 02:35:42] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 3 ms to minimize.
[2024-05-21 02:35:43] [INFO ] Deduced a trap composed of 54 places in 342 ms of which 6 ms to minimize.
[2024-05-21 02:35:43] [INFO ] Deduced a trap composed of 15 places in 298 ms of which 6 ms to minimize.
[2024-05-21 02:35:43] [INFO ] Deduced a trap composed of 21 places in 345 ms of which 6 ms to minimize.
[2024-05-21 02:35:43] [INFO ] Deduced a trap composed of 16 places in 260 ms of which 6 ms to minimize.
[2024-05-21 02:35:44] [INFO ] Deduced a trap composed of 58 places in 342 ms of which 6 ms to minimize.
[2024-05-21 02:35:44] [INFO ] Deduced a trap composed of 18 places in 335 ms of which 6 ms to minimize.
[2024-05-21 02:35:44] [INFO ] Deduced a trap composed of 51 places in 322 ms of which 8 ms to minimize.
[2024-05-21 02:35:45] [INFO ] Deduced a trap composed of 18 places in 344 ms of which 6 ms to minimize.
[2024-05-21 02:35:45] [INFO ] Deduced a trap composed of 62 places in 322 ms of which 6 ms to minimize.
[2024-05-21 02:35:46] [INFO ] Deduced a trap composed of 56 places in 329 ms of which 5 ms to minimize.
[2024-05-21 02:35:46] [INFO ] Deduced a trap composed of 21 places in 302 ms of which 6 ms to minimize.
[2024-05-21 02:35:46] [INFO ] Deduced a trap composed of 68 places in 293 ms of which 6 ms to minimize.
[2024-05-21 02:35:46] [INFO ] Deduced a trap composed of 71 places in 283 ms of which 6 ms to minimize.
[2024-05-21 02:35:47] [INFO ] Deduced a trap composed of 67 places in 285 ms of which 5 ms to minimize.
[2024-05-21 02:35:47] [INFO ] Deduced a trap composed of 57 places in 279 ms of which 6 ms to minimize.
[2024-05-21 02:35:47] [INFO ] Deduced a trap composed of 21 places in 279 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-21 02:35:53] [INFO ] Deduced a trap composed of 56 places in 273 ms of which 6 ms to minimize.
[2024-05-21 02:35:53] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 5 ms to minimize.
[2024-05-21 02:35:53] [INFO ] Deduced a trap composed of 29 places in 262 ms of which 6 ms to minimize.
[2024-05-21 02:35:54] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 4 ms to minimize.
[2024-05-21 02:35:54] [INFO ] Deduced a trap composed of 26 places in 289 ms of which 5 ms to minimize.
[2024-05-21 02:35:54] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 5 ms to minimize.
[2024-05-21 02:35:55] [INFO ] Deduced a trap composed of 28 places in 297 ms of which 6 ms to minimize.
[2024-05-21 02:35:55] [INFO ] Deduced a trap composed of 22 places in 316 ms of which 6 ms to minimize.
[2024-05-21 02:35:56] [INFO ] Deduced a trap composed of 62 places in 280 ms of which 5 ms to minimize.
[2024-05-21 02:35:56] [INFO ] Deduced a trap composed of 30 places in 266 ms of which 5 ms to minimize.
[2024-05-21 02:35:56] [INFO ] Deduced a trap composed of 81 places in 223 ms of which 4 ms to minimize.
[2024-05-21 02:35:56] [INFO ] Deduced a trap composed of 64 places in 209 ms of which 4 ms to minimize.
[2024-05-21 02:35:57] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 4 ms to minimize.
[2024-05-21 02:35:57] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 4 ms to minimize.
[2024-05-21 02:35:57] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 3 ms to minimize.
[2024-05-21 02:35:57] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 3 ms to minimize.
[2024-05-21 02:35:57] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 3 ms to minimize.
[2024-05-21 02:35:58] [INFO ] Deduced a trap composed of 29 places in 248 ms of which 6 ms to minimize.
[2024-05-21 02:35:58] [INFO ] Deduced a trap composed of 30 places in 271 ms of which 5 ms to minimize.
[2024-05-21 02:35:58] [INFO ] Deduced a trap composed of 94 places in 213 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-21 02:35:59] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 3 ms to minimize.
[2024-05-21 02:35:59] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 3 ms to minimize.
[2024-05-21 02:35:59] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 3 ms to minimize.
[2024-05-21 02:35:59] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 3 ms to minimize.
[2024-05-21 02:35:59] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 3 ms to minimize.
[2024-05-21 02:36:00] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 3 ms to minimize.
[2024-05-21 02:36:00] [INFO ] Deduced a trap composed of 70 places in 261 ms of which 5 ms to minimize.
[2024-05-21 02:36:01] [INFO ] Deduced a trap composed of 69 places in 261 ms of which 5 ms to minimize.
[2024-05-21 02:36:01] [INFO ] Deduced a trap composed of 27 places in 287 ms of which 5 ms to minimize.
[2024-05-21 02:36:02] [INFO ] Deduced a trap composed of 72 places in 124 ms of which 3 ms to minimize.
[2024-05-21 02:36:02] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 4 ms to minimize.
SMT process timed out in 30167ms, After SMT, problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 30173ms
Starting structural reductions in LTL mode, iteration 1 : 390/415 places, 378/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30957 ms. Remains : 390/415 places, 378/405 transitions.
[2024-05-21 02:36:02] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:36:02] [INFO ] Flatten gal took : 13 ms
[2024-05-21 02:36:02] [INFO ] Input system was already deterministic with 378 transitions.
[2024-05-21 02:36:02] [INFO ] Flatten gal took : 13 ms
[2024-05-21 02:36:02] [INFO ] Flatten gal took : 14 ms
[2024-05-21 02:36:02] [INFO ] Time to serialize gal into /tmp/CTLFireability6932100363246413853.gal : 3 ms
[2024-05-21 02:36:02] [INFO ] Time to serialize properties into /tmp/CTLFireability8183509054036274970.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6932100363246413853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8183509054036274970.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 02:36:32] [INFO ] Flatten gal took : 8 ms
[2024-05-21 02:36:32] [INFO ] Applying decomposition
[2024-05-21 02:36:32] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2263820442301753120.txt' '-o' '/tmp/graph2263820442301753120.bin' '-w' '/tmp/graph2263820442301753120.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2263820442301753120.bin' '-l' '-1' '-v' '-w' '/tmp/graph2263820442301753120.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:36:32] [INFO ] Decomposing Gal with order
[2024-05-21 02:36:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:36:32] [INFO ] Removed a total of 65 redundant transitions.
[2024-05-21 02:36:32] [INFO ] Flatten gal took : 20 ms
[2024-05-21 02:36:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 02:36:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11307670750095333581.gal : 5 ms
[2024-05-21 02:36:32] [INFO ] Time to serialize properties into /tmp/CTLFireability4787753539547976233.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11307670750095333581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4787753539547976233.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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,8.0814e+27,8.5354,220384,26739,23,415237,367,734,702228,41,1253,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 405/405 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 390 transition count 380
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 390 transition count 380
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 390 transition count 378
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 381 transition count 369
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 381 transition count 369
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 378 transition count 366
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 378 transition count 366
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 376 transition count 364
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 376 transition count 364
Applied a total of 80 rules in 26 ms. Remains 376 /415 variables (removed 39) and now considering 364/405 (removed 41) transitions.
// Phase 1: matrix 364 rows 376 cols
[2024-05-21 02:37:02] [INFO ] Computed 34 invariants in 3 ms
[2024-05-21 02:37:02] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-21 02:37:02] [INFO ] Invariant cache hit.
[2024-05-21 02:37:03] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-05-21 02:37:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 02:37:13] [INFO ] Deduced a trap composed of 21 places in 340 ms of which 6 ms to minimize.
[2024-05-21 02:37:13] [INFO ] Deduced a trap composed of 54 places in 326 ms of which 6 ms to minimize.
[2024-05-21 02:37:13] [INFO ] Deduced a trap composed of 16 places in 316 ms of which 6 ms to minimize.
[2024-05-21 02:37:14] [INFO ] Deduced a trap composed of 63 places in 324 ms of which 6 ms to minimize.
[2024-05-21 02:37:14] [INFO ] Deduced a trap composed of 20 places in 303 ms of which 5 ms to minimize.
[2024-05-21 02:37:14] [INFO ] Deduced a trap composed of 18 places in 306 ms of which 5 ms to minimize.
[2024-05-21 02:37:15] [INFO ] Deduced a trap composed of 59 places in 324 ms of which 6 ms to minimize.
[2024-05-21 02:37:15] [INFO ] Deduced a trap composed of 20 places in 259 ms of which 5 ms to minimize.
[2024-05-21 02:37:15] [INFO ] Deduced a trap composed of 22 places in 253 ms of which 5 ms to minimize.
[2024-05-21 02:37:16] [INFO ] Deduced a trap composed of 25 places in 239 ms of which 5 ms to minimize.
[2024-05-21 02:37:16] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 4 ms to minimize.
[2024-05-21 02:37:16] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 5 ms to minimize.
[2024-05-21 02:37:16] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 4 ms to minimize.
[2024-05-21 02:37:17] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 6 ms to minimize.
[2024-05-21 02:37:17] [INFO ] Deduced a trap composed of 72 places in 275 ms of which 5 ms to minimize.
[2024-05-21 02:37:17] [INFO ] Deduced a trap composed of 62 places in 265 ms of which 5 ms to minimize.
[2024-05-21 02:37:18] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 3 ms to minimize.
[2024-05-21 02:37:19] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-21 02:37:19] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-21 02:37:20] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 02:37:25] [INFO ] Deduced a trap composed of 54 places in 266 ms of which 5 ms to minimize.
[2024-05-21 02:37:25] [INFO ] Deduced a trap composed of 70 places in 250 ms of which 5 ms to minimize.
[2024-05-21 02:37:25] [INFO ] Deduced a trap composed of 59 places in 250 ms of which 5 ms to minimize.
[2024-05-21 02:37:26] [INFO ] Deduced a trap composed of 62 places in 261 ms of which 5 ms to minimize.
[2024-05-21 02:37:26] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 5 ms to minimize.
[2024-05-21 02:37:26] [INFO ] Deduced a trap composed of 62 places in 250 ms of which 5 ms to minimize.
[2024-05-21 02:37:26] [INFO ] Deduced a trap composed of 63 places in 228 ms of which 4 ms to minimize.
[2024-05-21 02:37:27] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 4 ms to minimize.
[2024-05-21 02:37:27] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 4 ms to minimize.
[2024-05-21 02:37:27] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 4 ms to minimize.
[2024-05-21 02:37:27] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 3 ms to minimize.
[2024-05-21 02:37:27] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 4 ms to minimize.
[2024-05-21 02:37:28] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 3 ms to minimize.
[2024-05-21 02:37:28] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 3 ms to minimize.
[2024-05-21 02:37:28] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 3 ms to minimize.
[2024-05-21 02:37:28] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 3 ms to minimize.
[2024-05-21 02:37:28] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 3 ms to minimize.
[2024-05-21 02:37:28] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 3 ms to minimize.
[2024-05-21 02:37:29] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 5 ms to minimize.
[2024-05-21 02:37:30] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 02:37:31] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 3 ms to minimize.
[2024-05-21 02:37:31] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-21 02:37:31] [INFO ] Deduced a trap composed of 56 places in 274 ms of which 6 ms to minimize.
[2024-05-21 02:37:32] [INFO ] Deduced a trap composed of 29 places in 246 ms of which 5 ms to minimize.
[2024-05-21 02:37:32] [INFO ] Deduced a trap composed of 61 places in 228 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/740 variables, and 79 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/376 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 45/79 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 02:37:39] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 2 ms to minimize.
[2024-05-21 02:37:39] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 4 ms to minimize.
[2024-05-21 02:37:40] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 5 ms to minimize.
[2024-05-21 02:37:40] [INFO ] Deduced a trap composed of 61 places in 193 ms of which 4 ms to minimize.
[2024-05-21 02:37:40] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 4 ms to minimize.
[2024-05-21 02:37:41] [INFO ] Deduced a trap composed of 69 places in 185 ms of which 4 ms to minimize.
[2024-05-21 02:37:41] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 4 ms to minimize.
[2024-05-21 02:37:41] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 4 ms to minimize.
[2024-05-21 02:37:41] [INFO ] Deduced a trap composed of 79 places in 155 ms of which 4 ms to minimize.
[2024-05-21 02:37:41] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 3 ms to minimize.
[2024-05-21 02:37:41] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 3 ms to minimize.
[2024-05-21 02:37:42] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 3 ms to minimize.
[2024-05-21 02:37:42] [INFO ] Deduced a trap composed of 74 places in 202 ms of which 4 ms to minimize.
[2024-05-21 02:37:42] [INFO ] Deduced a trap composed of 71 places in 187 ms of which 4 ms to minimize.
[2024-05-21 02:37:42] [INFO ] Deduced a trap composed of 74 places in 159 ms of which 4 ms to minimize.
[2024-05-21 02:37:43] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 3 ms to minimize.
[2024-05-21 02:37:44] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 3 ms to minimize.
[2024-05-21 02:37:45] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 3 ms to minimize.
[2024-05-21 02:37:45] [INFO ] Deduced a trap composed of 75 places in 186 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 19/98 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 02:37:47] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 4 ms to minimize.
[2024-05-21 02:37:48] [INFO ] Deduced a trap composed of 69 places in 207 ms of which 5 ms to minimize.
[2024-05-21 02:37:48] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 4 ms to minimize.
[2024-05-21 02:37:49] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 4 ms to minimize.
[2024-05-21 02:37:49] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 4 ms to minimize.
[2024-05-21 02:37:49] [INFO ] Deduced a trap composed of 80 places in 156 ms of which 4 ms to minimize.
[2024-05-21 02:37:50] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 3 ms to minimize.
[2024-05-21 02:37:50] [INFO ] Deduced a trap composed of 76 places in 161 ms of which 3 ms to minimize.
[2024-05-21 02:37:51] [INFO ] Deduced a trap composed of 59 places in 238 ms of which 4 ms to minimize.
[2024-05-21 02:37:52] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 4 ms to minimize.
[2024-05-21 02:37:52] [INFO ] Deduced a trap composed of 72 places in 200 ms of which 5 ms to minimize.
[2024-05-21 02:37:53] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 3 ms to minimize.
[2024-05-21 02:37:53] [INFO ] Deduced a trap composed of 73 places in 186 ms of which 4 ms to minimize.
[2024-05-21 02:37:53] [INFO ] Deduced a trap composed of 72 places in 217 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 14/112 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 02:37:56] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 5 ms to minimize.
[2024-05-21 02:37:56] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 4 ms to minimize.
[2024-05-21 02:37:57] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-21 02:38:02] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 3 ms to minimize.
[2024-05-21 02:38:02] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 4 ms to minimize.
[2024-05-21 02:38:03] [INFO ] Deduced a trap composed of 70 places in 183 ms of which 4 ms to minimize.
[2024-05-21 02:38:03] [INFO ] Deduced a trap composed of 51 places in 291 ms of which 5 ms to minimize.
SMT process timed out in 60150ms, After SMT, problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 376/415 places, 364/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60897 ms. Remains : 376/415 places, 364/405 transitions.
[2024-05-21 02:38:03] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:38:03] [INFO ] Flatten gal took : 13 ms
[2024-05-21 02:38:03] [INFO ] Input system was already deterministic with 364 transitions.
[2024-05-21 02:38:03] [INFO ] Flatten gal took : 11 ms
[2024-05-21 02:38:03] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:38:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4056137876454239428.gal : 3 ms
[2024-05-21 02:38:03] [INFO ] Time to serialize properties into /tmp/CTLFireability10212661458641182455.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4056137876454239428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10212661458641182455.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 02:38:33] [INFO ] Flatten gal took : 7 ms
[2024-05-21 02:38:33] [INFO ] Applying decomposition
[2024-05-21 02:38:33] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph976873040916487684.txt' '-o' '/tmp/graph976873040916487684.bin' '-w' '/tmp/graph976873040916487684.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph976873040916487684.bin' '-l' '-1' '-v' '-w' '/tmp/graph976873040916487684.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:38:33] [INFO ] Decomposing Gal with order
[2024-05-21 02:38:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:38:33] [INFO ] Removed a total of 70 redundant transitions.
[2024-05-21 02:38:33] [INFO ] Flatten gal took : 23 ms
[2024-05-21 02:38:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 02:38:33] [INFO ] Time to serialize gal into /tmp/CTLFireability10573754289148077170.gal : 5 ms
[2024-05-21 02:38:33] [INFO ] Time to serialize properties into /tmp/CTLFireability15637006726603955775.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10573754289148077170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15637006726603955775.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
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,5.99514e+27,0.557205,16040,3659,21,25802,271,635,28943,38,489,0


Converting to forward existential form...Done !
original formula: EX(EX(EX(EG((i12.u61.p222==0)))))
=> equivalent forward existential formula: [FwdG(EY(EY(EY(Init))),(i12.u61.p222==0))] != FALSE
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 an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,0,17.5229,327824,1,0,912576,271,3277,633295,136,489,639417
FORMULA AutoFlight-PT-05b-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 415/415 places, 405/405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 414 transition count 267
Reduce places removed 137 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 156 rules applied. Total rules applied 293 place count 277 transition count 248
Reduce places removed 10 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 13 rules applied. Total rules applied 306 place count 267 transition count 245
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 309 place count 264 transition count 245
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 309 place count 264 transition count 197
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 405 place count 216 transition count 197
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 423 place count 198 transition count 179
Iterating global reduction 4 with 18 rules applied. Total rules applied 441 place count 198 transition count 179
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 441 place count 198 transition count 172
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 455 place count 191 transition count 172
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 567 place count 135 transition count 116
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 575 place count 135 transition count 108
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 589 place count 128 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 590 place count 127 transition count 100
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 8 rules applied. Total rules applied 598 place count 121 transition count 98
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 600 place count 119 transition count 98
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 600 place count 119 transition count 95
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 606 place count 116 transition count 95
Applied a total of 606 rules in 34 ms. Remains 116 /415 variables (removed 299) and now considering 95/405 (removed 310) transitions.
// Phase 1: matrix 95 rows 116 cols
[2024-05-21 02:38:51] [INFO ] Computed 28 invariants in 4 ms
[2024-05-21 02:38:51] [INFO ] Implicit Places using invariants in 117 ms returned [69, 86, 93, 99, 103, 107, 115]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 118 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 109/415 places, 95/405 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 104 transition count 90
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 104 transition count 90
Applied a total of 10 rules in 4 ms. Remains 104 /109 variables (removed 5) and now considering 90/95 (removed 5) transitions.
// Phase 1: matrix 90 rows 104 cols
[2024-05-21 02:38:51] [INFO ] Computed 21 invariants in 0 ms
[2024-05-21 02:38:51] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 02:38:51] [INFO ] Invariant cache hit.
[2024-05-21 02:38:51] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-21 02:38:51] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 104/415 places, 90/405 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 398 ms. Remains : 104/415 places, 90/405 transitions.
[2024-05-21 02:38:51] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:38:51] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:38:51] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-21 02:38:51] [INFO ] Flatten gal took : 2 ms
[2024-05-21 02:38:51] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:38:51] [INFO ] Time to serialize gal into /tmp/CTLFireability17925675047993942476.gal : 1 ms
[2024-05-21 02:38:51] [INFO ] Time to serialize properties into /tmp/CTLFireability9039477663777110548.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17925675047993942476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9039477663777110548.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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.09392e+09,0.065913,5332,2,1279,5,8101,6,0,504,9042,0


Converting to forward existential form...Done !
original formula: AG(((p479==0) + (((!(E((((p46==1)&&(p398==1))||(p245!=1)) U A((p467==1) U (p217==1)))) * (p168==1)) * (AG(((p255==0)||(p418==0))) * AF((p...225
=> equivalent forward existential formula: ((([((FwdU((FwdU(Init,TRUE) * !((p479==0))),(((p46==1)&&(p398==1))||(p245!=1))) * !(EG(!((p217==1))))) * !(E(!((...582
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t34, t35, t45, t58, t61, t73, t77, Intersection with reachable at each step enabled....202
Hit Full ! (commute/partial/dont) 88/0/2
(forward)formula 0,0,9.21368,255132,1,0,675,1.5868e+06,222,311,3068,1.60019e+06,742
FORMULA AutoFlight-PT-05b-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 415/415 places, 405/405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 146 place count 414 transition count 258
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 165 rules applied. Total rules applied 311 place count 268 transition count 239
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 321 place count 258 transition count 239
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 321 place count 258 transition count 189
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 421 place count 208 transition count 189
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 439 place count 190 transition count 171
Iterating global reduction 3 with 18 rules applied. Total rules applied 457 place count 190 transition count 171
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 457 place count 190 transition count 164
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 471 place count 183 transition count 164
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 589 place count 124 transition count 105
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 597 place count 124 transition count 97
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 613 place count 116 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 614 place count 115 transition count 88
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 11 rules applied. Total rules applied 625 place count 107 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 628 place count 104 transition count 85
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 628 place count 104 transition count 80
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 638 place count 99 transition count 80
Applied a total of 638 rules in 25 ms. Remains 99 /415 variables (removed 316) and now considering 80/405 (removed 325) transitions.
// Phase 1: matrix 80 rows 99 cols
[2024-05-21 02:39:01] [INFO ] Computed 26 invariants in 1 ms
[2024-05-21 02:39:01] [INFO ] Implicit Places using invariants in 109 ms returned [41, 58, 75, 80, 85, 89, 93, 98]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 110 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 91/415 places, 80/405 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 85 transition count 74
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 85 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 84 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 84 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 83 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 83 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 82 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 82 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 81 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 81 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 80 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 80 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 79 transition count 68
Applied a total of 24 rules in 8 ms. Remains 79 /91 variables (removed 12) and now considering 68/80 (removed 12) transitions.
// Phase 1: matrix 68 rows 79 cols
[2024-05-21 02:39:01] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 02:39:01] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 02:39:01] [INFO ] Invariant cache hit.
[2024-05-21 02:39:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 02:39:01] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 79/415 places, 68/405 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 325 ms. Remains : 79/415 places, 68/405 transitions.
[2024-05-21 02:39:01] [INFO ] Flatten gal took : 1 ms
[2024-05-21 02:39:01] [INFO ] Flatten gal took : 2 ms
[2024-05-21 02:39:01] [INFO ] Input system was already deterministic with 68 transitions.
[2024-05-21 02:39:01] [INFO ] Flatten gal took : 1 ms
[2024-05-21 02:39:01] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 2283 steps (107 resets) in 9 ms. (228 steps per ms) remains 0/1 properties
FORMULA AutoFlight-PT-05b-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 02:39:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8553976293868583251.gal : 1 ms
[2024-05-21 02:39:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16658864589723343618.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8553976293868583251.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16658864589723343618.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :
ITS runner timed out or was interrupted.

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 415/415 places, 405/405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 414 transition count 266
Reduce places removed 138 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 153 rules applied. Total rules applied 291 place count 276 transition count 251
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 11 rules applied. Total rules applied 302 place count 268 transition count 248
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 306 place count 265 transition count 247
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 306 place count 265 transition count 196
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 408 place count 214 transition count 196
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 427 place count 195 transition count 177
Iterating global reduction 4 with 19 rules applied. Total rules applied 446 place count 195 transition count 177
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 446 place count 195 transition count 169
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 462 place count 187 transition count 169
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 578 place count 129 transition count 111
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 586 place count 129 transition count 103
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 602 place count 121 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 603 place count 120 transition count 94
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 9 rules applied. Total rules applied 612 place count 113 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 614 place count 111 transition count 92
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 614 place count 111 transition count 87
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 624 place count 106 transition count 87
Applied a total of 624 rules in 25 ms. Remains 106 /415 variables (removed 309) and now considering 87/405 (removed 318) transitions.
// Phase 1: matrix 87 rows 106 cols
[2024-05-21 02:39:01] [INFO ] Computed 27 invariants in 1 ms
[2024-05-21 02:39:01] [INFO ] Implicit Places using invariants in 108 ms returned [44, 63, 80, 85, 90, 96, 100, 105]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 111 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 98/415 places, 87/405 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 92 transition count 81
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 92 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 91 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 91 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 90 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 90 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 89 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 89 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 88 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 88 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 87 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 87 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 86 transition count 75
Applied a total of 24 rules in 13 ms. Remains 86 /98 variables (removed 12) and now considering 75/87 (removed 12) transitions.
// Phase 1: matrix 75 rows 86 cols
[2024-05-21 02:39:01] [INFO ] Computed 19 invariants in 0 ms
[2024-05-21 02:39:01] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 02:39:01] [INFO ] Invariant cache hit.
[2024-05-21 02:39:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 02:39:01] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 86/415 places, 75/405 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 414 ms. Remains : 86/415 places, 75/405 transitions.
[2024-05-21 02:39:01] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:39:01] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:39:01] [INFO ] Input system was already deterministic with 75 transitions.
[2024-05-21 02:39:01] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:39:01] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:39:01] [INFO ] Time to serialize gal into /tmp/CTLFireability2424368176731953079.gal : 1 ms
[2024-05-21 02:39:01] [INFO ] Time to serialize properties into /tmp/CTLFireability15208694234487826774.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2424368176731953079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15208694234487826774.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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.38879e+08,0.048296,4236,2,358,5,2885,6,0,416,3911,0


Converting to forward existential form...Done !
original formula: E(((p264==1)&&(p152==1)) U EF(((p433!=1) * AF((p327==1)))))
=> equivalent forward existential formula: [((FwdU(FwdU(Init,((p264==1)&&(p152==1))),TRUE) * (p433!=1)) * !(EG(!((p327==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t72, t73, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...169
Hit Full ! (commute/partial/dont) 70/5/5
(forward)formula 0,1,2.00248,62356,1,0,446,348050,182,216,2480,381900,617
FORMULA AutoFlight-PT-05b-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 415/415 places, 405/405 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 414 transition count 267
Reduce places removed 137 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 156 rules applied. Total rules applied 293 place count 277 transition count 248
Reduce places removed 10 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 13 rules applied. Total rules applied 306 place count 267 transition count 245
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 309 place count 264 transition count 245
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 309 place count 264 transition count 196
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 407 place count 215 transition count 196
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 424 place count 198 transition count 179
Iterating global reduction 4 with 17 rules applied. Total rules applied 441 place count 198 transition count 179
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 441 place count 198 transition count 172
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 455 place count 191 transition count 172
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 567 place count 135 transition count 116
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 575 place count 135 transition count 108
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 589 place count 128 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 590 place count 127 transition count 100
Applied a total of 590 rules in 24 ms. Remains 127 /415 variables (removed 288) and now considering 100/405 (removed 305) transitions.
// Phase 1: matrix 100 rows 127 cols
[2024-05-21 02:39:03] [INFO ] Computed 34 invariants in 0 ms
[2024-05-21 02:39:04] [INFO ] Implicit Places using invariants in 96 ms returned [73, 91, 105, 111]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 97 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 123/415 places, 100/405 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 120 transition count 97
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 120 transition count 97
Applied a total of 6 rules in 4 ms. Remains 120 /123 variables (removed 3) and now considering 97/100 (removed 3) transitions.
// Phase 1: matrix 97 rows 120 cols
[2024-05-21 02:39:04] [INFO ] Computed 30 invariants in 0 ms
[2024-05-21 02:39:04] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-21 02:39:04] [INFO ] Invariant cache hit.
[2024-05-21 02:39:04] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 02:39:04] [INFO ] Implicit Places using invariants and state equation in 286 ms returned [47, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 410 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 118/415 places, 97/405 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 118 transition count 95
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 116 transition count 95
Applied a total of 4 rules in 4 ms. Remains 116 /118 variables (removed 2) and now considering 95/97 (removed 2) transitions.
// Phase 1: matrix 95 rows 116 cols
[2024-05-21 02:39:04] [INFO ] Computed 28 invariants in 0 ms
[2024-05-21 02:39:04] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-21 02:39:04] [INFO ] Invariant cache hit.
[2024-05-21 02:39:04] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 02:39:04] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 116/415 places, 95/405 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 1014 ms. Remains : 116/415 places, 95/405 transitions.
[2024-05-21 02:39:04] [INFO ] Flatten gal took : 10 ms
[2024-05-21 02:39:04] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:39:04] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-21 02:39:05] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:39:05] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:39:05] [INFO ] Time to serialize gal into /tmp/CTLFireability5884931027359738027.gal : 1 ms
[2024-05-21 02:39:05] [INFO ] Time to serialize properties into /tmp/CTLFireability15023612974752257865.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5884931027359738027.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15023612974752257865.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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.59233e+09,0.211689,7512,2,2491,5,17151,6,0,543,20105,0


Converting to forward existential form...Done !
original formula: AF((((p163==1) * (!(E(A((p34==1) U (p108==1)) U AG((p462==1)))) + EG(((p4==0)||(p349==0))))) + (AG(((p316==0)||(p480==0))) * (((p217==0)|...181
=> equivalent forward existential formula: [FwdG(Init,!((((p163==1) * (!(E(!((E(!((p108==1)) U (!((p34==1)) * !((p108==1)))) + EG(!((p108==1))))) U !(E(TRU...297
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t5, t22, t33, t58, t78, t84, t85, t86, Intersection with reachable at each step ...211
Detected timeout of ITS tools.
[2024-05-21 02:39:35] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:39:35] [INFO ] Applying decomposition
[2024-05-21 02:39:35] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4738901906174442374.txt' '-o' '/tmp/graph4738901906174442374.bin' '-w' '/tmp/graph4738901906174442374.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4738901906174442374.bin' '-l' '-1' '-v' '-w' '/tmp/graph4738901906174442374.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:39:35] [INFO ] Decomposing Gal with order
[2024-05-21 02:39:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:39:35] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-21 02:39:35] [INFO ] Flatten gal took : 15 ms
[2024-05-21 02:39:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-21 02:39:35] [INFO ] Time to serialize gal into /tmp/CTLFireability18423620027728676330.gal : 3 ms
[2024-05-21 02:39:35] [INFO ] Time to serialize properties into /tmp/CTLFireability8893699567143526927.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18423620027728676330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8893699567143526927.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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.59233e+09,0.072612,5072,225,42,2608,215,382,3716,67,505,0


Converting to forward existential form...Done !
original formula: AF((((i8.u11.p163==1) * (!(E(A((i1.u1.p34==1) U (i7.u7.p108==1)) U AG((i10.u41.p462==1)))) + EG(((i3.i0.u0.p4==0)||(i2.u26.p349==0))))) +...263
=> equivalent forward existential formula: [FwdG(Init,!((((i8.u11.p163==1) * (!(E(!((E(!((i7.u7.p108==1)) U (!((i1.u1.p34==1)) * !((i7.u7.p108==1)))) + EG(...391
Reverse transition relation is NOT exact ! Due to transitions t78, t84, t85, t86, i0.u35.t33, i1.u1.t58, i2.u26.t22, i3.i0.t5, i7.u7.t0, i9.i1.u36.t3, i10....261
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 an SCC at level 10
(forward)formula 0,0,2.32069,74240,1,0,148053,424,2010,213531,333,1128,167915
FORMULA AutoFlight-PT-05b-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-21 02:39:37] [INFO ] Flatten gal took : 8 ms
[2024-05-21 02:39:37] [INFO ] Flatten gal took : 8 ms
[2024-05-21 02:39:37] [INFO ] Applying decomposition
[2024-05-21 02:39:37] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13834892216247968961.txt' '-o' '/tmp/graph13834892216247968961.bin' '-w' '/tmp/graph13834892216247968961.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13834892216247968961.bin' '-l' '-1' '-v' '-w' '/tmp/graph13834892216247968961.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:39:37] [INFO ] Decomposing Gal with order
[2024-05-21 02:39:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:39:37] [INFO ] Removed a total of 57 redundant transitions.
[2024-05-21 02:39:37] [INFO ] Flatten gal took : 18 ms
[2024-05-21 02:39:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 02:39:37] [INFO ] Time to serialize gal into /tmp/CTLFireability7957464928010856883.gal : 4 ms
[2024-05-21 02:39:37] [INFO ] Time to serialize properties into /tmp/CTLFireability16717149274117808183.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7957464928010856883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16717149274117808183.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.83939e+28,15.9908,401360,25657,30,721465,454,751,1.35524e+06,54,1272,0


Converting to forward existential form...Done !
original formula: A((EF(!(((i4.i1.i0.u30.p91==1)&&(i4.i1.i0.u133.p378==1)))) * ((A((i22.u145.p408==1) U (i0.u92.p281!=1)) + (i12.u60.p185==1)) + (E((!(((i7...512
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!((!(EX(!(((i4.i1.i0.u30.p91==1)&&(i4.i1.i0.u133.p378==1))))) + !(EG(!(E((i21.u131.p372==1...952
Reverse transition relation is NOT exact ! Due to transitions t137, t140, t151, t154, t179, t210, t238, t296, t313, t391, t392, t394, t395, t396, t397, i0....1183
Detected timeout of ITS tools.
[2024-05-21 03:04:32] [INFO ] Applying decomposition
[2024-05-21 03:04:32] [INFO ] Flatten gal took : 9 ms
[2024-05-21 03:04:32] [INFO ] Decomposing Gal with order
[2024-05-21 03:04:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:04:32] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-21 03:04:32] [INFO ] Flatten gal took : 16 ms
[2024-05-21 03:04:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 24 ms.
[2024-05-21 03:04:32] [INFO ] Time to serialize gal into /tmp/CTLFireability7133167763652207986.gal : 5 ms
[2024-05-21 03:04:32] [INFO ] Time to serialize properties into /tmp/CTLFireability9886818355569199092.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7133167763652207986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9886818355569199092.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-21 03:13:10] [INFO ] Flatten gal took : 16 ms
[2024-05-21 03:13:10] [INFO ] Input system was already deterministic with 405 transitions.
[2024-05-21 03:13:10] [INFO ] Transformed 415 places.
[2024-05-21 03:13:10] [INFO ] Transformed 405 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 03:13:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3063553950161439476.gal : 2 ms
[2024-05-21 03:13:10] [INFO ] Time to serialize properties into /tmp/CTLFireability1065246401189098658.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3063553950161439476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1065246401189098658.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="AutoFlight-PT-05b"
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-5568"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-05b, 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-smll-171620167100130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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