Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689300466.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-12a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689300466
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 7.5K Apr 30 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 30 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 30 01:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 30 01:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 85K May 10 09:33 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-12a-CTLFireability-00
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-01
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-02
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-03
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-04
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-05
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-06
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-07
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-08
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-09
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-10
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-11
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-12
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-13
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-14
FORMULA_NAME AutoFlight-PT-12a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1652662967833

Running Version 202205111006
[2022-05-16 01:02:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 01:02:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:02:52] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2022-05-16 01:02:52] [INFO ] Transformed 307 places.
[2022-05-16 01:02:52] [INFO ] Transformed 305 transitions.
[2022-05-16 01:02:52] [INFO ] Found NUPN structural information;
[2022-05-16 01:02:52] [INFO ] Parsed PT model containing 307 places and 305 transitions in 588 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
Support contains 100 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 245/245 transitions.
Applied a total of 0 rules in 146 ms. Remains 307 /307 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 307 cols
[2022-05-16 01:02:53] [INFO ] Computed 76 place invariants in 32 ms
[2022-05-16 01:02:56] [INFO ] Implicit Places using invariants in 3213 ms returned []
// Phase 1: matrix 245 rows 307 cols
[2022-05-16 01:02:56] [INFO ] Computed 76 place invariants in 30 ms
[2022-05-16 01:02:56] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-05-16 01:02:57] [INFO ] Implicit Places using invariants and state equation in 1638 ms returned [35, 56, 63, 70, 87, 93, 99, 102, 105, 108, 114, 117, 120, 182, 232, 238, 244, 250, 256, 262, 274, 286, 292, 298, 304]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 4949 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 282/307 places, 245/245 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 275 transition count 238
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 275 transition count 238
Applied a total of 14 rules in 51 ms. Remains 275 /282 variables (removed 7) and now considering 238/245 (removed 7) transitions.
// Phase 1: matrix 238 rows 275 cols
[2022-05-16 01:02:57] [INFO ] Computed 51 place invariants in 3 ms
[2022-05-16 01:02:58] [INFO ] Implicit Places using invariants in 194 ms returned []
// Phase 1: matrix 238 rows 275 cols
[2022-05-16 01:02:58] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-16 01:02:58] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-16 01:02:58] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 275/307 places, 238/245 transitions.
Finished structural reductions, in 2 iterations. Remains : 275/307 places, 238/245 transitions.
Support contains 100 out of 275 places after structural reductions.
[2022-05-16 01:02:59] [INFO ] Flatten gal took : 129 ms
[2022-05-16 01:02:59] [INFO ] Flatten gal took : 52 ms
[2022-05-16 01:02:59] [INFO ] Input system was already deterministic with 238 transitions.
Incomplete random walk after 10000 steps, including 182 resets, run finished after 515 ms. (steps per millisecond=19 ) properties (out of 64) seen :52
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 238 rows 275 cols
[2022-05-16 01:03:01] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-16 01:03:02] [INFO ] [Real]Absence check using 51 positive place invariants in 255 ms returned sat
[2022-05-16 01:03:02] [INFO ] After 1595ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:9
[2022-05-16 01:03:03] [INFO ] [Nat]Absence check using 51 positive place invariants in 311 ms returned sat
[2022-05-16 01:03:06] [INFO ] After 2372ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :7
[2022-05-16 01:03:06] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-16 01:03:06] [INFO ] After 311ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :4 sat :7
[2022-05-16 01:03:07] [INFO ] After 845ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :7
Attempting to minimize the solution found.
Minimization took 399 ms.
[2022-05-16 01:03:07] [INFO ] After 4967ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :7
Fused 11 Parikh solutions to 6 different solutions.
Parikh walk visited 4 properties in 6 ms.
Support contains 4 out of 275 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 275/275 places, 238/238 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 275 transition count 196
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 233 transition count 196
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 84 place count 233 transition count 165
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 146 place count 202 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 149 place count 199 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 152 place count 199 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 198 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 198 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 197 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 197 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 196 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 196 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 195 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 195 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 194 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 194 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 193 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 193 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 192 transition count 155
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 192 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 191 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 191 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 190 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 190 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 189 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 189 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 188 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 188 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 187 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 187 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 186 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 186 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 185 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 185 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 184 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 184 transition count 147
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 228 place count 161 transition count 124
Free-agglomeration rule applied 24 times.
Iterating global reduction 2 with 24 rules applied. Total rules applied 252 place count 161 transition count 100
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 276 place count 137 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 277 place count 136 transition count 99
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 3 with 106 rules applied. Total rules applied 383 place count 90 transition count 39
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 4 with 60 rules applied. Total rules applied 443 place count 30 transition count 39
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 443 place count 30 transition count 32
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 457 place count 23 transition count 32
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 466 place count 14 transition count 23
Iterating global reduction 5 with 9 rules applied. Total rules applied 475 place count 14 transition count 23
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 483 place count 14 transition count 15
Applied a total of 483 rules in 433 ms. Remains 14 /275 variables (removed 261) and now considering 15/238 (removed 223) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/275 places, 15/238 transitions.
Finished random walk after 48 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=48 )
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2022-05-16 01:03:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2022-05-16 01:03:08] [INFO ] Flatten gal took : 55 ms
FORMULA AutoFlight-PT-12a-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 01:03:08] [INFO ] Flatten gal took : 44 ms
[2022-05-16 01:03:08] [INFO ] Input system was already deterministic with 238 transitions.
Support contains 80 out of 275 places (down from 90) after GAL structural reductions.
Computed a total of 12 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 238/238 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 270 transition count 233
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 270 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 269 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 269 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 268 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 268 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 267 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 267 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 266 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 266 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 265 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 265 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 264 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 264 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 263 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 263 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 262 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 262 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 261 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 261 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 260 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 260 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 259 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 259 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 258 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 258 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 257 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 257 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 256 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 256 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 255 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 255 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 254 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 254 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 253 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 253 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 252 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 252 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 251 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 251 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 250 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 250 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 249 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 249 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 248 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 248 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 247 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 247 transition count 210
Applied a total of 56 rules in 355 ms. Remains 247 /275 variables (removed 28) and now considering 210/238 (removed 28) transitions.
// Phase 1: matrix 210 rows 247 cols
[2022-05-16 01:03:08] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-16 01:03:16] [INFO ] Implicit Places using invariants in 7503 ms returned [14, 21, 28, 48, 80, 85, 101, 218, 228, 246]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 7517 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 237/275 places, 210/238 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 235 transition count 208
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 235 transition count 208
Applied a total of 4 rules in 7 ms. Remains 235 /237 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 235 cols
[2022-05-16 01:03:16] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-16 01:03:16] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 208 rows 235 cols
[2022-05-16 01:03:16] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-16 01:03:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 01:03:16] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 235/275 places, 208/238 transitions.
Finished structural reductions, in 2 iterations. Remains : 235/275 places, 208/238 transitions.
[2022-05-16 01:03:16] [INFO ] Flatten gal took : 16 ms
[2022-05-16 01:03:16] [INFO ] Flatten gal took : 11 ms
[2022-05-16 01:03:16] [INFO ] Input system was already deterministic with 208 transitions.
[2022-05-16 01:03:16] [INFO ] Flatten gal took : 24 ms
[2022-05-16 01:03:16] [INFO ] Flatten gal took : 10 ms
[2022-05-16 01:03:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14179513306829717040.gal : 10 ms
[2022-05-16 01:03:16] [INFO ] Time to serialize properties into /tmp/CTLFireability15458551561079152582.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14179513306829717040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15458551561079152582.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
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.54764e+16,18.0864,392024,2,55292,5,1.12761e+06,6,0,1142,2.46007e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2022-05-16 01:03:46] [INFO ] Flatten gal took : 48 ms
[2022-05-16 01:03:46] [INFO ] Applying decomposition
[2022-05-16 01:03:46] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4752510197384133339.txt' '-o' '/tmp/graph4752510197384133339.bin' '-w' '/tmp/graph4752510197384133339.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4752510197384133339.bin' '-l' '-1' '-v' '-w' '/tmp/graph4752510197384133339.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:03:47] [INFO ] Decomposing Gal with order
[2022-05-16 01:03:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:03:47] [INFO ] Removed a total of 25 redundant transitions.
[2022-05-16 01:03:47] [INFO ] Flatten gal took : 103 ms
[2022-05-16 01:03:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2022-05-16 01:03:47] [INFO ] Time to serialize gal into /tmp/CTLFireability10941040205747181329.gal : 9 ms
[2022-05-16 01:03:47] [INFO ] Time to serialize properties into /tmp/CTLFireability16644832864990748428.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10941040205747181329.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16644832864990748428.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
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.54764e+16,0.062504,7660,332,20,5801,230,474,6971,36,403,0


Converting to forward existential form...Done !
original formula: !(A(A((((EX((i15.u13.p48==1)) + (i13.u20.p73!=1)) + ((i2.u9.p34==1)||(i10.i0.u2.p9==1))) + (((i15.u12.p45==1)&&(i15.u83.p270==1))&&(i8.i1...427
=> equivalent forward existential formula: (((([((((FwdU((FwdU(Init,!(((i18.i1.u28.p96==1)&&(i17.u95.p255==1)))) * !(((i18.i1.u28.p96==1)&&(i17.u95.p255==1...2791
Reverse transition relation is NOT exact ! Due to transitions t85, t121, i0.u0.t59, i0.u1.t57, i1.u3.t53, i2.u9.t41, i3.u19.t21, i4.u21.t17, i5.u22.t15, i5...494
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 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 275/275 places, 238/238 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 275 transition count 196
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 233 transition count 196
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 84 place count 233 transition count 168
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 140 place count 205 transition count 168
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 201 transition count 164
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 201 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 200 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 200 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 199 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 199 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 198 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 198 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 197 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 197 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 196 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 196 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 195 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 195 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 194 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 194 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 193 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 193 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 192 transition count 155
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 192 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 191 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 191 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 190 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 190 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 189 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 189 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 188 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 188 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 187 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 187 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 186 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 186 transition count 149
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 222 place count 164 transition count 127
Applied a total of 222 rules in 183 ms. Remains 164 /275 variables (removed 111) and now considering 127/238 (removed 111) transitions.
// Phase 1: matrix 127 rows 164 cols
[2022-05-16 01:04:17] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-16 01:04:17] [INFO ] Implicit Places using invariants in 199 ms returned [5, 11, 16, 21, 30, 35, 53, 58, 59, 60, 61, 62, 63, 64, 65, 66, 69, 70, 71, 72, 75, 138, 146]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 202 ms to find 23 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 141/275 places, 127/238 transitions.
Drop transitions 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 141 transition count 109
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 123 transition count 109
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 36 place count 123 transition count 99
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 56 place count 113 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 111 transition count 97
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 111 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 2 with 2 rules applied. Total rules applied 62 place count 110 transition count 96
Applied a total of 62 rules in 23 ms. Remains 110 /141 variables (removed 31) and now considering 96/127 (removed 31) transitions.
// Phase 1: matrix 96 rows 110 cols
[2022-05-16 01:04:17] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 01:04:17] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 96 rows 110 cols
[2022-05-16 01:04:18] [INFO ] Computed 28 place invariants in 3 ms
[2022-05-16 01:04:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-16 01:04:18] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 110/275 places, 96/238 transitions.
Finished structural reductions, in 2 iterations. Remains : 110/275 places, 96/238 transitions.
[2022-05-16 01:04:18] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:04:18] [INFO ] Flatten gal took : 15 ms
[2022-05-16 01:04:18] [INFO ] Input system was already deterministic with 96 transitions.
[2022-05-16 01:04:18] [INFO ] Flatten gal took : 24 ms
[2022-05-16 01:04:18] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:04:18] [INFO ] Time to serialize gal into /tmp/CTLFireability2491363248444654095.gal : 2 ms
[2022-05-16 01:04:18] [INFO ] Time to serialize properties into /tmp/CTLFireability16566691162898351148.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2491363248444654095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16566691162898351148.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.61686e+09,0.464986,20480,2,6519,5,62125,6,0,538,85323,0


Converting to forward existential form...Done !
original formula: AG((!(E(AF(EG((p76==1))) U (A((p13==1) U ((p281==1)&&(p306==1))) * EF(((p115==1)&&(p296==1)))))) + (p104==0)))
=> equivalent forward existential formula: [(FwdU((FwdU((FwdU(Init,TRUE) * !((p104==0))),!(EG(!(EG((p76==1)))))) * !((E(!(((p281==1)&&(p306==1))) U (!((p13...266
Reverse transition relation is NOT exact ! Due to transitions t5, t24, t95, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
Using saturation style SCC detection
Detected timeout of ITS tools.
[2022-05-16 01:04:48] [INFO ] Flatten gal took : 9 ms
[2022-05-16 01:04:48] [INFO ] Applying decomposition
[2022-05-16 01:04:48] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14462053095699670583.txt' '-o' '/tmp/graph14462053095699670583.bin' '-w' '/tmp/graph14462053095699670583.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14462053095699670583.bin' '-l' '-1' '-v' '-w' '/tmp/graph14462053095699670583.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:04:48] [INFO ] Decomposing Gal with order
[2022-05-16 01:04:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:04:48] [INFO ] Removed a total of 20 redundant transitions.
[2022-05-16 01:04:48] [INFO ] Flatten gal took : 18 ms
[2022-05-16 01:04:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 01:04:48] [INFO ] Time to serialize gal into /tmp/CTLFireability646644913660596022.gal : 7 ms
[2022-05-16 01:04:48] [INFO ] Time to serialize properties into /tmp/CTLFireability8073813329123976302.ctl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability646644913660596022.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8073813329123976302.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...252
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.61686e+09,0.038226,5512,138,25,1502,213,283,1797,45,279,0


Converting to forward existential form...Done !
original formula: AG((!(E(AF(EG((i13.u21.p76==1))) U (A((i1.u3.p13==1) U ((i9.u43.p281==1)&&(u47.p306==1))) * EF(((i16.u25.p115==1)&&(i16.u45.p296==1))))))...176
=> equivalent forward existential formula: [(FwdU((FwdU((FwdU(Init,TRUE) * !((i6.u24.p104==0))),!(EG(!(EG((i13.u21.p76==1)))))) * !((E(!(((i9.u43.p281==1)&...336
Reverse transition relation is NOT exact ! Due to transitions t95, i1.u3.t24, i13.u21.t5, Intersection with reachable at each step enabled. (destroyed/rev...187
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 17
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 17
(forward)formula 0,0,1.67753,69424,1,0,155138,443,1867,180490,252,1110,230398
FORMULA AutoFlight-PT-12a-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 238/238 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 270 transition count 233
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 270 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 269 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 269 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 268 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 268 transition count 231
Applied a total of 14 rules in 29 ms. Remains 268 /275 variables (removed 7) and now considering 231/238 (removed 7) transitions.
// Phase 1: matrix 231 rows 268 cols
[2022-05-16 01:04:50] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-16 01:04:50] [INFO ] Implicit Places using invariants in 146 ms returned [14, 21, 41, 48, 73, 80, 85, 90, 101, 239, 249, 267]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 151 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 256/275 places, 231/238 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 254 transition count 229
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 254 transition count 229
Applied a total of 4 rules in 14 ms. Remains 254 /256 variables (removed 2) and now considering 229/231 (removed 2) transitions.
// Phase 1: matrix 229 rows 254 cols
[2022-05-16 01:04:50] [INFO ] Computed 39 place invariants in 2 ms
[2022-05-16 01:04:50] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 229 rows 254 cols
[2022-05-16 01:04:50] [INFO ] Computed 39 place invariants in 2 ms
[2022-05-16 01:04:50] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 01:04:50] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 254/275 places, 229/238 transitions.
Finished structural reductions, in 2 iterations. Remains : 254/275 places, 229/238 transitions.
[2022-05-16 01:04:50] [INFO ] Flatten gal took : 18 ms
[2022-05-16 01:04:50] [INFO ] Flatten gal took : 10 ms
[2022-05-16 01:04:50] [INFO ] Input system was already deterministic with 229 transitions.
[2022-05-16 01:04:50] [INFO ] Flatten gal took : 10 ms
[2022-05-16 01:04:50] [INFO ] Flatten gal took : 10 ms
[2022-05-16 01:04:50] [INFO ] Time to serialize gal into /tmp/CTLFireability920381625470430983.gal : 2 ms
[2022-05-16 01:04:50] [INFO ] Time to serialize properties into /tmp/CTLFireability5699745830750026525.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability920381625470430983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5699745830750026525.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
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.54778e+16,12.8275,348256,2,42114,5,982124,6,0,1243,2.23179e+06,0


Converting to forward existential form...Done !
original formula: (EF(((p28==1)&&(p187==1))) * A(EX(AX(((p7==1)&&(p208==1)))) U AF(!(EF(((p54==1)||((p118==1)&&(p302==1))))))))
=> equivalent forward existential formula: [(((Init * E(TRUE U ((p28==1)&&(p187==1)))) * !(EG(!(!(EG(!(!(E(TRUE U ((p54==1)||((p118==1)&&(p302==1))))))))))...342
Reverse transition relation is NOT exact ! Due to transitions t13, t15, t17, t19, t21, t23, t25, t27, t29, t31, t33, t35, t37, t39, t41, t43, t45, t47, t49...298
Detected timeout of ITS tools.
[2022-05-16 01:05:20] [INFO ] Flatten gal took : 9 ms
[2022-05-16 01:05:20] [INFO ] Applying decomposition
[2022-05-16 01:05:20] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1145987498718824094.txt' '-o' '/tmp/graph1145987498718824094.bin' '-w' '/tmp/graph1145987498718824094.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1145987498718824094.bin' '-l' '-1' '-v' '-w' '/tmp/graph1145987498718824094.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:05:20] [INFO ] Decomposing Gal with order
[2022-05-16 01:05:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:05:20] [INFO ] Removed a total of 26 redundant transitions.
[2022-05-16 01:05:20] [INFO ] Flatten gal took : 15 ms
[2022-05-16 01:05:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 01:05:20] [INFO ] Time to serialize gal into /tmp/CTLFireability16814818109640324769.gal : 3 ms
[2022-05-16 01:05:20] [INFO ] Time to serialize properties into /tmp/CTLFireability10764315138828784334.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16814818109640324769.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10764315138828784334.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
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.54778e+16,0.071693,8344,352,18,7504,197,460,8577,30,338,0


Converting to forward existential form...Done !
original formula: (EF(((i9.u37.p28==1)&&(i14.i0.u64.p187==1))) * A(EX(AX(((i15.i1.u72.p7==1)&&(i15.i1.u73.p208==1)))) U AF(!(EF(((i5.u15.p54==1)||((i21.u35...191
=> equivalent forward existential formula: [(((Init * E(TRUE U ((i9.u37.p28==1)&&(i14.i0.u64.p187==1)))) * !(EG(!(!(EG(!(!(E(TRUE U ((i5.u15.p54==1)||((i21...454
Reverse transition relation is NOT exact ! Due to transitions t85, t88, t121, i0.u5.t49, i1.i0.u2.t55, i1.i0.u4.t51, i1.i1.u6.t47, i1.i1.u8.t43, i2.u7.t45,...499
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 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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 : 275/275 places, 238/238 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 275 transition count 196
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 233 transition count 196
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 84 place count 233 transition count 166
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 144 place count 203 transition count 166
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 149 place count 198 transition count 161
Iterating global reduction 2 with 5 rules applied. Total rules applied 154 place count 198 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 197 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 197 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 196 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 196 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 195 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 195 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 194 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 194 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 193 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 193 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 192 transition count 155
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 192 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 191 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 191 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 190 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 190 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 189 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 189 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 188 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 188 transition count 151
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 222 place count 164 transition count 127
Applied a total of 222 rules in 96 ms. Remains 164 /275 variables (removed 111) and now considering 127/238 (removed 111) transitions.
// Phase 1: matrix 127 rows 164 cols
[2022-05-16 01:05:51] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-16 01:05:51] [INFO ] Implicit Places using invariants in 156 ms returned [5, 10, 15, 29, 34, 51, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 140, 148, 163]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 158 ms to find 25 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 139/275 places, 127/238 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 139 transition count 98
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 110 transition count 98
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 58 place count 110 transition count 95
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 107 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 105 transition count 93
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 105 transition count 93
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 2 with 4 rules applied. Total rules applied 72 place count 103 transition count 91
Applied a total of 72 rules in 9 ms. Remains 103 /139 variables (removed 36) and now considering 91/127 (removed 36) transitions.
// Phase 1: matrix 91 rows 103 cols
[2022-05-16 01:05:51] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:05:51] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 91 rows 103 cols
[2022-05-16 01:05:51] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:05:51] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-05-16 01:05:51] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 103/275 places, 91/238 transitions.
Finished structural reductions, in 2 iterations. Remains : 103/275 places, 91/238 transitions.
[2022-05-16 01:05:51] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:05:51] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:05:51] [INFO ] Input system was already deterministic with 91 transitions.
[2022-05-16 01:05:51] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:05:51] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:05:51] [INFO ] Time to serialize gal into /tmp/CTLFireability6979023903979984709.gal : 1 ms
[2022-05-16 01:05:51] [INFO ] Time to serialize properties into /tmp/CTLFireability1081561557473379062.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6979023903979984709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1081561557473379062.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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.89192e+08,0.36163,23084,2,7818,5,62022,6,0,503,82858,0


Converting to forward existential form...Done !
original formula: EG(((p28==0)||(p161==0)))
=> equivalent forward existential formula: [FwdG(Init,((p28==0)||(p161==0)))] != FALSE
Hit Full ! (commute/partial/dont) 86/0/5
(forward)formula 0,1,1.59221,62028,1,0,10,234904,19,4,2502,179341,9
FORMULA AutoFlight-PT-12a-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 275/275 places, 238/238 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 275 transition count 197
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 234 transition count 197
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 82 place count 234 transition count 166
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 144 place count 203 transition count 166
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 149 place count 198 transition count 161
Iterating global reduction 2 with 5 rules applied. Total rules applied 154 place count 198 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 197 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 197 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 196 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 196 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 195 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 195 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 194 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 194 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 193 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 193 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 192 transition count 155
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 192 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 191 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 191 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 190 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 190 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 189 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 189 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 188 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 188 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 187 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 187 transition count 150
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 218 place count 166 transition count 129
Applied a total of 218 rules in 31 ms. Remains 166 /275 variables (removed 109) and now considering 129/238 (removed 109) transitions.
// Phase 1: matrix 129 rows 166 cols
[2022-05-16 01:05:53] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-16 01:05:53] [INFO ] Implicit Places using invariants in 133 ms returned [5, 11, 16, 23, 54, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 142, 150, 165]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 136 ms to find 24 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 142/275 places, 129/238 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 142 transition count 104
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 117 transition count 104
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 50 place count 117 transition count 101
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 56 place count 114 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 112 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 112 transition count 99
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 2 with 4 rules applied. Total rules applied 64 place count 110 transition count 97
Applied a total of 64 rules in 8 ms. Remains 110 /142 variables (removed 32) and now considering 97/129 (removed 32) transitions.
// Phase 1: matrix 97 rows 110 cols
[2022-05-16 01:05:53] [INFO ] Computed 27 place invariants in 5 ms
[2022-05-16 01:05:53] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 97 rows 110 cols
[2022-05-16 01:05:53] [INFO ] Computed 27 place invariants in 2 ms
[2022-05-16 01:05:53] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-05-16 01:05:53] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 110/275 places, 97/238 transitions.
Finished structural reductions, in 2 iterations. Remains : 110/275 places, 97/238 transitions.
[2022-05-16 01:05:53] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:05:53] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:05:53] [INFO ] Input system was already deterministic with 97 transitions.
[2022-05-16 01:05:53] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:05:53] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:05:53] [INFO ] Time to serialize gal into /tmp/CTLFireability5486473081356967024.gal : 1 ms
[2022-05-16 01:05:53] [INFO ] Time to serialize properties into /tmp/CTLFireability2372509354773359024.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5486473081356967024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2372509354773359024.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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.90456e+09,0.433953,18044,2,6543,5,50819,6,0,535,63424,0


Converting to forward existential form...Done !
original formula: EF(AG(A(A(A((p24==1) U ((p42==1)&&(p163==1))) U ((p13==1)||(p27==1))) U !(EG(((p49==1)&&(p164==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!(!(EG(((p49==1)&&(p164==1))))) U (!(!((E(!(((p13==1)||(p27==1))) U (!(!((...410
Reverse transition relation is NOT exact ! Due to transitions t17, t19, t23, t28, t42, t96, Intersection with reachable at each step enabled. (destroyed/r...189
(forward)formula 0,1,3.62805,92404,1,0,300,491027,232,139,3206,288278,363
FORMULA AutoFlight-PT-12a-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 275/275 places, 238/238 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 263 transition count 155
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 175 place count 181 transition count 155
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 175 place count 181 transition count 131
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 235 place count 145 transition count 131
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 235 place count 145 transition count 119
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 259 place count 133 transition count 119
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 264 place count 128 transition count 114
Iterating global reduction 2 with 5 rules applied. Total rules applied 269 place count 128 transition count 114
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 319 place count 103 transition count 89
Applied a total of 319 rules in 12 ms. Remains 103 /275 variables (removed 172) and now considering 89/238 (removed 149) transitions.
// Phase 1: matrix 89 rows 103 cols
[2022-05-16 01:05:57] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 01:05:57] [INFO ] Implicit Places using invariants in 95 ms returned [86, 92, 102]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 97 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 100/275 places, 89/238 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 98 transition count 87
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 98 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 97 transition count 86
Applied a total of 6 rules in 7 ms. Remains 97 /100 variables (removed 3) and now considering 86/89 (removed 3) transitions.
// Phase 1: matrix 86 rows 97 cols
[2022-05-16 01:05:57] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 01:05:57] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 86 rows 97 cols
[2022-05-16 01:05:57] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-16 01:05:57] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 97/275 places, 86/238 transitions.
Finished structural reductions, in 2 iterations. Remains : 97/275 places, 86/238 transitions.
[2022-05-16 01:05:57] [INFO ] Flatten gal took : 2 ms
[2022-05-16 01:05:57] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:05:57] [INFO ] Input system was already deterministic with 86 transitions.
[2022-05-16 01:05:57] [INFO ] Flatten gal took : 2 ms
[2022-05-16 01:05:57] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:05:57] [INFO ] Time to serialize gal into /tmp/CTLFireability11434886008460088721.gal : 1 ms
[2022-05-16 01:05:57] [INFO ] Time to serialize properties into /tmp/CTLFireability4452479797865671898.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11434886008460088721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4452479797865671898.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.22084e+08,0.032483,5672,2,570,5,4552,6,0,477,4468,0


Converting to forward existential form...Done !
original formula: AF(((p25==1)&&(p223==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((p25==1)&&(p223==1))))] = FALSE
Hit Full ! (commute/partial/dont) 83/0/3
(forward)formula 0,0,0.11681,9164,1,0,9,23473,20,4,2281,11717,8
FORMULA AutoFlight-PT-12a-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 275/275 places, 238/238 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 275 transition count 196
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 233 transition count 196
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 84 place count 233 transition count 165
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 146 place count 202 transition count 165
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 151 place count 197 transition count 160
Iterating global reduction 2 with 5 rules applied. Total rules applied 156 place count 197 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 196 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 196 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 195 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 195 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 194 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 194 transition count 157
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 202 place count 174 transition count 137
Applied a total of 202 rules in 47 ms. Remains 174 /275 variables (removed 101) and now considering 137/238 (removed 101) transitions.
// Phase 1: matrix 137 rows 174 cols
[2022-05-16 01:05:57] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-16 01:05:57] [INFO ] Implicit Places using invariants in 134 ms returned [5, 11, 17, 22, 36, 54, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 73, 74, 75, 158, 173]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 137 ms to find 22 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 152/275 places, 137/238 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 152 transition count 123
Reduce places removed 14 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 24 rules applied. Total rules applied 38 place count 138 transition count 113
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 48 place count 128 transition count 113
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 48 place count 128 transition count 107
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 60 place count 122 transition count 107
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 121 transition count 106
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 121 transition count 106
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 3 with 2 rules applied. Total rules applied 64 place count 120 transition count 105
Applied a total of 64 rules in 9 ms. Remains 120 /152 variables (removed 32) and now considering 105/137 (removed 32) transitions.
// Phase 1: matrix 105 rows 120 cols
[2022-05-16 01:05:57] [INFO ] Computed 29 place invariants in 0 ms
[2022-05-16 01:05:57] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 105 rows 120 cols
[2022-05-16 01:05:57] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-16 01:05:57] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-05-16 01:05:57] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 120/275 places, 105/238 transitions.
Finished structural reductions, in 2 iterations. Remains : 120/275 places, 105/238 transitions.
[2022-05-16 01:05:57] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:05:57] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:05:57] [INFO ] Input system was already deterministic with 105 transitions.
[2022-05-16 01:05:57] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:05:57] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:05:57] [INFO ] Time to serialize gal into /tmp/CTLFireability5907435257153819617.gal : 1 ms
[2022-05-16 01:05:57] [INFO ] Time to serialize properties into /tmp/CTLFireability87900723445970227.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5907435257153819617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability87900723445970227.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...272
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.33167e+09,0.768189,37008,2,19865,5,111261,6,0,581,161729,0


Converting to forward existential form...Done !
original formula: AG(((EF(((p62==0)||(p283==0))) + EG((((((p20==1)&&(p247==1)) + !(A(((p268==1)&&(p305==1)) U ((p42==1)&&(p127==1))))) * EF((p9==0))) * (((...215
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(((p84==0)||(p169==0)))) * !(EG((((((p20==1)&&(p247==1)) + !(!((E(!(((p42==1)&&(p127==1))...358
Reverse transition relation is NOT exact ! Due to transitions t2, t8, t21, t25, t103, t104, Intersection with reachable at each step enabled. (destroyed/r...190
(forward)formula 0,1,6.01939,185332,1,0,203,874473,231,95,3451,642609,220
FORMULA AutoFlight-PT-12a-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 275/275 places, 238/238 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 275 transition count 199
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 79 place count 236 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 235 transition count 198
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 80 place count 235 transition count 167
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 142 place count 204 transition count 167
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 146 place count 200 transition count 163
Iterating global reduction 3 with 4 rules applied. Total rules applied 150 place count 200 transition count 163
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 199 transition count 162
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 199 transition count 162
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 153 place count 198 transition count 161
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 198 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 197 transition count 160
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 197 transition count 160
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 157 place count 196 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 196 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 195 transition count 158
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 195 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 194 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 194 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 193 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 193 transition count 156
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 210 place count 170 transition count 133
Applied a total of 210 rules in 63 ms. Remains 170 /275 variables (removed 105) and now considering 133/238 (removed 105) transitions.
// Phase 1: matrix 133 rows 170 cols
[2022-05-16 01:06:04] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-16 01:06:04] [INFO ] Implicit Places using invariants in 123 ms returned [5, 11, 16, 21, 30, 35, 52, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 146, 154]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 137 ms to find 25 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 145/275 places, 133/238 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 145 transition count 109
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 121 transition count 109
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 48 place count 121 transition count 96
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 74 place count 108 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 106 transition count 94
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 106 transition count 94
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 2 with 4 rules applied. Total rules applied 82 place count 104 transition count 92
Applied a total of 82 rules in 10 ms. Remains 104 /145 variables (removed 41) and now considering 92/133 (removed 41) transitions.
// Phase 1: matrix 92 rows 104 cols
[2022-05-16 01:06:04] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 01:06:04] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 92 rows 104 cols
[2022-05-16 01:06:04] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 01:06:04] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-05-16 01:06:04] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 104/275 places, 92/238 transitions.
Finished structural reductions, in 2 iterations. Remains : 104/275 places, 92/238 transitions.
[2022-05-16 01:06:04] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:06:04] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:06:04] [INFO ] Input system was already deterministic with 92 transitions.
[2022-05-16 01:06:04] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:06:04] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:06:04] [INFO ] Time to serialize gal into /tmp/CTLFireability2417428317047085203.gal : 1 ms
[2022-05-16 01:06:04] [INFO ] Time to serialize properties into /tmp/CTLFireability11607231839054270900.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2417428317047085203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11607231839054270900.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.30862e+09,0.497405,28560,2,9176,5,87517,6,0,510,119802,0


Converting to forward existential form...Done !
original formula: AF((A(AF(((p239==1)&&(p306==1))) U EF((p10==1))) * (p140==1)))
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!(E(TRUE U (p10==1))) U (!(!(EG(!(((p239==1)&&(p306==1)))))) * !(E(TRUE U (p10==1))))) + EG(!...202
Reverse transition relation is NOT exact ! Due to transitions t22, t90, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...169
Using saturation style SCC detection
(forward)formula 0,0,20.3461,603964,1,0,863,3.70706e+06,224,479,3323,2.74007e+06,1034
FORMULA AutoFlight-PT-12a-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 238/238 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 271 transition count 234
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 271 transition count 234
Applied a total of 8 rules in 15 ms. Remains 271 /275 variables (removed 4) and now considering 234/238 (removed 4) transitions.
// Phase 1: matrix 234 rows 271 cols
[2022-05-16 01:06:24] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-16 01:06:25] [INFO ] Implicit Places using invariants in 156 ms returned [21, 28, 41, 48, 73, 80, 85, 90, 101, 242, 252, 270]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 170 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 259/275 places, 234/238 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 257 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 257 transition count 232
Applied a total of 4 rules in 12 ms. Remains 257 /259 variables (removed 2) and now considering 232/234 (removed 2) transitions.
// Phase 1: matrix 232 rows 257 cols
[2022-05-16 01:06:25] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-16 01:06:25] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 232 rows 257 cols
[2022-05-16 01:06:25] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-16 01:06:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 01:06:25] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 257/275 places, 232/238 transitions.
Finished structural reductions, in 2 iterations. Remains : 257/275 places, 232/238 transitions.
[2022-05-16 01:06:25] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:06:25] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:06:25] [INFO ] Input system was already deterministic with 232 transitions.
[2022-05-16 01:06:25] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:06:25] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:06:25] [INFO ] Time to serialize gal into /tmp/CTLFireability14241136495585138341.gal : 1 ms
[2022-05-16 01:06:25] [INFO ] Time to serialize properties into /tmp/CTLFireability11683034619799447739.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14241136495585138341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11683034619799447739.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
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.5478e+16,14.3689,392924,2,63012,5,1.18509e+06,6,0,1258,2.41818e+06,0


Converting to forward existential form...Done !
original formula: EX(EF((AX((p79==1)) + (AG(A(((p7==1)&&(p184==1)) U (p62==1))) * EG((((p14==1)&&(p159==1))||(p37==1)))))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(EX(!((p79==1)))))] != FALSE + [FwdG((FwdU(EY(Init),TRUE) * !(E(TRUE U !(!((E(!((p62==...271
Reverse transition relation is NOT exact ! Due to transitions t13, t15, t17, t19, t21, t23, t25, t27, t29, t31, t33, t35, t37, t39, t41, t43, t45, t47, t49...293
Detected timeout of ITS tools.
[2022-05-16 01:06:55] [INFO ] Flatten gal took : 16 ms
[2022-05-16 01:06:55] [INFO ] Applying decomposition
[2022-05-16 01:06:55] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12485898987935677783.txt' '-o' '/tmp/graph12485898987935677783.bin' '-w' '/tmp/graph12485898987935677783.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12485898987935677783.bin' '-l' '-1' '-v' '-w' '/tmp/graph12485898987935677783.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:06:55] [INFO ] Decomposing Gal with order
[2022-05-16 01:06:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:06:55] [INFO ] Removed a total of 27 redundant transitions.
[2022-05-16 01:06:55] [INFO ] Flatten gal took : 18 ms
[2022-05-16 01:06:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 01:06:55] [INFO ] Time to serialize gal into /tmp/CTLFireability12980607016345963368.gal : 3 ms
[2022-05-16 01:06:55] [INFO ] Time to serialize properties into /tmp/CTLFireability11001382421954214445.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12980607016345963368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11001382421954214445.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
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.5478e+16,0.223899,12772,345,15,16893,178,460,26387,25,330,0


Converting to forward existential form...Done !
original formula: EX(EF((AX((i13.i1.u24.p79==1)) + (AG(A(((i9.i0.u2.p7==1)&&(i14.u63.p184==1)) U (i17.u19.p62==1))) * EG((((i16.i0.u5.p14==1)&&(i11.u54.p15...187
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(EX(!((i13.i1.u24.p79==1)))))] != FALSE + [FwdG((FwdU(EY(Init),TRUE) * !(E(TRUE U !(!(...351
Reverse transition relation is NOT exact ! Due to transitions t121, i0.u0.t59, i0.u1.t57, i1.u4.t53, i2.u7.t49, i3.u8.t47, i3.u9.t45, i4.i0.u10.t43, i4.i0....499
(forward)formula 0,1,0.476731,18756,1,0,31184,178,2801,46481,98,330,66729
FORMULA AutoFlight-PT-12a-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 238/238 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 270 transition count 233
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 270 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 269 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 269 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 268 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 268 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 267 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 267 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 266 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 266 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 265 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 265 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 264 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 264 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 263 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 263 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 262 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 262 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 261 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 261 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 260 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 260 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 259 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 259 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 258 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 258 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 257 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 257 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 256 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 256 transition count 219
Applied a total of 38 rules in 87 ms. Remains 256 /275 variables (removed 19) and now considering 219/238 (removed 19) transitions.
// Phase 1: matrix 219 rows 256 cols
[2022-05-16 01:06:56] [INFO ] Computed 51 place invariants in 3 ms
[2022-05-16 01:06:56] [INFO ] Implicit Places using invariants in 168 ms returned [7, 14, 21, 28, 41, 48, 73, 80, 85, 90, 101, 227, 237, 255]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 170 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/275 places, 219/238 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 240 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 240 transition count 217
Applied a total of 4 rules in 6 ms. Remains 240 /242 variables (removed 2) and now considering 217/219 (removed 2) transitions.
// Phase 1: matrix 217 rows 240 cols
[2022-05-16 01:06:56] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-16 01:06:56] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 217 rows 240 cols
[2022-05-16 01:06:56] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-16 01:06:56] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 240/275 places, 217/238 transitions.
Finished structural reductions, in 2 iterations. Remains : 240/275 places, 217/238 transitions.
[2022-05-16 01:06:56] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:06:56] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:06:56] [INFO ] Input system was already deterministic with 217 transitions.
[2022-05-16 01:06:56] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:06:56] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:06:56] [INFO ] Time to serialize gal into /tmp/CTLFireability17459785087649154422.gal : 2 ms
[2022-05-16 01:06:56] [INFO ] Time to serialize properties into /tmp/CTLFireability7359586013323244644.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17459785087649154422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7359586013323244644.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.5477e+16,13.9838,379156,2,31938,5,988972,6,0,1179,2.50015e+06,0


Converting to forward existential form...Done !
original formula: AG(((p199==0) + EX((p61==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p199==0))) * !(EX((p61==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, t15, t17, t19, t21, t23, t25, t27, t29, t31, t33, t35, t37, t39, t41, t43, t45, t47, t49...299
(forward)formula 0,0,23.3672,389816,1,0,385,1.87681e+06,452,211,6527,2.50015e+06,442
FORMULA AutoFlight-PT-12a-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 238/238 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 271 transition count 234
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 271 transition count 234
Applied a total of 8 rules in 16 ms. Remains 271 /275 variables (removed 4) and now considering 234/238 (removed 4) transitions.
// Phase 1: matrix 234 rows 271 cols
[2022-05-16 01:07:20] [INFO ] Computed 51 place invariants in 3 ms
[2022-05-16 01:07:20] [INFO ] Implicit Places using invariants in 198 ms returned [14, 21, 41, 48, 73, 80, 90, 101, 242, 270]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 201 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 261/275 places, 234/238 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 260 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 260 transition count 233
Applied a total of 2 rules in 6 ms. Remains 260 /261 variables (removed 1) and now considering 233/234 (removed 1) transitions.
// Phase 1: matrix 233 rows 260 cols
[2022-05-16 01:07:20] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-16 01:07:20] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 233 rows 260 cols
[2022-05-16 01:07:20] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-16 01:07:20] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 01:07:20] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 260/275 places, 233/238 transitions.
Finished structural reductions, in 2 iterations. Remains : 260/275 places, 233/238 transitions.
[2022-05-16 01:07:20] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:07:20] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:07:20] [INFO ] Input system was already deterministic with 233 transitions.
[2022-05-16 01:07:20] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:07:20] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:07:20] [INFO ] Time to serialize gal into /tmp/CTLFireability16254723895995159287.gal : 1 ms
[2022-05-16 01:07:20] [INFO ] Time to serialize properties into /tmp/CTLFireability5927127633779299221.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16254723895995159287.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5927127633779299221.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.66348e+16,12.602,345052,2,67005,5,1.11001e+06,6,0,1269,2.07439e+06,0


Converting to forward existential form...Done !
original formula: A((EG(AF((p144==1))) * EF((EG((p19==1)) * A((((p28==1)&&(p125==1))||(p154==1)) U (((p90==1)&&(p243==1))||((p280==1)&&(p305==1))))))) U !(...243
=> equivalent forward existential formula: [((Init * !(EG(!(!(((!(EG(!((p40==1)))) + ((EX((p197==1)) * (p57==1)) * (p178==1))) + !(EX(!(((p7==1)&&(p184==1)...669
Reverse transition relation is NOT exact ! Due to transitions t13, t15, t17, t19, t21, t23, t25, t27, t29, t31, t33, t35, t37, t39, t41, t43, t45, t47, t49...293
Detected timeout of ITS tools.
[2022-05-16 01:07:50] [INFO ] Flatten gal took : 13 ms
[2022-05-16 01:07:50] [INFO ] Applying decomposition
[2022-05-16 01:07:50] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13818770725974793497.txt' '-o' '/tmp/graph13818770725974793497.bin' '-w' '/tmp/graph13818770725974793497.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13818770725974793497.bin' '-l' '-1' '-v' '-w' '/tmp/graph13818770725974793497.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:07:50] [INFO ] Decomposing Gal with order
[2022-05-16 01:07:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:07:50] [INFO ] Removed a total of 26 redundant transitions.
[2022-05-16 01:07:50] [INFO ] Flatten gal took : 20 ms
[2022-05-16 01:07:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 01:07:50] [INFO ] Time to serialize gal into /tmp/CTLFireability9002309848890384584.gal : 4 ms
[2022-05-16 01:07:50] [INFO ] Time to serialize properties into /tmp/CTLFireability7412663877089687874.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9002309848890384584.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7412663877089687874.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
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.66348e+16,1.95461,79452,345,21,147931,203,513,252172,34,309,0


Converting to forward existential form...Done !
original formula: A((EG(AF((i7.i0.u47.p144==1))) * EF((EG((i16.u5.p19==1)) * A((((i10.i0.u37.p28==1)&&(i6.i0.u38.p125==1))||(i7.i2.u52.p154==1)) U (((i15.i...393
=> equivalent forward existential formula: [((Init * !(EG(!(!(((!(EG(!((i14.u11.p40==1)))) + ((EX((i11.i1.u70.p197==1)) * (i3.i0.u16.p57==1)) * (i3.i0.u62....1023
Reverse transition relation is NOT exact ! Due to transitions i0.u1.t57, i1.i0.u6.t47, i1.i0.u8.t43, i1.i1.u10.t39, i1.i1.u12.t35, i2.u13.t33, i3.i0.u16.t2...514
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
(forward)formula 0,1,22.3779,796704,1,0,1.73428e+06,283,3631,2.28649e+06,164,684,1356892
FORMULA AutoFlight-PT-12a-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 275/275 places, 238/238 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 263 transition count 158
Reduce places removed 79 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 170 place count 184 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 171 place count 183 transition count 157
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 171 place count 183 transition count 132
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 233 place count 146 transition count 132
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 233 place count 146 transition count 120
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 257 place count 134 transition count 120
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 261 place count 130 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 265 place count 130 transition count 116
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 315 place count 105 transition count 91
Applied a total of 315 rules in 27 ms. Remains 105 /275 variables (removed 170) and now considering 91/238 (removed 147) transitions.
// Phase 1: matrix 91 rows 105 cols
[2022-05-16 01:08:13] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 01:08:13] [INFO ] Implicit Places using invariants in 93 ms returned [88, 94, 104]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 95 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 102/275 places, 91/238 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 100 transition count 89
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 100 transition count 89
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 6 place count 99 transition count 88
Applied a total of 6 rules in 7 ms. Remains 99 /102 variables (removed 3) and now considering 88/91 (removed 3) transitions.
// Phase 1: matrix 88 rows 99 cols
[2022-05-16 01:08:13] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 01:08:13] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 88 rows 99 cols
[2022-05-16 01:08:13] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 01:08:13] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 99/275 places, 88/238 transitions.
Finished structural reductions, in 2 iterations. Remains : 99/275 places, 88/238 transitions.
[2022-05-16 01:08:13] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:08:13] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:08:13] [INFO ] Input system was already deterministic with 88 transitions.
Finished random walk after 581 steps, including 18 resets, run visited all 1 properties in 5 ms. (steps per millisecond=116 )
FORMULA AutoFlight-PT-12a-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 238/238 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 270 transition count 233
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 270 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 269 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 269 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 268 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 268 transition count 231
Applied a total of 14 rules in 18 ms. Remains 268 /275 variables (removed 7) and now considering 231/238 (removed 7) transitions.
// Phase 1: matrix 231 rows 268 cols
[2022-05-16 01:08:13] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-16 01:08:13] [INFO ] Implicit Places using invariants in 118 ms returned [7, 14, 21, 41, 73, 80, 85, 90, 101, 239, 249, 267]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 120 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 256/275 places, 231/238 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 254 transition count 229
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 254 transition count 229
Applied a total of 4 rules in 6 ms. Remains 254 /256 variables (removed 2) and now considering 229/231 (removed 2) transitions.
// Phase 1: matrix 229 rows 254 cols
[2022-05-16 01:08:13] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-16 01:08:13] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 229 rows 254 cols
[2022-05-16 01:08:13] [INFO ] Computed 39 place invariants in 2 ms
[2022-05-16 01:08:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 01:08:14] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 254/275 places, 229/238 transitions.
Finished structural reductions, in 2 iterations. Remains : 254/275 places, 229/238 transitions.
[2022-05-16 01:08:14] [INFO ] Flatten gal took : 9 ms
[2022-05-16 01:08:14] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:08:14] [INFO ] Input system was already deterministic with 229 transitions.
[2022-05-16 01:08:14] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:08:14] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:08:14] [INFO ] Time to serialize gal into /tmp/CTLFireability6246675327528740419.gal : 1 ms
[2022-05-16 01:08:14] [INFO ] Time to serialize properties into /tmp/CTLFireability17184280530928196780.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6246675327528740419.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17184280530928196780.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.54778e+16,12.0357,331348,2,34907,5,898918,6,0,1243,2.16379e+06,0


Converting to forward existential form...Done !
original formula: (!(A(AX(E(EF((p66==1)) U A(((p28==1)&&(p187==1)) U (p142==1)))) U EF(((p49==1)&&(p164==1))))) + AG((p116==0)))
=> equivalent forward existential formula: [(FwdU((Init * !(!(!((E(!(E(TRUE U ((p49==1)&&(p164==1)))) U (!(!(EX(!(E(E(TRUE U (p66==1)) U !((E(!((p142==1)) ...341
Reverse transition relation is NOT exact ! Due to transitions t13, t15, t17, t19, t21, t23, t25, t27, t29, t31, t33, t35, t37, t39, t41, t43, t45, t47, t49...298
Detected timeout of ITS tools.
[2022-05-16 01:08:44] [INFO ] Flatten gal took : 14 ms
[2022-05-16 01:08:44] [INFO ] Applying decomposition
[2022-05-16 01:08:44] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph310342611481555724.txt' '-o' '/tmp/graph310342611481555724.bin' '-w' '/tmp/graph310342611481555724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph310342611481555724.bin' '-l' '-1' '-v' '-w' '/tmp/graph310342611481555724.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:08:44] [INFO ] Decomposing Gal with order
[2022-05-16 01:08:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:08:44] [INFO ] Removed a total of 27 redundant transitions.
[2022-05-16 01:08:44] [INFO ] Flatten gal took : 21 ms
[2022-05-16 01:08:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-16 01:08:44] [INFO ] Time to serialize gal into /tmp/CTLFireability16412643837334387757.gal : 3 ms
[2022-05-16 01:08:44] [INFO ] Time to serialize properties into /tmp/CTLFireability17807976260371300870.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16412643837334387757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17807976260371300870.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
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.54778e+16,0.705766,28172,341,27,42580,252,461,84036,39,453,0


Converting to forward existential form...Done !
original formula: (!(A(AX(E(EF((i10.i0.u18.p66==1)) U A(((i7.u36.p28==1)&&(i7.u60.p187==1)) U (i5.i2.u44.p142==1)))) U EF(((i7.u37.p49==1)&&(i8.u53.p164==1...185
=> equivalent forward existential formula: [(FwdU((Init * !(!(!((E(!(E(TRUE U ((i7.u37.p49==1)&&(i8.u53.p164==1)))) U (!(!(EX(!(E(E(TRUE U (i10.i0.u18.p66=...446
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t59, i0.u1.t57, i1.u3.t53, i2.u13.t33, i3.u15.t29, i4.u23.t13, i7.t121, i7.t88, i7.u36....513
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 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 275/275 places, 238/238 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 263 transition count 155
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 175 place count 181 transition count 155
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 175 place count 181 transition count 131
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 235 place count 145 transition count 131
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 235 place count 145 transition count 119
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 259 place count 133 transition count 119
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 264 place count 128 transition count 114
Iterating global reduction 2 with 5 rules applied. Total rules applied 269 place count 128 transition count 114
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 319 place count 103 transition count 89
Applied a total of 319 rules in 24 ms. Remains 103 /275 variables (removed 172) and now considering 89/238 (removed 149) transitions.
// Phase 1: matrix 89 rows 103 cols
[2022-05-16 01:09:14] [INFO ] Computed 28 place invariants in 6 ms
[2022-05-16 01:09:14] [INFO ] Implicit Places using invariants in 72 ms returned [86, 92, 102]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 73 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 100/275 places, 89/238 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 98 transition count 87
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 98 transition count 87
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 6 place count 97 transition count 86
Applied a total of 6 rules in 6 ms. Remains 97 /100 variables (removed 3) and now considering 86/89 (removed 3) transitions.
// Phase 1: matrix 86 rows 97 cols
[2022-05-16 01:09:14] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-16 01:09:14] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 86 rows 97 cols
[2022-05-16 01:09:14] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 01:09:14] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 97/275 places, 86/238 transitions.
Finished structural reductions, in 2 iterations. Remains : 97/275 places, 86/238 transitions.
[2022-05-16 01:09:14] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:09:14] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:09:14] [INFO ] Input system was already deterministic with 86 transitions.
[2022-05-16 01:09:14] [INFO ] Flatten gal took : 2 ms
[2022-05-16 01:09:14] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:09:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8289336171901184253.gal : 0 ms
[2022-05-16 01:09:14] [INFO ] Time to serialize properties into /tmp/CTLFireability2586948255037078446.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8289336171901184253.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2586948255037078446.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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.22084e+08,0.047225,5688,2,570,5,4552,6,0,477,4468,0


Converting to forward existential form...Done !
original formula: AG(EF(AG(((p22==1)&&(p173==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(((p22==1)&&(p173==1))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.115271,7912,1,0,7,19474,15,1,2136,4596,5
FORMULA AutoFlight-PT-12a-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 238/238 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 270 transition count 233
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 270 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 269 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 269 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 268 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 268 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 267 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 267 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 266 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 266 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 265 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 265 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 264 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 264 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 263 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 263 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 262 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 262 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 261 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 261 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 260 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 260 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 259 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 259 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 258 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 258 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 257 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 257 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 256 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 256 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 255 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 255 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 254 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 254 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 253 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 253 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 252 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 252 transition count 215
Applied a total of 46 rules in 99 ms. Remains 252 /275 variables (removed 23) and now considering 215/238 (removed 23) transitions.
// Phase 1: matrix 215 rows 252 cols
[2022-05-16 01:09:14] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-16 01:09:15] [INFO ] Implicit Places using invariants in 161 ms returned [7, 14, 21, 28, 41, 48, 73, 80, 85, 90, 101, 223, 233, 251]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 162 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 238/275 places, 215/238 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 236 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 236 transition count 213
Applied a total of 4 rules in 6 ms. Remains 236 /238 variables (removed 2) and now considering 213/215 (removed 2) transitions.
// Phase 1: matrix 213 rows 236 cols
[2022-05-16 01:09:15] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-16 01:09:15] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 213 rows 236 cols
[2022-05-16 01:09:15] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-16 01:09:15] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 236/275 places, 213/238 transitions.
Finished structural reductions, in 2 iterations. Remains : 236/275 places, 213/238 transitions.
[2022-05-16 01:09:15] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:09:15] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:09:15] [INFO ] Input system was already deterministic with 213 transitions.
[2022-05-16 01:09:15] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:09:15] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:09:15] [INFO ] Time to serialize gal into /tmp/CTLFireability14002736890510036891.gal : 1 ms
[2022-05-16 01:09:15] [INFO ] Time to serialize properties into /tmp/CTLFireability4025128781150528567.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14002736890510036891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4025128781150528567.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.54767e+16,14.2349,388100,2,32575,5,1.01292e+06,6,0,1159,2.55048e+06,0


Converting to forward existential form...Done !
original formula: E(EX(TRUE) U ((p203==1)||(p23==1)))
=> equivalent forward existential formula: [(FwdU(Init,EX(TRUE)) * ((p203==1)||(p23==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, t15, t17, t19, t21, t23, t25, t27, t29, t31, t33, t35, t37, t39, t41, t43, t45, t47, t49...299
Detected timeout of ITS tools.
[2022-05-16 01:09:45] [INFO ] Flatten gal took : 12 ms
[2022-05-16 01:09:45] [INFO ] Applying decomposition
[2022-05-16 01:09:45] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14533470241278575030.txt' '-o' '/tmp/graph14533470241278575030.bin' '-w' '/tmp/graph14533470241278575030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14533470241278575030.bin' '-l' '-1' '-v' '-w' '/tmp/graph14533470241278575030.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:09:45] [INFO ] Decomposing Gal with order
[2022-05-16 01:09:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:09:45] [INFO ] Removed a total of 24 redundant transitions.
[2022-05-16 01:09:45] [INFO ] Flatten gal took : 15 ms
[2022-05-16 01:09:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 01:09:45] [INFO ] Time to serialize gal into /tmp/CTLFireability9898038536874913774.gal : 2 ms
[2022-05-16 01:09:45] [INFO ] Time to serialize properties into /tmp/CTLFireability13171275822282711497.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9898038536874913774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13171275822282711497.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
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.54767e+16,0.236923,19576,466,16,35137,171,445,46584,30,276,0


Converting to forward existential form...Done !
original formula: E(EX(TRUE) U ((i8.i2.u63.p203==1)||(i10.i1.u6.p23==1)))
=> equivalent forward existential formula: [(FwdU(Init,EX(TRUE)) * ((i8.i2.u63.p203==1)||(i10.i1.u6.p23==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.u1.t57, i1.i0.u3.t53, i1.i1.u5.t49, i2.u13.t33, i3.u18.t23, i3.u20.t19, i4.u17.t25, i5.u21...522
Detected timeout of ITS tools.
[2022-05-16 01:10:15] [INFO ] Flatten gal took : 14 ms
[2022-05-16 01:10:15] [INFO ] Flatten gal took : 17 ms
[2022-05-16 01:10:15] [INFO ] Applying decomposition
[2022-05-16 01:10:15] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14594003346123197749.txt' '-o' '/tmp/graph14594003346123197749.bin' '-w' '/tmp/graph14594003346123197749.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14594003346123197749.bin' '-l' '-1' '-v' '-w' '/tmp/graph14594003346123197749.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:10:15] [INFO ] Decomposing Gal with order
[2022-05-16 01:10:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:10:15] [INFO ] Removed a total of 29 redundant transitions.
[2022-05-16 01:10:15] [INFO ] Flatten gal took : 16 ms
[2022-05-16 01:10:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2022-05-16 01:10:15] [INFO ] Time to serialize gal into /tmp/CTLFireability17133671240877321274.gal : 3 ms
[2022-05-16 01:10:15] [INFO ] Time to serialize properties into /tmp/CTLFireability16911679392339850257.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17133671240877321274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16911679392339850257.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 4 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.2419e+16,0.160338,10384,446,65,9763,1426,642,16879,81,5208,0


Converting to forward existential form...Done !
original formula: !(A(A((((EX((i3.i0.u16.p48==1)) + (i4.u23.p73!=1)) + ((i16.i0.u12.p34==1)||(i10.i1.u3.p9==1))) + (((i11.i0.u15.p45==1)&&(i3.i0.u94.p270==...427
=> equivalent forward existential formula: (((([((((FwdU((FwdU(Init,!(((i1.i1.u31.p96==1)&&(i1.i1.u31.p255==1)))) * !(((i1.i1.u31.p96==1)&&(i1.i1.u31.p255=...2765
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u4.t53, i0.i1.u1.t57, i1.i0.u9.t45, i2.u14.t37, i3.i0.u16.t33, i3.i1.u18.t29, i4.u21.t2...522
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 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,1,10.3329,229240,1,0,362217,2969,4369,547123,459,7643,330584
FORMULA AutoFlight-PT-12a-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF(((i9.u10.p28==1)&&(i12.i1.u65.p187==1))) * A(EX(AX(((i9.u2.p7==1)&&(i9.u73.p208==1)))) U AF(!(EF(((i3.i1.u18.p54==1)||((i6.u39.p118==...183
=> equivalent forward existential formula: [(((Init * E(TRUE U ((i9.u10.p28==1)&&(i12.i1.u65.p187==1)))) * !(EG(!(!(EG(!(!(E(TRUE U ((i3.i1.u18.p54==1)||((...448
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
ITS-tools command line returned an error code 139
[2022-05-16 01:13:27] [INFO ] Applying decomposition
[2022-05-16 01:13:27] [INFO ] Flatten gal took : 12 ms
[2022-05-16 01:13:27] [INFO ] Decomposing Gal with order
[2022-05-16 01:13:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:13:27] [INFO ] Removed a total of 49 redundant transitions.
[2022-05-16 01:13:27] [INFO ] Flatten gal took : 33 ms
[2022-05-16 01:13:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 4 ms.
[2022-05-16 01:13:27] [INFO ] Time to serialize gal into /tmp/CTLFireability11195945345759316655.gal : 3 ms
[2022-05-16 01:13:27] [INFO ] Time to serialize properties into /tmp/CTLFireability2312339569409310946.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11195945345759316655.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2312339569409310946.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 3 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.2419e+16,6.47274,214240,1924,343,210842,7576,499,1.04233e+06,332,22588,0


Converting to forward existential form...Done !
original formula: (EF(((u12.p28==1)&&(u62.p187==1))) * A(EX(AX(((u3.p7==1)&&(u62.p208==1)))) U AF(!(EF(((u23.p54==1)||((u59.p118==1)&&(u74.p302==1))))))))
=> equivalent forward existential formula: [(((Init * E(TRUE U ((u12.p28==1)&&(u62.p187==1)))) * !(EG(!(!(EG(!(!(E(TRUE U ((u23.p54==1)||((u59.p118==1)&&(u...393
Reverse transition relation is NOT exact ! Due to transitions t97, t121, u1.t59, u2.t57, u4.t55, u5.t53, u7.t51, u8.t49, u10.t47, u11.t45, u13.t43, u14.t41...383
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 61
Fast SCC detection found an SCC at level 62
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
(forward)formula 0,0,231.498,4286136,1,0,7.63777e+06,76419,1871,1.45843e+07,1128,311734,23924722
FORMULA AutoFlight-PT-12a-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(A(AX(E(EF((u28.p66==1)) U A(((u12.p28==1)&&(u62.p187==1)) U (u61.p142==1)))) U EF(((u21.p49==1)&&(u61.p164==1))))) + AG((u57.p116==0))...156
=> equivalent forward existential formula: [(FwdU((Init * !(!(!((E(!(E(TRUE U ((u21.p49==1)&&(u61.p164==1)))) U (!(!(EX(!(E(E(TRUE U (u28.p66==1)) U !((E(!...393
Using saturation style SCC detection
(forward)formula 1,0,435.144,4795304,1,0,8.21059e+06,175123,2502,2.82379e+07,1240,686503,13424480
FORMULA AutoFlight-PT-12a-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(EX(TRUE) U ((u62.p203==1)||(u10.p23==1)))
=> equivalent forward existential formula: [(FwdU(Init,EX(TRUE)) * ((u62.p203==1)||(u10.p23==1)))] != FALSE
(forward)formula 2,1,521.976,5196056,1,0,8.21059e+06,175123,1157,2.98551e+07,888,686503,4869460
FORMULA AutoFlight-PT-12a-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 1159340 ms.

BK_STOP 1652664131254

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-12a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-12a, 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 r006-tajo-165245689300466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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