About the Execution of ITS-Tools for Anderson-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2849.468 | 1108127.00 | 1202707.00 | 4128.80 | TTTTTFFFTFFTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r004-smll-171620118300330.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Anderson-PT-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118300330
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 15:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 15:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 302K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-00
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-01
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-02
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-03
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-04
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-05
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-06
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-07
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-08
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-09
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-10
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-11
FORMULA_NAME Anderson-PT-06-CTLFireability-2023-12
FORMULA_NAME Anderson-PT-06-CTLFireability-2023-13
FORMULA_NAME Anderson-PT-06-CTLFireability-2023-14
FORMULA_NAME Anderson-PT-06-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716424405658
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-23 00:33:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 00:33:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:33:28] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2024-05-23 00:33:28] [INFO ] Transformed 229 places.
[2024-05-23 00:33:28] [INFO ] Transformed 600 transitions.
[2024-05-23 00:33:28] [INFO ] Found NUPN structural information;
[2024-05-23 00:33:28] [INFO ] Parsed PT model containing 229 places and 600 transitions and 2280 arcs in 653 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 35 ms.
Support contains 93 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 600/600 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 209 transition count 580
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 209 transition count 580
Applied a total of 40 rules in 95 ms. Remains 209 /229 variables (removed 20) and now considering 580/600 (removed 20) transitions.
// Phase 1: matrix 580 rows 209 cols
[2024-05-23 00:33:28] [INFO ] Computed 15 invariants in 55 ms
[2024-05-23 00:33:29] [INFO ] Implicit Places using invariants in 629 ms returned []
[2024-05-23 00:33:29] [INFO ] Invariant cache hit.
[2024-05-23 00:33:29] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:33:30] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1655 ms to find 0 implicit places.
Running 574 sub problems to find dead transitions.
[2024-05-23 00:33:30] [INFO ] Invariant cache hit.
[2024-05-23 00:33:30] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-23 00:33:35] [INFO ] Deduced a trap composed of 88 places in 223 ms of which 28 ms to minimize.
[2024-05-23 00:33:36] [INFO ] Deduced a trap composed of 140 places in 238 ms of which 4 ms to minimize.
[2024-05-23 00:33:36] [INFO ] Deduced a trap composed of 87 places in 268 ms of which 4 ms to minimize.
[2024-05-23 00:33:36] [INFO ] Deduced a trap composed of 123 places in 221 ms of which 3 ms to minimize.
[2024-05-23 00:33:36] [INFO ] Deduced a trap composed of 112 places in 195 ms of which 4 ms to minimize.
[2024-05-23 00:33:37] [INFO ] Deduced a trap composed of 115 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:33:37] [INFO ] Deduced a trap composed of 133 places in 198 ms of which 4 ms to minimize.
[2024-05-23 00:33:37] [INFO ] Deduced a trap composed of 105 places in 150 ms of which 3 ms to minimize.
[2024-05-23 00:33:37] [INFO ] Deduced a trap composed of 114 places in 253 ms of which 4 ms to minimize.
[2024-05-23 00:33:37] [INFO ] Deduced a trap composed of 111 places in 160 ms of which 3 ms to minimize.
[2024-05-23 00:33:38] [INFO ] Deduced a trap composed of 87 places in 223 ms of which 3 ms to minimize.
[2024-05-23 00:33:38] [INFO ] Deduced a trap composed of 148 places in 313 ms of which 4 ms to minimize.
[2024-05-23 00:33:38] [INFO ] Deduced a trap composed of 65 places in 290 ms of which 4 ms to minimize.
[2024-05-23 00:33:39] [INFO ] Deduced a trap composed of 75 places in 264 ms of which 4 ms to minimize.
[2024-05-23 00:33:39] [INFO ] Deduced a trap composed of 90 places in 255 ms of which 4 ms to minimize.
[2024-05-23 00:33:39] [INFO ] Deduced a trap composed of 104 places in 217 ms of which 4 ms to minimize.
[2024-05-23 00:33:39] [INFO ] Deduced a trap composed of 48 places in 212 ms of which 3 ms to minimize.
[2024-05-23 00:33:40] [INFO ] Deduced a trap composed of 132 places in 214 ms of which 3 ms to minimize.
[2024-05-23 00:33:40] [INFO ] Deduced a trap composed of 121 places in 281 ms of which 3 ms to minimize.
[2024-05-23 00:33:40] [INFO ] Deduced a trap composed of 118 places in 291 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-23 00:33:41] [INFO ] Deduced a trap composed of 98 places in 287 ms of which 4 ms to minimize.
[2024-05-23 00:33:41] [INFO ] Deduced a trap composed of 114 places in 157 ms of which 3 ms to minimize.
[2024-05-23 00:33:41] [INFO ] Deduced a trap composed of 107 places in 163 ms of which 3 ms to minimize.
[2024-05-23 00:33:42] [INFO ] Deduced a trap composed of 128 places in 239 ms of which 4 ms to minimize.
[2024-05-23 00:33:42] [INFO ] Deduced a trap composed of 134 places in 250 ms of which 3 ms to minimize.
[2024-05-23 00:33:42] [INFO ] Deduced a trap composed of 131 places in 247 ms of which 4 ms to minimize.
[2024-05-23 00:33:42] [INFO ] Deduced a trap composed of 115 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:33:43] [INFO ] Deduced a trap composed of 84 places in 259 ms of which 4 ms to minimize.
[2024-05-23 00:33:43] [INFO ] Deduced a trap composed of 87 places in 247 ms of which 4 ms to minimize.
[2024-05-23 00:33:43] [INFO ] Deduced a trap composed of 112 places in 242 ms of which 4 ms to minimize.
[2024-05-23 00:33:43] [INFO ] Deduced a trap composed of 99 places in 240 ms of which 4 ms to minimize.
[2024-05-23 00:33:44] [INFO ] Deduced a trap composed of 123 places in 250 ms of which 4 ms to minimize.
[2024-05-23 00:33:44] [INFO ] Deduced a trap composed of 115 places in 241 ms of which 4 ms to minimize.
[2024-05-23 00:33:44] [INFO ] Deduced a trap composed of 86 places in 245 ms of which 4 ms to minimize.
[2024-05-23 00:33:44] [INFO ] Deduced a trap composed of 53 places in 237 ms of which 4 ms to minimize.
[2024-05-23 00:33:45] [INFO ] Deduced a trap composed of 119 places in 164 ms of which 2 ms to minimize.
[2024-05-23 00:33:45] [INFO ] Deduced a trap composed of 91 places in 227 ms of which 2 ms to minimize.
[2024-05-23 00:33:45] [INFO ] Deduced a trap composed of 87 places in 169 ms of which 2 ms to minimize.
[2024-05-23 00:33:45] [INFO ] Deduced a trap composed of 120 places in 240 ms of which 3 ms to minimize.
[2024-05-23 00:33:46] [INFO ] Deduced a trap composed of 119 places in 306 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-23 00:33:50] [INFO ] Deduced a trap composed of 69 places in 241 ms of which 3 ms to minimize.
[2024-05-23 00:33:50] [INFO ] Deduced a trap composed of 51 places in 241 ms of which 3 ms to minimize.
[2024-05-23 00:33:50] [INFO ] Deduced a trap composed of 56 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:33:50] [INFO ] Deduced a trap composed of 131 places in 171 ms of which 2 ms to minimize.
[2024-05-23 00:33:51] [INFO ] Deduced a trap composed of 51 places in 240 ms of which 2 ms to minimize.
[2024-05-23 00:33:51] [INFO ] Deduced a trap composed of 45 places in 314 ms of which 4 ms to minimize.
[2024-05-23 00:33:51] [INFO ] Deduced a trap composed of 41 places in 248 ms of which 3 ms to minimize.
[2024-05-23 00:33:51] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 3 ms to minimize.
[2024-05-23 00:33:52] [INFO ] Deduced a trap composed of 74 places in 285 ms of which 4 ms to minimize.
[2024-05-23 00:33:52] [INFO ] Deduced a trap composed of 99 places in 230 ms of which 2 ms to minimize.
[2024-05-23 00:33:52] [INFO ] Deduced a trap composed of 105 places in 251 ms of which 4 ms to minimize.
[2024-05-23 00:33:53] [INFO ] Deduced a trap composed of 123 places in 355 ms of which 4 ms to minimize.
[2024-05-23 00:33:53] [INFO ] Deduced a trap composed of 116 places in 256 ms of which 4 ms to minimize.
[2024-05-23 00:33:53] [INFO ] Deduced a trap composed of 95 places in 187 ms of which 2 ms to minimize.
[2024-05-23 00:33:53] [INFO ] Deduced a trap composed of 58 places in 247 ms of which 4 ms to minimize.
[2024-05-23 00:33:54] [INFO ] Deduced a trap composed of 127 places in 242 ms of which 4 ms to minimize.
[2024-05-23 00:33:54] [INFO ] Deduced a trap composed of 84 places in 240 ms of which 3 ms to minimize.
[2024-05-23 00:33:54] [INFO ] Deduced a trap composed of 112 places in 166 ms of which 3 ms to minimize.
[2024-05-23 00:33:54] [INFO ] Deduced a trap composed of 99 places in 240 ms of which 4 ms to minimize.
[2024-05-23 00:33:55] [INFO ] Deduced a trap composed of 44 places in 240 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-23 00:33:56] [INFO ] Deduced a trap composed of 101 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:33:56] [INFO ] Deduced a trap composed of 91 places in 229 ms of which 4 ms to minimize.
[2024-05-23 00:33:56] [INFO ] Deduced a trap composed of 83 places in 229 ms of which 4 ms to minimize.
[2024-05-23 00:33:57] [INFO ] Deduced a trap composed of 83 places in 242 ms of which 3 ms to minimize.
[2024-05-23 00:33:57] [INFO ] Deduced a trap composed of 110 places in 307 ms of which 3 ms to minimize.
[2024-05-23 00:33:57] [INFO ] Deduced a trap composed of 87 places in 246 ms of which 4 ms to minimize.
[2024-05-23 00:33:57] [INFO ] Deduced a trap composed of 134 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:33:58] [INFO ] Deduced a trap composed of 93 places in 236 ms of which 4 ms to minimize.
[2024-05-23 00:33:58] [INFO ] Deduced a trap composed of 80 places in 234 ms of which 4 ms to minimize.
[2024-05-23 00:33:58] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 3 ms to minimize.
[2024-05-23 00:33:58] [INFO ] Deduced a trap composed of 97 places in 230 ms of which 4 ms to minimize.
[2024-05-23 00:33:59] [INFO ] Deduced a trap composed of 104 places in 233 ms of which 3 ms to minimize.
[2024-05-23 00:33:59] [INFO ] Deduced a trap composed of 86 places in 227 ms of which 4 ms to minimize.
[2024-05-23 00:33:59] [INFO ] Deduced a trap composed of 108 places in 216 ms of which 3 ms to minimize.
[2024-05-23 00:33:59] [INFO ] Deduced a trap composed of 122 places in 256 ms of which 3 ms to minimize.
[2024-05-23 00:34:00] [INFO ] Deduced a trap composed of 87 places in 257 ms of which 3 ms to minimize.
[2024-05-23 00:34:00] [INFO ] Deduced a trap composed of 96 places in 247 ms of which 5 ms to minimize.
[2024-05-23 00:34:00] [INFO ] Deduced a trap composed of 118 places in 294 ms of which 4 ms to minimize.
[2024-05-23 00:34:01] [INFO ] Deduced a trap composed of 131 places in 289 ms of which 4 ms to minimize.
[2024-05-23 00:34:01] [INFO ] Deduced a trap composed of 96 places in 302 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 209/789 variables, and 95 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/209 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 574 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 80/95 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-23 00:34:05] [INFO ] Deduced a trap composed of 117 places in 279 ms of which 4 ms to minimize.
[2024-05-23 00:34:06] [INFO ] Deduced a trap composed of 145 places in 294 ms of which 3 ms to minimize.
[2024-05-23 00:34:06] [INFO ] Deduced a trap composed of 103 places in 320 ms of which 4 ms to minimize.
[2024-05-23 00:34:06] [INFO ] Deduced a trap composed of 126 places in 230 ms of which 3 ms to minimize.
[2024-05-23 00:34:07] [INFO ] Deduced a trap composed of 70 places in 302 ms of which 3 ms to minimize.
[2024-05-23 00:34:07] [INFO ] Deduced a trap composed of 67 places in 223 ms of which 3 ms to minimize.
[2024-05-23 00:34:07] [INFO ] Deduced a trap composed of 87 places in 292 ms of which 3 ms to minimize.
[2024-05-23 00:34:08] [INFO ] Deduced a trap composed of 76 places in 306 ms of which 4 ms to minimize.
[2024-05-23 00:34:08] [INFO ] Deduced a trap composed of 133 places in 313 ms of which 4 ms to minimize.
[2024-05-23 00:34:08] [INFO ] Deduced a trap composed of 98 places in 324 ms of which 4 ms to minimize.
[2024-05-23 00:34:09] [INFO ] Deduced a trap composed of 83 places in 307 ms of which 4 ms to minimize.
[2024-05-23 00:34:09] [INFO ] Deduced a trap composed of 128 places in 316 ms of which 4 ms to minimize.
[2024-05-23 00:34:09] [INFO ] Deduced a trap composed of 83 places in 244 ms of which 3 ms to minimize.
[2024-05-23 00:34:10] [INFO ] Deduced a trap composed of 68 places in 299 ms of which 4 ms to minimize.
[2024-05-23 00:34:10] [INFO ] Deduced a trap composed of 80 places in 326 ms of which 4 ms to minimize.
[2024-05-23 00:34:10] [INFO ] Deduced a trap composed of 102 places in 319 ms of which 4 ms to minimize.
[2024-05-23 00:34:11] [INFO ] Deduced a trap composed of 118 places in 252 ms of which 4 ms to minimize.
[2024-05-23 00:34:11] [INFO ] Deduced a trap composed of 84 places in 212 ms of which 3 ms to minimize.
[2024-05-23 00:34:11] [INFO ] Deduced a trap composed of 78 places in 236 ms of which 2 ms to minimize.
[2024-05-23 00:34:11] [INFO ] Deduced a trap composed of 110 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-23 00:34:13] [INFO ] Deduced a trap composed of 128 places in 255 ms of which 4 ms to minimize.
[2024-05-23 00:34:14] [INFO ] Deduced a trap composed of 68 places in 315 ms of which 4 ms to minimize.
[2024-05-23 00:34:14] [INFO ] Deduced a trap composed of 74 places in 273 ms of which 3 ms to minimize.
[2024-05-23 00:34:15] [INFO ] Deduced a trap composed of 93 places in 314 ms of which 4 ms to minimize.
[2024-05-23 00:34:15] [INFO ] Deduced a trap composed of 67 places in 316 ms of which 4 ms to minimize.
[2024-05-23 00:34:16] [INFO ] Deduced a trap composed of 130 places in 302 ms of which 4 ms to minimize.
[2024-05-23 00:34:16] [INFO ] Deduced a trap composed of 123 places in 320 ms of which 4 ms to minimize.
[2024-05-23 00:34:16] [INFO ] Deduced a trap composed of 100 places in 241 ms of which 3 ms to minimize.
[2024-05-23 00:34:17] [INFO ] Deduced a trap composed of 123 places in 313 ms of which 4 ms to minimize.
[2024-05-23 00:34:17] [INFO ] Deduced a trap composed of 126 places in 303 ms of which 4 ms to minimize.
[2024-05-23 00:34:17] [INFO ] Deduced a trap composed of 115 places in 328 ms of which 4 ms to minimize.
[2024-05-23 00:34:18] [INFO ] Deduced a trap composed of 41 places in 296 ms of which 3 ms to minimize.
[2024-05-23 00:34:18] [INFO ] Deduced a trap composed of 102 places in 310 ms of which 4 ms to minimize.
[2024-05-23 00:34:18] [INFO ] Deduced a trap composed of 92 places in 284 ms of which 4 ms to minimize.
[2024-05-23 00:34:19] [INFO ] Deduced a trap composed of 101 places in 282 ms of which 4 ms to minimize.
[2024-05-23 00:34:19] [INFO ] Deduced a trap composed of 91 places in 278 ms of which 3 ms to minimize.
[2024-05-23 00:34:20] [INFO ] Deduced a trap composed of 95 places in 278 ms of which 4 ms to minimize.
[2024-05-23 00:34:20] [INFO ] Deduced a trap composed of 96 places in 303 ms of which 4 ms to minimize.
[2024-05-23 00:34:21] [INFO ] Deduced a trap composed of 105 places in 289 ms of which 4 ms to minimize.
[2024-05-23 00:34:21] [INFO ] Deduced a trap composed of 41 places in 278 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-23 00:34:24] [INFO ] Deduced a trap composed of 82 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:34:24] [INFO ] Deduced a trap composed of 140 places in 312 ms of which 4 ms to minimize.
[2024-05-23 00:34:25] [INFO ] Deduced a trap composed of 143 places in 296 ms of which 4 ms to minimize.
[2024-05-23 00:34:25] [INFO ] Deduced a trap composed of 142 places in 292 ms of which 4 ms to minimize.
[2024-05-23 00:34:25] [INFO ] Deduced a trap composed of 136 places in 300 ms of which 4 ms to minimize.
[2024-05-23 00:34:25] [INFO ] Deduced a trap composed of 137 places in 308 ms of which 4 ms to minimize.
[2024-05-23 00:34:26] [INFO ] Deduced a trap composed of 141 places in 298 ms of which 4 ms to minimize.
[2024-05-23 00:34:26] [INFO ] Deduced a trap composed of 64 places in 302 ms of which 4 ms to minimize.
[2024-05-23 00:34:26] [INFO ] Deduced a trap composed of 103 places in 313 ms of which 3 ms to minimize.
[2024-05-23 00:34:27] [INFO ] Deduced a trap composed of 127 places in 310 ms of which 4 ms to minimize.
[2024-05-23 00:34:27] [INFO ] Deduced a trap composed of 123 places in 315 ms of which 4 ms to minimize.
[2024-05-23 00:34:27] [INFO ] Deduced a trap composed of 63 places in 296 ms of which 5 ms to minimize.
[2024-05-23 00:34:28] [INFO ] Deduced a trap composed of 130 places in 297 ms of which 4 ms to minimize.
[2024-05-23 00:34:28] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 2 ms to minimize.
[2024-05-23 00:34:29] [INFO ] Deduced a trap composed of 90 places in 166 ms of which 2 ms to minimize.
[2024-05-23 00:34:29] [INFO ] Deduced a trap composed of 86 places in 197 ms of which 2 ms to minimize.
[2024-05-23 00:34:29] [INFO ] Deduced a trap composed of 68 places in 214 ms of which 2 ms to minimize.
[2024-05-23 00:34:29] [INFO ] Deduced a trap composed of 98 places in 207 ms of which 2 ms to minimize.
[2024-05-23 00:34:30] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 2 ms to minimize.
[2024-05-23 00:34:30] [INFO ] Deduced a trap composed of 54 places in 192 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 209/789 variables, and 155 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/209 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/574 constraints, Known Traps: 140/140 constraints]
After SMT, in 61415ms problems are : Problem set: 0 solved, 574 unsolved
Search for dead transitions found 0 dead transitions in 61454ms
Starting structural reductions in LTL mode, iteration 1 : 209/229 places, 580/600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63264 ms. Remains : 209/229 places, 580/600 transitions.
Support contains 93 out of 209 places after structural reductions.
[2024-05-23 00:34:32] [INFO ] Flatten gal took : 133 ms
[2024-05-23 00:34:32] [INFO ] Flatten gal took : 91 ms
[2024-05-23 00:34:32] [INFO ] Input system was already deterministic with 580 transitions.
RANDOM walk for 40000 steps (8 resets) in 3910 ms. (10 steps per ms) remains 33/97 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 31/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 26/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 20/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 14/14 properties
[2024-05-23 00:34:33] [INFO ] Invariant cache hit.
[2024-05-23 00:34:33] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp79 is UNSAT
At refinement iteration 1 (OVERLAPS) 170/206 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 4 (OVERLAPS) 3/209 variables, 4/15 constraints. Problems are: Problem set: 3 solved, 11 unsolved
[2024-05-23 00:34:34] [INFO ] Deduced a trap composed of 97 places in 276 ms of which 4 ms to minimize.
[2024-05-23 00:34:35] [INFO ] Deduced a trap composed of 86 places in 324 ms of which 4 ms to minimize.
[2024-05-23 00:34:35] [INFO ] Deduced a trap composed of 67 places in 265 ms of which 2 ms to minimize.
[2024-05-23 00:34:35] [INFO ] Deduced a trap composed of 107 places in 207 ms of which 3 ms to minimize.
[2024-05-23 00:34:35] [INFO ] Deduced a trap composed of 79 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:34:36] [INFO ] Deduced a trap composed of 63 places in 194 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 6/21 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 580/789 variables, 209/230 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 30/260 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/789 variables, 0/260 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/789 variables, 0/260 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 789/789 variables, and 260 constraints, problems are : Problem set: 3 solved, 11 unsolved in 2755 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 209/209 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Problem AtomicPropp62 is UNSAT
At refinement iteration 1 (OVERLAPS) 179/205 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 3/10 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/209 variables, 5/15 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 6/21 constraints. Problems are: Problem set: 7 solved, 7 unsolved
[2024-05-23 00:34:37] [INFO ] Deduced a trap composed of 110 places in 267 ms of which 3 ms to minimize.
[2024-05-23 00:34:37] [INFO ] Deduced a trap composed of 68 places in 263 ms of which 3 ms to minimize.
[2024-05-23 00:34:37] [INFO ] Deduced a trap composed of 79 places in 190 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 3/24 constraints. Problems are: Problem set: 7 solved, 7 unsolved
[2024-05-23 00:34:38] [INFO ] Deduced a trap composed of 56 places in 251 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 1/25 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/25 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 580/789 variables, 209/234 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/789 variables, 30/264 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/789 variables, 7/271 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/789 variables, 0/271 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/789 variables, 0/271 constraints. Problems are: Problem set: 7 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 789/789 variables, and 271 constraints, problems are : Problem set: 7 solved, 7 unsolved in 3690 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 209/209 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 7/14 constraints, Known Traps: 10/10 constraints]
After SMT, in 6581ms problems are : Problem set: 7 solved, 7 unsolved
Parikh walk visited 0 properties in 5320 ms.
Support contains 15 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 580/580 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 209 transition count 550
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 179 transition count 550
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 91 place count 148 transition count 309
Iterating global reduction 0 with 31 rules applied. Total rules applied 122 place count 148 transition count 309
Applied a total of 122 rules in 61 ms. Remains 148 /209 variables (removed 61) and now considering 309/580 (removed 271) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 148/209 places, 309/580 transitions.
RANDOM walk for 40000 steps (8 resets) in 324 ms. (123 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 178 ms. (223 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 3/6 properties
// Phase 1: matrix 309 rows 148 cols
[2024-05-23 00:34:46] [INFO ] Computed 15 invariants in 11 ms
[2024-05-23 00:34:46] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 112/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/138 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/148 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 00:34:46] [INFO ] Deduced a trap composed of 48 places in 223 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 309/457 variables, 148/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 30/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/457 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 194 constraints, problems are : Problem set: 0 solved, 3 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 148/148 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 112/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/138 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/148 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 00:34:47] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 309/457 variables, 148/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 30/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/457 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 198 constraints, problems are : Problem set: 0 solved, 3 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 148/148 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 1449ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 10 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 309/309 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 144 transition count 265
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 144 transition count 265
Applied a total of 8 rules in 27 ms. Remains 144 /148 variables (removed 4) and now considering 265/309 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 144/148 places, 265/309 transitions.
RANDOM walk for 40000 steps (8 resets) in 207 ms. (192 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 62 ms. (634 steps per ms) remains 2/3 properties
// Phase 1: matrix 265 rows 144 cols
[2024-05-23 00:34:48] [INFO ] Computed 15 invariants in 4 ms
[2024-05-23 00:34:48] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/135 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/137 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/144 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 00:34:48] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 265/409 variables, 144/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 30/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/409 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 190 constraints, problems are : Problem set: 0 solved, 2 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/135 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/137 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/144 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 265/409 variables, 144/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 30/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/409 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 192 constraints, problems are : Problem set: 0 solved, 2 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 854ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 191 ms.
Support contains 9 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 265/265 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 254
Applied a total of 2 rules in 15 ms. Remains 143 /144 variables (removed 1) and now considering 254/265 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 143/144 places, 254/265 transitions.
RANDOM walk for 40000 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 128793 steps, run visited all 2 properties in 757 ms. (steps per millisecond=170 )
Probabilistic random walk after 128793 steps, saw 61727 distinct states, run finished after 764 ms. (steps per millisecond=168 ) properties seen :2
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA Anderson-PT-06-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 00:34:50] [INFO ] Flatten gal took : 45 ms
[2024-05-23 00:34:50] [INFO ] Flatten gal took : 41 ms
[2024-05-23 00:34:50] [INFO ] Input system was already deterministic with 580 transitions.
Support contains 84 out of 209 places (down from 85) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 172 transition count 263
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 172 transition count 263
Applied a total of 74 rules in 9 ms. Remains 172 /209 variables (removed 37) and now considering 263/580 (removed 317) transitions.
// Phase 1: matrix 263 rows 172 cols
[2024-05-23 00:34:50] [INFO ] Computed 15 invariants in 3 ms
[2024-05-23 00:34:50] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-23 00:34:50] [INFO ] Invariant cache hit.
[2024-05-23 00:34:50] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:34:50] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-23 00:34:50] [INFO ] Invariant cache hit.
[2024-05-23 00:34:50] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:34:52] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:34:53] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 2 ms to minimize.
[2024-05-23 00:34:53] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 3 ms to minimize.
[2024-05-23 00:34:53] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 2 ms to minimize.
[2024-05-23 00:34:54] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-23 00:34:54] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 3 ms to minimize.
[2024-05-23 00:34:54] [INFO ] Deduced a trap composed of 102 places in 155 ms of which 3 ms to minimize.
[2024-05-23 00:34:54] [INFO ] Deduced a trap composed of 79 places in 154 ms of which 3 ms to minimize.
[2024-05-23 00:34:54] [INFO ] Deduced a trap composed of 105 places in 148 ms of which 3 ms to minimize.
[2024-05-23 00:34:54] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:34:54] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:34:55] [INFO ] Deduced a trap composed of 66 places in 155 ms of which 3 ms to minimize.
[2024-05-23 00:34:55] [INFO ] Deduced a trap composed of 83 places in 157 ms of which 3 ms to minimize.
[2024-05-23 00:34:55] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:34:55] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:34:55] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 2 ms to minimize.
[2024-05-23 00:34:56] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-05-23 00:34:56] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 4 ms to minimize.
[2024-05-23 00:34:56] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 3 ms to minimize.
[2024-05-23 00:34:56] [INFO ] Deduced a trap composed of 109 places in 161 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:34:57] [INFO ] Deduced a trap composed of 102 places in 156 ms of which 3 ms to minimize.
[2024-05-23 00:34:57] [INFO ] Deduced a trap composed of 92 places in 156 ms of which 3 ms to minimize.
[2024-05-23 00:34:57] [INFO ] Deduced a trap composed of 99 places in 157 ms of which 3 ms to minimize.
[2024-05-23 00:34:58] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 3 ms to minimize.
[2024-05-23 00:34:58] [INFO ] Deduced a trap composed of 69 places in 159 ms of which 3 ms to minimize.
[2024-05-23 00:34:58] [INFO ] Deduced a trap composed of 71 places in 157 ms of which 3 ms to minimize.
[2024-05-23 00:34:58] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 3 ms to minimize.
[2024-05-23 00:34:58] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 3 ms to minimize.
[2024-05-23 00:34:59] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 3 ms to minimize.
[2024-05-23 00:34:59] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 3 ms to minimize.
[2024-05-23 00:34:59] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:34:59] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:35:02] [INFO ] Deduced a trap composed of 60 places in 218 ms of which 3 ms to minimize.
[2024-05-23 00:35:03] [INFO ] Deduced a trap composed of 71 places in 182 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:35:04] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 3 ms to minimize.
[2024-05-23 00:35:05] [INFO ] Deduced a trap composed of 73 places in 160 ms of which 3 ms to minimize.
[2024-05-23 00:35:05] [INFO ] Deduced a trap composed of 109 places in 215 ms of which 3 ms to minimize.
[2024-05-23 00:35:05] [INFO ] Deduced a trap composed of 74 places in 210 ms of which 3 ms to minimize.
[2024-05-23 00:35:05] [INFO ] Deduced a trap composed of 89 places in 200 ms of which 3 ms to minimize.
[2024-05-23 00:35:06] [INFO ] Deduced a trap composed of 93 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:35:06] [INFO ] Deduced a trap composed of 62 places in 207 ms of which 3 ms to minimize.
[2024-05-23 00:35:06] [INFO ] Deduced a trap composed of 61 places in 217 ms of which 3 ms to minimize.
[2024-05-23 00:35:06] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 3 ms to minimize.
[2024-05-23 00:35:06] [INFO ] Deduced a trap composed of 52 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:35:07] [INFO ] Deduced a trap composed of 69 places in 208 ms of which 3 ms to minimize.
[2024-05-23 00:35:07] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:35:08] [INFO ] Deduced a trap composed of 61 places in 206 ms of which 3 ms to minimize.
[2024-05-23 00:35:08] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:35:10] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 4 ms to minimize.
[2024-05-23 00:35:10] [INFO ] Deduced a trap composed of 100 places in 205 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:35:14] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 2 ms to minimize.
[2024-05-23 00:35:14] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 2 ms to minimize.
[2024-05-23 00:35:14] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:35:14] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:35:14] [INFO ] Deduced a trap composed of 112 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:35:14] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 3 ms to minimize.
[2024-05-23 00:35:14] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-05-23 00:35:15] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:35:15] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 2 ms to minimize.
[2024-05-23 00:35:15] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-05-23 00:35:15] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 11/76 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:35:18] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-05-23 00:35:19] [INFO ] Deduced a trap composed of 104 places in 148 ms of which 3 ms to minimize.
[2024-05-23 00:35:19] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 172/435 variables, and 79 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/172 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 64/79 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:35:22] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:35:22] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 2 ms to minimize.
[2024-05-23 00:35:23] [INFO ] Deduced a trap composed of 85 places in 158 ms of which 2 ms to minimize.
[2024-05-23 00:35:23] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 2 ms to minimize.
[2024-05-23 00:35:24] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:35:26] [INFO ] Deduced a trap composed of 110 places in 153 ms of which 2 ms to minimize.
[2024-05-23 00:35:26] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 3 ms to minimize.
[2024-05-23 00:35:27] [INFO ] Deduced a trap composed of 72 places in 206 ms of which 3 ms to minimize.
[2024-05-23 00:35:27] [INFO ] Deduced a trap composed of 108 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:35:28] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 3 ms to minimize.
[2024-05-23 00:35:28] [INFO ] Deduced a trap composed of 72 places in 152 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:35:32] [INFO ] Deduced a trap composed of 88 places in 165 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:35:35] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-05-23 00:35:36] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 172/435 variables, and 93 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/172 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/257 constraints, Known Traps: 78/78 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Starting structural reductions in LTL mode, iteration 1 : 172/209 places, 263/580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60784 ms. Remains : 172/209 places, 263/580 transitions.
[2024-05-23 00:35:51] [INFO ] Flatten gal took : 17 ms
[2024-05-23 00:35:51] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:35:51] [INFO ] Input system was already deterministic with 263 transitions.
[2024-05-23 00:35:51] [INFO ] Flatten gal took : 14 ms
[2024-05-23 00:35:51] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:35:51] [INFO ] Time to serialize gal into /tmp/CTLFireability333855194348269142.gal : 13 ms
[2024-05-23 00:35:51] [INFO ] Time to serialize properties into /tmp/CTLFireability9165859593031942212.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability333855194348269142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9165859593031942212.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.13102e+06,11.5924,274500,2,50288,5,786124,6,0,954,479087,0
Converting to forward existential form...Done !
original formula: EF((((slot_F.F.F.F.F.T==1)&&(p2_3_5==1)) + (((next_10==1)&&(ncs_4_1==1)) * (AX(((AX(((slot_F.F.F.F.F.F==1)&&(cs_5_2==1))) * (next_10==1))...236
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((slot_F.F.F.F.F.T==1)&&(p2_3_5==1)))] != FALSE + ([((FwdU(Init,TRUE) * ((next_10==1)&&(ncs...458
(forward)formula 0,1,11.6085,274500,1,0,7,786124,8,1,960,479087,1
FORMULA Anderson-PT-06-CTLFireability-2024-00 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 : 209/209 places, 580/580 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 171 transition count 252
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 171 transition count 252
Applied a total of 76 rules in 7 ms. Remains 171 /209 variables (removed 38) and now considering 252/580 (removed 328) transitions.
// Phase 1: matrix 252 rows 171 cols
[2024-05-23 00:36:02] [INFO ] Computed 15 invariants in 4 ms
[2024-05-23 00:36:03] [INFO ] Implicit Places using invariants in 282 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 285 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/209 places, 252/580 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 297 ms. Remains : 170/209 places, 252/580 transitions.
[2024-05-23 00:36:03] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:36:03] [INFO ] Flatten gal took : 16 ms
[2024-05-23 00:36:03] [INFO ] Input system was already deterministic with 252 transitions.
[2024-05-23 00:36:03] [INFO ] Flatten gal took : 17 ms
[2024-05-23 00:36:03] [INFO ] Flatten gal took : 17 ms
[2024-05-23 00:36:03] [INFO ] Time to serialize gal into /tmp/CTLFireability10707570831582889208.gal : 7 ms
[2024-05-23 00:36:03] [INFO ] Time to serialize properties into /tmp/CTLFireability15145825550023219208.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10707570831582889208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15145825550023219208.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.02879e+06,2.59371,61852,2,25063,5,186453,6,0,935,143070,0
Converting to forward existential form...Done !
original formula: EF(AG(E(EX(!(((next_7==1)&&(ncs_1_5==1)))) U ((p1_0_0==1)||((slot_F.F.F.T.F.F==1)&&(p2_1_3==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(EX(!(((next_7==1)&&(ncs_1_5==1)))) U ((p1_0_0==1)||((slot_F.F.F.T.F.F==1)&&(p...181
Reverse transition relation is NOT exact ! Due to transitions t84, t85, t86, t87, t88, t90, t91, t92, t93, t94, t96, t97, t98, t99, t100, t102, t103, t104,...520
Detected timeout of ITS tools.
[2024-05-23 00:36:33] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:36:33] [INFO ] Applying decomposition
[2024-05-23 00:36:33] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph4957422388709088979.txt' '-o' '/tmp/graph4957422388709088979.bin' '-w' '/tmp/graph4957422388709088979.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4957422388709088979.bin' '-l' '-1' '-v' '-w' '/tmp/graph4957422388709088979.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:36:33] [INFO ] Decomposing Gal with order
[2024-05-23 00:36:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:36:33] [INFO ] Removed a total of 383 redundant transitions.
[2024-05-23 00:36:33] [INFO ] Flatten gal took : 112 ms
[2024-05-23 00:36:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-23 00:36:33] [INFO ] Time to serialize gal into /tmp/CTLFireability9144346884920623554.gal : 8 ms
[2024-05-23 00:36:33] [INFO ] Time to serialize properties into /tmp/CTLFireability128145336064950121.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9144346884920623554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability128145336064950121.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
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.02879e+06,0.998706,26064,4582,26,44866,192,732,37399,39,329,0
Converting to forward existential form...Done !
original formula: EF(AG(E(EX(!(((i0.u3.next_7==1)&&(i7.u51.ncs_1_5==1)))) U ((i1.u5.p1_0_0==1)||((i5.i1.u54.slot_F.F.F.T.F.F==1)&&(i7.u10.p2_1_3==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(EX(!(((i0.u3.next_7==1)&&(i7.u51.ncs_1_5==1)))) U ((i1.u5.p1_0_0==1)||((i5.i1...217
Reverse transition relation is NOT exact ! Due to transitions t216, t217, t218, t219, t220, t221, t222, t223, t224, t225, t226, t227, t228, t229, t230, t23...604
(forward)formula 0,1,5.76517,144600,1,0,263987,253,3710,279496,183,943,1395420
FORMULA Anderson-PT-06-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 28 Pre rules applied. Total rules applied 0 place count 209 transition count 552
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 181 transition count 552
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 94 place count 143 transition count 224
Iterating global reduction 0 with 38 rules applied. Total rules applied 132 place count 143 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 134 place count 142 transition count 223
Applied a total of 134 rules in 55 ms. Remains 142 /209 variables (removed 67) and now considering 223/580 (removed 357) transitions.
// Phase 1: matrix 223 rows 142 cols
[2024-05-23 00:36:39] [INFO ] Computed 15 invariants in 3 ms
[2024-05-23 00:36:39] [INFO ] Implicit Places using invariants in 197 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 202 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 141/209 places, 223/580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 141 transition count 212
Reduce places removed 11 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 23 rules applied. Total rules applied 34 place count 130 transition count 200
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 46 place count 118 transition count 200
Applied a total of 46 rules in 15 ms. Remains 118 /141 variables (removed 23) and now considering 200/223 (removed 23) transitions.
// Phase 1: matrix 200 rows 118 cols
[2024-05-23 00:36:40] [INFO ] Computed 14 invariants in 5 ms
[2024-05-23 00:36:40] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-23 00:36:40] [INFO ] Invariant cache hit.
[2024-05-23 00:36:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:36:40] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 118/209 places, 200/580 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 700 ms. Remains : 118/209 places, 200/580 transitions.
[2024-05-23 00:36:40] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:36:40] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:36:40] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-23 00:36:40] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:36:40] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:36:40] [INFO ] Time to serialize gal into /tmp/CTLFireability15290373598751744304.gal : 3 ms
[2024-05-23 00:36:40] [INFO ] Time to serialize properties into /tmp/CTLFireability14452128325083820963.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15290373598751744304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14452128325083820963.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,69017,0.924107,27324,2,13674,5,79420,6,0,675,48454,0
Converting to forward existential form...Done !
original formula: AG(((AG(((!(A(((slot_F.T.F.F.F.F==1)&&(p2_5_1==1)) U (p1_4_9==1))) + (next_2==0)) + (ncs_4_2==0))) + (slot_F.F.F.F.F.T==0)) + (p3_2_5==0)...157
=> equivalent forward existential formula: [((((FwdU(((FwdU(Init,TRUE) * !((p3_2_5==0))) * !((slot_F.F.F.F.F.T==0))),TRUE) * !((ncs_4_2==0))) * !((next_2==...278
Reverse transition relation is NOT exact ! Due to transitions t122, t123, t126, t127, t130, t131, t134, t135, t139, t142, t143, t145, t146, t147, t148, t14...378
(forward)formula 0,1,9.51988,227412,1,0,430,1.04439e+06,436,217,5510,492991,425
FORMULA Anderson-PT-06-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 173 transition count 284
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 173 transition count 284
Applied a total of 72 rules in 13 ms. Remains 173 /209 variables (removed 36) and now considering 284/580 (removed 296) transitions.
// Phase 1: matrix 284 rows 173 cols
[2024-05-23 00:36:50] [INFO ] Computed 15 invariants in 6 ms
[2024-05-23 00:36:50] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-23 00:36:50] [INFO ] Invariant cache hit.
[2024-05-23 00:36:50] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:36:50] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2024-05-23 00:36:50] [INFO ] Invariant cache hit.
[2024-05-23 00:36:50] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-23 00:36:53] [INFO ] Deduced a trap composed of 96 places in 188 ms of which 3 ms to minimize.
[2024-05-23 00:36:53] [INFO ] Deduced a trap composed of 58 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:36:53] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 3 ms to minimize.
[2024-05-23 00:36:54] [INFO ] Deduced a trap composed of 64 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:36:54] [INFO ] Deduced a trap composed of 57 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:36:54] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 4 ms to minimize.
[2024-05-23 00:36:54] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:36:54] [INFO ] Deduced a trap composed of 56 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:36:55] [INFO ] Deduced a trap composed of 71 places in 204 ms of which 4 ms to minimize.
[2024-05-23 00:36:56] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 3 ms to minimize.
[2024-05-23 00:36:56] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-05-23 00:36:56] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 2 ms to minimize.
[2024-05-23 00:36:56] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 2 ms to minimize.
[2024-05-23 00:36:56] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:36:56] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:36:56] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 4 ms to minimize.
[2024-05-23 00:36:57] [INFO ] Deduced a trap composed of 75 places in 164 ms of which 5 ms to minimize.
[2024-05-23 00:36:57] [INFO ] Deduced a trap composed of 53 places in 205 ms of which 3 ms to minimize.
[2024-05-23 00:36:57] [INFO ] Deduced a trap composed of 97 places in 198 ms of which 3 ms to minimize.
[2024-05-23 00:36:57] [INFO ] Deduced a trap composed of 79 places in 175 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-23 00:36:58] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 3 ms to minimize.
[2024-05-23 00:36:58] [INFO ] Deduced a trap composed of 100 places in 170 ms of which 4 ms to minimize.
[2024-05-23 00:36:58] [INFO ] Deduced a trap composed of 115 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:36:58] [INFO ] Deduced a trap composed of 117 places in 133 ms of which 3 ms to minimize.
[2024-05-23 00:36:59] [INFO ] Deduced a trap composed of 75 places in 211 ms of which 3 ms to minimize.
[2024-05-23 00:36:59] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 4 ms to minimize.
[2024-05-23 00:37:00] [INFO ] Deduced a trap composed of 71 places in 205 ms of which 4 ms to minimize.
[2024-05-23 00:37:00] [INFO ] Deduced a trap composed of 81 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:37:00] [INFO ] Deduced a trap composed of 86 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:37:01] [INFO ] Deduced a trap composed of 101 places in 198 ms of which 4 ms to minimize.
[2024-05-23 00:37:01] [INFO ] Deduced a trap composed of 107 places in 194 ms of which 3 ms to minimize.
[2024-05-23 00:37:02] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:37:02] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 3 ms to minimize.
[2024-05-23 00:37:02] [INFO ] Deduced a trap composed of 75 places in 202 ms of which 3 ms to minimize.
[2024-05-23 00:37:02] [INFO ] Deduced a trap composed of 59 places in 194 ms of which 3 ms to minimize.
[2024-05-23 00:37:03] [INFO ] Deduced a trap composed of 62 places in 206 ms of which 4 ms to minimize.
[2024-05-23 00:37:03] [INFO ] Deduced a trap composed of 67 places in 205 ms of which 4 ms to minimize.
[2024-05-23 00:37:03] [INFO ] Deduced a trap composed of 45 places in 202 ms of which 4 ms to minimize.
[2024-05-23 00:37:03] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 3 ms to minimize.
[2024-05-23 00:37:04] [INFO ] Deduced a trap composed of 124 places in 176 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-23 00:37:07] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 3 ms to minimize.
[2024-05-23 00:37:08] [INFO ] Deduced a trap composed of 70 places in 209 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-23 00:37:11] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 3 ms to minimize.
[2024-05-23 00:37:12] [INFO ] Deduced a trap composed of 68 places in 160 ms of which 3 ms to minimize.
[2024-05-23 00:37:12] [INFO ] Deduced a trap composed of 123 places in 211 ms of which 4 ms to minimize.
[2024-05-23 00:37:12] [INFO ] Deduced a trap composed of 79 places in 200 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-23 00:37:14] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 4 ms to minimize.
[2024-05-23 00:37:14] [INFO ] Deduced a trap composed of 79 places in 206 ms of which 3 ms to minimize.
[2024-05-23 00:37:15] [INFO ] Deduced a trap composed of 78 places in 199 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 173/457 variables, and 64 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/173 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-23 00:37:23] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 4 ms to minimize.
[2024-05-23 00:37:23] [INFO ] Deduced a trap composed of 84 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:37:24] [INFO ] Deduced a trap composed of 92 places in 204 ms of which 3 ms to minimize.
[2024-05-23 00:37:24] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 4 ms to minimize.
[2024-05-23 00:37:24] [INFO ] Deduced a trap composed of 113 places in 175 ms of which 4 ms to minimize.
[2024-05-23 00:37:25] [INFO ] Deduced a trap composed of 67 places in 199 ms of which 3 ms to minimize.
[2024-05-23 00:37:26] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 3 ms to minimize.
[2024-05-23 00:37:26] [INFO ] Deduced a trap composed of 59 places in 211 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-23 00:37:29] [INFO ] Deduced a trap composed of 81 places in 209 ms of which 3 ms to minimize.
[2024-05-23 00:37:30] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-23 00:37:32] [INFO ] Deduced a trap composed of 59 places in 195 ms of which 3 ms to minimize.
[2024-05-23 00:37:34] [INFO ] Deduced a trap composed of 81 places in 178 ms of which 3 ms to minimize.
[2024-05-23 00:37:34] [INFO ] Deduced a trap composed of 96 places in 215 ms of which 3 ms to minimize.
[2024-05-23 00:37:35] [INFO ] Deduced a trap composed of 118 places in 213 ms of which 3 ms to minimize.
[2024-05-23 00:37:35] [INFO ] Deduced a trap composed of 119 places in 173 ms of which 3 ms to minimize.
[2024-05-23 00:37:35] [INFO ] Deduced a trap composed of 122 places in 171 ms of which 3 ms to minimize.
[2024-05-23 00:37:35] [INFO ] Deduced a trap composed of 121 places in 157 ms of which 3 ms to minimize.
[2024-05-23 00:37:36] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 3 ms to minimize.
[2024-05-23 00:37:36] [INFO ] Deduced a trap composed of 115 places in 208 ms of which 3 ms to minimize.
[2024-05-23 00:37:36] [INFO ] Deduced a trap composed of 127 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:37:37] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 11/85 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-23 00:37:40] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 3 ms to minimize.
[2024-05-23 00:37:40] [INFO ] Deduced a trap composed of 83 places in 198 ms of which 3 ms to minimize.
[2024-05-23 00:37:40] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 3 ms to minimize.
[2024-05-23 00:37:41] [INFO ] Deduced a trap composed of 68 places in 162 ms of which 3 ms to minimize.
[2024-05-23 00:37:41] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
[2024-05-23 00:37:41] [INFO ] Deduced a trap composed of 107 places in 163 ms of which 3 ms to minimize.
[2024-05-23 00:37:41] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 4 ms to minimize.
[2024-05-23 00:37:42] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 3 ms to minimize.
[2024-05-23 00:37:42] [INFO ] Deduced a trap composed of 102 places in 163 ms of which 3 ms to minimize.
[2024-05-23 00:37:42] [INFO ] Deduced a trap composed of 73 places in 164 ms of which 3 ms to minimize.
[2024-05-23 00:37:42] [INFO ] Deduced a trap composed of 82 places in 166 ms of which 3 ms to minimize.
[2024-05-23 00:37:42] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 3 ms to minimize.
[2024-05-23 00:37:42] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 2 ms to minimize.
[2024-05-23 00:37:43] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 3 ms to minimize.
[2024-05-23 00:37:43] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:37:43] [INFO ] Deduced a trap composed of 70 places in 165 ms of which 3 ms to minimize.
[2024-05-23 00:37:43] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 2 ms to minimize.
[2024-05-23 00:37:44] [INFO ] Deduced a trap composed of 126 places in 163 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-23 00:37:45] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 3 ms to minimize.
[2024-05-23 00:37:45] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:37:47] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 173/457 variables, and 106 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/173 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/278 constraints, Known Traps: 91/91 constraints]
After SMT, in 60313ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 60320ms
Starting structural reductions in LTL mode, iteration 1 : 173/209 places, 284/580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61112 ms. Remains : 173/209 places, 284/580 transitions.
[2024-05-23 00:37:51] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:37:51] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:37:51] [INFO ] Input system was already deterministic with 284 transitions.
[2024-05-23 00:37:51] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:37:51] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:37:51] [INFO ] Time to serialize gal into /tmp/CTLFireability7704611529352406501.gal : 3 ms
[2024-05-23 00:37:51] [INFO ] Time to serialize properties into /tmp/CTLFireability799585812208367290.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7704611529352406501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability799585812208367290.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.25537e+06,13.1704,294084,2,43263,5,867564,6,0,979,521798,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-23 00:38:21] [INFO ] Flatten gal took : 16 ms
[2024-05-23 00:38:21] [INFO ] Applying decomposition
[2024-05-23 00:38:21] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph244368205881678896.txt' '-o' '/tmp/graph244368205881678896.bin' '-w' '/tmp/graph244368205881678896.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph244368205881678896.bin' '-l' '-1' '-v' '-w' '/tmp/graph244368205881678896.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:38:21] [INFO ] Decomposing Gal with order
[2024-05-23 00:38:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:38:21] [INFO ] Removed a total of 418 redundant transitions.
[2024-05-23 00:38:21] [INFO ] Flatten gal took : 44 ms
[2024-05-23 00:38:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 19 ms.
[2024-05-23 00:38:21] [INFO ] Time to serialize gal into /tmp/CTLFireability5338156074141851120.gal : 7 ms
[2024-05-23 00:38:21] [INFO ] Time to serialize properties into /tmp/CTLFireability13359349309922970780.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5338156074141851120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13359349309922970780.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.25537e+06,2.05585,42992,3535,2360,69110,11270,661,68629,368,14097,0
Converting to forward existential form...Done !
original formula: A(!(AF(EX((((i2.i1.u3.next_4==1)&&(i7.u39.ncs_5_5==1))||((i2.i1.u6.next_10==1)&&(i3.u10.ncs_0_4==1)))))) U A((!((EX(((i2.i0.u2.next_3==1)...330
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(E(TRUE U ((i2.i1.u3.next_5==1)&&(i6.u21.ncs_4_5==1)))) U (!((!((EX(((i2.i0.u2.next_3==1)...1262
Reverse transition relation is NOT exact ! Due to transitions t249, t250, t252, t253, t256, t257, t259, t263, t264, t274, t275, t276, t277, t280, t282, t28...312
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,21.3444,393848,1,0,680150,89915,3443,748481,2060,269592,2186519
FORMULA Anderson-PT-06-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 171 transition count 262
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 171 transition count 262
Applied a total of 76 rules in 7 ms. Remains 171 /209 variables (removed 38) and now considering 262/580 (removed 318) transitions.
// Phase 1: matrix 262 rows 171 cols
[2024-05-23 00:38:43] [INFO ] Computed 15 invariants in 5 ms
[2024-05-23 00:38:43] [INFO ] Implicit Places using invariants in 344 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 346 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/209 places, 262/580 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 361 ms. Remains : 170/209 places, 262/580 transitions.
[2024-05-23 00:38:43] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:38:43] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:38:43] [INFO ] Input system was already deterministic with 262 transitions.
[2024-05-23 00:38:43] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:38:43] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:38:43] [INFO ] Time to serialize gal into /tmp/CTLFireability7006443254331924785.gal : 3 ms
[2024-05-23 00:38:43] [INFO ] Time to serialize properties into /tmp/CTLFireability15251994272205337024.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7006443254331924785.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15251994272205337024.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07119e+06,2.8006,74188,2,25295,5,222329,6,0,945,167415,0
Converting to forward existential form...Done !
original formula: (AX(((next_1==0)||(ncs_0_0==0))) + AX(((next_0==0)||(ncs_3_4==0))))
=> equivalent forward existential formula: [(EY((Init * !(!(EX(!(((next_1==0)||(ncs_0_0==0)))))))) * !(((next_0==0)||(ncs_3_4==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t226, t227, t228, t229, t230, t231, t232, t233, t234, t235, t236, t237, t238, t239, t240, t24...378
(forward)formula 0,1,23.7232,501684,1,0,510,2.0829e+06,543,268,6731,852299,533
FORMULA Anderson-PT-06-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 174 transition count 285
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 174 transition count 285
Applied a total of 70 rules in 13 ms. Remains 174 /209 variables (removed 35) and now considering 285/580 (removed 295) transitions.
// Phase 1: matrix 285 rows 174 cols
[2024-05-23 00:39:07] [INFO ] Computed 15 invariants in 2 ms
[2024-05-23 00:39:07] [INFO ] Implicit Places using invariants in 395 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 396 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/209 places, 285/580 transitions.
Applied a total of 0 rules in 5 ms. Remains 173 /173 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 415 ms. Remains : 173/209 places, 285/580 transitions.
[2024-05-23 00:39:07] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:39:07] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:39:07] [INFO ] Input system was already deterministic with 285 transitions.
[2024-05-23 00:39:07] [INFO ] Flatten gal took : 16 ms
[2024-05-23 00:39:07] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:39:07] [INFO ] Time to serialize gal into /tmp/CTLFireability5397711607202191895.gal : 4 ms
[2024-05-23 00:39:07] [INFO ] Time to serialize properties into /tmp/CTLFireability772669028253868567.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5397711607202191895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability772669028253868567.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.3169e+06,4.50423,116544,2,27903,5,342677,6,0,980,273461,0
Converting to forward existential form...Done !
original formula: AF((((AX(AF((((p1_5_1==1)&&(next_4==1))&&(ncs_1_2==1)))) * (next_0==1)) * ((ncs_2_5==1) * (EX(((next_3==0)||(ncs_4_4==0))) + ((slot_F.T.F...259
=> equivalent forward existential formula: [FwdG(Init,!((((!(EX(!(!(EG(!((((p1_5_1==1)&&(next_4==1))&&(ncs_1_2==1)))))))) * (next_0==1)) * ((ncs_2_5==1) * ...316
Reverse transition relation is NOT exact ! Due to transitions t112, t113, t114, t115, t118, t119, t120, t121, t124, t125, t126, t127, t130, t131, t132, t13...504
Detected timeout of ITS tools.
[2024-05-23 00:39:38] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:39:38] [INFO ] Applying decomposition
[2024-05-23 00:39:38] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1264594486526536393.txt' '-o' '/tmp/graph1264594486526536393.bin' '-w' '/tmp/graph1264594486526536393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1264594486526536393.bin' '-l' '-1' '-v' '-w' '/tmp/graph1264594486526536393.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:39:38] [INFO ] Decomposing Gal with order
[2024-05-23 00:39:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:39:38] [INFO ] Removed a total of 496 redundant transitions.
[2024-05-23 00:39:38] [INFO ] Flatten gal took : 24 ms
[2024-05-23 00:39:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 11 ms.
[2024-05-23 00:39:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8021546236342010907.gal : 6 ms
[2024-05-23 00:39:38] [INFO ] Time to serialize properties into /tmp/CTLFireability15924844001695122874.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8021546236342010907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15924844001695122874.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.3169e+06,1.72569,37612,4294,26,65094,148,777,93908,39,292,0
Converting to forward existential form...Done !
original formula: AF((((AX(AF((((i5.i0.u21.p1_5_1==1)&&(i0.i1.u2.next_4==1))&&(i0.i2.u61.ncs_1_2==1)))) * (i1.u0.next_0==1)) * ((i2.u50.ncs_2_5==1) * (EX((...376
=> equivalent forward existential formula: [FwdG(Init,!((((!(EX(!(!(EG(!((((i5.i0.u21.p1_5_1==1)&&(i0.i1.u2.next_4==1))&&(i0.i2.u61.ncs_1_2==1)))))))) * (i...433
Reverse transition relation is NOT exact ! Due to transitions t124, t125, t126, t127, t130, t131, t132, t133, t251, t252, t253, t254, t255, t256, t257, t25...559
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,13.5335,300780,1,0,506886,270,4442,1.1539e+06,190,1140,1948225
FORMULA Anderson-PT-06-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 174 transition count 295
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 174 transition count 295
Applied a total of 70 rules in 6 ms. Remains 174 /209 variables (removed 35) and now considering 295/580 (removed 285) transitions.
// Phase 1: matrix 295 rows 174 cols
[2024-05-23 00:39:51] [INFO ] Computed 15 invariants in 2 ms
[2024-05-23 00:39:51] [INFO ] Implicit Places using invariants in 183 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 193 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/209 places, 295/580 transitions.
Applied a total of 0 rules in 2 ms. Remains 173 /173 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 203 ms. Remains : 173/209 places, 295/580 transitions.
[2024-05-23 00:39:51] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:39:51] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:39:51] [INFO ] Input system was already deterministic with 295 transitions.
[2024-05-23 00:39:51] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:39:51] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:39:52] [INFO ] Time to serialize gal into /tmp/CTLFireability1115298644819535087.gal : 2 ms
[2024-05-23 00:39:52] [INFO ] Time to serialize properties into /tmp/CTLFireability14850997266154221809.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1115298644819535087.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14850997266154221809.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.35599e+06,5.0551,109360,2,27729,5,328256,6,0,990,244323,0
Converting to forward existential form...Done !
original formula: (AF(AX((E(((next_8==1)&&(p1_1_5==1)) U ((next_1==1)&&(ncs_3_3==1))) * EF(((next_10==1)&&(p1_4_5==1)))))) + (EG(((EX((((next_2==0)||(ncs_0...311
=> equivalent forward existential formula: [FwdG((Init * !((EG(((EX((((next_2==0)||(ncs_0_4==0))&&((next_4==0)||(ncs_2_3==0)))) * (next_5==1)) * (ncs_0_1==...542
Reverse transition relation is NOT exact ! Due to transitions t259, t260, t261, t262, t263, t264, t265, t266, t267, t268, t269, t270, t271, t272, t273, t27...378
Detected timeout of ITS tools.
[2024-05-23 00:40:22] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:40:22] [INFO ] Applying decomposition
[2024-05-23 00:40:22] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3031273322648593828.txt' '-o' '/tmp/graph3031273322648593828.bin' '-w' '/tmp/graph3031273322648593828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3031273322648593828.bin' '-l' '-1' '-v' '-w' '/tmp/graph3031273322648593828.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:40:22] [INFO ] Decomposing Gal with order
[2024-05-23 00:40:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:40:22] [INFO ] Removed a total of 516 redundant transitions.
[2024-05-23 00:40:22] [INFO ] Flatten gal took : 63 ms
[2024-05-23 00:40:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2024-05-23 00:40:22] [INFO ] Time to serialize gal into /tmp/CTLFireability3486113939171557864.gal : 6 ms
[2024-05-23 00:40:22] [INFO ] Time to serialize properties into /tmp/CTLFireability6917452425715418335.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3486113939171557864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6917452425715418335.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.35599e+06,2.56878,52136,3610,27,91080,182,834,106185,38,331,0
Converting to forward existential form...Done !
original formula: (AF(AX((E(((i0.i1.u3.next_8==1)&&(i0.i0.u28.p1_1_5==1)) U ((i0.i0.u0.next_1==1)&&(i3.u54.ncs_3_3==1))) * EF(((i0.i1.u4.next_10==1)&&(i0.i...442
=> equivalent forward existential formula: [FwdG((Init * !((EG(((EX((((i0.i0.u0.next_2==0)||(i2.u24.ncs_0_4==0))&&((i0.i0.u1.next_4==0)||(i1.u64.ncs_2_3==0...701
Reverse transition relation is NOT exact ! Due to transitions t259, t260, t261, t262, t263, t264, t265, t268, t269, t270, t271, t272, t273, t274, t275, t27...387
(forward)formula 0,0,16.8571,319300,1,0,553693,286,5062,1.13134e+06,193,1184,2196729
FORMULA Anderson-PT-06-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 176 transition count 307
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 176 transition count 307
Applied a total of 66 rules in 6 ms. Remains 176 /209 variables (removed 33) and now considering 307/580 (removed 273) transitions.
// Phase 1: matrix 307 rows 176 cols
[2024-05-23 00:40:39] [INFO ] Computed 15 invariants in 2 ms
[2024-05-23 00:40:39] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-23 00:40:39] [INFO ] Invariant cache hit.
[2024-05-23 00:40:39] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:40:40] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-05-23 00:40:40] [INFO ] Invariant cache hit.
[2024-05-23 00:40:40] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-23 00:40:43] [INFO ] Deduced a trap composed of 115 places in 223 ms of which 4 ms to minimize.
[2024-05-23 00:40:43] [INFO ] Deduced a trap composed of 60 places in 213 ms of which 3 ms to minimize.
[2024-05-23 00:40:43] [INFO ] Deduced a trap composed of 106 places in 210 ms of which 3 ms to minimize.
[2024-05-23 00:40:43] [INFO ] Deduced a trap composed of 92 places in 165 ms of which 3 ms to minimize.
[2024-05-23 00:40:43] [INFO ] Deduced a trap composed of 126 places in 201 ms of which 3 ms to minimize.
[2024-05-23 00:40:44] [INFO ] Deduced a trap composed of 97 places in 208 ms of which 3 ms to minimize.
[2024-05-23 00:40:44] [INFO ] Deduced a trap composed of 67 places in 221 ms of which 3 ms to minimize.
[2024-05-23 00:40:44] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 3 ms to minimize.
[2024-05-23 00:40:45] [INFO ] Deduced a trap composed of 79 places in 207 ms of which 3 ms to minimize.
[2024-05-23 00:40:45] [INFO ] Deduced a trap composed of 94 places in 205 ms of which 3 ms to minimize.
[2024-05-23 00:40:45] [INFO ] Deduced a trap composed of 75 places in 204 ms of which 4 ms to minimize.
[2024-05-23 00:40:45] [INFO ] Deduced a trap composed of 84 places in 203 ms of which 4 ms to minimize.
[2024-05-23 00:40:45] [INFO ] Deduced a trap composed of 80 places in 206 ms of which 3 ms to minimize.
[2024-05-23 00:40:46] [INFO ] Deduced a trap composed of 68 places in 206 ms of which 3 ms to minimize.
[2024-05-23 00:40:46] [INFO ] Deduced a trap composed of 83 places in 195 ms of which 3 ms to minimize.
[2024-05-23 00:40:46] [INFO ] Deduced a trap composed of 81 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:40:46] [INFO ] Deduced a trap composed of 67 places in 148 ms of which 3 ms to minimize.
[2024-05-23 00:40:47] [INFO ] Deduced a trap composed of 94 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:40:47] [INFO ] Deduced a trap composed of 63 places in 197 ms of which 3 ms to minimize.
[2024-05-23 00:40:48] [INFO ] Deduced a trap composed of 63 places in 210 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-23 00:40:48] [INFO ] Deduced a trap composed of 88 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:40:48] [INFO ] Deduced a trap composed of 97 places in 192 ms of which 3 ms to minimize.
[2024-05-23 00:40:49] [INFO ] Deduced a trap composed of 96 places in 195 ms of which 3 ms to minimize.
[2024-05-23 00:40:49] [INFO ] Deduced a trap composed of 87 places in 209 ms of which 4 ms to minimize.
[2024-05-23 00:40:49] [INFO ] Deduced a trap composed of 68 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:40:50] [INFO ] Deduced a trap composed of 88 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:40:50] [INFO ] Deduced a trap composed of 82 places in 205 ms of which 3 ms to minimize.
[2024-05-23 00:40:51] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 3 ms to minimize.
[2024-05-23 00:40:51] [INFO ] Deduced a trap composed of 67 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:40:51] [INFO ] Deduced a trap composed of 73 places in 218 ms of which 3 ms to minimize.
[2024-05-23 00:40:51] [INFO ] Deduced a trap composed of 80 places in 208 ms of which 3 ms to minimize.
[2024-05-23 00:40:52] [INFO ] Deduced a trap composed of 75 places in 211 ms of which 3 ms to minimize.
[2024-05-23 00:40:52] [INFO ] Deduced a trap composed of 69 places in 225 ms of which 3 ms to minimize.
[2024-05-23 00:40:52] [INFO ] Deduced a trap composed of 77 places in 158 ms of which 3 ms to minimize.
[2024-05-23 00:40:52] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 3 ms to minimize.
[2024-05-23 00:40:53] [INFO ] Deduced a trap composed of 79 places in 221 ms of which 4 ms to minimize.
[2024-05-23 00:40:54] [INFO ] Deduced a trap composed of 81 places in 240 ms of which 4 ms to minimize.
[2024-05-23 00:40:54] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 3 ms to minimize.
[2024-05-23 00:40:54] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 3 ms to minimize.
[2024-05-23 00:40:54] [INFO ] Deduced a trap composed of 52 places in 199 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-23 00:40:57] [INFO ] Deduced a trap composed of 119 places in 218 ms of which 3 ms to minimize.
[2024-05-23 00:40:58] [INFO ] Deduced a trap composed of 100 places in 200 ms of which 3 ms to minimize.
[2024-05-23 00:40:58] [INFO ] Deduced a trap composed of 82 places in 206 ms of which 3 ms to minimize.
[2024-05-23 00:40:58] [INFO ] Deduced a trap composed of 121 places in 206 ms of which 3 ms to minimize.
[2024-05-23 00:40:58] [INFO ] Deduced a trap composed of 116 places in 215 ms of which 4 ms to minimize.
[2024-05-23 00:40:58] [INFO ] Deduced a trap composed of 61 places in 202 ms of which 3 ms to minimize.
[2024-05-23 00:40:59] [INFO ] Deduced a trap composed of 50 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:40:59] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:40:59] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 3 ms to minimize.
[2024-05-23 00:40:59] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 3 ms to minimize.
[2024-05-23 00:40:59] [INFO ] Deduced a trap composed of 71 places in 201 ms of which 3 ms to minimize.
[2024-05-23 00:41:00] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 3 ms to minimize.
[2024-05-23 00:41:00] [INFO ] Deduced a trap composed of 88 places in 210 ms of which 3 ms to minimize.
[2024-05-23 00:41:00] [INFO ] Deduced a trap composed of 75 places in 204 ms of which 3 ms to minimize.
[2024-05-23 00:41:00] [INFO ] Deduced a trap composed of 95 places in 204 ms of which 3 ms to minimize.
[2024-05-23 00:41:01] [INFO ] Deduced a trap composed of 81 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:41:01] [INFO ] Deduced a trap composed of 68 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:41:01] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 3 ms to minimize.
[2024-05-23 00:41:02] [INFO ] Deduced a trap composed of 57 places in 169 ms of which 3 ms to minimize.
[2024-05-23 00:41:02] [INFO ] Deduced a trap composed of 55 places in 207 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-23 00:41:03] [INFO ] Deduced a trap composed of 76 places in 186 ms of which 4 ms to minimize.
[2024-05-23 00:41:03] [INFO ] Deduced a trap composed of 85 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:41:04] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:41:04] [INFO ] Deduced a trap composed of 109 places in 173 ms of which 4 ms to minimize.
[2024-05-23 00:41:04] [INFO ] Deduced a trap composed of 74 places in 188 ms of which 3 ms to minimize.
[2024-05-23 00:41:05] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 3 ms to minimize.
[2024-05-23 00:41:05] [INFO ] Deduced a trap composed of 77 places in 213 ms of which 3 ms to minimize.
[2024-05-23 00:41:05] [INFO ] Deduced a trap composed of 86 places in 215 ms of which 3 ms to minimize.
[2024-05-23 00:41:06] [INFO ] Deduced a trap composed of 62 places in 214 ms of which 4 ms to minimize.
[2024-05-23 00:41:06] [INFO ] Deduced a trap composed of 47 places in 207 ms of which 3 ms to minimize.
[2024-05-23 00:41:06] [INFO ] Deduced a trap composed of 80 places in 231 ms of which 4 ms to minimize.
[2024-05-23 00:41:06] [INFO ] Deduced a trap composed of 71 places in 204 ms of which 3 ms to minimize.
[2024-05-23 00:41:07] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 3 ms to minimize.
[2024-05-23 00:41:07] [INFO ] Deduced a trap composed of 81 places in 207 ms of which 3 ms to minimize.
[2024-05-23 00:41:07] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 3 ms to minimize.
[2024-05-23 00:41:08] [INFO ] Deduced a trap composed of 59 places in 169 ms of which 3 ms to minimize.
[2024-05-23 00:41:08] [INFO ] Deduced a trap composed of 89 places in 171 ms of which 3 ms to minimize.
[2024-05-23 00:41:08] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 3 ms to minimize.
[2024-05-23 00:41:08] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 3 ms to minimize.
[2024-05-23 00:41:08] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 176/483 variables, and 95 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/176 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 80/95 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-23 00:41:12] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 3 ms to minimize.
[2024-05-23 00:41:13] [INFO ] Deduced a trap composed of 102 places in 218 ms of which 4 ms to minimize.
[2024-05-23 00:41:14] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 3 ms to minimize.
[2024-05-23 00:41:15] [INFO ] Deduced a trap composed of 70 places in 222 ms of which 4 ms to minimize.
[2024-05-23 00:41:15] [INFO ] Deduced a trap composed of 126 places in 200 ms of which 3 ms to minimize.
[2024-05-23 00:41:16] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 3 ms to minimize.
[2024-05-23 00:41:16] [INFO ] Deduced a trap composed of 61 places in 168 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 7/102 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 176/483 variables, and 102 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/176 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/301 constraints, Known Traps: 87/87 constraints]
After SMT, in 60320ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60326ms
Starting structural reductions in LTL mode, iteration 1 : 176/209 places, 307/580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61232 ms. Remains : 176/209 places, 307/580 transitions.
[2024-05-23 00:41:40] [INFO ] Flatten gal took : 14 ms
[2024-05-23 00:41:40] [INFO ] Flatten gal took : 16 ms
[2024-05-23 00:41:40] [INFO ] Input system was already deterministic with 307 transitions.
[2024-05-23 00:41:40] [INFO ] Flatten gal took : 14 ms
[2024-05-23 00:41:40] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:41:40] [INFO ] Time to serialize gal into /tmp/CTLFireability10830280510183047319.gal : 4 ms
[2024-05-23 00:41:40] [INFO ] Time to serialize properties into /tmp/CTLFireability7718057833676951356.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10830280510183047319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7718057833676951356.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.53454e+06,19.4093,406428,2,43348,5,1.11453e+06,6,0,1014,754274,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-23 00:42:10] [INFO ] Flatten gal took : 16 ms
[2024-05-23 00:42:10] [INFO ] Applying decomposition
[2024-05-23 00:42:10] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph1642716270027633333.txt' '-o' '/tmp/graph1642716270027633333.bin' '-w' '/tmp/graph1642716270027633333.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1642716270027633333.bin' '-l' '-1' '-v' '-w' '/tmp/graph1642716270027633333.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:42:10] [INFO ] Decomposing Gal with order
[2024-05-23 00:42:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:42:10] [INFO ] Removed a total of 475 redundant transitions.
[2024-05-23 00:42:10] [INFO ] Flatten gal took : 37 ms
[2024-05-23 00:42:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 7 ms.
[2024-05-23 00:42:10] [INFO ] Time to serialize gal into /tmp/CTLFireability15218481723031757108.gal : 5 ms
[2024-05-23 00:42:10] [INFO ] Time to serialize properties into /tmp/CTLFireability165681789302064841.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15218481723031757108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability165681789302064841.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.53454e+06,2.13293,45336,2229,2893,49986,23261,707,70961,403,236240,0
Converting to forward existential form...Done !
original formula: E(A(!(((E(((i2.i0.u2.next_3==1)&&(i4.u16.ncs_2_3==1)) U ((i2.i2.u6.next_10==1)&&(i2.i3.u22.ncs_4_3==1))) * !(((i4.u28.p1_2_0==1)||((i2.i1...630
=> equivalent forward existential formula: [((FwdU(Init,!((E(!(((EX(EG(((i2.i1.u4.next_6==1)&&(i2.i3.u22.ncs_4_3==1)))) * !(EX(!(FALSE)))) * ((u0.slot_F.F....1092
Reverse transition relation is NOT exact ! Due to transitions t272, t273, t275, t276, t279, t280, t282, t285, t286, t297, t298, t300, t302, t303, t306, u0....454
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found 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
(forward)formula 0,0,21.6642,385848,1,0,444687,226813,3965,774705,2335,2.19949e+06,1214983
FORMULA Anderson-PT-06-CTLFireability-2024-07 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 : 209/209 places, 580/580 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 170 transition count 251
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 170 transition count 251
Applied a total of 78 rules in 5 ms. Remains 170 /209 variables (removed 39) and now considering 251/580 (removed 329) transitions.
// Phase 1: matrix 251 rows 170 cols
[2024-05-23 00:42:32] [INFO ] Computed 15 invariants in 2 ms
[2024-05-23 00:42:32] [INFO ] Implicit Places using invariants in 212 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 213 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/209 places, 251/580 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 221 ms. Remains : 169/209 places, 251/580 transitions.
[2024-05-23 00:42:32] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:42:32] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:42:32] [INFO ] Input system was already deterministic with 251 transitions.
[2024-05-23 00:42:32] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:42:32] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:42:32] [INFO ] Time to serialize gal into /tmp/CTLFireability5970815112919179928.gal : 2 ms
[2024-05-23 00:42:32] [INFO ] Time to serialize properties into /tmp/CTLFireability16938440667807102603.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5970815112919179928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16938440667807102603.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,987636,1.90698,50816,2,23284,5,160901,6,0,930,117573,0
Converting to forward existential form...Done !
original formula: AX((EF(((next_6==1)&&(ncs_5_4==1))) + (EF((((next_11==1)&&(p1_4_5==1))||((next_8==1)&&(p1_1_5==1)))) * EG(((slot_F.F.F.T.F.F==0)||(p2_2_3...164
=> equivalent forward existential formula: [((EY(Init) * !((E(TRUE U (((next_11==1)&&(p1_4_5==1))||((next_8==1)&&(p1_1_5==1)))) * EG(((slot_F.F.F.T.F.F==0)...226
Reverse transition relation is NOT exact ! Due to transitions t215, t216, t217, t218, t219, t220, t221, t222, t223, t224, t225, t226, t227, t228, t229, t23...378
(forward)formula 0,1,24.9846,538612,1,0,529,2.55062e+06,523,276,6644,1.02952e+06,570
FORMULA Anderson-PT-06-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 173 transition count 274
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 173 transition count 274
Applied a total of 72 rules in 5 ms. Remains 173 /209 variables (removed 36) and now considering 274/580 (removed 306) transitions.
// Phase 1: matrix 274 rows 173 cols
[2024-05-23 00:42:58] [INFO ] Computed 15 invariants in 2 ms
[2024-05-23 00:42:58] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-23 00:42:58] [INFO ] Invariant cache hit.
[2024-05-23 00:42:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:42:59] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-23 00:42:59] [INFO ] Invariant cache hit.
[2024-05-23 00:42:59] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-23 00:43:01] [INFO ] Deduced a trap composed of 113 places in 195 ms of which 3 ms to minimize.
[2024-05-23 00:43:02] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 4 ms to minimize.
[2024-05-23 00:43:02] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:43:02] [INFO ] Deduced a trap composed of 98 places in 170 ms of which 3 ms to minimize.
[2024-05-23 00:43:02] [INFO ] Deduced a trap composed of 72 places in 282 ms of which 3 ms to minimize.
[2024-05-23 00:43:03] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 2 ms to minimize.
[2024-05-23 00:43:03] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 3 ms to minimize.
[2024-05-23 00:43:03] [INFO ] Deduced a trap composed of 67 places in 130 ms of which 2 ms to minimize.
[2024-05-23 00:43:04] [INFO ] Deduced a trap composed of 61 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:43:04] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 2 ms to minimize.
[2024-05-23 00:43:04] [INFO ] Deduced a trap composed of 111 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:43:05] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 2 ms to minimize.
[2024-05-23 00:43:05] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 2 ms to minimize.
[2024-05-23 00:43:05] [INFO ] Deduced a trap composed of 119 places in 122 ms of which 2 ms to minimize.
[2024-05-23 00:43:05] [INFO ] Deduced a trap composed of 85 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:43:05] [INFO ] Deduced a trap composed of 74 places in 183 ms of which 19 ms to minimize.
[2024-05-23 00:43:05] [INFO ] Deduced a trap composed of 82 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:43:06] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 3 ms to minimize.
[2024-05-23 00:43:06] [INFO ] Deduced a trap composed of 125 places in 160 ms of which 3 ms to minimize.
[2024-05-23 00:43:06] [INFO ] Deduced a trap composed of 115 places in 167 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-23 00:43:07] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 2 ms to minimize.
[2024-05-23 00:43:07] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 3 ms to minimize.
[2024-05-23 00:43:07] [INFO ] Deduced a trap composed of 105 places in 152 ms of which 3 ms to minimize.
[2024-05-23 00:43:07] [INFO ] Deduced a trap composed of 95 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:43:07] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 3 ms to minimize.
[2024-05-23 00:43:07] [INFO ] Deduced a trap composed of 107 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:43:09] [INFO ] Deduced a trap composed of 102 places in 133 ms of which 2 ms to minimize.
[2024-05-23 00:43:09] [INFO ] Deduced a trap composed of 80 places in 192 ms of which 3 ms to minimize.
[2024-05-23 00:43:09] [INFO ] Deduced a trap composed of 108 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:43:09] [INFO ] Deduced a trap composed of 94 places in 190 ms of which 4 ms to minimize.
[2024-05-23 00:43:10] [INFO ] Deduced a trap composed of 80 places in 149 ms of which 3 ms to minimize.
[2024-05-23 00:43:10] [INFO ] Deduced a trap composed of 86 places in 197 ms of which 3 ms to minimize.
[2024-05-23 00:43:10] [INFO ] Deduced a trap composed of 89 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:43:10] [INFO ] Deduced a trap composed of 84 places in 192 ms of which 3 ms to minimize.
[2024-05-23 00:43:10] [INFO ] Deduced a trap composed of 88 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:43:11] [INFO ] Deduced a trap composed of 77 places in 194 ms of which 3 ms to minimize.
[2024-05-23 00:43:11] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 4 ms to minimize.
[2024-05-23 00:43:11] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:43:11] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-23 00:43:15] [INFO ] Deduced a trap composed of 76 places in 206 ms of which 3 ms to minimize.
[2024-05-23 00:43:15] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-23 00:43:17] [INFO ] Deduced a trap composed of 62 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:43:18] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 4 ms to minimize.
[2024-05-23 00:43:18] [INFO ] Deduced a trap composed of 90 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:43:18] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:43:18] [INFO ] Deduced a trap composed of 83 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:43:18] [INFO ] Deduced a trap composed of 94 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:43:19] [INFO ] Deduced a trap composed of 95 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:43:19] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 3 ms to minimize.
[2024-05-23 00:43:19] [INFO ] Deduced a trap composed of 101 places in 157 ms of which 3 ms to minimize.
[2024-05-23 00:43:19] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 3 ms to minimize.
[2024-05-23 00:43:20] [INFO ] Deduced a trap composed of 103 places in 205 ms of which 3 ms to minimize.
[2024-05-23 00:43:20] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 4 ms to minimize.
[2024-05-23 00:43:20] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 4 ms to minimize.
[2024-05-23 00:43:21] [INFO ] Deduced a trap composed of 86 places in 198 ms of which 3 ms to minimize.
[2024-05-23 00:43:21] [INFO ] Deduced a trap composed of 61 places in 204 ms of which 3 ms to minimize.
[2024-05-23 00:43:22] [INFO ] Deduced a trap composed of 81 places in 224 ms of which 3 ms to minimize.
[2024-05-23 00:43:22] [INFO ] Deduced a trap composed of 100 places in 212 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 17/73 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-23 00:43:24] [INFO ] Deduced a trap composed of 83 places in 196 ms of which 4 ms to minimize.
[2024-05-23 00:43:24] [INFO ] Deduced a trap composed of 112 places in 154 ms of which 3 ms to minimize.
[2024-05-23 00:43:24] [INFO ] Deduced a trap composed of 78 places in 202 ms of which 3 ms to minimize.
[2024-05-23 00:43:25] [INFO ] Deduced a trap composed of 90 places in 194 ms of which 3 ms to minimize.
[2024-05-23 00:43:25] [INFO ] Deduced a trap composed of 35 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:43:26] [INFO ] Deduced a trap composed of 70 places in 216 ms of which 3 ms to minimize.
[2024-05-23 00:43:27] [INFO ] Deduced a trap composed of 100 places in 204 ms of which 4 ms to minimize.
[2024-05-23 00:43:27] [INFO ] Deduced a trap composed of 60 places in 218 ms of which 3 ms to minimize.
[2024-05-23 00:43:27] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 3 ms to minimize.
[2024-05-23 00:43:27] [INFO ] Deduced a trap composed of 66 places in 155 ms of which 3 ms to minimize.
[2024-05-23 00:43:28] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:43:28] [INFO ] Deduced a trap composed of 71 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:43:28] [INFO ] Deduced a trap composed of 62 places in 196 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 13/86 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 173/447 variables, and 86 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/173 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 71/86 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-23 00:43:31] [INFO ] Deduced a trap composed of 67 places in 220 ms of which 3 ms to minimize.
[2024-05-23 00:43:32] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 3 ms to minimize.
[2024-05-23 00:43:32] [INFO ] Deduced a trap composed of 74 places in 203 ms of which 4 ms to minimize.
[2024-05-23 00:43:32] [INFO ] Deduced a trap composed of 104 places in 201 ms of which 3 ms to minimize.
[2024-05-23 00:43:32] [INFO ] Deduced a trap composed of 88 places in 200 ms of which 3 ms to minimize.
[2024-05-23 00:43:32] [INFO ] Deduced a trap composed of 67 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:43:33] [INFO ] Deduced a trap composed of 61 places in 196 ms of which 4 ms to minimize.
[2024-05-23 00:43:33] [INFO ] Deduced a trap composed of 74 places in 202 ms of which 4 ms to minimize.
[2024-05-23 00:43:33] [INFO ] Deduced a trap composed of 108 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:43:33] [INFO ] Deduced a trap composed of 92 places in 195 ms of which 3 ms to minimize.
[2024-05-23 00:43:34] [INFO ] Deduced a trap composed of 80 places in 155 ms of which 3 ms to minimize.
[2024-05-23 00:43:34] [INFO ] Deduced a trap composed of 61 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:43:36] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-23 00:43:38] [INFO ] Deduced a trap composed of 72 places in 188 ms of which 3 ms to minimize.
[2024-05-23 00:43:39] [INFO ] Deduced a trap composed of 107 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:43:39] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:43:39] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 3 ms to minimize.
[2024-05-23 00:43:40] [INFO ] Deduced a trap composed of 100 places in 198 ms of which 3 ms to minimize.
[2024-05-23 00:43:40] [INFO ] Deduced a trap composed of 75 places in 199 ms of which 3 ms to minimize.
[2024-05-23 00:43:40] [INFO ] Deduced a trap composed of 61 places in 202 ms of which 3 ms to minimize.
[2024-05-23 00:43:40] [INFO ] Deduced a trap composed of 86 places in 195 ms of which 3 ms to minimize.
[2024-05-23 00:43:41] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 4 ms to minimize.
[2024-05-23 00:43:42] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 3 ms to minimize.
[2024-05-23 00:43:42] [INFO ] Deduced a trap composed of 78 places in 158 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-23 00:43:45] [INFO ] Deduced a trap composed of 87 places in 159 ms of which 3 ms to minimize.
[2024-05-23 00:43:45] [INFO ] Deduced a trap composed of 79 places in 170 ms of which 3 ms to minimize.
[2024-05-23 00:43:46] [INFO ] Deduced a trap composed of 109 places in 208 ms of which 4 ms to minimize.
[2024-05-23 00:43:46] [INFO ] Deduced a trap composed of 74 places in 159 ms of which 3 ms to minimize.
[2024-05-23 00:43:46] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 3 ms to minimize.
[2024-05-23 00:43:47] [INFO ] Deduced a trap composed of 71 places in 209 ms of which 3 ms to minimize.
[2024-05-23 00:43:47] [INFO ] Deduced a trap composed of 85 places in 188 ms of which 3 ms to minimize.
[2024-05-23 00:43:47] [INFO ] Deduced a trap composed of 101 places in 195 ms of which 4 ms to minimize.
[2024-05-23 00:43:47] [INFO ] Deduced a trap composed of 100 places in 148 ms of which 4 ms to minimize.
[2024-05-23 00:43:47] [INFO ] Deduced a trap composed of 73 places in 202 ms of which 3 ms to minimize.
[2024-05-23 00:43:48] [INFO ] Deduced a trap composed of 80 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:43:48] [INFO ] Deduced a trap composed of 79 places in 197 ms of which 3 ms to minimize.
[2024-05-23 00:43:48] [INFO ] Deduced a trap composed of 81 places in 149 ms of which 4 ms to minimize.
[2024-05-23 00:43:48] [INFO ] Deduced a trap composed of 132 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:43:49] [INFO ] Deduced a trap composed of 56 places in 162 ms of which 3 ms to minimize.
[2024-05-23 00:43:49] [INFO ] Deduced a trap composed of 66 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:43:49] [INFO ] Deduced a trap composed of 82 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:43:49] [INFO ] Deduced a trap composed of 76 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:43:49] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 3 ms to minimize.
[2024-05-23 00:43:50] [INFO ] Deduced a trap composed of 102 places in 212 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 274/447 variables, 173/303 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 30/333 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 601 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 173/173 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 115/115 constraints]
After SMT, in 60331ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 60336ms
Starting structural reductions in LTL mode, iteration 1 : 173/209 places, 274/580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61387 ms. Remains : 173/209 places, 274/580 transitions.
[2024-05-23 00:43:59] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:43:59] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:43:59] [INFO ] Input system was already deterministic with 274 transitions.
[2024-05-23 00:43:59] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:43:59] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:43:59] [INFO ] Time to serialize gal into /tmp/CTLFireability18122709958377507524.gal : 5 ms
[2024-05-23 00:43:59] [INFO ] Time to serialize properties into /tmp/CTLFireability12149607724383389213.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18122709958377507524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12149607724383389213.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.21412e+06,10.5405,231284,2,38154,5,657339,6,0,969,431178,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-23 00:44:29] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:44:29] [INFO ] Applying decomposition
[2024-05-23 00:44:29] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13187504686332027627.txt' '-o' '/tmp/graph13187504686332027627.bin' '-w' '/tmp/graph13187504686332027627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13187504686332027627.bin' '-l' '-1' '-v' '-w' '/tmp/graph13187504686332027627.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:44:29] [INFO ] Decomposing Gal with order
[2024-05-23 00:44:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:44:29] [INFO ] Removed a total of 381 redundant transitions.
[2024-05-23 00:44:29] [INFO ] Flatten gal took : 24 ms
[2024-05-23 00:44:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2024-05-23 00:44:29] [INFO ] Time to serialize gal into /tmp/CTLFireability12889695080160620698.gal : 3 ms
[2024-05-23 00:44:29] [INFO ] Time to serialize properties into /tmp/CTLFireability7704007971159996284.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12889695080160620698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7704007971159996284.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21412e+06,5.41707,106776,5985,2992,159456,23206,661,287254,334,148486,0
Converting to forward existential form...Done !
original formula: A(!(EF((AF(((i2.u1.next_1==1)&&(i3.u26.ncs_2_4==1))) + AX(((u0.slot_F.F.F.F.F.F==1)&&(i8.u17.cs_0_1==1)))))) U !(A(AG(!(EF((u28.p1_2_2==1...296
=> equivalent forward existential formula: [((Init * !(EG(!(!(!((E(!(!(!((E(!(((i2.u4.next_7==1)&&(i3.u7.p1_1_5==1))) U (!((((i2.u1.next_0==1)&&(i5.u13.ncs...2595
Reverse transition relation is NOT exact ! Due to transitions t120, t121, t122, t132, t133, t134, t239, t240, t242, t251, t252, t253, t254, t255, t256, t25...511
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 : 209/209 places, 580/580 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 172 transition count 273
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 172 transition count 273
Applied a total of 74 rules in 8 ms. Remains 172 /209 variables (removed 37) and now considering 273/580 (removed 307) transitions.
// Phase 1: matrix 273 rows 172 cols
[2024-05-23 00:44:59] [INFO ] Computed 15 invariants in 3 ms
[2024-05-23 00:44:59] [INFO ] Implicit Places using invariants in 186 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 187 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 171/209 places, 273/580 transitions.
Applied a total of 0 rules in 1 ms. Remains 171 /171 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 197 ms. Remains : 171/209 places, 273/580 transitions.
[2024-05-23 00:44:59] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:44:59] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:44:59] [INFO ] Input system was already deterministic with 273 transitions.
[2024-05-23 00:44:59] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:45:00] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:45:00] [INFO ] Time to serialize gal into /tmp/CTLFireability3117353915775703833.gal : 2 ms
[2024-05-23 00:45:00] [INFO ] Time to serialize properties into /tmp/CTLFireability10508838189320269289.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3117353915775703833.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10508838189320269289.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16328e+06,2.95442,81776,2,25440,5,244504,6,0,960,179315,0
Converting to forward existential form...Done !
original formula: A(!(AX(((!(AG(((next_7==1)&&(ncs_2_0==1)))) * (next_10==1)) * (ncs_4_5==1)))) U ((next_5==1)&&(ncs_0_3==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((next_5==1)&&(ncs_0_3==1)))))) * !(E(!(((next_5==1)&&(ncs_0_3==1))) U (!(!(!(EX(!(((!(!(E(TRUE...275
Reverse transition relation is NOT exact ! Due to transitions t237, t238, t239, t240, t241, t242, t243, t244, t245, t246, t247, t248, t249, t250, t251, t25...378
(forward)formula 0,0,21.9989,549040,1,0,524,2.36453e+06,578,285,7203,1.09865e+06,572
FORMULA Anderson-PT-06-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 179 transition count 340
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 179 transition count 340
Applied a total of 60 rules in 4 ms. Remains 179 /209 variables (removed 30) and now considering 340/580 (removed 240) transitions.
// Phase 1: matrix 340 rows 179 cols
[2024-05-23 00:45:22] [INFO ] Computed 15 invariants in 3 ms
[2024-05-23 00:45:22] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-23 00:45:22] [INFO ] Invariant cache hit.
[2024-05-23 00:45:22] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:45:22] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
Running 334 sub problems to find dead transitions.
[2024-05-23 00:45:23] [INFO ] Invariant cache hit.
[2024-05-23 00:45:23] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-23 00:45:26] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 4 ms to minimize.
[2024-05-23 00:45:26] [INFO ] Deduced a trap composed of 91 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:45:26] [INFO ] Deduced a trap composed of 94 places in 210 ms of which 3 ms to minimize.
[2024-05-23 00:45:26] [INFO ] Deduced a trap composed of 69 places in 212 ms of which 4 ms to minimize.
[2024-05-23 00:45:27] [INFO ] Deduced a trap composed of 122 places in 145 ms of which 2 ms to minimize.
[2024-05-23 00:45:27] [INFO ] Deduced a trap composed of 68 places in 190 ms of which 3 ms to minimize.
[2024-05-23 00:45:27] [INFO ] Deduced a trap composed of 64 places in 212 ms of which 4 ms to minimize.
[2024-05-23 00:45:27] [INFO ] Deduced a trap composed of 64 places in 206 ms of which 3 ms to minimize.
[2024-05-23 00:45:28] [INFO ] Deduced a trap composed of 58 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:45:28] [INFO ] Deduced a trap composed of 99 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:45:28] [INFO ] Deduced a trap composed of 104 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:45:28] [INFO ] Deduced a trap composed of 62 places in 256 ms of which 3 ms to minimize.
[2024-05-23 00:45:28] [INFO ] Deduced a trap composed of 87 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:45:29] [INFO ] Deduced a trap composed of 100 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:45:29] [INFO ] Deduced a trap composed of 118 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:45:29] [INFO ] Deduced a trap composed of 54 places in 205 ms of which 3 ms to minimize.
[2024-05-23 00:45:30] [INFO ] Deduced a trap composed of 71 places in 199 ms of which 3 ms to minimize.
[2024-05-23 00:45:30] [INFO ] Deduced a trap composed of 60 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:45:30] [INFO ] Deduced a trap composed of 88 places in 188 ms of which 4 ms to minimize.
[2024-05-23 00:45:31] [INFO ] Deduced a trap composed of 75 places in 182 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-23 00:45:32] [INFO ] Deduced a trap composed of 74 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:45:32] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 3 ms to minimize.
[2024-05-23 00:45:33] [INFO ] Deduced a trap composed of 67 places in 198 ms of which 4 ms to minimize.
[2024-05-23 00:45:33] [INFO ] Deduced a trap composed of 92 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:45:33] [INFO ] Deduced a trap composed of 100 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:45:33] [INFO ] Deduced a trap composed of 85 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:45:33] [INFO ] Deduced a trap composed of 85 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:45:34] [INFO ] Deduced a trap composed of 82 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:45:34] [INFO ] Deduced a trap composed of 77 places in 170 ms of which 3 ms to minimize.
[2024-05-23 00:45:34] [INFO ] Deduced a trap composed of 61 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:45:34] [INFO ] Deduced a trap composed of 85 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:45:35] [INFO ] Deduced a trap composed of 88 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:45:35] [INFO ] Deduced a trap composed of 70 places in 172 ms of which 2 ms to minimize.
[2024-05-23 00:45:35] [INFO ] Deduced a trap composed of 84 places in 173 ms of which 3 ms to minimize.
[2024-05-23 00:45:35] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 2 ms to minimize.
[2024-05-23 00:45:35] [INFO ] Deduced a trap composed of 71 places in 227 ms of which 3 ms to minimize.
[2024-05-23 00:45:36] [INFO ] Deduced a trap composed of 61 places in 209 ms of which 3 ms to minimize.
[2024-05-23 00:45:36] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 2 ms to minimize.
[2024-05-23 00:45:36] [INFO ] Deduced a trap composed of 83 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:45:36] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-23 00:45:40] [INFO ] Deduced a trap composed of 71 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:45:40] [INFO ] Deduced a trap composed of 61 places in 195 ms of which 3 ms to minimize.
[2024-05-23 00:45:41] [INFO ] Deduced a trap composed of 76 places in 195 ms of which 3 ms to minimize.
[2024-05-23 00:45:42] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 3 ms to minimize.
[2024-05-23 00:45:42] [INFO ] Deduced a trap composed of 64 places in 152 ms of which 3 ms to minimize.
[2024-05-23 00:45:42] [INFO ] Deduced a trap composed of 74 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:45:42] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 2 ms to minimize.
[2024-05-23 00:45:42] [INFO ] Deduced a trap composed of 63 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:45:42] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 2 ms to minimize.
[2024-05-23 00:45:43] [INFO ] Deduced a trap composed of 86 places in 204 ms of which 3 ms to minimize.
[2024-05-23 00:45:43] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 3 ms to minimize.
[2024-05-23 00:45:43] [INFO ] Deduced a trap composed of 89 places in 211 ms of which 3 ms to minimize.
[2024-05-23 00:45:43] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 2 ms to minimize.
[2024-05-23 00:45:44] [INFO ] Deduced a trap composed of 85 places in 209 ms of which 3 ms to minimize.
[2024-05-23 00:45:44] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-23 00:45:45] [INFO ] Deduced a trap composed of 81 places in 178 ms of which 3 ms to minimize.
[2024-05-23 00:45:46] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 3 ms to minimize.
[2024-05-23 00:45:48] [INFO ] Deduced a trap composed of 58 places in 199 ms of which 3 ms to minimize.
[2024-05-23 00:45:48] [INFO ] Deduced a trap composed of 58 places in 201 ms of which 3 ms to minimize.
[2024-05-23 00:45:48] [INFO ] Deduced a trap composed of 60 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:45:49] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:45:49] [INFO ] Deduced a trap composed of 88 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:45:49] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:45:49] [INFO ] Deduced a trap composed of 59 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:45:50] [INFO ] Deduced a trap composed of 102 places in 192 ms of which 3 ms to minimize.
[2024-05-23 00:45:50] [INFO ] Deduced a trap composed of 102 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:45:50] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:45:51] [INFO ] Deduced a trap composed of 83 places in 174 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 13/83 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-23 00:45:52] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-05-23 00:45:52] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 2 ms to minimize.
[2024-05-23 00:45:52] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 3 ms to minimize.
[2024-05-23 00:45:53] [INFO ] Deduced a trap composed of 79 places in 185 ms of which 3 ms to minimize.
SMT process timed out in 30317ms, After SMT, problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 30324ms
Starting structural reductions in LTL mode, iteration 1 : 179/209 places, 340/580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31148 ms. Remains : 179/209 places, 340/580 transitions.
[2024-05-23 00:45:53] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:45:53] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:45:53] [INFO ] Input system was already deterministic with 340 transitions.
[2024-05-23 00:45:53] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:45:53] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:45:53] [INFO ] Time to serialize gal into /tmp/CTLFireability2152143078391385258.gal : 3 ms
[2024-05-23 00:45:53] [INFO ] Time to serialize properties into /tmp/CTLFireability5123391785130192690.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2152143078391385258.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5123391785130192690.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-23 00:46:23] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:46:23] [INFO ] Applying decomposition
[2024-05-23 00:46:23] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph9469703063002280182.txt' '-o' '/tmp/graph9469703063002280182.bin' '-w' '/tmp/graph9469703063002280182.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9469703063002280182.bin' '-l' '-1' '-v' '-w' '/tmp/graph9469703063002280182.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:46:23] [INFO ] Decomposing Gal with order
[2024-05-23 00:46:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:46:23] [INFO ] Removed a total of 568 redundant transitions.
[2024-05-23 00:46:23] [INFO ] Flatten gal took : 31 ms
[2024-05-23 00:46:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 3 ms.
[2024-05-23 00:46:23] [INFO ] Time to serialize gal into /tmp/CTLFireability7902606743348509504.gal : 15 ms
[2024-05-23 00:46:23] [INFO ] Time to serialize properties into /tmp/CTLFireability15044986170880961202.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7902606743348509504.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15044986170880961202.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.93866e+06,10.7284,198016,4160,4754,167423,65777,841,665734,417,1.4095e+06,0
Converting to forward existential form...Done !
original formula: !(A((((!((AG((i12.u38.p1_4_7==1)) + A(((i0.i1.u4.next_6==1)&&(i1.u8.ncs_0_2==1)) U ((i3.u0.slot_F.F.F.F.F.F==1)&&(i3.u0.cs_5_1==1))))) + ...715
=> equivalent forward existential formula: ([((FwdU(Init,!(!(!(EG(!(!(E(((i0.i0.u1.next_1==1)&&(i12.u25.ncs_4_3==1)) U ((i0.i1.u4.next_7==1)&&(i2.u40.ncs_5...1175
Reverse transition relation is NOT exact ! Due to transitions t173, t174, t175, t176, t185, t186, t187, t188, t304, t306, t308, t309, t323, t324, t326, t32...452
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 172 transition count 273
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 172 transition count 273
Applied a total of 74 rules in 5 ms. Remains 172 /209 variables (removed 37) and now considering 273/580 (removed 307) transitions.
// Phase 1: matrix 273 rows 172 cols
[2024-05-23 00:46:53] [INFO ] Computed 15 invariants in 3 ms
[2024-05-23 00:46:53] [INFO ] Implicit Places using invariants in 196 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 199 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 171/209 places, 273/580 transitions.
Applied a total of 0 rules in 1 ms. Remains 171 /171 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 209 ms. Remains : 171/209 places, 273/580 transitions.
[2024-05-23 00:46:53] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:46:53] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:46:53] [INFO ] Input system was already deterministic with 273 transitions.
[2024-05-23 00:46:53] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:46:53] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:46:53] [INFO ] Time to serialize gal into /tmp/CTLFireability2515162861260972539.gal : 2 ms
[2024-05-23 00:46:53] [INFO ] Time to serialize properties into /tmp/CTLFireability5068067439023741862.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2515162861260972539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5068067439023741862.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16328e+06,2.81222,80100,2,25349,5,235529,6,0,960,178077,0
Converting to forward existential form...Done !
original formula: EG(EF((((next_7==0)||(ncs_3_0==0)) * (AX(((next_0==0)||(ncs_1_4==0))) + AF(((next_4==0)||(ncs_5_2==0)))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((next_7==0)||(ncs_3_0==0)) * (!(EX(!(((next_0==0)||(ncs_1_4==0))))) + !(EG(!(((next_4==0)|...186
Reverse transition relation is NOT exact ! Due to transitions t237, t238, t239, t240, t241, t242, t243, t244, t245, t246, t247, t248, t249, t250, t251, t25...378
(forward)formula 0,1,27.5321,617352,1,0,601,2.9539e+06,579,315,7377,1.27839e+06,688
FORMULA Anderson-PT-06-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 179 transition count 330
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 179 transition count 330
Applied a total of 60 rules in 4 ms. Remains 179 /209 variables (removed 30) and now considering 330/580 (removed 250) transitions.
// Phase 1: matrix 330 rows 179 cols
[2024-05-23 00:47:21] [INFO ] Computed 15 invariants in 4 ms
[2024-05-23 00:47:22] [INFO ] Implicit Places using invariants in 342 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 344 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 178/209 places, 330/580 transitions.
Applied a total of 0 rules in 2 ms. Remains 178 /178 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 350 ms. Remains : 178/209 places, 330/580 transitions.
[2024-05-23 00:47:22] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:47:22] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:47:22] [INFO ] Input system was already deterministic with 330 transitions.
[2024-05-23 00:47:22] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:47:22] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:47:22] [INFO ] Time to serialize gal into /tmp/CTLFireability7864735026740410052.gal : 1 ms
[2024-05-23 00:47:22] [INFO ] Time to serialize properties into /tmp/CTLFireability15666878553575450089.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7864735026740410052.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15666878553575450089.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.86073e+06,9.079,174512,2,32440,5,488669,6,0,1045,410568,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-23 00:47:52] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:47:52] [INFO ] Applying decomposition
[2024-05-23 00:47:52] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15036285300900160213.txt' '-o' '/tmp/graph15036285300900160213.bin' '-w' '/tmp/graph15036285300900160213.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15036285300900160213.bin' '-l' '-1' '-v' '-w' '/tmp/graph15036285300900160213.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:47:52] [INFO ] Decomposing Gal with order
[2024-05-23 00:47:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:47:52] [INFO ] Removed a total of 631 redundant transitions.
[2024-05-23 00:47:52] [INFO ] Flatten gal took : 35 ms
[2024-05-23 00:47:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 14 ms.
[2024-05-23 00:47:52] [INFO ] Time to serialize gal into /tmp/CTLFireability5001314878917504260.gal : 7 ms
[2024-05-23 00:47:52] [INFO ] Time to serialize properties into /tmp/CTLFireability14170755586986851817.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5001314878917504260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14170755586986851817.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.86073e+06,2.93388,58676,5386,27,122559,167,958,89117,39,350,0
Converting to forward existential form...Done !
original formula: (EX(((i5.i2.u48.slot_F.F.F.T.F.F==1)&&(i5.i2.u58.p3_5_3==1))) + E((!(EX((((i0.i1.u2.next_6==1)&&(i0.i1.u43.p1_5_5==1))||((i0.i0.u0.next_1...662
=> equivalent forward existential formula: ([(EY(Init) * ((i5.i2.u48.slot_F.F.F.T.F.F==1)&&(i5.i2.u58.p3_5_3==1)))] != FALSE + [(FwdU(Init,(!(EX((((i0.i1.u...867
Reverse transition relation is NOT exact ! Due to transitions t162, t163, t164, t165, t168, t169, t170, t171, t179, t180, t181, t182, t183, t294, t295, t29...528
(forward)formula 0,0,7.95543,178268,1,0,287754,250,4809,331542,181,856,1640504
FORMULA Anderson-PT-06-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 174 transition count 295
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 174 transition count 295
Applied a total of 70 rules in 4 ms. Remains 174 /209 variables (removed 35) and now considering 295/580 (removed 285) transitions.
// Phase 1: matrix 295 rows 174 cols
[2024-05-23 00:48:00] [INFO ] Computed 15 invariants in 6 ms
[2024-05-23 00:48:00] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-23 00:48:00] [INFO ] Invariant cache hit.
[2024-05-23 00:48:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:48:01] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2024-05-23 00:48:01] [INFO ] Invariant cache hit.
[2024-05-23 00:48:01] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-23 00:48:03] [INFO ] Deduced a trap composed of 57 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:48:04] [INFO ] Deduced a trap composed of 82 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:48:04] [INFO ] Deduced a trap composed of 84 places in 171 ms of which 3 ms to minimize.
[2024-05-23 00:48:05] [INFO ] Deduced a trap composed of 114 places in 219 ms of which 3 ms to minimize.
[2024-05-23 00:48:05] [INFO ] Deduced a trap composed of 68 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:48:06] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 2 ms to minimize.
[2024-05-23 00:48:06] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 2 ms to minimize.
[2024-05-23 00:48:06] [INFO ] Deduced a trap composed of 113 places in 147 ms of which 2 ms to minimize.
[2024-05-23 00:48:06] [INFO ] Deduced a trap composed of 94 places in 178 ms of which 2 ms to minimize.
[2024-05-23 00:48:07] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-23 00:48:07] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 3 ms to minimize.
[2024-05-23 00:48:08] [INFO ] Deduced a trap composed of 70 places in 195 ms of which 3 ms to minimize.
[2024-05-23 00:48:08] [INFO ] Deduced a trap composed of 99 places in 194 ms of which 3 ms to minimize.
[2024-05-23 00:48:08] [INFO ] Deduced a trap composed of 98 places in 198 ms of which 3 ms to minimize.
[2024-05-23 00:48:08] [INFO ] Deduced a trap composed of 79 places in 204 ms of which 3 ms to minimize.
[2024-05-23 00:48:09] [INFO ] Deduced a trap composed of 82 places in 194 ms of which 3 ms to minimize.
[2024-05-23 00:48:09] [INFO ] Deduced a trap composed of 102 places in 217 ms of which 3 ms to minimize.
[2024-05-23 00:48:09] [INFO ] Deduced a trap composed of 96 places in 158 ms of which 3 ms to minimize.
[2024-05-23 00:48:09] [INFO ] Deduced a trap composed of 76 places in 160 ms of which 3 ms to minimize.
[2024-05-23 00:48:09] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 2 ms to minimize.
[2024-05-23 00:48:09] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 2 ms to minimize.
[2024-05-23 00:48:10] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:48:10] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
[2024-05-23 00:48:10] [INFO ] Deduced a trap composed of 87 places in 180 ms of which 4 ms to minimize.
[2024-05-23 00:48:10] [INFO ] Deduced a trap composed of 93 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:48:10] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 3 ms to minimize.
[2024-05-23 00:48:11] [INFO ] Deduced a trap composed of 82 places in 188 ms of which 3 ms to minimize.
[2024-05-23 00:48:11] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 3 ms to minimize.
[2024-05-23 00:48:11] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 2 ms to minimize.
[2024-05-23 00:48:11] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-23 00:48:14] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 3 ms to minimize.
[2024-05-23 00:48:14] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 3 ms to minimize.
[2024-05-23 00:48:14] [INFO ] Deduced a trap composed of 61 places in 186 ms of which 2 ms to minimize.
[2024-05-23 00:48:15] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:48:16] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:48:17] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:48:17] [INFO ] Deduced a trap composed of 96 places in 190 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-23 00:48:19] [INFO ] Deduced a trap composed of 71 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:48:20] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:48:20] [INFO ] Deduced a trap composed of 78 places in 208 ms of which 3 ms to minimize.
[2024-05-23 00:48:20] [INFO ] Deduced a trap composed of 98 places in 218 ms of which 3 ms to minimize.
[2024-05-23 00:48:21] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 3 ms to minimize.
[2024-05-23 00:48:21] [INFO ] Deduced a trap composed of 79 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:48:21] [INFO ] Deduced a trap composed of 89 places in 191 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-23 00:48:22] [INFO ] Deduced a trap composed of 89 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:48:23] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 4 ms to minimize.
[2024-05-23 00:48:23] [INFO ] Deduced a trap composed of 98 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:48:23] [INFO ] Deduced a trap composed of 97 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:48:23] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 4 ms to minimize.
[2024-05-23 00:48:23] [INFO ] Deduced a trap composed of 74 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:48:24] [INFO ] Deduced a trap composed of 107 places in 219 ms of which 4 ms to minimize.
[2024-05-23 00:48:25] [INFO ] Deduced a trap composed of 73 places in 215 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-23 00:48:29] [INFO ] Deduced a trap composed of 75 places in 217 ms of which 4 ms to minimize.
[2024-05-23 00:48:30] [INFO ] Deduced a trap composed of 106 places in 213 ms of which 3 ms to minimize.
[2024-05-23 00:48:30] [INFO ] Deduced a trap composed of 107 places in 200 ms of which 3 ms to minimize.
[2024-05-23 00:48:30] [INFO ] Deduced a trap composed of 72 places in 205 ms of which 3 ms to minimize.
[2024-05-23 00:48:30] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 3 ms to minimize.
[2024-05-23 00:48:31] [INFO ] Deduced a trap composed of 102 places in 197 ms of which 3 ms to minimize.
SMT process timed out in 30249ms, After SMT, problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 30253ms
Starting structural reductions in LTL mode, iteration 1 : 174/209 places, 295/580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31057 ms. Remains : 174/209 places, 295/580 transitions.
[2024-05-23 00:48:31] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:48:31] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:48:31] [INFO ] Input system was already deterministic with 295 transitions.
[2024-05-23 00:48:31] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:48:31] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:48:31] [INFO ] Time to serialize gal into /tmp/CTLFireability8790709194993032092.gal : 3 ms
[2024-05-23 00:48:31] [INFO ] Time to serialize properties into /tmp/CTLFireability12858372690139851402.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8790709194993032092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12858372690139851402.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.3667e+06,21.9478,532884,2,81448,5,2.0829e+06,6,0,994,672813,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-23 00:49:01] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:49:01] [INFO ] Applying decomposition
[2024-05-23 00:49:01] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14873558783290764067.txt' '-o' '/tmp/graph14873558783290764067.bin' '-w' '/tmp/graph14873558783290764067.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14873558783290764067.bin' '-l' '-1' '-v' '-w' '/tmp/graph14873558783290764067.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:49:01] [INFO ] Decomposing Gal with order
[2024-05-23 00:49:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:49:01] [INFO ] Removed a total of 434 redundant transitions.
[2024-05-23 00:49:01] [INFO ] Flatten gal took : 33 ms
[2024-05-23 00:49:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 18 ms.
[2024-05-23 00:49:01] [INFO ] Time to serialize gal into /tmp/CTLFireability16875372076286823893.gal : 5 ms
[2024-05-23 00:49:01] [INFO ] Time to serialize properties into /tmp/CTLFireability15393801383674299721.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16875372076286823893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15393801383674299721.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.3667e+06,1.44078,35916,2039,2544,40946,18913,660,35769,379,183854,0
Converting to forward existential form...Done !
original formula: EF(EX(((E((EF(((i2.i0.u1.next_0==1)&&(i8.u26.ncs_0_2==1))) + !(((i2.i1.u4.next_9==1)&&(i9.u10.ncs_1_4==1)))) U (((AX(((i2.i0.u1.next_1==1...421
=> equivalent forward existential formula: (([((((FwdU(EY(FwdU(Init,TRUE)),(E(TRUE U ((i2.i0.u1.next_0==1)&&(i8.u26.ncs_0_2==1))) + !(((i2.i1.u4.next_9==1)...556
Reverse transition relation is NOT exact ! Due to transitions t259, t260, t261, t264, t269, t270, t277, t280, t282, t283, t285, t286, t287, t289, t294, u0....306
(forward)formula 0,1,6.43032,172724,1,0,140356,219478,3004,222090,2088,1.70771e+06,483616
FORMULA Anderson-PT-06-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-23 00:49:08] [INFO ] Flatten gal took : 16 ms
[2024-05-23 00:49:08] [INFO ] Flatten gal took : 16 ms
[2024-05-23 00:49:08] [INFO ] Applying decomposition
[2024-05-23 00:49:08] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph850265451938914035.txt' '-o' '/tmp/graph850265451938914035.bin' '-w' '/tmp/graph850265451938914035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph850265451938914035.bin' '-l' '-1' '-v' '-w' '/tmp/graph850265451938914035.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:49:08] [INFO ] Decomposing Gal with order
[2024-05-23 00:49:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:49:08] [INFO ] Removed a total of 639 redundant transitions.
[2024-05-23 00:49:08] [INFO ] Flatten gal took : 54 ms
[2024-05-23 00:49:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 540 labels/synchronizations in 13 ms.
[2024-05-23 00:49:08] [INFO ] Time to serialize gal into /tmp/CTLFireability10053348518859036933.gal : 4 ms
[2024-05-23 00:49:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15992503954379877048.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10053348518859036933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15992503954379877048.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 2 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.32237e+07,42.4442,750736,6395,5445,1.14995e+06,111162,761,1.61946e+06,740,1.4543e+06,0
Converting to forward existential form...Done !
original formula: A(!(EF((AF(((i1.u1.next_1==1)&&(i2.u3.ncs_2_4==1))) + AX(((u0.slot_F.F.F.F.F.F==1)&&(u0.cs_0_1==1)))))) U !(A(AG(!(EF((i2.u7.p1_2_2==1)))...291
=> equivalent forward existential formula: [((Init * !(EG(!(!(!((E(!(!(!((E(!(((i2.u3.next_7==1)&&(i3.u6.p1_1_5==1))) U (!((((i1.u1.next_0==1)&&(i1.u1.ncs_...2578
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t6, t7, t13, t14, t15, t16, t90, t93, t100, t102, t103, t106, t110, t116, t132, t133,...1361
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 6
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,95.1366,1444564,1,0,2.93396e+06,389725,3546,2.46896e+06,4393,1.98321e+06,7758442
FORMULA Anderson-PT-06-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: !(A((((!((AG((i1.u1.p1_4_7==1)) + A(((i2.u3.next_6==1)&&(i6.u4.ncs_0_2==1)) U ((u0.slot_F.F.F.F.F.F==1)&&(u0.cs_5_1==1))))) + ((i5.u2.nex...662
=> equivalent forward existential formula: ([((FwdU(Init,!(!(!(EG(!(!(E(((i1.u1.next_1==1)&&(i1.u1.ncs_4_3==1)) U ((i2.u3.next_7==1)&&(i5.u2.ncs_5_5==1))))...1092
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 1,1,164.703,2213168,1,0,4.24855e+06,463702,2283,3.90264e+06,2177,3.00461e+06,1755115
FORMULA Anderson-PT-06-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Total runtime 1106038 ms.
BK_STOP 1716425513785
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-06"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Anderson-PT-06, 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 r004-smll-171620118300330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-06.tgz
mv Anderson-PT-06 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 ;