About the Execution of ITS-Tools for AutoFlight-PT-12a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2834.600 | 903615.00 | 952766.00 | 913.30 | FTFFFTTTTFTFFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593200466.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
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 r005-oct2-167813593200466
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.9K Feb 25 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 18:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 25 18:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 85K Mar 5 18:22 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 1678514766166
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12a
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202303021504
[2023-03-11 06:06:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 06:06:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:06:08] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-11 06:06:08] [INFO ] Transformed 307 places.
[2023-03-11 06:06:08] [INFO ] Transformed 305 transitions.
[2023-03-11 06:06:08] [INFO ] Found NUPN structural information;
[2023-03-11 06:06:08] [INFO ] Parsed PT model containing 307 places and 305 transitions and 980 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
Support contains 156 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 19 ms. Remains 307 /307 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 307 cols
[2023-03-11 06:06:08] [INFO ] Computed 76 place invariants in 24 ms
[2023-03-11 06:06:09] [INFO ] Implicit Places using invariants in 699 ms returned [87, 99, 114, 117, 120, 182, 232, 256, 268, 280, 292, 298, 304]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 745 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 294/307 places, 245/245 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 289 transition count 240
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 289 transition count 240
Applied a total of 10 rules in 16 ms. Remains 289 /294 variables (removed 5) and now considering 240/245 (removed 5) transitions.
// Phase 1: matrix 240 rows 289 cols
[2023-03-11 06:06:09] [INFO ] Computed 63 place invariants in 5 ms
[2023-03-11 06:06:09] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-11 06:06:09] [INFO ] Invariant cache hit.
[2023-03-11 06:06:09] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-11 06:06:10] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 289/307 places, 240/245 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1389 ms. Remains : 289/307 places, 240/245 transitions.
Support contains 156 out of 289 places after structural reductions.
[2023-03-11 06:06:10] [INFO ] Flatten gal took : 44 ms
[2023-03-11 06:06:10] [INFO ] Flatten gal took : 18 ms
[2023-03-11 06:06:10] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 150 out of 289 places (down from 156) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 177 resets, run finished after 548 ms. (steps per millisecond=18 ) properties (out of 95) seen :71
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2023-03-11 06:06:11] [INFO ] Invariant cache hit.
[2023-03-11 06:06:11] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-11 06:06:11] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:22
[2023-03-11 06:06:11] [INFO ] [Nat]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-11 06:06:12] [INFO ] After 518ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :17
[2023-03-11 06:06:12] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-11 06:06:12] [INFO ] After 426ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :7 sat :17
[2023-03-11 06:06:12] [INFO ] Deduced a trap composed of 113 places in 132 ms of which 31 ms to minimize.
[2023-03-11 06:06:13] [INFO ] Deduced a trap composed of 114 places in 116 ms of which 2 ms to minimize.
[2023-03-11 06:06:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 302 ms
[2023-03-11 06:06:13] [INFO ] After 1256ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :15
Attempting to minimize the solution found.
Minimization took 461 ms.
[2023-03-11 06:06:14] [INFO ] After 2554ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :15
Fused 24 Parikh solutions to 14 different solutions.
Parikh walk visited 9 properties in 128 ms.
Support contains 17 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 240/240 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 289 transition count 206
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 255 transition count 206
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 68 place count 255 transition count 190
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 100 place count 239 transition count 190
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 237 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 237 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 236 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 236 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 235 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 235 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 234 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 234 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 233 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 233 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 232 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 232 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 231 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 231 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 230 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 230 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 229 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 229 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 228 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 228 transition count 179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 227 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 227 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 226 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 226 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 225 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 225 transition count 176
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 224 transition count 175
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 224 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 223 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 223 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 222 transition count 173
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 222 transition count 173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 221 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 221 transition count 172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 220 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 220 transition count 171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 219 transition count 170
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 219 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 218 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 218 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 217 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 217 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 216 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 216 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 215 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 215 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 214 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 214 transition count 165
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 186 place count 196 transition count 147
Free-agglomeration rule applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 206 place count 196 transition count 127
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 226 place count 176 transition count 127
Applied a total of 226 rules in 164 ms. Remains 176 /289 variables (removed 113) and now considering 127/240 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 176/289 places, 127/240 transitions.
Incomplete random walk after 10000 steps, including 216 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 176 cols
[2023-03-11 06:06:14] [INFO ] Computed 63 place invariants in 3 ms
[2023-03-11 06:06:14] [INFO ] [Real]Absence check using 63 positive place invariants in 8 ms returned sat
[2023-03-11 06:06:14] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:06:14] [INFO ] [Nat]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-11 06:06:14] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:06:14] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-11 06:06:14] [INFO ] After 39ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:06:14] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-11 06:06:14] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 127/127 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 176 transition count 126
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 2 place count 175 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 174 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 174 transition count 125
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 14 place count 169 transition count 120
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 169 transition count 116
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 165 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 164 transition count 115
Reduce places removed 53 places and 0 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 1 with 124 rules applied. Total rules applied 147 place count 111 transition count 44
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 2 with 71 rules applied. Total rules applied 218 place count 40 transition count 44
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 218 place count 40 transition count 34
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 238 place count 30 transition count 34
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 245 place count 23 transition count 27
Iterating global reduction 3 with 7 rules applied. Total rules applied 252 place count 23 transition count 27
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 257 place count 23 transition count 22
Applied a total of 257 rules in 32 ms. Remains 23 /176 variables (removed 153) and now considering 22/127 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 23/176 places, 22/127 transitions.
Finished random walk after 754 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=377 )
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2023-03-11 06:06:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 06:06:14] [INFO ] Flatten gal took : 15 ms
FORMULA AutoFlight-PT-12a-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 06:06:14] [INFO ] Flatten gal took : 13 ms
[2023-03-11 06:06:14] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 118 out of 289 places (down from 127) after GAL structural reductions.
Computed a total of 20 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 289 transition count 209
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 258 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 257 transition count 208
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 64 place count 257 transition count 189
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 102 place count 238 transition count 189
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 105 place count 235 transition count 186
Iterating global reduction 3 with 3 rules applied. Total rules applied 108 place count 235 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 234 transition count 185
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 234 transition count 185
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 3 with 40 rules applied. Total rules applied 150 place count 214 transition count 165
Applied a total of 150 rules in 42 ms. Remains 214 /289 variables (removed 75) and now considering 165/240 (removed 75) transitions.
// Phase 1: matrix 165 rows 214 cols
[2023-03-11 06:06:15] [INFO ] Computed 63 place invariants in 2 ms
[2023-03-11 06:06:15] [INFO ] Implicit Places using invariants in 376 ms returned [6, 11, 21, 31, 43, 48, 53, 58, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 161, 167, 173, 182, 192, 202]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 378 ms to find 34 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 180/289 places, 165/240 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 180 transition count 140
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 155 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 154 transition count 139
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 52 place count 154 transition count 117
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 96 place count 132 transition count 117
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 101 place count 127 transition count 112
Iterating global reduction 3 with 5 rules applied. Total rules applied 106 place count 127 transition count 112
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 108 place count 126 transition count 111
Applied a total of 108 rules in 25 ms. Remains 126 /180 variables (removed 54) and now considering 111/165 (removed 54) transitions.
// Phase 1: matrix 111 rows 126 cols
[2023-03-11 06:06:15] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-11 06:06:15] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-11 06:06:15] [INFO ] Invariant cache hit.
[2023-03-11 06:06:15] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-11 06:06:15] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 126/289 places, 111/240 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 778 ms. Remains : 126/289 places, 111/240 transitions.
[2023-03-11 06:06:15] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:06:15] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:06:15] [INFO ] Input system was already deterministic with 111 transitions.
[2023-03-11 06:06:15] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:06:15] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:06:15] [INFO ] Time to serialize gal into /tmp/CTLFireability5294079283318830824.gal : 6 ms
[2023-03-11 06:06:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5073595312883760201.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5294079283318830824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5073595312883760201.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.51412e+09,1.22836,47612,2,18021,5,136809,6,0,611,215055,0
Converting to forward existential form...Done !
original formula: (AF((EG(E(((p39==1)&&(p225==1)) U ((p49==1)&&(p128==1)))) * ((EG(((p269==1)&&(p306==1))) + A(((p55==1)&&(p277==1)) U ((p35==1)&&(p162==1)...346
=> equivalent forward existential formula: ([FwdG(Init,!((EG(E(((p39==1)&&(p225==1)) U ((p49==1)&&(p128==1)))) * ((EG(((p269==1)&&(p306==1))) + !((E(!(((p3...690
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t14, t26, t109, t110, Intersection with reachable at each step enabled. (destroyed/...192
Using saturation style SCC detection
Detected timeout of ITS tools.
[2023-03-11 06:06:45] [INFO ] Flatten gal took : 14 ms
[2023-03-11 06:06:45] [INFO ] Applying decomposition
[2023-03-11 06:06:46] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15358241492039649043.txt' '-o' '/tmp/graph15358241492039649043.bin' '-w' '/tmp/graph15358241492039649043.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15358241492039649043.bin' '-l' '-1' '-v' '-w' '/tmp/graph15358241492039649043.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:06:46] [INFO ] Decomposing Gal with order
[2023-03-11 06:06:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:06:46] [INFO ] Removed a total of 22 redundant transitions.
[2023-03-11 06:06:46] [INFO ] Flatten gal took : 65 ms
[2023-03-11 06:06:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2023-03-11 06:06:46] [INFO ] Time to serialize gal into /tmp/CTLFireability3590307531744765551.gal : 12 ms
[2023-03-11 06:06:46] [INFO ] Time to serialize properties into /tmp/CTLFireability9259452104045686543.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3590307531744765551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9259452104045686543.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.51412e+09,0.03908,5044,197,33,2646,344,386,3455,54,634,0
Converting to forward existential form...Done !
original formula: (AF((EG(E(((i5.i0.u11.p39==1)&&(i5.i0.u38.p225==1)) U ((i7.u33.p49==1)&&(i7.u26.p128==1)))) * ((EG(((u51.p269==1)&&(u51.p306==1))) + A(((...518
=> equivalent forward existential formula: ([FwdG(Init,!((EG(E(((i5.i0.u11.p39==1)&&(i5.i0.u38.p225==1)) U ((i7.u33.p49==1)&&(i7.u26.p128==1)))) * ((EG(((u...946
Reverse transition relation is NOT exact ! Due to transitions t110, i4.u12.t14, i6.u15.t10, i9.u1.t26, i11.u23.t1, Intersection with reachable at each ste...214
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,0.892419,44380,1,0,93006,1137,2086,118811,285,2265,134241
FORMULA AutoFlight-PT-12a-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 289 transition count 206
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 255 transition count 206
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 68 place count 255 transition count 188
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 104 place count 237 transition count 188
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 234 transition count 185
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 234 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 233 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 233 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 232 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 232 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 231 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 231 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 230 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 230 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 229 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 229 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 228 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 228 transition count 179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 227 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 227 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 226 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 226 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 225 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 225 transition count 176
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 224 transition count 175
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 224 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 223 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 223 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 222 transition count 173
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 222 transition count 173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 221 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 221 transition count 172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 220 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 220 transition count 171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 219 transition count 170
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 219 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 218 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 218 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 217 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 217 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 216 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 216 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 215 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 215 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 214 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 214 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 213 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 213 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 212 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 212 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 211 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 211 transition count 162
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 198 place count 190 transition count 141
Applied a total of 198 rules in 75 ms. Remains 190 /289 variables (removed 99) and now considering 141/240 (removed 99) transitions.
// Phase 1: matrix 141 rows 190 cols
[2023-03-11 06:06:47] [INFO ] Computed 63 place invariants in 1 ms
[2023-03-11 06:06:47] [INFO ] Implicit Places using invariants in 211 ms returned [6, 11, 16, 21, 26, 31, 36, 41, 47, 52, 58, 63, 64, 65, 67, 68, 69, 70, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 137, 143, 149, 158, 168, 178, 189]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 212 ms to find 36 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 154/289 places, 141/240 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 154 transition count 103
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 116 transition count 103
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 76 place count 116 transition count 102
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 78 place count 115 transition count 102
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 109 transition count 96
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 109 transition count 96
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 94 place count 107 transition count 94
Applied a total of 94 rules in 12 ms. Remains 107 /154 variables (removed 47) and now considering 94/141 (removed 47) transitions.
// Phase 1: matrix 94 rows 107 cols
[2023-03-11 06:06:47] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-11 06:06:47] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-11 06:06:47] [INFO ] Invariant cache hit.
[2023-03-11 06:06:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-11 06:06:47] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 107/289 places, 94/240 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 551 ms. Remains : 107/289 places, 94/240 transitions.
[2023-03-11 06:06:47] [INFO ] Flatten gal took : 7 ms
[2023-03-11 06:06:47] [INFO ] Flatten gal took : 7 ms
[2023-03-11 06:06:47] [INFO ] Input system was already deterministic with 94 transitions.
[2023-03-11 06:06:47] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:06:47] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:06:47] [INFO ] Time to serialize gal into /tmp/CTLFireability14923707660563810686.gal : 2 ms
[2023-03-11 06:06:47] [INFO ] Time to serialize properties into /tmp/CTLFireability7451204706436677026.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14923707660563810686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7451204706436677026.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.30999e+09,0.677363,27028,2,12810,5,80972,6,0,522,106964,0
Converting to forward existential form...Done !
original formula: EF(EG(((E(((p90==1)&&(p243==1)) U (p98==1)) + (p58==1)) + (((p73==1)&&(p6==1))&&(p235==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((E(((p90==1)&&(p243==1)) U (p98==1)) + (p58==1)) + (((p73==1)&&(p6==1))&&(p235==1))))] !=...161
Reverse transition relation is NOT exact ! Due to transitions t5, t10, t92, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
(forward)formula 0,1,2.53386,77856,1,0,192,341364,216,91,3094,230519,208
FORMULA AutoFlight-PT-12a-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 289 transition count 206
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 255 transition count 206
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 68 place count 255 transition count 187
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 106 place count 236 transition count 187
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 233 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 233 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 232 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 232 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 231 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 231 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 230 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 230 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 229 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 229 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 228 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 228 transition count 179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 227 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 227 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 226 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 226 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 225 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 225 transition count 176
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 224 transition count 175
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 224 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 223 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 223 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 222 transition count 173
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 222 transition count 173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 221 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 221 transition count 172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 220 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 220 transition count 171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 219 transition count 170
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 219 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 218 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 218 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 217 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 217 transition count 168
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 192 place count 193 transition count 144
Applied a total of 192 rules in 63 ms. Remains 193 /289 variables (removed 96) and now considering 144/240 (removed 96) transitions.
// Phase 1: matrix 144 rows 193 cols
[2023-03-11 06:06:50] [INFO ] Computed 63 place invariants in 1 ms
[2023-03-11 06:06:50] [INFO ] Implicit Places using invariants in 266 ms returned [5, 10, 15, 20, 25, 35, 40, 45, 50, 55, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 140, 146, 152, 161, 171, 181, 192]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 280 ms to find 37 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 156/289 places, 144/240 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 156 transition count 102
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 114 transition count 102
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 84 place count 114 transition count 99
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 90 place count 111 transition count 99
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 96 place count 105 transition count 93
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 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 106 place count 103 transition count 91
Applied a total of 106 rules in 10 ms. Remains 103 /156 variables (removed 53) and now considering 91/144 (removed 53) transitions.
// Phase 1: matrix 91 rows 103 cols
[2023-03-11 06:06:50] [INFO ] Computed 26 place invariants in 0 ms
[2023-03-11 06:06:50] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-11 06:06:50] [INFO ] Invariant cache hit.
[2023-03-11 06:06:50] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-11 06:06:51] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 103/289 places, 91/240 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 706 ms. Remains : 103/289 places, 91/240 transitions.
[2023-03-11 06:06:51] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:06:51] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:06:51] [INFO ] Input system was already deterministic with 91 transitions.
Finished random walk after 80 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
FORMULA AutoFlight-PT-12a-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-11 06:06:51] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:06:51] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:06:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15036379786062070988.gal : 1 ms
[2023-03-11 06:06:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7874974075022352290.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15036379786062070988.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7874974075022352290.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 286 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 282 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 282 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 281 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 280 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 280 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 279 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 279 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 278 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 278 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 277 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 277 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 276 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 276 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 275 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 275 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 274 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 274 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 273 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 273 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 272 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 272 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 271 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 271 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 270 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 270 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 269 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 269 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 268 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 268 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 267 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 267 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 266 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 266 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 265 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 265 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 264 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 264 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 263 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 263 transition count 214
Applied a total of 52 rules in 113 ms. Remains 263 /289 variables (removed 26) and now considering 214/240 (removed 26) transitions.
// Phase 1: matrix 214 rows 263 cols
[2023-03-11 06:06:51] [INFO ] Computed 63 place invariants in 1 ms
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7874974075022352290.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9,0.079226,3952,2,284,5,539,6,0,503,151,0
Total reachable state count : 9
[2023-03-11 06:06:51] [INFO ] Implicit Places using invariants in 241 ms returned [7, 14, 21, 28, 35, 42, 49, 56, 63, 70, 77, 84, 89, 92, 95, 100, 103, 109, 206, 218, 228, 248, 262]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 244 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/289 places, 214/240 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 235 transition count 209
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 235 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 234 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 234 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 233 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 233 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 232 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 232 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 231 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 231 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 230 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 230 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 229 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 229 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 228 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 228 transition count 202
Applied a total of 24 rules in 34 ms. Remains 228 /240 variables (removed 12) and now considering 202/214 (removed 12) transitions.
// Phase 1: matrix 202 rows 228 cols
[2023-03-11 06:06:51] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-11 06:06:51] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-11 06:06:51] [INFO ] Invariant cache hit.
[2023-03-11 06:06:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:06:51] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 228/289 places, 202/240 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 746 ms. Remains : 228/289 places, 202/240 transitions.
[2023-03-11 06:06:51] [INFO ] Flatten gal took : 31 ms
[2023-03-11 06:06:51] [INFO ] Flatten gal took : 7 ms
[2023-03-11 06:06:51] [INFO ] Input system was already deterministic with 202 transitions.
[2023-03-11 06:06:51] [INFO ] Flatten gal took : 7 ms
[2023-03-11 06:06:51] [INFO ] Flatten gal took : 7 ms
[2023-03-11 06:06:51] [INFO ] Time to serialize gal into /tmp/CTLFireability10262428127056792329.gal : 4 ms
[2023-03-11 06:06:51] [INFO ] Time to serialize properties into /tmp/CTLFireability8284822846110288162.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10262428127056792329.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8284822846110288162.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.77895e+16,13.2235,368788,2,38236,5,1.04387e+06,6,0,1114,2.25195e+06,0
Converting to forward existential form...Done !
original formula: (AF(((p108==1)&&(p279==1))) + AX((((((p244==0)||(p305==0))||(((p274==0)||(p305==0))&&(p65==0))) * EF((p45==0))) * EF(EG((p154==0))))))
=> equivalent forward existential formula: (([(EY((Init * !(!(EG(!(((p108==1)&&(p279==1)))))))) * !((((p244==0)||(p305==0))||(((p274==0)||(p305==0))&&(p65=...352
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.
[2023-03-11 06:07:22] [INFO ] Flatten gal took : 23 ms
[2023-03-11 06:07:22] [INFO ] Applying decomposition
[2023-03-11 06:07:22] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2502673861255684351.txt' '-o' '/tmp/graph2502673861255684351.bin' '-w' '/tmp/graph2502673861255684351.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2502673861255684351.bin' '-l' '-1' '-v' '-w' '/tmp/graph2502673861255684351.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:07:22] [INFO ] Decomposing Gal with order
[2023-03-11 06:07:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:07:22] [INFO ] Removed a total of 22 redundant transitions.
[2023-03-11 06:07:22] [INFO ] Flatten gal took : 33 ms
[2023-03-11 06:07:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-11 06:07:22] [INFO ] Time to serialize gal into /tmp/CTLFireability5868956197449969194.gal : 3 ms
[2023-03-11 06:07:22] [INFO ] Time to serialize properties into /tmp/CTLFireability18147291916286064673.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5868956197449969194.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18147291916286064673.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.77895e+16,0.127286,10056,334,17,15160,188,476,17793,32,297,0
Converting to forward existential form...Done !
original formula: (AF(((i16.i1.u85.p108==1)&&(i20.u94.p279==1))) + AX((((((i13.i1.u72.p244==0)||(i20.u94.p305==0))||(((i15.i1.u83.p274==0)||(i20.u94.p305==...239
=> equivalent forward existential formula: (([(EY((Init * !(!(EG(!(((i16.i1.u85.p108==1)&&(i20.u94.p279==1)))))))) * !((((i13.i1.u72.p244==0)||(i20.u94.p30...477
Reverse transition relation is NOT exact ! Due to transitions i0.u1.t57, i1.u7.t45, i2.u9.t41, i3.u11.t37, i4.u14.t31, i4.u16.t27, i5.u17.t25, i6.u36.t85, ...529
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 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,13.0165,347448,1,0,558793,213,3085,636965,149,454,663343
FORMULA AutoFlight-PT-12a-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 286 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Applied a total of 12 rules in 14 ms. Remains 283 /289 variables (removed 6) and now considering 234/240 (removed 6) transitions.
// Phase 1: matrix 234 rows 283 cols
[2023-03-11 06:07:35] [INFO ] Computed 63 place invariants in 2 ms
[2023-03-11 06:07:35] [INFO ] Implicit Places using invariants in 173 ms returned [7, 14, 21, 28, 42, 49, 56, 63, 70, 77, 84, 89, 92, 95, 100, 103, 106, 109, 226, 232, 238, 248, 258, 268, 282]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 175 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/289 places, 234/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 252 transition count 228
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 252 transition count 228
Applied a total of 12 rules in 16 ms. Remains 252 /258 variables (removed 6) and now considering 228/234 (removed 6) transitions.
// Phase 1: matrix 228 rows 252 cols
[2023-03-11 06:07:35] [INFO ] Computed 38 place invariants in 1 ms
[2023-03-11 06:07:35] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-11 06:07:35] [INFO ] Invariant cache hit.
[2023-03-11 06:07:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 06:07:35] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 252/289 places, 228/240 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 566 ms. Remains : 252/289 places, 228/240 transitions.
[2023-03-11 06:07:35] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:07:35] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:07:35] [INFO ] Input system was already deterministic with 228 transitions.
[2023-03-11 06:07:35] [INFO ] Flatten gal took : 7 ms
[2023-03-11 06:07:35] [INFO ] Flatten gal took : 6 ms
[2023-03-11 06:07:35] [INFO ] Time to serialize gal into /tmp/CTLFireability11714749033326001222.gal : 1 ms
[2023-03-11 06:07:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7173224172879889939.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11714749033326001222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7173224172879889939.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.54777e+16,14.3664,329444,2,27650,5,871022,6,0,1236,2.17465e+06,0
Converting to forward existential form...Done !
original formula: A(EX(!(EG((p141==1)))) U ((AX(((EX((p61==1)) * !(AG(((p35==1)&&(p188==1))))) * ((EG(((p8==1)&&(p171==1))) + (p68==1)) + (p34==1)))) * EF(...219
=> equivalent forward existential formula: [((Init * !(EG(!(((!(EX(!(((EX((p61==1)) * !(!(E(TRUE U !(((p35==1)&&(p188==1))))))) * ((EG(((p8==1)&&(p171==1))...754
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.
[2023-03-11 06:08:06] [INFO ] Flatten gal took : 11 ms
[2023-03-11 06:08:06] [INFO ] Applying decomposition
[2023-03-11 06:08:06] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7389451097855013177.txt' '-o' '/tmp/graph7389451097855013177.bin' '-w' '/tmp/graph7389451097855013177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7389451097855013177.bin' '-l' '-1' '-v' '-w' '/tmp/graph7389451097855013177.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:08:06] [INFO ] Decomposing Gal with order
[2023-03-11 06:08:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:08:06] [INFO ] Removed a total of 25 redundant transitions.
[2023-03-11 06:08:06] [INFO ] Flatten gal took : 11 ms
[2023-03-11 06:08:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-11 06:08:06] [INFO ] Time to serialize gal into /tmp/CTLFireability15291635386772581686.gal : 32 ms
[2023-03-11 06:08:06] [INFO ] Time to serialize properties into /tmp/CTLFireability16836581074729272105.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15291635386772581686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16836581074729272105.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.54777e+16,6.67056,231984,302,19,437360,206,461,875563,31,315,0
Converting to forward existential form...Done !
original formula: A(EX(!(EG((i11.i0.u45.p141==1)))) U ((AX(((EX((i6.u17.p61==1)) * !(AG(((i9.u37.p35==1)&&(i14.i0.u63.p188==1))))) * ((EG(((i1.i0.u2.p8==1)...326
=> equivalent forward existential formula: [((Init * !(EG(!(((!(EX(!(((EX((i6.u17.p61==1)) * !(!(E(TRUE U !(((i9.u37.p35==1)&&(i14.i0.u63.p188==1))))))) * ...1053
Reverse transition relation is NOT exact ! Due to transitions t89, t121, i0.u0.t59, i0.u1.t57, i1.i0.u2.t55, i1.i0.u4.t51, i1.i1.u6.t47, i1.i1.u8.t43, i2.u...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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 286 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 282 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 282 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 281 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 280 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 280 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 279 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 279 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 278 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 278 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 277 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 277 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 276 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 276 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 275 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 275 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 274 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 274 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 273 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 273 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 272 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 272 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 271 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 271 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 270 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 270 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 269 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 269 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 268 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 268 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 267 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 267 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 266 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 266 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 265 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 265 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 264 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 264 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 263 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 263 transition count 214
Applied a total of 52 rules in 126 ms. Remains 263 /289 variables (removed 26) and now considering 214/240 (removed 26) transitions.
// Phase 1: matrix 214 rows 263 cols
[2023-03-11 06:08:36] [INFO ] Computed 63 place invariants in 3 ms
[2023-03-11 06:08:36] [INFO ] Implicit Places using invariants in 320 ms returned [7, 14, 21, 28, 35, 42, 49, 56, 63, 70, 77, 84, 89, 92, 95, 100, 103, 106, 109, 206, 212, 218, 228, 238, 248, 262]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 334 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 237/289 places, 214/240 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 230 transition count 207
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 219 transition count 196
Applied a total of 36 rules in 46 ms. Remains 219 /237 variables (removed 18) and now considering 196/214 (removed 18) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-11 06:08:36] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-11 06:08:36] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-11 06:08:36] [INFO ] Invariant cache hit.
[2023-03-11 06:08:37] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/289 places, 196/240 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 835 ms. Remains : 219/289 places, 196/240 transitions.
[2023-03-11 06:08:37] [INFO ] Flatten gal took : 6 ms
[2023-03-11 06:08:37] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:08:37] [INFO ] Input system was already deterministic with 196 transitions.
[2023-03-11 06:08:37] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:08:37] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:08:37] [INFO ] Time to serialize gal into /tmp/CTLFireability13704026337110981026.gal : 1 ms
[2023-03-11 06:08:37] [INFO ] Time to serialize properties into /tmp/CTLFireability3116858372230723049.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13704026337110981026.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3116858372230723049.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.54755e+16,16.5993,359088,2,36343,5,966103,6,0,1074,2.36952e+06,0
Converting to forward existential form...Done !
original formula: EG(((!(E(EF((p3==1)) U (((p36==1)&&(p175==1))||(p58==1)))) + AX(EX((p68==0)))) + ((p61==0) * AX((p95==0)))))
=> equivalent forward existential formula: [FwdG(Init,((!(E(E(TRUE U (p3==1)) U (((p36==1)&&(p175==1))||(p58==1)))) + !(EX(!(EX((p68==0)))))) + ((p61==0) *...187
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.
[2023-03-11 06:09:07] [INFO ] Flatten gal took : 17 ms
[2023-03-11 06:09:07] [INFO ] Applying decomposition
[2023-03-11 06:09:07] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9708943857288120578.txt' '-o' '/tmp/graph9708943857288120578.bin' '-w' '/tmp/graph9708943857288120578.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9708943857288120578.bin' '-l' '-1' '-v' '-w' '/tmp/graph9708943857288120578.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:09:07] [INFO ] Decomposing Gal with order
[2023-03-11 06:09:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:09:07] [INFO ] Removed a total of 24 redundant transitions.
[2023-03-11 06:09:07] [INFO ] Flatten gal took : 23 ms
[2023-03-11 06:09:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-11 06:09:07] [INFO ] Time to serialize gal into /tmp/CTLFireability16271105722842264184.gal : 11 ms
[2023-03-11 06:09:07] [INFO ] Time to serialize properties into /tmp/CTLFireability13521893733645752632.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16271105722842264184.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13521893733645752632.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.54755e+16,0.134577,9664,327,16,13447,182,422,17830,30,333,0
Converting to forward existential form...Done !
original formula: EG(((!(E(EF((i16.u0.p3==1)) U (((i2.u11.p36==1)&&(i2.u10.p175==1))||(i12.u17.p58==1)))) + AX(EX((i5.i1.u20.p68==0)))) + ((i4.u18.p61==0) ...179
=> equivalent forward existential formula: [FwdG(Init,((!(E(E(TRUE U (i16.u0.p3==1)) U (((i2.u11.p36==1)&&(i2.u10.p175==1))||(i12.u17.p58==1)))) + !(EX(!(E...240
Reverse transition relation is NOT exact ! Due to transitions t121, i0.i0.u3.t53, i0.i1.u5.t49, i1.u7.t45, i2.u11.t39, i2.u13.t35, i3.i0.u9.t41, i3.i1.u12....498
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 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,1,16.3878,482488,1,0,684957,184,3252,1.21758e+06,143,548,780991
FORMULA AutoFlight-PT-12a-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 286 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Applied a total of 8 rules in 20 ms. Remains 285 /289 variables (removed 4) and now considering 236/240 (removed 4) transitions.
// Phase 1: matrix 236 rows 285 cols
[2023-03-11 06:09:23] [INFO ] Computed 63 place invariants in 1 ms
[2023-03-11 06:09:24] [INFO ] Implicit Places using invariants in 317 ms returned [7, 14, 28, 35, 42, 49, 56, 63, 70, 77, 84, 89, 92, 95, 100, 103, 106, 109, 228, 234, 240, 250, 260, 270, 284]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 339 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 260/289 places, 236/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 254 transition count 230
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 254 transition count 230
Applied a total of 12 rules in 6 ms. Remains 254 /260 variables (removed 6) and now considering 230/236 (removed 6) transitions.
// Phase 1: matrix 230 rows 254 cols
[2023-03-11 06:09:24] [INFO ] Computed 38 place invariants in 9 ms
[2023-03-11 06:09:24] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-11 06:09:24] [INFO ] Invariant cache hit.
[2023-03-11 06:09:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 06:09:24] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 254/289 places, 230/240 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 722 ms. Remains : 254/289 places, 230/240 transitions.
[2023-03-11 06:09:24] [INFO ] Flatten gal took : 6 ms
[2023-03-11 06:09:24] [INFO ] Flatten gal took : 6 ms
[2023-03-11 06:09:24] [INFO ] Input system was already deterministic with 230 transitions.
[2023-03-11 06:09:24] [INFO ] Flatten gal took : 6 ms
[2023-03-11 06:09:24] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:09:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14847521190224173572.gal : 1 ms
[2023-03-11 06:09:24] [INFO ] Time to serialize properties into /tmp/CTLFireability7692846120541835760.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14847521190224173572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7692846120541835760.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.54779e+16,12.9284,361044,2,35574,5,994233,6,0,1246,2.34285e+06,0
Converting to forward existential form...Done !
original formula: AF((AX(FALSE) + (AF((((EF((p204==1)) + ((p21==1)&&(p186==1))) + ((p34==1)&&(p259==1))) * ((p62==0)||(p283==0)))) * EG((p98==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(FALSE))) + (!(EG(!((((E(TRUE U (p204==1)) + ((p21==1)&&(p186==1))) + ((p34==1)&&(p259==1)))...211
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.
[2023-03-11 06:09:54] [INFO ] Flatten gal took : 19 ms
[2023-03-11 06:09:54] [INFO ] Applying decomposition
[2023-03-11 06:09:54] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13641426062868290188.txt' '-o' '/tmp/graph13641426062868290188.bin' '-w' '/tmp/graph13641426062868290188.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13641426062868290188.bin' '-l' '-1' '-v' '-w' '/tmp/graph13641426062868290188.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:09:54] [INFO ] Decomposing Gal with order
[2023-03-11 06:09:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:09:54] [INFO ] Removed a total of 25 redundant transitions.
[2023-03-11 06:09:54] [INFO ] Flatten gal took : 18 ms
[2023-03-11 06:09:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-11 06:09:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9188584572701185230.gal : 3 ms
[2023-03-11 06:09:54] [INFO ] Time to serialize properties into /tmp/CTLFireability5714826592801380753.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9188584572701185230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5714826592801380753.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.54779e+16,0.101274,8656,373,21,10041,202,454,14716,31,422,0
Converting to forward existential form...Done !
original formula: AF((AX(FALSE) + (AF((((EF((i14.u71.p204==1)) + ((i7.u6.p21==1)&&(i13.i0.u63.p186==1))) + ((i1.u10.p34==1)&&(i1.u91.p259==1))) * ((i3.u18....208
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(FALSE))) + (!(EG(!((((E(TRUE U (i14.u71.p204==1)) + ((i7.u6.p21==1)&&(i13.i0.u63.p186==1)))...271
Reverse transition relation is NOT exact ! Due to transitions t87, t121, i0.u8.t45, i1.u10.t41, i2.u11.t39, i2.u12.t37, i3.u17.t27, i3.u18.t25, i4.u23.t15,...505
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 286 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 282 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 282 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 281 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 280 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 280 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 279 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 279 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 278 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 278 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 277 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 277 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 276 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 276 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 275 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 275 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 274 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 274 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 273 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 273 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 272 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 272 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 271 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 271 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 270 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 270 transition count 221
Applied a total of 38 rules in 64 ms. Remains 270 /289 variables (removed 19) and now considering 221/240 (removed 19) transitions.
// Phase 1: matrix 221 rows 270 cols
[2023-03-11 06:10:25] [INFO ] Computed 63 place invariants in 2 ms
[2023-03-11 06:10:25] [INFO ] Implicit Places using invariants in 185 ms returned [7, 14, 21, 28, 35, 42, 49, 56, 63, 70, 77, 84, 89, 92, 95, 100, 103, 106, 109, 213, 219, 225, 235, 245, 269]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 187 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/289 places, 221/240 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 240 transition count 216
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 240 transition count 216
Applied a total of 10 rules in 18 ms. Remains 240 /245 variables (removed 5) and now considering 216/221 (removed 5) transitions.
// Phase 1: matrix 216 rows 240 cols
[2023-03-11 06:10:25] [INFO ] Computed 38 place invariants in 2 ms
[2023-03-11 06:10:25] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-11 06:10:25] [INFO ] Invariant cache hit.
[2023-03-11 06:10:25] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 240/289 places, 216/240 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 701 ms. Remains : 240/289 places, 216/240 transitions.
[2023-03-11 06:10:25] [INFO ] Flatten gal took : 6 ms
[2023-03-11 06:10:25] [INFO ] Flatten gal took : 7 ms
[2023-03-11 06:10:25] [INFO ] Input system was already deterministic with 216 transitions.
[2023-03-11 06:10:25] [INFO ] Flatten gal took : 15 ms
[2023-03-11 06:10:25] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:10:25] [INFO ] Time to serialize gal into /tmp/CTLFireability3939137353030722407.gal : 14 ms
[2023-03-11 06:10:25] [INFO ] Time to serialize properties into /tmp/CTLFireability18328265255978247169.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3939137353030722407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18328265255978247169.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.66337e+16,15.6212,417588,2,31637,5,1.10407e+06,6,0,1178,2.73289e+06,0
Converting to forward existential form...Done !
original formula: EF((((p40==0) * ((EG(((p286==1)&&(p305==1))) + EX((p79==1))) + ((p103==0)||(p272==0)))) * (EX((((p47==1)&&(p118==1))&&(p302==1))) + !(A((...208
=> equivalent forward existential formula: ([(EY((FwdU(Init,TRUE) * ((p40==0) * ((EG(((p286==1)&&(p305==1))) + EX((p79==1))) + ((p103==0)||(p272==0)))))) *...568
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.
[2023-03-11 06:10:55] [INFO ] Flatten gal took : 6 ms
[2023-03-11 06:10:55] [INFO ] Applying decomposition
[2023-03-11 06:10:55] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8029908033086435502.txt' '-o' '/tmp/graph8029908033086435502.bin' '-w' '/tmp/graph8029908033086435502.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8029908033086435502.bin' '-l' '-1' '-v' '-w' '/tmp/graph8029908033086435502.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:10:55] [INFO ] Decomposing Gal with order
[2023-03-11 06:10:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:10:55] [INFO ] Removed a total of 23 redundant transitions.
[2023-03-11 06:10:55] [INFO ] Flatten gal took : 15 ms
[2023-03-11 06:10:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-11 06:10:55] [INFO ] Time to serialize gal into /tmp/CTLFireability1986849584259814818.gal : 3 ms
[2023-03-11 06:10:55] [INFO ] Time to serialize properties into /tmp/CTLFireability1631863277858423798.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1986849584259814818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1631863277858423798.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.66337e+16,0.090074,7120,402,14,7002,182,405,9712,22,317,0
Converting to forward existential form...Done !
original formula: EF((((i17.u11.p40==0) * ((EG(((i18.u93.p286==1)&&(i14.u63.p305==1))) + EX((i20.u22.p79==1))) + ((i4.u30.p103==0)||(i14.u90.p272==0)))) * ...314
=> equivalent forward existential formula: ([(EY((FwdU(Init,TRUE) * ((i17.u11.p40==0) * ((EG(((i18.u93.p286==1)&&(i14.u63.p305==1))) + EX((i20.u22.p79==1))...798
Reverse transition relation is NOT exact ! Due to transitions i0.u1.t57, i1.u5.t49, i1.u3.t53, i2.u6.t47, i2.u8.t43, i2.u10.t39, i3.u9.t41, i4.u13.t33, 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
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
(forward)formula 0,1,0.295115,18736,1,0,38546,182,2603,42989,98,317,73956
FORMULA AutoFlight-PT-12a-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 287 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 287 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 286 transition count 237
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Applied a total of 12 rules in 17 ms. Remains 283 /289 variables (removed 6) and now considering 234/240 (removed 6) transitions.
// Phase 1: matrix 234 rows 283 cols
[2023-03-11 06:10:56] [INFO ] Computed 63 place invariants in 1 ms
[2023-03-11 06:10:56] [INFO ] Implicit Places using invariants in 378 ms returned [7, 14, 21, 28, 35, 49, 56, 63, 70, 77, 84, 89, 92, 95, 100, 103, 106, 109, 225, 231, 237, 248, 258, 268]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 380 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 259/289 places, 234/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 253 transition count 228
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 253 transition count 228
Applied a total of 12 rules in 7 ms. Remains 253 /259 variables (removed 6) and now considering 228/234 (removed 6) transitions.
// Phase 1: matrix 228 rows 253 cols
[2023-03-11 06:10:56] [INFO ] Computed 39 place invariants in 9 ms
[2023-03-11 06:10:56] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-11 06:10:56] [INFO ] Invariant cache hit.
[2023-03-11 06:10:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 06:10:57] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 253/289 places, 228/240 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 894 ms. Remains : 253/289 places, 228/240 transitions.
[2023-03-11 06:10:57] [INFO ] Flatten gal took : 13 ms
[2023-03-11 06:10:57] [INFO ] Flatten gal took : 12 ms
[2023-03-11 06:10:57] [INFO ] Input system was already deterministic with 228 transitions.
[2023-03-11 06:10:57] [INFO ] Flatten gal took : 6 ms
[2023-03-11 06:10:57] [INFO ] Flatten gal took : 7 ms
[2023-03-11 06:10:57] [INFO ] Time to serialize gal into /tmp/CTLFireability11297259129296549738.gal : 2 ms
[2023-03-11 06:10:57] [INFO ] Time to serialize properties into /tmp/CTLFireability7512165836960375751.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11297259129296549738.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7512165836960375751.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2023-03-11 06:11:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 06:11:27] [INFO ] Applying decomposition
[2023-03-11 06:11:27] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18390560243469695011.txt' '-o' '/tmp/graph18390560243469695011.bin' '-w' '/tmp/graph18390560243469695011.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18390560243469695011.bin' '-l' '-1' '-v' '-w' '/tmp/graph18390560243469695011.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:11:27] [INFO ] Decomposing Gal with order
[2023-03-11 06:11:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:11:27] [INFO ] Removed a total of 23 redundant transitions.
[2023-03-11 06:11:27] [INFO ] Flatten gal took : 11 ms
[2023-03-11 06:11:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2023-03-11 06:11:27] [INFO ] Time to serialize gal into /tmp/CTLFireability9642035894994270886.gal : 3 ms
[2023-03-11 06:11:27] [INFO ] Time to serialize properties into /tmp/CTLFireability17926386587262474597.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9642035894994270886.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17926386587262474597.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.66345e+16,0.390603,22308,348,24,43574,299,434,58627,40,532,0
Converting to forward existential form...Done !
original formula: (E(((((i3.u17.p58==1) * AX((((i20.u102.p251==1)&&(i20.u102.p306==1))||(i3.u15.p51==1)))) + (i16.u7.p26==1)) * !(((i8.u0.p3==1)&&(i0.u78.p...321
=> equivalent forward existential formula: [FwdG((Init * !(E(((((i3.u17.p58==1) * !(EX(!((((i20.u102.p251==1)&&(i20.u102.p306==1))||(i3.u15.p51==1)))))) + ...381
Reverse transition relation is NOT exact ! Due to transitions t90, t121, i0.u1.t57, i1.u3.t53, i2.u12.t37, i3.u13.t35, i3.u15.t31, i3.u17.t27, i4.i0.u20.t2...485
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 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,1,2.68086,102036,1,0,207325,359,2999,298544,202,729,307459
FORMULA AutoFlight-PT-12a-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 286 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 282 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 282 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 281 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 280 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 280 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 279 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 279 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 278 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 278 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 277 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 277 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 276 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 276 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 275 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 275 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 274 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 274 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 273 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 273 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 272 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 272 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 271 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 271 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 270 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 270 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 269 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 269 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 268 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 268 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 267 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 267 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 266 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 266 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 265 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 265 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 264 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 264 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 263 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 263 transition count 214
Applied a total of 52 rules in 86 ms. Remains 263 /289 variables (removed 26) and now considering 214/240 (removed 26) transitions.
// Phase 1: matrix 214 rows 263 cols
[2023-03-11 06:11:30] [INFO ] Computed 63 place invariants in 1 ms
[2023-03-11 06:11:30] [INFO ] Implicit Places using invariants in 279 ms returned [7, 14, 21, 28, 35, 42, 49, 56, 63, 70, 84, 89, 92, 100, 103, 106, 109, 206, 212, 218, 228, 238, 248, 262]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 280 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 239/289 places, 214/240 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 232 transition count 207
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 232 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 231 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 231 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 230 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 230 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 229 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 229 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 228 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 228 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 227 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 227 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 226 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 226 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 225 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 225 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 224 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 224 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 223 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 223 transition count 198
Applied a total of 32 rules in 26 ms. Remains 223 /239 variables (removed 16) and now considering 198/214 (removed 16) transitions.
// Phase 1: matrix 198 rows 223 cols
[2023-03-11 06:11:30] [INFO ] Computed 39 place invariants in 28 ms
[2023-03-11 06:11:30] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-11 06:11:30] [INFO ] Invariant cache hit.
[2023-03-11 06:11:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 06:11:30] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 223/289 places, 198/240 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 779 ms. Remains : 223/289 places, 198/240 transitions.
[2023-03-11 06:11:30] [INFO ] Flatten gal took : 15 ms
[2023-03-11 06:11:30] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:11:30] [INFO ] Input system was already deterministic with 198 transitions.
[2023-03-11 06:11:30] [INFO ] Flatten gal took : 6 ms
[2023-03-11 06:11:31] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:11:31] [INFO ] Time to serialize gal into /tmp/CTLFireability15991690891547174979.gal : 1 ms
[2023-03-11 06:11:31] [INFO ] Time to serialize properties into /tmp/CTLFireability5444763756692127348.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15991690891547174979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5444763756692127348.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.54757e+16,16.8098,370624,2,43367,5,1.02086e+06,6,0,1088,2.39392e+06,0
Converting to forward existential form...Done !
original formula: AG(AX((!(A(E(((p77==1)&&(p218==1)) U (p17==1)) U AX((p54==1)))) + ((p96==1)&&(p255==1)))))
=> equivalent forward existential formula: [(((EY(FwdU(Init,TRUE)) * !(((p96==1)&&(p255==1)))) * !(EG(!(!(EX(!((p54==1)))))))) * !(E(!(!(EX(!((p54==1))))) ...233
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.
[2023-03-11 06:12:01] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:12:01] [INFO ] Applying decomposition
[2023-03-11 06:12:01] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10847587575999279933.txt' '-o' '/tmp/graph10847587575999279933.bin' '-w' '/tmp/graph10847587575999279933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10847587575999279933.bin' '-l' '-1' '-v' '-w' '/tmp/graph10847587575999279933.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:12:01] [INFO ] Decomposing Gal with order
[2023-03-11 06:12:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:12:01] [INFO ] Removed a total of 24 redundant transitions.
[2023-03-11 06:12:01] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:12:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-11 06:12:01] [INFO ] Time to serialize gal into /tmp/CTLFireability7447515374193151946.gal : 3 ms
[2023-03-11 06:12:01] [INFO ] Time to serialize properties into /tmp/CTLFireability11901638928038912889.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7447515374193151946.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11901638928038912889.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 286 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Applied a total of 12 rules in 22 ms. Remains 283 /289 variables (removed 6) and now considering 234/240 (removed 6) transitions.
// Phase 1: matrix 234 rows 283 cols
[2023-03-11 06:12:31] [INFO ] Computed 63 place invariants in 1 ms
[2023-03-11 06:12:31] [INFO ] Implicit Places using invariants in 212 ms returned [7, 14, 21, 28, 49, 56, 63, 70, 77, 89, 92, 95, 100, 103, 106, 109, 226, 232, 238, 248, 258, 268, 282]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 214 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 260/289 places, 234/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 254 transition count 228
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 254 transition count 228
Applied a total of 12 rules in 4 ms. Remains 254 /260 variables (removed 6) and now considering 228/234 (removed 6) transitions.
// Phase 1: matrix 228 rows 254 cols
[2023-03-11 06:12:31] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-11 06:12:31] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-11 06:12:31] [INFO ] Invariant cache hit.
[2023-03-11 06:12:31] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-11 06:12:31] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 254/289 places, 228/240 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 600 ms. Remains : 254/289 places, 228/240 transitions.
[2023-03-11 06:12:31] [INFO ] Flatten gal took : 6 ms
[2023-03-11 06:12:31] [INFO ] Flatten gal took : 6 ms
[2023-03-11 06:12:31] [INFO ] Input system was already deterministic with 228 transitions.
[2023-03-11 06:12:31] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:12:31] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:12:31] [INFO ] Time to serialize gal into /tmp/CTLFireability15139134437494915462.gal : 2 ms
[2023-03-11 06:12:31] [INFO ] Time to serialize properties into /tmp/CTLFireability13655472701797123180.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15139134437494915462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13655472701797123180.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
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.54777e+16,15.1584,364400,2,41255,5,1.03424e+06,6,0,1240,2.35911e+06,0
Converting to forward existential form...Done !
original formula: EF((EX(E(((p8==1)&&(p171==1)) U (p92==1))) * E((((!((p42==1)&&(p213==1)))&&(p84==1))&&(p195==1)) U EX(((p35==1)&&(p126==1))))))
=> equivalent forward existential formula: [(EY(FwdU((FwdU(Init,TRUE) * EX(E(((p8==1)&&(p171==1)) U (p92==1)))),(((!((p42==1)&&(p213==1)))&&(p84==1))&&(p19...198
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
Hit Full ! (commute/partial/dont) 217/15/11
(forward)formula 0,1,26.9886,419760,1,0,396,2.17939e+06,484,221,7455,2.35911e+06,472
FORMULA AutoFlight-PT-12a-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 286 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 282 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 282 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 281 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 280 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 280 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 279 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 279 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 278 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 278 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 277 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 277 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 276 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 276 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 275 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 275 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 274 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 274 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 273 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 273 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 272 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 272 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 271 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 271 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 270 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 270 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 269 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 269 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 268 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 268 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 267 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 267 transition count 218
Applied a total of 44 rules in 128 ms. Remains 267 /289 variables (removed 22) and now considering 218/240 (removed 22) transitions.
// Phase 1: matrix 218 rows 267 cols
[2023-03-11 06:12:59] [INFO ] Computed 63 place invariants in 3 ms
[2023-03-11 06:12:59] [INFO ] Implicit Places using invariants in 280 ms returned [7, 14, 21, 28, 35, 42, 49, 56, 63, 70, 77, 84, 89, 92, 95, 100, 103, 106, 109, 210, 216, 222, 232, 242, 252]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 281 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/289 places, 218/240 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 237 transition count 213
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 237 transition count 213
Applied a total of 10 rules in 6 ms. Remains 237 /242 variables (removed 5) and now considering 213/218 (removed 5) transitions.
// Phase 1: matrix 213 rows 237 cols
[2023-03-11 06:12:59] [INFO ] Computed 38 place invariants in 1 ms
[2023-03-11 06:12:59] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-11 06:12:59] [INFO ] Invariant cache hit.
[2023-03-11 06:12:59] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 237/289 places, 213/240 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 801 ms. Remains : 237/289 places, 213/240 transitions.
[2023-03-11 06:12:59] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:12:59] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:12:59] [INFO ] Input system was already deterministic with 213 transitions.
[2023-03-11 06:12:59] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:12:59] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:12:59] [INFO ] Time to serialize gal into /tmp/CTLFireability11202048283514869443.gal : 2 ms
[2023-03-11 06:12:59] [INFO ] Time to serialize properties into /tmp/CTLFireability1109817733650088214.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11202048283514869443.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1109817733650088214.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2023-03-11 06:13:29] [INFO ] Flatten gal took : 16 ms
[2023-03-11 06:13:29] [INFO ] Applying decomposition
[2023-03-11 06:13:30] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2727047505497168850.txt' '-o' '/tmp/graph2727047505497168850.bin' '-w' '/tmp/graph2727047505497168850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2727047505497168850.bin' '-l' '-1' '-v' '-w' '/tmp/graph2727047505497168850.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:13:30] [INFO ] Decomposing Gal with order
[2023-03-11 06:13:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:13:30] [INFO ] Removed a total of 21 redundant transitions.
[2023-03-11 06:13:30] [INFO ] Flatten gal took : 22 ms
[2023-03-11 06:13:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-11 06:13:30] [INFO ] Time to serialize gal into /tmp/CTLFireability12559254622153419381.gal : 4 ms
[2023-03-11 06:13:30] [INFO ] Time to serialize properties into /tmp/CTLFireability5609670247610962626.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12559254622153419381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5609670247610962626.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.66335e+16,1.85176,69480,363,21,143916,329,422,224757,39,843,0
Converting to forward existential form...Done !
original formula: AX(AF(((i14.i0.u63.p204==1) * EF(((u98.p245!=1)||(u98.p306!=1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((i14.i0.u63.p204==1) * E(TRUE U ((u98.p245!=1)||(u98.p306!=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t193, i0.u1.t57, i1.u7.t45, i2.u10.t41, i3.i0.u12.t37, i3.i1.u14.t33, i4.i0.u13.t35, i4.i0.u1...528
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 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 LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 286 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 282 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 282 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 281 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 280 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 280 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 279 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 279 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 278 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 278 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 277 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 277 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 276 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 276 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 275 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 275 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 274 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 274 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 273 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 273 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 272 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 272 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 271 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 271 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 270 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 270 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 269 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 269 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 268 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 268 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 267 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 267 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 266 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 266 transition count 217
Applied a total of 46 rules in 74 ms. Remains 266 /289 variables (removed 23) and now considering 217/240 (removed 23) transitions.
// Phase 1: matrix 217 rows 266 cols
[2023-03-11 06:14:00] [INFO ] Computed 63 place invariants in 8 ms
[2023-03-11 06:14:00] [INFO ] Implicit Places using invariants in 351 ms returned [7, 14, 21, 28, 35, 42, 49, 63, 70, 77, 84, 89, 92, 95, 100, 103, 106, 109, 209, 215, 231, 241, 251, 265]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 352 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/289 places, 217/240 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 237 transition count 212
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 237 transition count 212
Applied a total of 10 rules in 5 ms. Remains 237 /242 variables (removed 5) and now considering 212/217 (removed 5) transitions.
// Phase 1: matrix 212 rows 237 cols
[2023-03-11 06:14:00] [INFO ] Computed 39 place invariants in 3 ms
[2023-03-11 06:14:00] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-11 06:14:00] [INFO ] Invariant cache hit.
[2023-03-11 06:14:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 06:14:00] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 237/289 places, 212/240 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 726 ms. Remains : 237/289 places, 212/240 transitions.
[2023-03-11 06:14:00] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:14:00] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:14:00] [INFO ] Input system was already deterministic with 212 transitions.
[2023-03-11 06:14:00] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:14:00] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:14:00] [INFO ] Time to serialize gal into /tmp/CTLFireability3516307853696106817.gal : 1 ms
[2023-03-11 06:14:00] [INFO ] Time to serialize properties into /tmp/CTLFireability5218525234086733284.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3516307853696106817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5218525234086733284.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.66334e+16,17.8235,487708,2,105563,5,1.44839e+06,6,0,1160,2.89757e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2023-03-11 06:14:31] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:14:31] [INFO ] Applying decomposition
[2023-03-11 06:14:31] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10453913609911067563.txt' '-o' '/tmp/graph10453913609911067563.bin' '-w' '/tmp/graph10453913609911067563.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10453913609911067563.bin' '-l' '-1' '-v' '-w' '/tmp/graph10453913609911067563.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:14:31] [INFO ] Decomposing Gal with order
[2023-03-11 06:14:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:14:31] [INFO ] Removed a total of 25 redundant transitions.
[2023-03-11 06:14:31] [INFO ] Flatten gal took : 65 ms
[2023-03-11 06:14:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2023-03-11 06:14:31] [INFO ] Time to serialize gal into /tmp/CTLFireability5559622948539754786.gal : 7 ms
[2023-03-11 06:14:31] [INFO ] Time to serialize properties into /tmp/CTLFireability18065083499733614637.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5559622948539754786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18065083499733614637.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.66334e+16,0.747495,29120,353,20,56004,227,467,72768,36,497,0
Converting to forward existential form...Done !
original formula: E(!(AX(((i8.i2.u53.p56==1)&&(i9.i0.u54.p165==1)))) U EG(!((!(EF(((i17.u78.p250==1)&&(i13.u61.p305==1)))) * EX((i14.i0.u62.p205==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(!(EX(!(((i8.i2.u53.p56==1)&&(i9.i0.u54.p165==1))))))),!((!(E(TRUE U ((i17.u78.p250==1)&&(i13.u...209
Reverse transition relation is NOT exact ! Due to transitions t178, t193, i0.u7.t45, i1.u9.t41, i2.u17.t25, i3.u18.t23, i3.u19.t21, i4.u21.t17, i5.u36.t85,...510
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 287 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 287 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 286 transition count 237
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 286 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 285 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 285 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 284 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 284 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 283 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 283 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 282 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 282 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 281 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 280 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 280 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 279 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 279 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 278 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 278 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 277 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 277 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 276 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 276 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 275 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 275 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 274 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 274 transition count 225
Applied a total of 30 rules in 99 ms. Remains 274 /289 variables (removed 15) and now considering 225/240 (removed 15) transitions.
// Phase 1: matrix 225 rows 274 cols
[2023-03-11 06:15:01] [INFO ] Computed 63 place invariants in 2 ms
[2023-03-11 06:15:01] [INFO ] Implicit Places using invariants in 287 ms returned [7, 14, 21, 28, 35, 42, 49, 56, 70, 77, 84, 89, 92, 95, 100, 103, 106, 109, 222, 228, 238, 248, 258]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 288 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 251/289 places, 225/240 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 247 transition count 221
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 247 transition count 221
Applied a total of 8 rules in 5 ms. Remains 247 /251 variables (removed 4) and now considering 221/225 (removed 4) transitions.
// Phase 1: matrix 221 rows 247 cols
[2023-03-11 06:15:01] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-11 06:15:01] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-11 06:15:01] [INFO ] Invariant cache hit.
[2023-03-11 06:15:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 06:15:02] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 247/289 places, 221/240 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 795 ms. Remains : 247/289 places, 221/240 transitions.
[2023-03-11 06:15:02] [INFO ] Flatten gal took : 11 ms
[2023-03-11 06:15:02] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:15:02] [INFO ] Input system was already deterministic with 221 transitions.
[2023-03-11 06:15:02] [INFO ] Flatten gal took : 13 ms
[2023-03-11 06:15:02] [INFO ] Flatten gal took : 14 ms
[2023-03-11 06:15:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9999075572572970957.gal : 3 ms
[2023-03-11 06:15:02] [INFO ] Time to serialize properties into /tmp/CTLFireability13138172269737731933.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9999075572572970957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13138172269737731933.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2023-03-11 06:15:32] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:15:32] [INFO ] Applying decomposition
[2023-03-11 06:15:32] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16887655947479188601.txt' '-o' '/tmp/graph16887655947479188601.bin' '-w' '/tmp/graph16887655947479188601.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16887655947479188601.bin' '-l' '-1' '-v' '-w' '/tmp/graph16887655947479188601.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:15:32] [INFO ] Decomposing Gal with order
[2023-03-11 06:15:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:15:32] [INFO ] Removed a total of 20 redundant transitions.
[2023-03-11 06:15:32] [INFO ] Flatten gal took : 19 ms
[2023-03-11 06:15:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2023-03-11 06:15:32] [INFO ] Time to serialize gal into /tmp/CTLFireability17714084081982708322.gal : 3 ms
[2023-03-11 06:15:32] [INFO ] Time to serialize properties into /tmp/CTLFireability4900663354041799965.ctl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17714084081982708322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4900663354041799965.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.89475e+16,0.156019,11212,324,36,15896,301,425,22638,53,702,0
Converting to forward existential form...Done !
original formula: ((AF(!(E(AF(((i4.u102.p281==1)&&(i4.u102.p306==1))) U !(((i4.u102.p238==1)&&(i4.u102.p305==1)))))) + EX(AF((((i9.i1.u43.p136==0)||(i19.u1...348
=> equivalent forward existential formula: (([(FwdU(EY((Init * !((!(EG(!(!(E(!(EG(!(((i4.u102.p281==1)&&(i4.u102.p306==1))))) U !(((i4.u102.p238==1)&&(i4.u...958
Reverse transition relation is NOT exact ! Due to transitions i0.u3.t53, i1.u5.t49, i2.u7.t45, i3.u17.t25, i5.u20.t21, i6.u21.t19, i6.u23.t15, i7.u22.t17, ...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
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 289/289 places, 240/240 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 289 transition count 212
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 58 place count 261 transition count 210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 259 transition count 210
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 60 place count 259 transition count 192
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 96 place count 241 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 240 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 240 transition count 191
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 136 place count 221 transition count 172
Applied a total of 136 rules in 23 ms. Remains 221 /289 variables (removed 68) and now considering 172/240 (removed 68) transitions.
// Phase 1: matrix 172 rows 221 cols
[2023-03-11 06:16:02] [INFO ] Computed 63 place invariants in 1 ms
[2023-03-11 06:16:02] [INFO ] Implicit Places using invariants in 322 ms returned [11, 16, 22, 27, 32, 43, 49, 60, 65, 66, 67, 68, 69, 70, 71, 72, 73, 77, 78, 79, 80, 81, 82, 83, 84, 85, 167, 179, 198, 208]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 336 ms to find 30 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 191/289 places, 172/240 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 191 transition count 147
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 166 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 165 transition count 146
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 52 place count 165 transition count 124
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 96 place count 143 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 100 place count 139 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 139 transition count 120
Applied a total of 104 rules in 6 ms. Remains 139 /191 variables (removed 52) and now considering 120/172 (removed 52) transitions.
// Phase 1: matrix 120 rows 139 cols
[2023-03-11 06:16:02] [INFO ] Computed 33 place invariants in 1 ms
[2023-03-11 06:16:02] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-11 06:16:02] [INFO ] Invariant cache hit.
[2023-03-11 06:16:03] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-11 06:16:03] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 139/289 places, 120/240 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 740 ms. Remains : 139/289 places, 120/240 transitions.
[2023-03-11 06:16:03] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:16:03] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:16:03] [INFO ] Input system was already deterministic with 120 transitions.
[2023-03-11 06:16:03] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:16:03] [INFO ] Flatten gal took : 18 ms
[2023-03-11 06:16:03] [INFO ] Time to serialize gal into /tmp/CTLFireability6033744518396734794.gal : 2 ms
[2023-03-11 06:16:03] [INFO ] Time to serialize properties into /tmp/CTLFireability2506642667147934936.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6033744518396734794.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2506642667147934936.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44892e+10,10.8788,226116,2,88363,5,641161,6,0,670,1.08356e+06,0
Converting to forward existential form...Done !
original formula: E(AF((((E(((p27==1)&&(p253==1)) U (p200==1)) + AG(((p49==1)&&(p164==1)))) + (((p70==1)&&(p131==1))||(((p60==1)&&(p228==1))&&((p262==1)&&(...450
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(EG(!((((E(((p27==1)&&(p253==1)) U (p200==1)) + !(E(TRUE U !(((p49==1)&&(p164==1)))))) + (((p70...644
Reverse transition relation is NOT exact ! Due to transitions t4, t10, t14, t21, t28, t32, t104, Intersection with reachable at each step enabled. (destro...196
Detected timeout of ITS tools.
[2023-03-11 06:16:33] [INFO ] Flatten gal took : 10 ms
[2023-03-11 06:16:33] [INFO ] Applying decomposition
[2023-03-11 06:16:33] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8756637390373726107.txt' '-o' '/tmp/graph8756637390373726107.bin' '-w' '/tmp/graph8756637390373726107.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8756637390373726107.bin' '-l' '-1' '-v' '-w' '/tmp/graph8756637390373726107.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:16:33] [INFO ] Decomposing Gal with order
[2023-03-11 06:16:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:16:33] [INFO ] Removed a total of 21 redundant transitions.
[2023-03-11 06:16:33] [INFO ] Flatten gal took : 17 ms
[2023-03-11 06:16:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2023-03-11 06:16:33] [INFO ] Time to serialize gal into /tmp/CTLFireability1449320599821119034.gal : 3 ms
[2023-03-11 06:16:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7501018427575510616.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1449320599821119034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7501018427575510616.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44892e+10,0.076095,5172,214,34,2858,379,427,4428,55,790,0
Converting to forward existential form...Done !
original formula: E(AF((((E(((i7.u7.p27==1)&&(i7.u46.p253==1)) U (i6.u35.p200==1)) + AG(((i5.u37.p49==1)&&(i5.u28.p164==1)))) + (((i5.u38.p70==1)&&(i5.u27....696
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(EG(!((((E(((i7.u7.p27==1)&&(i7.u46.p253==1)) U (i6.u35.p200==1)) + !(E(TRUE U !(((i5.u37.p49==...936
Reverse transition relation is NOT exact ! Due to transitions t104, i0.i1.u1.t28, i2.i0.u16.t10, i3.u13.t14, i7.u7.t21, i11.i0.u21.t4, Intersection with r...234
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,8.57033,226140,1,0,426112,1476,2564,716686,289,4619,502002
FORMULA AutoFlight-PT-12a-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2023-03-11 06:16:41] [INFO ] Flatten gal took : 6 ms
[2023-03-11 06:16:41] [INFO ] Flatten gal took : 6 ms
[2023-03-11 06:16:41] [INFO ] Applying decomposition
[2023-03-11 06:16:42] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18011179512522794654.txt' '-o' '/tmp/graph18011179512522794654.bin' '-w' '/tmp/graph18011179512522794654.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18011179512522794654.bin' '-l' '-1' '-v' '-w' '/tmp/graph18011179512522794654.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:16:42] [INFO ] Decomposing Gal with order
[2023-03-11 06:16:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:16:42] [INFO ] Removed a total of 32 redundant transitions.
[2023-03-11 06:16:42] [INFO ] Flatten gal took : 26 ms
[2023-03-11 06:16:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-11 06:16:42] [INFO ] Time to serialize gal into /tmp/CTLFireability636365114737570611.gal : 4 ms
[2023-03-11 06:16:42] [INFO ] Time to serialize properties into /tmp/CTLFireability4102083451525779447.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability636365114737570611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4102083451525779447.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.47327e+16,0.176788,12096,480,144,13189,5651,666,21483,109,24019,0
Converting to forward existential form...Done !
original formula: A(EX(!(EG((i10.i2.u54.p141==1)))) U ((AX(((EX((i3.i0.u21.p61==1)) * !(AG(((i9.i0.u73.p35==1)&&(i12.i0.u14.p188==1))))) * ((EG(((i0.u3.p8=...329
=> equivalent forward existential formula: [((Init * !(EG(!(((!(EX(!(((EX((i3.i0.u21.p61==1)) * !(!(E(TRUE U !(((i9.i0.u73.p35==1)&&(i12.i0.u14.p188==1))))...1062
Reverse transition relation is NOT exact ! Due to transitions i0.u3.t55, i0.u6.t51, i1.i0.u9.t45, i1.i1.u11.t41, i2.u18.t29, i3.i0.u21.t25, i4.i0.u25.t17, ...524
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 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
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,0,106.893,2062656,1,0,3.14028e+06,5651,4205,4.49828e+06,656,24019,3479481
FORMULA AutoFlight-PT-12a-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AF((AX(FALSE) + (AF((((EF((i15.i1.u80.p204==1)) + ((i9.i1.u44.p21==1)&&(i9.i0.u72.p186==1))) + ((i1.i1.u11.p34==1)&&(i1.i1.u100.p259==1))...231
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(FALSE))) + (!(EG(!((((E(TRUE U (i15.i1.u80.p204==1)) + ((i9.i1.u44.p21==1)&&(i9.i0.u72.p186...294
(forward)formula 1,1,128.337,2197648,1,0,3.3885e+06,5651,1629,4.87106e+06,329,24019,49516
FORMULA AutoFlight-PT-12a-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(AX((!(A(E(((i12.i1.u49.p77==1)&&(i12.i1.u87.p218==1)) U (i0.u6.p17==1)) U AX((i2.u18.p54==1)))) + ((i6.u99.p96==1)&&(i6.u99.p255==1)))...157
=> equivalent forward existential formula: [(((EY(FwdU(Init,TRUE)) * !(((i6.u99.p96==1)&&(i6.u99.p255==1)))) * !(EG(!(!(EX(!((i2.u18.p54==1)))))))) * !(E(!...296
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 2,0,210.559,2197648,1,0,3.3885e+06,5651,2436,4.87106e+06,412,24019,3300252
FORMULA AutoFlight-PT-12a-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AX(AF(((i15.i1.u80.p204==1) * EF(((i17.u113.p245!=1)||(i17.u113.p306!=1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((i15.i1.u80.p204==1) * E(TRUE U ((i17.u113.p245!=1)||(i17.u113.p306!=1))))))] = FALSE
(forward)formula 3,0,242.565,2382708,1,0,3.82016e+06,5693,2561,5.16423e+06,415,24019,3800099
FORMULA AutoFlight-PT-12a-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: E(!(AX(((i12.i0.u19.p56==1)&&(i12.i0.u64.p165==1)))) U EG(!((!(EF(((i17.u113.p250==1)&&(i17.u113.p305==1)))) * EX((i15.i1.u80.p205==1))))...157
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(!(EX(!(((i12.i0.u19.p56==1)&&(i12.i0.u64.p165==1))))))),!((!(E(TRUE U ((i17.u113.p250==1)&&(i1...213
(forward)formula 4,1,244.659,2419404,1,0,3.883e+06,6862,3232,5.24822e+06,446,24019,3920905
FORMULA AutoFlight-PT-12a-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: ((AF(!(E(AF(((i17.u113.p281==1)&&(i17.u113.p306==1))) U !(((i17.u113.p238==1)&&(i17.u113.p305==1)))))) + EX(AF((((i10.i0.u51.p136==0)||(i...357
=> equivalent forward existential formula: (([(FwdU(EY((Init * !((!(EG(!(!(E(!(EG(!(((i17.u113.p281==1)&&(i17.u113.p306==1))))) U !(((i17.u113.p238==1)&&(i...979
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 5,1,267.236,2431812,1,0,3.90968e+06,7062,2362,5.28379e+06,380,24019,572268
FORMULA AutoFlight-PT-12a-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Total runtime 901104 ms.
BK_STOP 1678515669781
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-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-5348"
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 r005-oct2-167813593200466"
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 '
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 ;