Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 22:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 22:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-04b-CTLFireability-2024-00
FORMULA_NAME AutoFlight-PT-04b-CTLFireability-2024-01
FORMULA_NAME AutoFlight-PT-04b-CTLFireability-2024-02
FORMULA_NAME AutoFlight-PT-04b-CTLFireability-2024-03
FORMULA_NAME AutoFlight-PT-04b-CTLFireability-2024-04
FORMULA_NAME AutoFlight-PT-04b-CTLFireability-2024-05
FORMULA_NAME AutoFlight-PT-04b-CTLFireability-2024-06
FORMULA_NAME AutoFlight-PT-04b-CTLFireability-2024-07
FORMULA_NAME AutoFlight-PT-04b-CTLFireability-2024-08
FORMULA_NAME AutoFlight-PT-04b-CTLFireability-2024-09
FORMULA_NAME AutoFlight-PT-04b-CTLFireability-2024-10
FORMULA_NAME AutoFlight-PT-04b-CTLFireability-2024-11
FORMULA_NAME AutoFlight-PT-04b-CTLFireability-2023-12
FORMULA_NAME AutoFlight-PT-04b-CTLFireability-2023-13
FORMULA_NAME AutoFlight-PT-04b-CTLFireability-2023-14
FORMULA_NAME AutoFlight-PT-04b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716253163667

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 00:59:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 00:59:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 00:59:26] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2024-05-21 00:59:26] [INFO ] Transformed 390 places.
[2024-05-21 00:59:26] [INFO ] Transformed 388 transitions.
[2024-05-21 00:59:26] [INFO ] Found NUPN structural information;
[2024-05-21 00:59:26] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 553 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 36 ms.
Support contains 139 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 388/388 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 370 transition count 368
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 370 transition count 368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 370 transition count 364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 364 transition count 358
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 364 transition count 358
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 362 transition count 356
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 362 transition count 356
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 360 transition count 354
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 360 transition count 354
Applied a total of 64 rules in 211 ms. Remains 360 /390 variables (removed 30) and now considering 354/388 (removed 34) transitions.
// Phase 1: matrix 354 rows 360 cols
[2024-05-21 00:59:26] [INFO ] Computed 28 invariants in 40 ms
[2024-05-21 00:59:27] [INFO ] Implicit Places using invariants in 603 ms returned []
[2024-05-21 00:59:27] [INFO ] Invariant cache hit.
[2024-05-21 00:59:27] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 1323 ms to find 0 implicit places.
Running 353 sub problems to find dead transitions.
[2024-05-21 00:59:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-05-21 00:59:36] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 32 ms to minimize.
[2024-05-21 00:59:36] [INFO ] Deduced a trap composed of 78 places in 173 ms of which 5 ms to minimize.
[2024-05-21 00:59:36] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 9 ms to minimize.
[2024-05-21 00:59:36] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-05-21 00:59:36] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-05-21 00:59:37] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 3 ms to minimize.
[2024-05-21 00:59:37] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-05-21 00:59:37] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 2 ms to minimize.
[2024-05-21 00:59:37] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-21 00:59:37] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 4 ms to minimize.
[2024-05-21 00:59:37] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 4 ms to minimize.
[2024-05-21 00:59:37] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 3 ms to minimize.
[2024-05-21 00:59:37] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 3 ms to minimize.
[2024-05-21 00:59:38] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 3 ms to minimize.
[2024-05-21 00:59:38] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 3 ms to minimize.
[2024-05-21 00:59:38] [INFO ] Deduced a trap composed of 63 places in 193 ms of which 5 ms to minimize.
[2024-05-21 00:59:38] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 4 ms to minimize.
[2024-05-21 00:59:38] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 3 ms to minimize.
[2024-05-21 00:59:39] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 3 ms to minimize.
[2024-05-21 00:59:39] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-05-21 00:59:43] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 4 ms to minimize.
[2024-05-21 00:59:43] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 4 ms to minimize.
[2024-05-21 00:59:43] [INFO ] Deduced a trap composed of 60 places in 178 ms of which 4 ms to minimize.
[2024-05-21 00:59:43] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 4 ms to minimize.
[2024-05-21 00:59:44] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 4 ms to minimize.
[2024-05-21 00:59:44] [INFO ] Deduced a trap composed of 23 places in 347 ms of which 6 ms to minimize.
[2024-05-21 00:59:44] [INFO ] Deduced a trap composed of 26 places in 353 ms of which 6 ms to minimize.
[2024-05-21 00:59:45] [INFO ] Deduced a trap composed of 19 places in 340 ms of which 6 ms to minimize.
[2024-05-21 00:59:45] [INFO ] Deduced a trap composed of 24 places in 327 ms of which 6 ms to minimize.
[2024-05-21 00:59:45] [INFO ] Deduced a trap composed of 70 places in 333 ms of which 6 ms to minimize.
[2024-05-21 00:59:46] [INFO ] Deduced a trap composed of 54 places in 289 ms of which 5 ms to minimize.
[2024-05-21 00:59:46] [INFO ] Deduced a trap composed of 56 places in 276 ms of which 5 ms to minimize.
[2024-05-21 00:59:46] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 6 ms to minimize.
[2024-05-21 00:59:47] [INFO ] Deduced a trap composed of 26 places in 286 ms of which 5 ms to minimize.
[2024-05-21 00:59:47] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 5 ms to minimize.
[2024-05-21 00:59:47] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 5 ms to minimize.
[2024-05-21 00:59:47] [INFO ] Deduced a trap composed of 61 places in 241 ms of which 5 ms to minimize.
[2024-05-21 00:59:48] [INFO ] Deduced a trap composed of 62 places in 237 ms of which 4 ms to minimize.
[2024-05-21 00:59:48] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 4 ms to minimize.
[2024-05-21 00:59:48] [INFO ] Deduced a trap composed of 57 places in 202 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-05-21 00:59:49] [INFO ] Deduced a trap composed of 53 places in 192 ms of which 4 ms to minimize.
[2024-05-21 00:59:49] [INFO ] Deduced a trap composed of 58 places in 209 ms of which 5 ms to minimize.
[2024-05-21 00:59:50] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 3 ms to minimize.
[2024-05-21 00:59:50] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 5 ms to minimize.
[2024-05-21 00:59:50] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 4 ms to minimize.
[2024-05-21 00:59:50] [INFO ] Deduced a trap composed of 67 places in 233 ms of which 5 ms to minimize.
[2024-05-21 00:59:51] [INFO ] Deduced a trap composed of 54 places in 212 ms of which 5 ms to minimize.
[2024-05-21 00:59:51] [INFO ] Deduced a trap composed of 50 places in 197 ms of which 4 ms to minimize.
[2024-05-21 00:59:51] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 4 ms to minimize.
[2024-05-21 00:59:51] [INFO ] Deduced a trap composed of 54 places in 201 ms of which 4 ms to minimize.
[2024-05-21 00:59:52] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 5 ms to minimize.
[2024-05-21 00:59:52] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 3 ms to minimize.
[2024-05-21 00:59:52] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 4 ms to minimize.
[2024-05-21 00:59:52] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 3 ms to minimize.
[2024-05-21 00:59:52] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 3 ms to minimize.
[2024-05-21 00:59:52] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 3 ms to minimize.
[2024-05-21 00:59:53] [INFO ] Deduced a trap composed of 60 places in 193 ms of which 10 ms to minimize.
[2024-05-21 00:59:53] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 4 ms to minimize.
[2024-05-21 00:59:53] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 4 ms to minimize.
[2024-05-21 00:59:53] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-05-21 00:59:54] [INFO ] Deduced a trap composed of 76 places in 150 ms of which 3 ms to minimize.
[2024-05-21 00:59:55] [INFO ] Deduced a trap composed of 61 places in 244 ms of which 4 ms to minimize.
[2024-05-21 00:59:55] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 5 ms to minimize.
[2024-05-21 00:59:56] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 3 ms to minimize.
[2024-05-21 00:59:56] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 4 ms to minimize.
[2024-05-21 00:59:56] [INFO ] Deduced a trap composed of 55 places in 148 ms of which 4 ms to minimize.
[2024-05-21 00:59:56] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 3 ms to minimize.
[2024-05-21 00:59:56] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 4 ms to minimize.
[2024-05-21 00:59:56] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 3 ms to minimize.
[2024-05-21 00:59:57] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 3 ms to minimize.
[2024-05-21 00:59:57] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 3 ms to minimize.
[2024-05-21 00:59:57] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-21 00:59:57] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-05-21 00:59:57] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 4 ms to minimize.
[2024-05-21 00:59:57] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/714 variables, and 103 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/360 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 75/75 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 75/103 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-05-21 01:00:03] [INFO ] Deduced a trap composed of 62 places in 164 ms of which 3 ms to minimize.
[2024-05-21 01:00:04] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 3 ms to minimize.
[2024-05-21 01:00:04] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 3 ms to minimize.
[2024-05-21 01:00:04] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 4 ms to minimize.
[2024-05-21 01:00:04] [INFO ] Deduced a trap composed of 64 places in 142 ms of which 4 ms to minimize.
[2024-05-21 01:00:04] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-05-21 01:00:04] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
[2024-05-21 01:00:04] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-21 01:00:05] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-05-21 01:00:05] [INFO ] Deduced a trap composed of 72 places in 218 ms of which 5 ms to minimize.
[2024-05-21 01:00:05] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 3 ms to minimize.
[2024-05-21 01:00:05] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 2 ms to minimize.
[2024-05-21 01:00:06] [INFO ] Deduced a trap composed of 58 places in 242 ms of which 5 ms to minimize.
[2024-05-21 01:00:06] [INFO ] Deduced a trap composed of 24 places in 245 ms of which 5 ms to minimize.
[2024-05-21 01:00:07] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 3 ms to minimize.
[2024-05-21 01:00:07] [INFO ] Deduced a trap composed of 86 places in 171 ms of which 4 ms to minimize.
[2024-05-21 01:00:07] [INFO ] Deduced a trap composed of 63 places in 153 ms of which 3 ms to minimize.
[2024-05-21 01:00:07] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 3 ms to minimize.
[2024-05-21 01:00:07] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 4 ms to minimize.
[2024-05-21 01:00:08] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-05-21 01:00:09] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
[2024-05-21 01:00:10] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 4 ms to minimize.
[2024-05-21 01:00:10] [INFO ] Deduced a trap composed of 67 places in 188 ms of which 4 ms to minimize.
[2024-05-21 01:00:10] [INFO ] Deduced a trap composed of 63 places in 172 ms of which 4 ms to minimize.
[2024-05-21 01:00:10] [INFO ] Deduced a trap composed of 73 places in 152 ms of which 4 ms to minimize.
[2024-05-21 01:00:10] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 3 ms to minimize.
[2024-05-21 01:00:11] [INFO ] Deduced a trap composed of 63 places in 159 ms of which 4 ms to minimize.
[2024-05-21 01:00:11] [INFO ] Deduced a trap composed of 60 places in 149 ms of which 3 ms to minimize.
[2024-05-21 01:00:11] [INFO ] Deduced a trap composed of 67 places in 215 ms of which 4 ms to minimize.
[2024-05-21 01:00:11] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-21 01:00:11] [INFO ] Deduced a trap composed of 63 places in 225 ms of which 6 ms to minimize.
[2024-05-21 01:00:12] [INFO ] Deduced a trap composed of 60 places in 221 ms of which 4 ms to minimize.
[2024-05-21 01:00:13] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-05-21 01:00:13] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 4 ms to minimize.
[2024-05-21 01:00:13] [INFO ] Deduced a trap composed of 60 places in 160 ms of which 4 ms to minimize.
[2024-05-21 01:00:13] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 3 ms to minimize.
[2024-05-21 01:00:14] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 4 ms to minimize.
[2024-05-21 01:00:14] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-05-21 01:00:14] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 2 ms to minimize.
[2024-05-21 01:00:14] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-05-21 01:00:15] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 5 ms to minimize.
[2024-05-21 01:00:15] [INFO ] Deduced a trap composed of 31 places in 230 ms of which 5 ms to minimize.
[2024-05-21 01:00:16] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 5 ms to minimize.
[2024-05-21 01:00:16] [INFO ] Deduced a trap composed of 55 places in 239 ms of which 5 ms to minimize.
[2024-05-21 01:00:17] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 5 ms to minimize.
[2024-05-21 01:00:17] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 4 ms to minimize.
[2024-05-21 01:00:17] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-21 01:00:19] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 2 ms to minimize.
[2024-05-21 01:00:19] [INFO ] Deduced a trap composed of 65 places in 185 ms of which 4 ms to minimize.
[2024-05-21 01:00:20] [INFO ] Deduced a trap composed of 79 places in 166 ms of which 4 ms to minimize.
[2024-05-21 01:00:20] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 4 ms to minimize.
[2024-05-21 01:00:20] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 3 ms to minimize.
[2024-05-21 01:00:20] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 3 ms to minimize.
[2024-05-21 01:00:20] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 2 ms to minimize.
[2024-05-21 01:00:21] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 15/158 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-05-21 01:00:23] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 4 ms to minimize.
[2024-05-21 01:00:23] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 3 ms to minimize.
[2024-05-21 01:00:24] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-05-21 01:00:24] [INFO ] Deduced a trap composed of 85 places in 200 ms of which 4 ms to minimize.
[2024-05-21 01:00:24] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 3 ms to minimize.
[2024-05-21 01:00:25] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 3 ms to minimize.
[2024-05-21 01:00:25] [INFO ] Deduced a trap composed of 58 places in 209 ms of which 4 ms to minimize.
[2024-05-21 01:00:25] [INFO ] Deduced a trap composed of 69 places in 215 ms of which 4 ms to minimize.
[2024-05-21 01:00:25] [INFO ] Deduced a trap composed of 63 places in 193 ms of which 4 ms to minimize.
[2024-05-21 01:00:25] [INFO ] Deduced a trap composed of 59 places in 196 ms of which 4 ms to minimize.
[2024-05-21 01:00:26] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 4 ms to minimize.
[2024-05-21 01:00:27] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 3 ms to minimize.
[2024-05-21 01:00:27] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 4 ms to minimize.
[2024-05-21 01:00:27] [INFO ] Deduced a trap composed of 76 places in 199 ms of which 4 ms to minimize.
[2024-05-21 01:00:28] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 4 ms to minimize.
[2024-05-21 01:00:28] [INFO ] Deduced a trap composed of 64 places in 185 ms of which 4 ms to minimize.
SMT process timed out in 60417ms, After SMT, problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 60459ms
Starting structural reductions in LTL mode, iteration 1 : 360/390 places, 354/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62043 ms. Remains : 360/390 places, 354/388 transitions.
Support contains 139 out of 360 places after structural reductions.
[2024-05-21 01:00:28] [INFO ] Flatten gal took : 118 ms
[2024-05-21 01:00:28] [INFO ] Flatten gal took : 45 ms
[2024-05-21 01:00:29] [INFO ] Input system was already deterministic with 354 transitions.
RANDOM walk for 40000 steps (195 resets) in 3053 ms. (13 steps per ms) remains 25/106 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
[2024-05-21 01:00:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp82 is UNSAT
At refinement iteration 1 (OVERLAPS) 296/341 variables, 27/27 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 19/360 variables, 1/28 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 354/714 variables, 360/388 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/714 variables, 0/388 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/714 variables, 0/388 constraints. Problems are: Problem set: 2 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 714/714 variables, and 388 constraints, problems are : Problem set: 2 solved, 23 unsolved in 1937 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 239/277 variables, 19/19 constraints. Problems are: Problem set: 2 solved, 23 unsolved
[2024-05-21 01:00:32] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-05-21 01:00:32] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-21 01:00:32] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
[2024-05-21 01:00:32] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-05-21 01:00:32] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 2 ms to minimize.
[2024-05-21 01:00:33] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-05-21 01:00:33] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-05-21 01:00:33] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 3 ms to minimize.
[2024-05-21 01:00:33] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 3 ms to minimize.
[2024-05-21 01:00:33] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 2 ms to minimize.
[2024-05-21 01:00:33] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 3 ms to minimize.
[2024-05-21 01:00:33] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 12/31 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 64/341 variables, 8/39 constraints. Problems are: Problem set: 2 solved, 23 unsolved
[2024-05-21 01:00:34] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 1/40 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 19/360 variables, 1/41 constraints. Problems are: Problem set: 2 solved, 23 unsolved
[2024-05-21 01:00:35] [INFO ] Deduced a trap composed of 46 places in 172 ms of which 4 ms to minimize.
[2024-05-21 01:00:35] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 4 ms to minimize.
[2024-05-21 01:00:35] [INFO ] Deduced a trap composed of 54 places in 188 ms of which 7 ms to minimize.
[2024-05-21 01:00:35] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 4 ms to minimize.
[2024-05-21 01:00:35] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 4 ms to minimize.
[2024-05-21 01:00:36] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 4 ms to minimize.
[2024-05-21 01:00:36] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 3 ms to minimize.
[2024-05-21 01:00:36] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 4 ms to minimize.
[2024-05-21 01:00:36] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 4 ms to minimize.
[2024-05-21 01:00:36] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 4 ms to minimize.
[2024-05-21 01:00:36] [INFO ] Deduced a trap composed of 86 places in 160 ms of which 4 ms to minimize.
[2024-05-21 01:00:37] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 4 ms to minimize.
[2024-05-21 01:00:37] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 4 ms to minimize.
SMT process timed out in 7021ms, After SMT, problems are : Problem set: 2 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 360 transition count 259
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 106 rules applied. Total rules applied 201 place count 265 transition count 248
Reduce places removed 6 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 16 rules applied. Total rules applied 217 place count 259 transition count 238
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 229 place count 249 transition count 236
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 229 place count 249 transition count 196
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 309 place count 209 transition count 196
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 325 place count 193 transition count 180
Iterating global reduction 4 with 16 rules applied. Total rules applied 341 place count 193 transition count 180
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 341 place count 193 transition count 174
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 353 place count 187 transition count 174
Performed 43 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 439 place count 144 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 440 place count 144 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 442 place count 143 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 446 place count 143 transition count 123
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 458 place count 143 transition count 111
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 470 place count 131 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 471 place count 130 transition count 110
Applied a total of 471 rules in 184 ms. Remains 130 /360 variables (removed 230) and now considering 110/354 (removed 244) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 130/360 places, 110/354 transitions.
RANDOM walk for 40000 steps (1125 resets) in 1415 ms. (28 steps per ms) remains 7/23 properties
BEST_FIRST walk for 40003 steps (204 resets) in 136 ms. (291 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (195 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (183 resets) in 117 ms. (339 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40001 steps (189 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (152 resets) in 65 ms. (606 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (172 resets) in 97 ms. (408 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (172 resets) in 93 ms. (425 steps per ms) remains 2/3 properties
// Phase 1: matrix 110 rows 130 cols
[2024-05-21 01:00:38] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 01:00:38] [INFO ] State equation strengthened by 23 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 71/108 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 21/129 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/130 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 110/240 variables, 130/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 23/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/240 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 130/130 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 71/108 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 01:00:38] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-21 01:00:38] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
[2024-05-21 01:00:38] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 21/129 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 01:00:38] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
[2024-05-21 01:00:38] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/130 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 01:00:38] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-21 01:00:38] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-21 01:00:38] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-21 01:00:39] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-21 01:00:39] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
[2024-05-21 01:00:39] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-05-21 01:00:39] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2024-05-21 01:00:39] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-21 01:00:39] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-21 01:00:39] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-21 01:00:39] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-05-21 01:00:39] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 3 ms to minimize.
[2024-05-21 01:00:39] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-21 01:00:39] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-05-21 01:00:39] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 2 ms to minimize.
[2024-05-21 01:00:40] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-05-21 01:00:40] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-05-21 01:00:40] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
[2024-05-21 01:00:40] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2024-05-21 01:00:40] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
Problem AtomicPropp71 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 20/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 01:00:40] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 1/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 110/240 variables, 130/184 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 23/207 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 1/208 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/240 variables, 0/208 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/240 variables, 0/208 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 208 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2072 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 130/130 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 26/26 constraints]
After SMT, in 2229ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 12 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-21 01:00:40] [INFO ] Flatten gal took : 36 ms
[2024-05-21 01:00:40] [INFO ] Flatten gal took : 35 ms
[2024-05-21 01:00:40] [INFO ] Input system was already deterministic with 354 transitions.
Computed a total of 106 stabilizing places and 106 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 354/354 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 326 transition count 320
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 326 transition count 320
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 72 place count 326 transition count 316
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 87 place count 311 transition count 301
Iterating global reduction 1 with 15 rules applied. Total rules applied 102 place count 311 transition count 301
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 309 transition count 299
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 309 transition count 299
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 307 transition count 297
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 307 transition count 297
Applied a total of 110 rules in 50 ms. Remains 307 /360 variables (removed 53) and now considering 297/354 (removed 57) transitions.
// Phase 1: matrix 297 rows 307 cols
[2024-05-21 01:00:40] [INFO ] Computed 28 invariants in 4 ms
[2024-05-21 01:00:40] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-21 01:00:40] [INFO ] Invariant cache hit.
[2024-05-21 01:00:41] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2024-05-21 01:00:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:00:47] [INFO ] Deduced a trap composed of 19 places in 284 ms of which 5 ms to minimize.
[2024-05-21 01:00:48] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 5 ms to minimize.
[2024-05-21 01:00:48] [INFO ] Deduced a trap composed of 53 places in 212 ms of which 4 ms to minimize.
[2024-05-21 01:00:48] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 5 ms to minimize.
[2024-05-21 01:00:48] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 4 ms to minimize.
[2024-05-21 01:00:48] [INFO ] Deduced a trap composed of 26 places in 245 ms of which 5 ms to minimize.
[2024-05-21 01:00:49] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-21 01:00:49] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 3 ms to minimize.
[2024-05-21 01:00:49] [INFO ] Deduced a trap composed of 59 places in 208 ms of which 4 ms to minimize.
[2024-05-21 01:00:50] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 5 ms to minimize.
[2024-05-21 01:00:50] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 4 ms to minimize.
[2024-05-21 01:00:51] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 3 ms to minimize.
[2024-05-21 01:00:51] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-05-21 01:00:51] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:00:56] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:00:58] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 5 ms to minimize.
[2024-05-21 01:00:58] [INFO ] Deduced a trap composed of 54 places in 233 ms of which 4 ms to minimize.
[2024-05-21 01:00:59] [INFO ] Deduced a trap composed of 53 places in 243 ms of which 5 ms to minimize.
[2024-05-21 01:00:59] [INFO ] Deduced a trap composed of 54 places in 233 ms of which 5 ms to minimize.
[2024-05-21 01:00:59] [INFO ] Deduced a trap composed of 54 places in 209 ms of which 4 ms to minimize.
[2024-05-21 01:00:59] [INFO ] Deduced a trap composed of 72 places in 214 ms of which 5 ms to minimize.
[2024-05-21 01:01:00] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 4 ms to minimize.
[2024-05-21 01:01:00] [INFO ] Deduced a trap composed of 55 places in 217 ms of which 4 ms to minimize.
[2024-05-21 01:01:00] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 3 ms to minimize.
[2024-05-21 01:01:01] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 3 ms to minimize.
[2024-05-21 01:01:01] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 3 ms to minimize.
[2024-05-21 01:01:01] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 3 ms to minimize.
[2024-05-21 01:01:01] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 3 ms to minimize.
[2024-05-21 01:01:01] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 3 ms to minimize.
[2024-05-21 01:01:01] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 3 ms to minimize.
[2024-05-21 01:01:02] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 3 ms to minimize.
[2024-05-21 01:01:02] [INFO ] Deduced a trap composed of 54 places in 153 ms of which 3 ms to minimize.
[2024-05-21 01:01:03] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 4 ms to minimize.
[2024-05-21 01:01:04] [INFO ] Deduced a trap composed of 63 places in 147 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:01:05] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 3 ms to minimize.
[2024-05-21 01:01:06] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 2 ms to minimize.
[2024-05-21 01:01:06] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-21 01:01:06] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 3 ms to minimize.
[2024-05-21 01:01:06] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 3 ms to minimize.
[2024-05-21 01:01:06] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 3 ms to minimize.
[2024-05-21 01:01:06] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2024-05-21 01:01:07] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 3 ms to minimize.
[2024-05-21 01:01:08] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 4 ms to minimize.
[2024-05-21 01:01:08] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 307/604 variables, and 72 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/307 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 44/72 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:01:15] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 3 ms to minimize.
[2024-05-21 01:01:15] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 3 ms to minimize.
[2024-05-21 01:01:15] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 4 ms to minimize.
[2024-05-21 01:01:15] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-05-21 01:01:15] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
[2024-05-21 01:01:15] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 2 ms to minimize.
[2024-05-21 01:01:16] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 3 ms to minimize.
[2024-05-21 01:01:16] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:01:18] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 4 ms to minimize.
[2024-05-21 01:01:19] [INFO ] Deduced a trap composed of 52 places in 178 ms of which 4 ms to minimize.
[2024-05-21 01:01:19] [INFO ] Deduced a trap composed of 57 places in 176 ms of which 4 ms to minimize.
[2024-05-21 01:01:19] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 4 ms to minimize.
[2024-05-21 01:01:19] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 3 ms to minimize.
[2024-05-21 01:01:19] [INFO ] Deduced a trap composed of 55 places in 130 ms of which 7 ms to minimize.
[2024-05-21 01:01:20] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 4 ms to minimize.
[2024-05-21 01:01:20] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 4 ms to minimize.
[2024-05-21 01:01:20] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 2 ms to minimize.
[2024-05-21 01:01:20] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 3 ms to minimize.
[2024-05-21 01:01:21] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 11/91 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 297/604 variables, 307/398 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 296/694 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:01:27] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 2 ms to minimize.
[2024-05-21 01:01:27] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 3 ms to minimize.
[2024-05-21 01:01:28] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 3 ms to minimize.
[2024-05-21 01:01:28] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 3 ms to minimize.
[2024-05-21 01:01:28] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 2 ms to minimize.
[2024-05-21 01:01:28] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-21 01:01:29] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 3 ms to minimize.
[2024-05-21 01:01:31] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-05-21 01:01:31] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 9/703 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:01:40] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 3 ms to minimize.
[2024-05-21 01:01:40] [INFO ] Deduced a trap composed of 66 places in 124 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 705 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 74/74 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 307/360 places, 297/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60817 ms. Remains : 307/360 places, 297/354 transitions.
[2024-05-21 01:01:41] [INFO ] Flatten gal took : 27 ms
[2024-05-21 01:01:41] [INFO ] Flatten gal took : 30 ms
[2024-05-21 01:01:41] [INFO ] Input system was already deterministic with 297 transitions.
[2024-05-21 01:01:41] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:01:41] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:01:41] [INFO ] Time to serialize gal into /tmp/CTLFireability9509868064981418141.gal : 14 ms
[2024-05-21 01:01:41] [INFO ] Time to serialize properties into /tmp/CTLFireability11889999292138838421.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9509868064981418141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11889999292138838421.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 01:02:11] [INFO ] Flatten gal took : 13 ms
[2024-05-21 01:02:11] [INFO ] Applying decomposition
[2024-05-21 01:02:11] [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/graph2884370537635710535.txt' '-o' '/tmp/graph2884370537635710535.bin' '-w' '/tmp/graph2884370537635710535.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2884370537635710535.bin' '-l' '-1' '-v' '-w' '/tmp/graph2884370537635710535.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:02:11] [INFO ] Decomposing Gal with order
[2024-05-21 01:02:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:02:12] [INFO ] Removed a total of 58 redundant transitions.
[2024-05-21 01:02:12] [INFO ] Flatten gal took : 78 ms
[2024-05-21 01:02:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-21 01:02:12] [INFO ] Time to serialize gal into /tmp/CTLFireability11492000794041893947.gal : 11 ms
[2024-05-21 01:02:12] [INFO ] Time to serialize properties into /tmp/CTLFireability5326497174749956932.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/CTLFireability11492000794041893947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5326497174749956932.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,5.70243e+22,0.617763,19344,3691,19,33099,224,589,44688,38,477,0


Converting to forward existential form...Done !
original formula: A(((i7.u21.p69==1)&&(i7.u108.p339==1)) U (AF(((AX((i2.i0.u5.p12==1)) * (i3.u24.p75==1)) * !((((i3.u24.p73==1)||(i14.i0.u77.p260==1))||((i...302
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!(((!(EX(!((i2.i0.u5.p12==1)))) * (i3.u24.p75==1)) * !((((i3.u24.p73==1)||(i14.i0.u77.p26...1418
Reverse transition relation is NOT exact ! Due to transitions t96, t106, t109, t132, t135, t160, t182, t205, t220, t286, t288, t289, t290, i0.t93, i0.i2.t9...778
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 354/354 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 327 transition count 321
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 327 transition count 321
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 70 place count 327 transition count 317
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 83 place count 314 transition count 304
Iterating global reduction 1 with 13 rules applied. Total rules applied 96 place count 314 transition count 304
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 312 transition count 302
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 312 transition count 302
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 310 transition count 300
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 310 transition count 300
Applied a total of 104 rules in 26 ms. Remains 310 /360 variables (removed 50) and now considering 300/354 (removed 54) transitions.
// Phase 1: matrix 300 rows 310 cols
[2024-05-21 01:02:42] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 01:02:42] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-21 01:02:42] [INFO ] Invariant cache hit.
[2024-05-21 01:02:42] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Running 299 sub problems to find dead transitions.
[2024-05-21 01:02:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/310 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-05-21 01:02:48] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-21 01:02:48] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 3 ms to minimize.
[2024-05-21 01:02:49] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 3 ms to minimize.
[2024-05-21 01:02:49] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 3 ms to minimize.
[2024-05-21 01:02:49] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 4 ms to minimize.
[2024-05-21 01:02:49] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 3 ms to minimize.
[2024-05-21 01:02:50] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 5 ms to minimize.
[2024-05-21 01:02:50] [INFO ] Deduced a trap composed of 17 places in 271 ms of which 5 ms to minimize.
[2024-05-21 01:02:50] [INFO ] Deduced a trap composed of 54 places in 273 ms of which 5 ms to minimize.
[2024-05-21 01:02:50] [INFO ] Deduced a trap composed of 19 places in 292 ms of which 5 ms to minimize.
[2024-05-21 01:02:51] [INFO ] Deduced a trap composed of 41 places in 273 ms of which 5 ms to minimize.
[2024-05-21 01:02:51] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 5 ms to minimize.
[2024-05-21 01:02:51] [INFO ] Deduced a trap composed of 52 places in 229 ms of which 5 ms to minimize.
[2024-05-21 01:02:51] [INFO ] Deduced a trap composed of 71 places in 215 ms of which 4 ms to minimize.
[2024-05-21 01:02:52] [INFO ] Deduced a trap composed of 56 places in 185 ms of which 4 ms to minimize.
[2024-05-21 01:02:52] [INFO ] Deduced a trap composed of 57 places in 189 ms of which 4 ms to minimize.
[2024-05-21 01:02:52] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 4 ms to minimize.
[2024-05-21 01:02:52] [INFO ] Deduced a trap composed of 58 places in 187 ms of which 4 ms to minimize.
[2024-05-21 01:02:52] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 4 ms to minimize.
[2024-05-21 01:02:53] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-05-21 01:02:56] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 3 ms to minimize.
[2024-05-21 01:02:56] [INFO ] Deduced a trap composed of 54 places in 151 ms of which 3 ms to minimize.
[2024-05-21 01:02:56] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 3 ms to minimize.
[2024-05-21 01:02:56] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 4 ms to minimize.
[2024-05-21 01:02:56] [INFO ] Deduced a trap composed of 55 places in 199 ms of which 4 ms to minimize.
[2024-05-21 01:02:57] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 3 ms to minimize.
[2024-05-21 01:02:57] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 5 ms to minimize.
[2024-05-21 01:02:57] [INFO ] Deduced a trap composed of 55 places in 149 ms of which 3 ms to minimize.
[2024-05-21 01:02:57] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 4 ms to minimize.
[2024-05-21 01:02:58] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 4 ms to minimize.
[2024-05-21 01:02:58] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 3 ms to minimize.
[2024-05-21 01:02:58] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 3 ms to minimize.
[2024-05-21 01:02:58] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 3 ms to minimize.
[2024-05-21 01:02:59] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 2 ms to minimize.
[2024-05-21 01:02:59] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 3 ms to minimize.
[2024-05-21 01:02:59] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 3 ms to minimize.
[2024-05-21 01:02:59] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 2 ms to minimize.
[2024-05-21 01:02:59] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 3 ms to minimize.
[2024-05-21 01:02:59] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 2 ms to minimize.
[2024-05-21 01:02:59] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-05-21 01:03:00] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 3 ms to minimize.
[2024-05-21 01:03:00] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 3 ms to minimize.
[2024-05-21 01:03:00] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 3 ms to minimize.
[2024-05-21 01:03:01] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-21 01:03:01] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 3 ms to minimize.
[2024-05-21 01:03:01] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 3 ms to minimize.
[2024-05-21 01:03:01] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 3 ms to minimize.
[2024-05-21 01:03:01] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 3 ms to minimize.
[2024-05-21 01:03:02] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 3 ms to minimize.
[2024-05-21 01:03:02] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 3 ms to minimize.
[2024-05-21 01:03:02] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 3 ms to minimize.
[2024-05-21 01:03:03] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 3 ms to minimize.
[2024-05-21 01:03:03] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 4 ms to minimize.
[2024-05-21 01:03:03] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 3 ms to minimize.
[2024-05-21 01:03:03] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-21 01:03:04] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
[2024-05-21 01:03:04] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-05-21 01:03:04] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 2 ms to minimize.
[2024-05-21 01:03:04] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 19/87 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-05-21 01:03:06] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-21 01:03:06] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 2 ms to minimize.
[2024-05-21 01:03:06] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 3 ms to minimize.
[2024-05-21 01:03:07] [INFO ] Deduced a trap composed of 62 places in 148 ms of which 3 ms to minimize.
[2024-05-21 01:03:07] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/610 variables, and 92 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/310 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/310 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 64/92 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-05-21 01:03:17] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 3 ms to minimize.
[2024-05-21 01:03:17] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 4 ms to minimize.
[2024-05-21 01:03:18] [INFO ] Deduced a trap composed of 57 places in 161 ms of which 4 ms to minimize.
[2024-05-21 01:03:18] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 3 ms to minimize.
[2024-05-21 01:03:18] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 3 ms to minimize.
[2024-05-21 01:03:20] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-05-21 01:03:22] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 4 ms to minimize.
[2024-05-21 01:03:22] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 3 ms to minimize.
[2024-05-21 01:03:22] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 3 ms to minimize.
[2024-05-21 01:03:22] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 3 ms to minimize.
[2024-05-21 01:03:22] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 4 ms to minimize.
[2024-05-21 01:03:22] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
[2024-05-21 01:03:23] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 3 ms to minimize.
[2024-05-21 01:03:23] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 4 ms to minimize.
[2024-05-21 01:03:23] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-05-21 01:03:27] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-05-21 01:03:27] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (OVERLAPS) 300/610 variables, 310/419 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 299/718 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-05-21 01:03:35] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-21 01:03:35] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 4 ms to minimize.
[2024-05-21 01:03:36] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 2 ms to minimize.
[2024-05-21 01:03:36] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2024-05-21 01:03:36] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 3 ms to minimize.
[2024-05-21 01:03:36] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
[2024-05-21 01:03:36] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 2 ms to minimize.
[2024-05-21 01:03:36] [INFO ] Deduced a trap composed of 74 places in 161 ms of which 3 ms to minimize.
[2024-05-21 01:03:37] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-21 01:03:37] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 3 ms to minimize.
[2024-05-21 01:03:38] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 3 ms to minimize.
[2024-05-21 01:03:38] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/610 variables, and 730 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 93/93 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 310/360 places, 300/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60849 ms. Remains : 310/360 places, 300/354 transitions.
[2024-05-21 01:03:43] [INFO ] Flatten gal took : 22 ms
[2024-05-21 01:03:43] [INFO ] Flatten gal took : 17 ms
[2024-05-21 01:03:43] [INFO ] Input system was already deterministic with 300 transitions.
[2024-05-21 01:03:43] [INFO ] Flatten gal took : 16 ms
[2024-05-21 01:03:43] [INFO ] Flatten gal took : 16 ms
[2024-05-21 01:03:43] [INFO ] Time to serialize gal into /tmp/CTLFireability7127964656972264397.gal : 5 ms
[2024-05-21 01:03:43] [INFO ] Time to serialize properties into /tmp/CTLFireability1974375570105617215.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/CTLFireability7127964656972264397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1974375570105617215.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 01:04:13] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:04:13] [INFO ] Applying decomposition
[2024-05-21 01:04:13] [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/graph4775696692177677485.txt' '-o' '/tmp/graph4775696692177677485.bin' '-w' '/tmp/graph4775696692177677485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4775696692177677485.bin' '-l' '-1' '-v' '-w' '/tmp/graph4775696692177677485.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:04:13] [INFO ] Decomposing Gal with order
[2024-05-21 01:04:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:04:13] [INFO ] Removed a total of 53 redundant transitions.
[2024-05-21 01:04:13] [INFO ] Flatten gal took : 43 ms
[2024-05-21 01:04:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-21 01:04:13] [INFO ] Time to serialize gal into /tmp/CTLFireability9896545457708731627.gal : 10 ms
[2024-05-21 01:04:13] [INFO ] Time to serialize properties into /tmp/CTLFireability12826952546305690543.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/CTLFireability9896545457708731627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12826952546305690543.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.3981e+22,1.03932,26776,6135,24,47710,326,615,65212,40,925,0


Converting to forward existential form...Done !
original formula: (EF(AX((E((((i6.u101.p320==1)&&(i17.i2.u128.p388==1))&&(i2.u13.p40==1)) U (i21.i0.u111.p347==1)) * EG(((i5.i0.u23.p80==0)||(i13.i1.u108.p...469
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(EX(!((E((((i6.u101.p320==1)&&(i17.i2.u128.p388==1))&&(i2.u13.p40==1)) U (i21.i0.u111.p347...1810
Reverse transition relation is NOT exact ! Due to transitions t109, t112, t122, t125, t156, t207, t222, t288, t289, t291, t292, t293, i0.u122.t33, i1.u43.t...865
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 360/360 places, 354/354 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 359 transition count 236
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 132 rules applied. Total rules applied 249 place count 242 transition count 221
Reduce places removed 6 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 10 rules applied. Total rules applied 259 place count 236 transition count 217
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 265 place count 232 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 266 place count 231 transition count 215
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 46 Pre rules applied. Total rules applied 266 place count 231 transition count 169
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 358 place count 185 transition count 169
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 381 place count 162 transition count 146
Iterating global reduction 5 with 23 rules applied. Total rules applied 404 place count 162 transition count 146
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 404 place count 162 transition count 136
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 424 place count 152 transition count 136
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 508 place count 110 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 512 place count 110 transition count 90
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 520 place count 106 transition count 86
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 521 place count 106 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 522 place count 105 transition count 85
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 6 rules applied. Total rules applied 528 place count 100 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 529 place count 99 transition count 84
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 529 place count 99 transition count 80
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 537 place count 95 transition count 80
Applied a total of 537 rules in 56 ms. Remains 95 /360 variables (removed 265) and now considering 80/354 (removed 274) transitions.
// Phase 1: matrix 80 rows 95 cols
[2024-05-21 01:04:43] [INFO ] Computed 23 invariants in 1 ms
[2024-05-21 01:04:43] [INFO ] Implicit Places using invariants in 106 ms returned [56, 70, 88, 94]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 109 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 91/360 places, 80/354 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 89 transition count 78
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 89 transition count 78
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 12 place count 85 transition count 74
Applied a total of 12 rules in 7 ms. Remains 85 /91 variables (removed 6) and now considering 74/80 (removed 6) transitions.
// Phase 1: matrix 74 rows 85 cols
[2024-05-21 01:04:43] [INFO ] Computed 19 invariants in 2 ms
[2024-05-21 01:04:43] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 01:04:43] [INFO ] Invariant cache hit.
[2024-05-21 01:04:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 01:04:43] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 85/360 places, 74/354 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 366 ms. Remains : 85/360 places, 74/354 transitions.
[2024-05-21 01:04:43] [INFO ] Flatten gal took : 5 ms
[2024-05-21 01:04:43] [INFO ] Flatten gal took : 5 ms
[2024-05-21 01:04:43] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-21 01:04:44] [INFO ] Flatten gal took : 4 ms
[2024-05-21 01:04:44] [INFO ] Flatten gal took : 5 ms
[2024-05-21 01:04:44] [INFO ] Time to serialize gal into /tmp/CTLFireability16429762445060942612.gal : 6 ms
[2024-05-21 01:04:44] [INFO ] Time to serialize properties into /tmp/CTLFireability4377622232231417221.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/CTLFireability16429762445060942612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4377622232231417221.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,4.41179e+08,0.066235,4756,2,934,5,5695,6,0,407,5085,0


Converting to forward existential form...Done !
original formula: ((EF((AF(((p92==0)||(p270==0))) + (p348==1))) * AG(!(A((p28!=1) U EG((p188==1)))))) * !(E((!(EG((p362!=1))) + EF(((p63==1) * AF((p282==1)...181
=> equivalent forward existential formula: (([(Init * !(E(TRUE U (!(EG(!(((p92==0)||(p270==0))))) + (p348==1)))))] = FALSE * [((FwdU(Init,TRUE) * !(EG(!(EG...354
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t50, t67, t70, t73, Intersection with reachable at each step enabled. (destroyed/rev...187
(forward)formula 0,0,8.8153,245832,1,0,1050,1.3931e+06,191,549,2452,1.73929e+06,1199
FORMULA AutoFlight-PT-04b-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 354/354 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 325 transition count 319
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 325 transition count 319
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 74 place count 325 transition count 315
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 89 place count 310 transition count 300
Iterating global reduction 1 with 15 rules applied. Total rules applied 104 place count 310 transition count 300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 308 transition count 298
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 308 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 307 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 307 transition count 297
Applied a total of 110 rules in 32 ms. Remains 307 /360 variables (removed 53) and now considering 297/354 (removed 57) transitions.
// Phase 1: matrix 297 rows 307 cols
[2024-05-21 01:04:52] [INFO ] Computed 28 invariants in 5 ms
[2024-05-21 01:04:53] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-21 01:04:53] [INFO ] Invariant cache hit.
[2024-05-21 01:04:53] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2024-05-21 01:04:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:05:00] [INFO ] Deduced a trap composed of 49 places in 271 ms of which 5 ms to minimize.
[2024-05-21 01:05:00] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 5 ms to minimize.
[2024-05-21 01:05:00] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 5 ms to minimize.
[2024-05-21 01:05:01] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 4 ms to minimize.
[2024-05-21 01:05:01] [INFO ] Deduced a trap composed of 51 places in 243 ms of which 5 ms to minimize.
[2024-05-21 01:05:01] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 4 ms to minimize.
[2024-05-21 01:05:01] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 5 ms to minimize.
[2024-05-21 01:05:01] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 5 ms to minimize.
[2024-05-21 01:05:02] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 4 ms to minimize.
[2024-05-21 01:05:02] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 4 ms to minimize.
[2024-05-21 01:05:02] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 3 ms to minimize.
[2024-05-21 01:05:02] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 2 ms to minimize.
[2024-05-21 01:05:02] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
[2024-05-21 01:05:02] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 2 ms to minimize.
[2024-05-21 01:05:03] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 3 ms to minimize.
[2024-05-21 01:05:03] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 3 ms to minimize.
[2024-05-21 01:05:03] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-21 01:05:03] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 01:05:03] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 01:05:03] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:05:06] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 4 ms to minimize.
[2024-05-21 01:05:06] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 4 ms to minimize.
[2024-05-21 01:05:07] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 4 ms to minimize.
[2024-05-21 01:05:07] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 4 ms to minimize.
[2024-05-21 01:05:07] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 3 ms to minimize.
[2024-05-21 01:05:08] [INFO ] Deduced a trap composed of 62 places in 217 ms of which 4 ms to minimize.
[2024-05-21 01:05:08] [INFO ] Deduced a trap composed of 53 places in 186 ms of which 4 ms to minimize.
[2024-05-21 01:05:08] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 3 ms to minimize.
[2024-05-21 01:05:09] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 4 ms to minimize.
[2024-05-21 01:05:09] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 3 ms to minimize.
[2024-05-21 01:05:09] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 3 ms to minimize.
[2024-05-21 01:05:09] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-21 01:05:10] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:05:12] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 2 ms to minimize.
[2024-05-21 01:05:13] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 3 ms to minimize.
[2024-05-21 01:05:13] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 3 ms to minimize.
[2024-05-21 01:05:13] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 3 ms to minimize.
[2024-05-21 01:05:14] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 2 ms to minimize.
[2024-05-21 01:05:14] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-05-21 01:05:14] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:05:15] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 3 ms to minimize.
[2024-05-21 01:05:16] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-05-21 01:05:16] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-05-21 01:05:16] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-05-21 01:05:16] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 2 ms to minimize.
[2024-05-21 01:05:17] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2024-05-21 01:05:17] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-05-21 01:05:17] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 8/76 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:05:22] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 3 ms to minimize.
[2024-05-21 01:05:22] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 307/604 variables, and 78 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/307 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 50/78 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:05:27] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 3 ms to minimize.
[2024-05-21 01:05:27] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 2 ms to minimize.
[2024-05-21 01:05:27] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 2 ms to minimize.
[2024-05-21 01:05:27] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 3 ms to minimize.
[2024-05-21 01:05:27] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
[2024-05-21 01:05:28] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2024-05-21 01:05:28] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-05-21 01:05:28] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:05:31] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 3 ms to minimize.
[2024-05-21 01:05:32] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 3 ms to minimize.
[2024-05-21 01:05:32] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 3 ms to minimize.
[2024-05-21 01:05:32] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
[2024-05-21 01:05:34] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 3 ms to minimize.
[2024-05-21 01:05:34] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:05:36] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 4 ms to minimize.
[2024-05-21 01:05:36] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-21 01:05:36] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-05-21 01:05:37] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 3 ms to minimize.
[2024-05-21 01:05:38] [INFO ] Deduced a trap composed of 60 places in 145 ms of which 3 ms to minimize.
[2024-05-21 01:05:38] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 4 ms to minimize.
[2024-05-21 01:05:38] [INFO ] Deduced a trap composed of 62 places in 146 ms of which 3 ms to minimize.
[2024-05-21 01:05:38] [INFO ] Deduced a trap composed of 60 places in 161 ms of which 4 ms to minimize.
[2024-05-21 01:05:38] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 3 ms to minimize.
[2024-05-21 01:05:39] [INFO ] Deduced a trap composed of 62 places in 132 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (OVERLAPS) 297/604 variables, 307/409 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 296/705 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:05:45] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-21 01:05:46] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 4 ms to minimize.
[2024-05-21 01:05:48] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 708 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 77/77 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 307/360 places, 297/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60794 ms. Remains : 307/360 places, 297/354 transitions.
[2024-05-21 01:05:53] [INFO ] Flatten gal took : 16 ms
[2024-05-21 01:05:53] [INFO ] Flatten gal took : 13 ms
[2024-05-21 01:05:53] [INFO ] Input system was already deterministic with 297 transitions.
[2024-05-21 01:05:53] [INFO ] Flatten gal took : 14 ms
[2024-05-21 01:05:53] [INFO ] Flatten gal took : 13 ms
[2024-05-21 01:05:53] [INFO ] Time to serialize gal into /tmp/CTLFireability8386400205601952693.gal : 3 ms
[2024-05-21 01:05:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8117374533213514000.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/CTLFireability8386400205601952693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8117374533213514000.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 01:06:23] [INFO ] Flatten gal took : 8 ms
[2024-05-21 01:06:23] [INFO ] Applying decomposition
[2024-05-21 01:06:23] [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/graph11341740546480926372.txt' '-o' '/tmp/graph11341740546480926372.bin' '-w' '/tmp/graph11341740546480926372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11341740546480926372.bin' '-l' '-1' '-v' '-w' '/tmp/graph11341740546480926372.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:06:23] [INFO ] Decomposing Gal with order
[2024-05-21 01:06:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:06:23] [INFO ] Removed a total of 56 redundant transitions.
[2024-05-21 01:06:23] [INFO ] Flatten gal took : 37 ms
[2024-05-21 01:06:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 01:06:24] [INFO ] Time to serialize gal into /tmp/CTLFireability17791851392206742621.gal : 8 ms
[2024-05-21 01:06:24] [INFO ] Time to serialize properties into /tmp/CTLFireability3784605988278717767.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/CTLFireability17791851392206742621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3784605988278717767.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,5.51991e+22,1.37618,30820,3212,20,49731,267,572,77964,37,542,0


Converting to forward existential form...Done !
original formula: EX((A((((E((i6.u19.p68==1) U (i9.u38.p128==1)) * !(((i3.u8.p26==1)&&(i6.u81.p273==1)))) * EG((i4.u13.p41==1))) + AG((i7.u30.p100!=1))) U ...255
=> equivalent forward existential formula: [FwdG(FwdU((EY(Init) * !((E(!(!(!((E(!(E(TRUE U (i15.u68.p243==1))) U (!(!(EX(!(((i3.u8.p26==1)&&(i6.u81.p273==1...767
Reverse transition relation is NOT exact ! Due to transitions t92, t95, t105, t108, t121, t134, t152, t159, t205, t220, t286, t288, t289, t290, i0.t287, i0...739
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 360/360 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 122 place count 360 transition count 232
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 139 rules applied. Total rules applied 261 place count 238 transition count 215
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 271 place count 231 transition count 212
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 274 place count 228 transition count 212
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 274 place count 228 transition count 167
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 364 place count 183 transition count 167
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 391 place count 156 transition count 140
Iterating global reduction 4 with 27 rules applied. Total rules applied 418 place count 156 transition count 140
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 418 place count 156 transition count 131
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 436 place count 147 transition count 131
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 508 place count 111 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 512 place count 111 transition count 91
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 520 place count 107 transition count 87
Applied a total of 520 rules in 44 ms. Remains 107 /360 variables (removed 253) and now considering 87/354 (removed 267) transitions.
// Phase 1: matrix 87 rows 107 cols
[2024-05-21 01:06:54] [INFO ] Computed 28 invariants in 1 ms
[2024-05-21 01:06:54] [INFO ] Implicit Places using invariants in 103 ms returned [50, 51, 66, 81, 87, 93, 99, 106]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 116 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 99/360 places, 87/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 99 transition count 86
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 98 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 97 transition count 85
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 8 place count 93 transition count 81
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 93 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 92 transition count 80
Applied a total of 14 rules in 9 ms. Remains 92 /99 variables (removed 7) and now considering 80/87 (removed 7) transitions.
// Phase 1: matrix 80 rows 92 cols
[2024-05-21 01:06:54] [INFO ] Computed 20 invariants in 0 ms
[2024-05-21 01:06:54] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 01:06:54] [INFO ] Invariant cache hit.
[2024-05-21 01:06:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 01:06:54] [INFO ] Implicit Places using invariants and state equation in 179 ms returned [40, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 266 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 90/360 places, 80/354 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 90 transition count 78
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 88 transition count 78
Applied a total of 4 rules in 8 ms. Remains 88 /90 variables (removed 2) and now considering 78/80 (removed 2) transitions.
// Phase 1: matrix 78 rows 88 cols
[2024-05-21 01:06:54] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 01:06:54] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-21 01:06:54] [INFO ] Invariant cache hit.
[2024-05-21 01:06:54] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-21 01:06:54] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 88/360 places, 78/354 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 799 ms. Remains : 88/360 places, 78/354 transitions.
[2024-05-21 01:06:54] [INFO ] Flatten gal took : 5 ms
[2024-05-21 01:06:54] [INFO ] Flatten gal took : 5 ms
[2024-05-21 01:06:54] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-21 01:06:54] [INFO ] Flatten gal took : 4 ms
[2024-05-21 01:06:54] [INFO ] Flatten gal took : 12 ms
[2024-05-21 01:06:54] [INFO ] Time to serialize gal into /tmp/CTLFireability17704089612793542074.gal : 2 ms
[2024-05-21 01:06:54] [INFO ] Time to serialize properties into /tmp/CTLFireability7689586464111443217.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/CTLFireability17704089612793542074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7689586464111443217.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.96732e+07,0.123989,6024,2,1331,5,10186,6,0,424,12504,0


Converting to forward existential form...Done !
original formula: (AG((((((AF((p89==0)) + AF((p295==0))) + EG((p146==0))) * AG((p140==1))) + ((p223==0) * EG((p268==0)))) + ((p6==1)||(p113==0)))) + E((p97...171
=> equivalent forward existential formula: ([FwdG(((((FwdU((Init * !(E((p97==1) U (p2==1)))),TRUE) * !(((p6==1)||(p113==0)))) * !(((p223==0) * EG((p268==0)...376
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t7, t29, t30, t56, t63, t70, t73, Intersection with reachable at each step e...210
(forward)formula 0,0,5.16734,141272,1,0,539,847743,189,245,2574,863042,597
FORMULA AutoFlight-PT-04b-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 354/354 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 330 transition count 324
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 330 transition count 324
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 330 transition count 320
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 78 place count 316 transition count 306
Iterating global reduction 1 with 14 rules applied. Total rules applied 92 place count 316 transition count 306
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 314 transition count 304
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 314 transition count 304
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 312 transition count 302
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 312 transition count 302
Applied a total of 100 rules in 26 ms. Remains 312 /360 variables (removed 48) and now considering 302/354 (removed 52) transitions.
// Phase 1: matrix 302 rows 312 cols
[2024-05-21 01:07:00] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 01:07:00] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-21 01:07:00] [INFO ] Invariant cache hit.
[2024-05-21 01:07:00] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-05-21 01:07:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/312 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:07:07] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-05-21 01:07:07] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 3 ms to minimize.
[2024-05-21 01:07:07] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 3 ms to minimize.
[2024-05-21 01:07:07] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 3 ms to minimize.
[2024-05-21 01:07:07] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 3 ms to minimize.
[2024-05-21 01:07:07] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 3 ms to minimize.
[2024-05-21 01:07:07] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 3 ms to minimize.
[2024-05-21 01:07:08] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 3 ms to minimize.
[2024-05-21 01:07:08] [INFO ] Deduced a trap composed of 67 places in 279 ms of which 5 ms to minimize.
[2024-05-21 01:07:08] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 5 ms to minimize.
[2024-05-21 01:07:09] [INFO ] Deduced a trap composed of 49 places in 305 ms of which 5 ms to minimize.
[2024-05-21 01:07:09] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 5 ms to minimize.
[2024-05-21 01:07:09] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 4 ms to minimize.
[2024-05-21 01:07:09] [INFO ] Deduced a trap composed of 57 places in 188 ms of which 5 ms to minimize.
[2024-05-21 01:07:10] [INFO ] Deduced a trap composed of 74 places in 229 ms of which 5 ms to minimize.
[2024-05-21 01:07:10] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 4 ms to minimize.
[2024-05-21 01:07:10] [INFO ] Deduced a trap composed of 53 places in 203 ms of which 4 ms to minimize.
[2024-05-21 01:07:10] [INFO ] Deduced a trap composed of 64 places in 199 ms of which 4 ms to minimize.
[2024-05-21 01:07:10] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 4 ms to minimize.
[2024-05-21 01:07:11] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:07:14] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 3 ms to minimize.
[2024-05-21 01:07:14] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 4 ms to minimize.
[2024-05-21 01:07:15] [INFO ] Deduced a trap composed of 62 places in 234 ms of which 5 ms to minimize.
[2024-05-21 01:07:15] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 4 ms to minimize.
[2024-05-21 01:07:15] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 4 ms to minimize.
[2024-05-21 01:07:16] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 4 ms to minimize.
[2024-05-21 01:07:16] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 4 ms to minimize.
[2024-05-21 01:07:16] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 3 ms to minimize.
[2024-05-21 01:07:16] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 3 ms to minimize.
[2024-05-21 01:07:16] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 3 ms to minimize.
[2024-05-21 01:07:17] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 3 ms to minimize.
[2024-05-21 01:07:17] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 3 ms to minimize.
[2024-05-21 01:07:18] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 4 ms to minimize.
[2024-05-21 01:07:18] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:07:21] [INFO ] Deduced a trap composed of 59 places in 217 ms of which 4 ms to minimize.
[2024-05-21 01:07:21] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 3 ms to minimize.
[2024-05-21 01:07:21] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 3 ms to minimize.
[2024-05-21 01:07:21] [INFO ] Deduced a trap composed of 56 places in 167 ms of which 3 ms to minimize.
[2024-05-21 01:07:21] [INFO ] Deduced a trap composed of 57 places in 157 ms of which 3 ms to minimize.
[2024-05-21 01:07:21] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 3 ms to minimize.
[2024-05-21 01:07:22] [INFO ] Deduced a trap composed of 55 places in 130 ms of which 3 ms to minimize.
[2024-05-21 01:07:22] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 3 ms to minimize.
[2024-05-21 01:07:22] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 4 ms to minimize.
[2024-05-21 01:07:22] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 3 ms to minimize.
[2024-05-21 01:07:22] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 3 ms to minimize.
[2024-05-21 01:07:23] [INFO ] Deduced a trap composed of 68 places in 181 ms of which 3 ms to minimize.
[2024-05-21 01:07:23] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 4 ms to minimize.
[2024-05-21 01:07:23] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 3 ms to minimize.
[2024-05-21 01:07:23] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 4 ms to minimize.
[2024-05-21 01:07:24] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 3 ms to minimize.
[2024-05-21 01:07:24] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 3 ms to minimize.
[2024-05-21 01:07:24] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 3 ms to minimize.
[2024-05-21 01:07:25] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 3 ms to minimize.
[2024-05-21 01:07:25] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:07:26] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 3 ms to minimize.
[2024-05-21 01:07:27] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 3 ms to minimize.
[2024-05-21 01:07:27] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 2 ms to minimize.
[2024-05-21 01:07:28] [INFO ] Deduced a trap composed of 56 places in 230 ms of which 4 ms to minimize.
[2024-05-21 01:07:29] [INFO ] Deduced a trap composed of 61 places in 174 ms of which 3 ms to minimize.
[2024-05-21 01:07:29] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 3 ms to minimize.
[2024-05-21 01:07:29] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/614 variables, and 89 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/312 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/312 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 61/89 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:07:35] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-05-21 01:07:35] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 4 ms to minimize.
[2024-05-21 01:07:35] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2024-05-21 01:07:35] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 3 ms to minimize.
[2024-05-21 01:07:36] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 4 ms to minimize.
[2024-05-21 01:07:36] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:07:40] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 3 ms to minimize.
[2024-05-21 01:07:40] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 3 ms to minimize.
[2024-05-21 01:07:40] [INFO ] Deduced a trap composed of 57 places in 201 ms of which 4 ms to minimize.
[2024-05-21 01:07:41] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:07:43] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-21 01:07:44] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 4 ms to minimize.
[2024-05-21 01:07:44] [INFO ] Deduced a trap composed of 68 places in 149 ms of which 3 ms to minimize.
[2024-05-21 01:07:44] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 3 ms to minimize.
[2024-05-21 01:07:44] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 3 ms to minimize.
[2024-05-21 01:07:44] [INFO ] Deduced a trap composed of 75 places in 159 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:07:48] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 3 ms to minimize.
[2024-05-21 01:07:49] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 3 ms to minimize.
[2024-05-21 01:07:49] [INFO ] Deduced a trap composed of 80 places in 170 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:07:53] [INFO ] Deduced a trap composed of 80 places in 174 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:07:55] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 4 ms to minimize.
[2024-05-21 01:07:55] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 4 ms to minimize.
[2024-05-21 01:07:55] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 4 ms to minimize.
[2024-05-21 01:07:56] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 2 ms to minimize.
[2024-05-21 01:07:56] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 3 ms to minimize.
[2024-05-21 01:07:56] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
[2024-05-21 01:07:56] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 2 ms to minimize.
[2024-05-21 01:07:57] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 8/117 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/614 variables, and 117 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/312 constraints, PredecessorRefiner: 0/301 constraints, Known Traps: 89/89 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 312/360 places, 302/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60611 ms. Remains : 312/360 places, 302/354 transitions.
[2024-05-21 01:08:00] [INFO ] Flatten gal took : 13 ms
[2024-05-21 01:08:00] [INFO ] Flatten gal took : 12 ms
[2024-05-21 01:08:00] [INFO ] Input system was already deterministic with 302 transitions.
[2024-05-21 01:08:00] [INFO ] Flatten gal took : 12 ms
[2024-05-21 01:08:00] [INFO ] Flatten gal took : 12 ms
[2024-05-21 01:08:00] [INFO ] Time to serialize gal into /tmp/CTLFireability3891238090582815077.gal : 3 ms
[2024-05-21 01:08:00] [INFO ] Time to serialize properties into /tmp/CTLFireability17226893278267599185.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/CTLFireability3891238090582815077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17226893278267599185.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 01:08:30] [INFO ] Flatten gal took : 14 ms
[2024-05-21 01:08:30] [INFO ] Applying decomposition
[2024-05-21 01:08:30] [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/graph13424738135858894660.txt' '-o' '/tmp/graph13424738135858894660.bin' '-w' '/tmp/graph13424738135858894660.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13424738135858894660.bin' '-l' '-1' '-v' '-w' '/tmp/graph13424738135858894660.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:08:30] [INFO ] Decomposing Gal with order
[2024-05-21 01:08:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:08:31] [INFO ] Removed a total of 59 redundant transitions.
[2024-05-21 01:08:31] [INFO ] Flatten gal took : 33 ms
[2024-05-21 01:08:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 01:08:31] [INFO ] Time to serialize gal into /tmp/CTLFireability3477755285899205234.gal : 7 ms
[2024-05-21 01:08:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15783137799270440403.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/CTLFireability3477755285899205234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15783137799270440403.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,7.5441e+22,0.537297,19396,3376,19,32448,273,614,43850,38,636,0


Converting to forward existential form...Done !
original formula: (AX(AF((AF(((i9.i1.u34.p117==1)&&(i6.u23.p78==1))) * (EF((i0.i0.u51.p180==1)) + AF((i1.u47.p163==1)))))) * EF(((!(A((i14.u79.p268==1) U (...285
=> equivalent forward existential formula: ([FwdG(EY(Init),!((!(EG(!(((i9.i1.u34.p117==1)&&(i6.u23.p78==1))))) * (E(TRUE U (i0.i0.u51.p180==1)) + !(EG(!((i...437
Reverse transition relation is NOT exact ! Due to transitions t109, t112, t135, t138, t158, t165, t187, t203, t210, t225, t291, t293, t294, t295, i0.i1.t13...832
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 360/360 places, 354/354 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 327 transition count 321
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 327 transition count 321
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 70 place count 327 transition count 317
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 85 place count 312 transition count 302
Iterating global reduction 1 with 15 rules applied. Total rules applied 100 place count 312 transition count 302
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 310 transition count 300
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 310 transition count 300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 308 transition count 298
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 308 transition count 298
Applied a total of 108 rules in 27 ms. Remains 308 /360 variables (removed 52) and now considering 298/354 (removed 56) transitions.
// Phase 1: matrix 298 rows 308 cols
[2024-05-21 01:09:01] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 01:09:01] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-21 01:09:01] [INFO ] Invariant cache hit.
[2024-05-21 01:09:01] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2024-05-21 01:09:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:09:08] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 3 ms to minimize.
[2024-05-21 01:09:08] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 3 ms to minimize.
[2024-05-21 01:09:08] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-05-21 01:09:08] [INFO ] Deduced a trap composed of 43 places in 276 ms of which 5 ms to minimize.
[2024-05-21 01:09:08] [INFO ] Deduced a trap composed of 16 places in 264 ms of which 6 ms to minimize.
[2024-05-21 01:09:09] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 5 ms to minimize.
[2024-05-21 01:09:09] [INFO ] Deduced a trap composed of 49 places in 247 ms of which 5 ms to minimize.
[2024-05-21 01:09:09] [INFO ] Deduced a trap composed of 16 places in 226 ms of which 4 ms to minimize.
[2024-05-21 01:09:10] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 5 ms to minimize.
[2024-05-21 01:09:10] [INFO ] Deduced a trap composed of 60 places in 228 ms of which 4 ms to minimize.
[2024-05-21 01:09:10] [INFO ] Deduced a trap composed of 47 places in 219 ms of which 5 ms to minimize.
[2024-05-21 01:09:10] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 4 ms to minimize.
[2024-05-21 01:09:10] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 4 ms to minimize.
[2024-05-21 01:09:11] [INFO ] Deduced a trap composed of 61 places in 201 ms of which 4 ms to minimize.
[2024-05-21 01:09:11] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 5 ms to minimize.
[2024-05-21 01:09:11] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 4 ms to minimize.
[2024-05-21 01:09:11] [INFO ] Deduced a trap composed of 53 places in 184 ms of which 4 ms to minimize.
[2024-05-21 01:09:12] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 4 ms to minimize.
[2024-05-21 01:09:12] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 4 ms to minimize.
[2024-05-21 01:09:12] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:09:16] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 2 ms to minimize.
[2024-05-21 01:09:16] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 3 ms to minimize.
[2024-05-21 01:09:16] [INFO ] Deduced a trap composed of 51 places in 242 ms of which 5 ms to minimize.
[2024-05-21 01:09:17] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 4 ms to minimize.
[2024-05-21 01:09:17] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 4 ms to minimize.
[2024-05-21 01:09:17] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 3 ms to minimize.
[2024-05-21 01:09:17] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 4 ms to minimize.
[2024-05-21 01:09:17] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 4 ms to minimize.
[2024-05-21 01:09:18] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 3 ms to minimize.
[2024-05-21 01:09:18] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 3 ms to minimize.
[2024-05-21 01:09:18] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 3 ms to minimize.
[2024-05-21 01:09:18] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 3 ms to minimize.
[2024-05-21 01:09:18] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 2 ms to minimize.
[2024-05-21 01:09:19] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 3 ms to minimize.
[2024-05-21 01:09:20] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:09:22] [INFO ] Deduced a trap composed of 69 places in 171 ms of which 4 ms to minimize.
[2024-05-21 01:09:22] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 4 ms to minimize.
[2024-05-21 01:09:22] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 3 ms to minimize.
[2024-05-21 01:09:23] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 4 ms to minimize.
[2024-05-21 01:09:24] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 4 ms to minimize.
[2024-05-21 01:09:24] [INFO ] Deduced a trap composed of 20 places in 201 ms of which 3 ms to minimize.
[2024-05-21 01:09:25] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:09:27] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 3 ms to minimize.
[2024-05-21 01:09:27] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 3 ms to minimize.
[2024-05-21 01:09:27] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 3 ms to minimize.
[2024-05-21 01:09:28] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 4 ms to minimize.
[2024-05-21 01:09:28] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 4 ms to minimize.
[2024-05-21 01:09:28] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/606 variables, and 76 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/308 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 48/76 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:09:35] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-05-21 01:09:35] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-21 01:09:35] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 3 ms to minimize.
[2024-05-21 01:09:36] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 4 ms to minimize.
[2024-05-21 01:09:36] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 4 ms to minimize.
[2024-05-21 01:09:36] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 4 ms to minimize.
[2024-05-21 01:09:37] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 3 ms to minimize.
[2024-05-21 01:09:37] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 8/84 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:09:41] [INFO ] Deduced a trap composed of 102 places in 85 ms of which 3 ms to minimize.
[2024-05-21 01:09:41] [INFO ] Deduced a trap composed of 50 places in 155 ms of which 3 ms to minimize.
[2024-05-21 01:09:41] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-21 01:09:42] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 3 ms to minimize.
[2024-05-21 01:09:42] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 3 ms to minimize.
[2024-05-21 01:09:44] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:09:46] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-21 01:09:47] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 3 ms to minimize.
[2024-05-21 01:09:47] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:09:52] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:09:55] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-21 01:09:57] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/606 variables, and 96 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/308 constraints, PredecessorRefiner: 0/297 constraints, Known Traps: 68/68 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 308/360 places, 298/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60647 ms. Remains : 308/360 places, 298/354 transitions.
[2024-05-21 01:10:01] [INFO ] Flatten gal took : 11 ms
[2024-05-21 01:10:01] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:10:01] [INFO ] Input system was already deterministic with 298 transitions.
[2024-05-21 01:10:01] [INFO ] Flatten gal took : 11 ms
[2024-05-21 01:10:01] [INFO ] Flatten gal took : 11 ms
[2024-05-21 01:10:01] [INFO ] Time to serialize gal into /tmp/CTLFireability11998617716675238605.gal : 3 ms
[2024-05-21 01:10:01] [INFO ] Time to serialize properties into /tmp/CTLFireability13707912412796967021.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/CTLFireability11998617716675238605.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13707912412796967021.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 01:10:31] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:10:31] [INFO ] Applying decomposition
[2024-05-21 01:10:31] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5595406908049651674.txt' '-o' '/tmp/graph5595406908049651674.bin' '-w' '/tmp/graph5595406908049651674.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5595406908049651674.bin' '-l' '-1' '-v' '-w' '/tmp/graph5595406908049651674.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:10:31] [INFO ] Decomposing Gal with order
[2024-05-21 01:10:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:10:31] [INFO ] Removed a total of 57 redundant transitions.
[2024-05-21 01:10:31] [INFO ] Flatten gal took : 17 ms
[2024-05-21 01:10:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 01:10:32] [INFO ] Time to serialize gal into /tmp/CTLFireability16219311859579218401.gal : 4 ms
[2024-05-21 01:10:32] [INFO ] Time to serialize properties into /tmp/CTLFireability17253367746716410929.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/CTLFireability16219311859579218401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17253367746716410929.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.77949e+22,0.813403,23364,3285,14,40575,199,593,54894,30,431,0


Converting to forward existential form...Done !
original formula: EF(((EG((i6.i1.u15.p42==1)) * E(!(((i3.u16.p46!=1)&&((i5.u21.p68==1)||(i1.i1.u60.p209==1)))) U A(EX((i11.u50.p171==1)) U ((i5.u21.p68==1)...262
=> equivalent forward existential formula: ([((FwdU((FwdU(Init,TRUE) * EG((i6.i1.u15.p42==1))),!(((i3.u16.p46!=1)&&((i5.u21.p68==1)||(i1.i1.u60.p209==1))))...458
Reverse transition relation is NOT exact ! Due to transitions t94, t97, t120, t123, t155, t162, t177, t184, t206, t221, t289, t290, t291, i0.t110, i0.t107,...794
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 360/360 places, 354/354 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 359 transition count 223
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 150 rules applied. Total rules applied 280 place count 229 transition count 203
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 288 place count 221 transition count 203
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 288 place count 221 transition count 156
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 382 place count 174 transition count 156
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 410 place count 146 transition count 128
Iterating global reduction 3 with 28 rules applied. Total rules applied 438 place count 146 transition count 128
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 438 place count 146 transition count 117
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 460 place count 135 transition count 117
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 532 place count 99 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 536 place count 99 transition count 77
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 544 place count 95 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 545 place count 94 transition count 72
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 551 place count 89 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 552 place count 88 transition count 71
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 552 place count 88 transition count 67
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 560 place count 84 transition count 67
Applied a total of 560 rules in 30 ms. Remains 84 /360 variables (removed 276) and now considering 67/354 (removed 287) transitions.
// Phase 1: matrix 67 rows 84 cols
[2024-05-21 01:11:02] [INFO ] Computed 23 invariants in 1 ms
[2024-05-21 01:11:02] [INFO ] Implicit Places using invariants in 117 ms returned [35, 49, 63, 68, 72, 77, 83]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 119 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 77/360 places, 67/354 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 72 transition count 62
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 72 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 71 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 71 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 70 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 70 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 69 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 69 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 68 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 68 transition count 58
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 20 place count 67 transition count 57
Applied a total of 20 rules in 10 ms. Remains 67 /77 variables (removed 10) and now considering 57/67 (removed 10) transitions.
// Phase 1: matrix 57 rows 67 cols
[2024-05-21 01:11:02] [INFO ] Computed 16 invariants in 1 ms
[2024-05-21 01:11:02] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 01:11:02] [INFO ] Invariant cache hit.
[2024-05-21 01:11:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 01:11:02] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 67/360 places, 57/354 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 350 ms. Remains : 67/360 places, 57/354 transitions.
[2024-05-21 01:11:02] [INFO ] Flatten gal took : 2 ms
[2024-05-21 01:11:02] [INFO ] Flatten gal took : 2 ms
[2024-05-21 01:11:02] [INFO ] Input system was already deterministic with 57 transitions.
[2024-05-21 01:11:02] [INFO ] Flatten gal took : 2 ms
[2024-05-21 01:11:02] [INFO ] Flatten gal took : 2 ms
[2024-05-21 01:11:02] [INFO ] Time to serialize gal into /tmp/CTLFireability5813958258477324936.gal : 1 ms
[2024-05-21 01:11:02] [INFO ] Time to serialize properties into /tmp/CTLFireability11116692417847018601.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/CTLFireability5813958258477324936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11116692417847018601.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.46496e+06,0.018904,3764,2,245,5,1757,6,0,322,1771,0


Converting to forward existential form...Done !
original formula: EG((p192==0))
=> equivalent forward existential formula: [FwdG(Init,(p192==0))] != FALSE
Hit Full ! (commute/partial/dont) 55/0/2
(forward)formula 0,1,0.058984,5140,1,0,10,9687,19,4,1564,5134,8
FORMULA AutoFlight-PT-04b-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 354/354 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 329 transition count 323
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 329 transition count 323
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 64 place count 329 transition count 321
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 77 place count 316 transition count 308
Iterating global reduction 1 with 13 rules applied. Total rules applied 90 place count 316 transition count 308
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 314 transition count 306
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 314 transition count 306
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 312 transition count 304
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 312 transition count 304
Applied a total of 98 rules in 22 ms. Remains 312 /360 variables (removed 48) and now considering 304/354 (removed 50) transitions.
// Phase 1: matrix 304 rows 312 cols
[2024-05-21 01:11:02] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 01:11:02] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 01:11:02] [INFO ] Invariant cache hit.
[2024-05-21 01:11:03] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-05-21 01:11:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/312 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 01:11:09] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 2 ms to minimize.
[2024-05-21 01:11:09] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 3 ms to minimize.
[2024-05-21 01:11:09] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
[2024-05-21 01:11:10] [INFO ] Deduced a trap composed of 50 places in 278 ms of which 5 ms to minimize.
[2024-05-21 01:11:10] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 5 ms to minimize.
[2024-05-21 01:11:10] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 5 ms to minimize.
[2024-05-21 01:11:11] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 5 ms to minimize.
[2024-05-21 01:11:11] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 5 ms to minimize.
[2024-05-21 01:11:11] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 4 ms to minimize.
[2024-05-21 01:11:11] [INFO ] Deduced a trap composed of 56 places in 183 ms of which 4 ms to minimize.
[2024-05-21 01:11:12] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 3 ms to minimize.
[2024-05-21 01:11:12] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 3 ms to minimize.
[2024-05-21 01:11:12] [INFO ] Deduced a trap composed of 71 places in 190 ms of which 3 ms to minimize.
[2024-05-21 01:11:12] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 3 ms to minimize.
[2024-05-21 01:11:12] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 3 ms to minimize.
[2024-05-21 01:11:13] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 3 ms to minimize.
[2024-05-21 01:11:13] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 3 ms to minimize.
[2024-05-21 01:11:13] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 4 ms to minimize.
[2024-05-21 01:11:13] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 4 ms to minimize.
[2024-05-21 01:11:13] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 01:11:17] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 4 ms to minimize.
[2024-05-21 01:11:17] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 3 ms to minimize.
[2024-05-21 01:11:18] [INFO ] Deduced a trap composed of 56 places in 235 ms of which 4 ms to minimize.
[2024-05-21 01:11:18] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-05-21 01:11:18] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 4 ms to minimize.
[2024-05-21 01:11:18] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 3 ms to minimize.
[2024-05-21 01:11:19] [INFO ] Deduced a trap composed of 62 places in 125 ms of which 3 ms to minimize.
[2024-05-21 01:11:19] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-05-21 01:11:19] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 3 ms to minimize.
[2024-05-21 01:11:19] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 4 ms to minimize.
[2024-05-21 01:11:20] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 4 ms to minimize.
[2024-05-21 01:11:21] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 4 ms to minimize.
[2024-05-21 01:11:21] [INFO ] Deduced a trap composed of 50 places in 170 ms of which 3 ms to minimize.
[2024-05-21 01:11:21] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 3 ms to minimize.
[2024-05-21 01:11:21] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 01:11:23] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 4 ms to minimize.
[2024-05-21 01:11:24] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 3 ms to minimize.
[2024-05-21 01:11:24] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 4 ms to minimize.
[2024-05-21 01:11:24] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 3 ms to minimize.
[2024-05-21 01:11:24] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 3 ms to minimize.
[2024-05-21 01:11:25] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 3 ms to minimize.
[2024-05-21 01:11:25] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 3 ms to minimize.
[2024-05-21 01:11:25] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 3 ms to minimize.
[2024-05-21 01:11:25] [INFO ] Deduced a trap composed of 70 places in 130 ms of which 3 ms to minimize.
[2024-05-21 01:11:25] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 3 ms to minimize.
[2024-05-21 01:11:25] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 3 ms to minimize.
[2024-05-21 01:11:26] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 12/75 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 01:11:29] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 3 ms to minimize.
[2024-05-21 01:11:29] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-21 01:11:29] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/616 variables, and 78 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/312 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/312 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 50/78 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 01:11:37] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 4 ms to minimize.
[2024-05-21 01:11:37] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 3 ms to minimize.
[2024-05-21 01:11:38] [INFO ] Deduced a trap composed of 68 places in 126 ms of which 3 ms to minimize.
[2024-05-21 01:11:38] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 4 ms to minimize.
[2024-05-21 01:11:38] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 3 ms to minimize.
[2024-05-21 01:11:39] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 01:11:41] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-21 01:11:41] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 3 ms to minimize.
[2024-05-21 01:11:42] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 3 ms to minimize.
[2024-05-21 01:11:42] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 3 ms to minimize.
[2024-05-21 01:11:42] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 3 ms to minimize.
[2024-05-21 01:11:43] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 01:11:46] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 4 ms to minimize.
[2024-05-21 01:11:46] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 4 ms to minimize.
[2024-05-21 01:11:46] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-05-21 01:11:47] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
[2024-05-21 01:11:47] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 01:11:50] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 2 ms to minimize.
[2024-05-21 01:11:50] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 01:11:54] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 01:11:59] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 4 ms to minimize.
[2024-05-21 01:11:59] [INFO ] Deduced a trap composed of 59 places in 171 ms of which 3 ms to minimize.
[2024-05-21 01:12:00] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 3 ms to minimize.
[2024-05-21 01:12:00] [INFO ] Deduced a trap composed of 66 places in 131 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 01:12:02] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/616 variables, and 103 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/312 constraints, PredecessorRefiner: 0/303 constraints, Known Traps: 75/75 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 312/360 places, 304/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60613 ms. Remains : 312/360 places, 304/354 transitions.
[2024-05-21 01:12:03] [INFO ] Flatten gal took : 11 ms
[2024-05-21 01:12:03] [INFO ] Flatten gal took : 13 ms
[2024-05-21 01:12:03] [INFO ] Input system was already deterministic with 304 transitions.
[2024-05-21 01:12:03] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:12:03] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:12:03] [INFO ] Time to serialize gal into /tmp/CTLFireability15645429185457183553.gal : 2 ms
[2024-05-21 01:12:03] [INFO ] Time to serialize properties into /tmp/CTLFireability13985547866352513322.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/CTLFireability15645429185457183553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13985547866352513322.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 01:12:33] [INFO ] Flatten gal took : 7 ms
[2024-05-21 01:12:33] [INFO ] Applying decomposition
[2024-05-21 01:12:33] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17959673450667882487.txt' '-o' '/tmp/graph17959673450667882487.bin' '-w' '/tmp/graph17959673450667882487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17959673450667882487.bin' '-l' '-1' '-v' '-w' '/tmp/graph17959673450667882487.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:12:33] [INFO ] Decomposing Gal with order
[2024-05-21 01:12:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:12:33] [INFO ] Removed a total of 55 redundant transitions.
[2024-05-21 01:12:33] [INFO ] Flatten gal took : 17 ms
[2024-05-21 01:12:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 01:12:33] [INFO ] Time to serialize gal into /tmp/CTLFireability11090849526203801653.gal : 7 ms
[2024-05-21 01:12:33] [INFO ] Time to serialize properties into /tmp/CTLFireability642425284203690497.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/CTLFireability11090849526203801653.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability642425284203690497.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,8.27924e+22,2.80853,72844,10270,26,139099,377,589,217015,44,978,0


Converting to forward existential form...Done !
original formula: ((AX(((i13.u51.p187==1)||(i6.u22.p72==0))) * AX(!(A(EG(E((i3.u13.p33==1) U (i10.u40.p145==1))) U (i4.u16.p52==1))))) * (AF(!(E(EF((i21.u1...350
=> equivalent forward existential formula: (([(EY(Init) * !(((i13.u51.p187==1)||(i6.u22.p72==0))))] = FALSE * [((EY(Init) * !(EG(!((i4.u16.p52==1))))) * !(...528
Reverse transition relation is NOT exact ! Due to transitions t96, t99, t109, t112, t135, t138, t166, t181, t188, t210, t227, t292, t293, t295, t296, t297,...798
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 354/354 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 333 transition count 327
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 333 transition count 327
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 333 transition count 325
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 69 place count 320 transition count 312
Iterating global reduction 1 with 13 rules applied. Total rules applied 82 place count 320 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 318 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 318 transition count 310
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 88 place count 316 transition count 308
Iterating global reduction 1 with 2 rules applied. Total rules applied 90 place count 316 transition count 308
Applied a total of 90 rules in 20 ms. Remains 316 /360 variables (removed 44) and now considering 308/354 (removed 46) transitions.
// Phase 1: matrix 308 rows 316 cols
[2024-05-21 01:13:03] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 01:13:03] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-21 01:13:03] [INFO ] Invariant cache hit.
[2024-05-21 01:13:03] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2024-05-21 01:13:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/316 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-05-21 01:13:09] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
[2024-05-21 01:13:09] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-21 01:13:09] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 3 ms to minimize.
[2024-05-21 01:13:09] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 3 ms to minimize.
[2024-05-21 01:13:10] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 3 ms to minimize.
[2024-05-21 01:13:10] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 3 ms to minimize.
[2024-05-21 01:13:10] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 3 ms to minimize.
[2024-05-21 01:13:10] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-21 01:13:10] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2024-05-21 01:13:10] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 4 ms to minimize.
[2024-05-21 01:13:10] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 3 ms to minimize.
[2024-05-21 01:13:11] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 3 ms to minimize.
[2024-05-21 01:13:11] [INFO ] Deduced a trap composed of 50 places in 207 ms of which 4 ms to minimize.
[2024-05-21 01:13:11] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 4 ms to minimize.
[2024-05-21 01:13:11] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 3 ms to minimize.
[2024-05-21 01:13:11] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2024-05-21 01:13:11] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 3 ms to minimize.
[2024-05-21 01:13:12] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
[2024-05-21 01:13:12] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 4 ms to minimize.
[2024-05-21 01:13:12] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-05-21 01:13:15] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 4 ms to minimize.
[2024-05-21 01:13:15] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 3 ms to minimize.
[2024-05-21 01:13:15] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 3 ms to minimize.
[2024-05-21 01:13:15] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 3 ms to minimize.
[2024-05-21 01:13:16] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 5 ms to minimize.
[2024-05-21 01:13:16] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 4 ms to minimize.
[2024-05-21 01:13:16] [INFO ] Deduced a trap composed of 52 places in 201 ms of which 5 ms to minimize.
[2024-05-21 01:13:17] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 3 ms to minimize.
[2024-05-21 01:13:17] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 3 ms to minimize.
[2024-05-21 01:13:17] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 4 ms to minimize.
[2024-05-21 01:13:17] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 4 ms to minimize.
[2024-05-21 01:13:17] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 3 ms to minimize.
[2024-05-21 01:13:17] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 2 ms to minimize.
[2024-05-21 01:13:18] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 4 ms to minimize.
[2024-05-21 01:13:18] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2024-05-21 01:13:18] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 3 ms to minimize.
[2024-05-21 01:13:19] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 3 ms to minimize.
[2024-05-21 01:13:19] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-21 01:13:20] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 3 ms to minimize.
[2024-05-21 01:13:20] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-05-21 01:13:21] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 4 ms to minimize.
[2024-05-21 01:13:21] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 4 ms to minimize.
[2024-05-21 01:13:21] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 3 ms to minimize.
[2024-05-21 01:13:22] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 4 ms to minimize.
[2024-05-21 01:13:22] [INFO ] Deduced a trap composed of 62 places in 160 ms of which 3 ms to minimize.
[2024-05-21 01:13:22] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 3 ms to minimize.
[2024-05-21 01:13:22] [INFO ] Deduced a trap composed of 60 places in 147 ms of which 3 ms to minimize.
[2024-05-21 01:13:24] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 8/76 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-05-21 01:13:27] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 3 ms to minimize.
[2024-05-21 01:13:27] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 3 ms to minimize.
[2024-05-21 01:13:27] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 2 ms to minimize.
[2024-05-21 01:13:27] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 3 ms to minimize.
[2024-05-21 01:13:27] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 3 ms to minimize.
[2024-05-21 01:13:28] [INFO ] Deduced a trap composed of 57 places in 160 ms of which 4 ms to minimize.
[2024-05-21 01:13:28] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
[2024-05-21 01:13:29] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 8/84 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/624 variables, and 84 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/316 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/316 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 56/84 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 308/624 variables, 316/400 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 307/707 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-05-21 01:13:43] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 01:13:43] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 2 ms to minimize.
[2024-05-21 01:13:43] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2024-05-21 01:13:43] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 3 ms to minimize.
[2024-05-21 01:13:44] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 3 ms to minimize.
[2024-05-21 01:13:44] [INFO ] Deduced a trap composed of 61 places in 199 ms of which 4 ms to minimize.
[2024-05-21 01:13:44] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 4 ms to minimize.
[2024-05-21 01:13:44] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
[2024-05-21 01:13:44] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 2 ms to minimize.
[2024-05-21 01:13:44] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 3 ms to minimize.
[2024-05-21 01:13:45] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 3 ms to minimize.
[2024-05-21 01:13:45] [INFO ] Deduced a trap composed of 63 places in 120 ms of which 3 ms to minimize.
[2024-05-21 01:13:45] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 3 ms to minimize.
[2024-05-21 01:13:45] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 2 ms to minimize.
[2024-05-21 01:13:45] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 2 ms to minimize.
[2024-05-21 01:13:46] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 3 ms to minimize.
[2024-05-21 01:13:46] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 3 ms to minimize.
[2024-05-21 01:13:47] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 5 ms to minimize.
[2024-05-21 01:13:47] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 2 ms to minimize.
[2024-05-21 01:13:48] [INFO ] Deduced a trap composed of 66 places in 123 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 20/727 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-05-21 01:13:51] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-05-21 01:13:51] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-21 01:13:52] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2024-05-21 01:13:53] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 3 ms to minimize.
[2024-05-21 01:13:53] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 4 ms to minimize.
[2024-05-21 01:13:53] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 4 ms to minimize.
[2024-05-21 01:13:53] [INFO ] Deduced a trap composed of 61 places in 188 ms of which 4 ms to minimize.
[2024-05-21 01:13:54] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
[2024-05-21 01:13:54] [INFO ] Deduced a trap composed of 81 places in 184 ms of which 4 ms to minimize.
[2024-05-21 01:13:55] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 4 ms to minimize.
[2024-05-21 01:13:55] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 3 ms to minimize.
[2024-05-21 01:13:56] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 3 ms to minimize.
[2024-05-21 01:14:02] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 2 ms to minimize.
[2024-05-21 01:14:02] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-05-21 01:14:02] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/624 variables, 15/742 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 624/624 variables, and 742 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 91/91 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 316/360 places, 308/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60527 ms. Remains : 316/360 places, 308/354 transitions.
[2024-05-21 01:14:03] [INFO ] Flatten gal took : 11 ms
[2024-05-21 01:14:03] [INFO ] Flatten gal took : 11 ms
[2024-05-21 01:14:03] [INFO ] Input system was already deterministic with 308 transitions.
[2024-05-21 01:14:03] [INFO ] Flatten gal took : 11 ms
[2024-05-21 01:14:03] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:14:04] [INFO ] Time to serialize gal into /tmp/CTLFireability2958094297660201447.gal : 3 ms
[2024-05-21 01:14:04] [INFO ] Time to serialize properties into /tmp/CTLFireability16040002867799985552.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/CTLFireability2958094297660201447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16040002867799985552.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 01:14:34] [INFO ] Flatten gal took : 7 ms
[2024-05-21 01:14:34] [INFO ] Applying decomposition
[2024-05-21 01:14:34] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12141868804620490502.txt' '-o' '/tmp/graph12141868804620490502.bin' '-w' '/tmp/graph12141868804620490502.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12141868804620490502.bin' '-l' '-1' '-v' '-w' '/tmp/graph12141868804620490502.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:14:34] [INFO ] Decomposing Gal with order
[2024-05-21 01:14:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:14:34] [INFO ] Removed a total of 52 redundant transitions.
[2024-05-21 01:14:34] [INFO ] Flatten gal took : 16 ms
[2024-05-21 01:14:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 01:14:34] [INFO ] Time to serialize gal into /tmp/CTLFireability15763857156524727465.gal : 4 ms
[2024-05-21 01:14:34] [INFO ] Time to serialize properties into /tmp/CTLFireability18429577720715268220.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/CTLFireability15763857156524727465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18429577720715268220.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,8.85325e+22,0.995599,24192,4106,24,43273,295,626,56696,47,710,0


Converting to forward existential form...Done !
original formula: (E(EG(!(AG((i14.i0.u3.p6==1)))) U (((((AG(((i21.i1.u124.p370==1)&&(i19.i1.u70.p248==1))) + EG((i6.u20.p66==1))) + AF((i8.i1.u27.p95==1)))...816
=> equivalent forward existential formula: ((([(EY(((EY((Init * !(E(EG(!(!(E(TRUE U !((i14.i0.u3.p6==1)))))) U (((((!(E(TRUE U !(((i21.i1.u124.p370==1)&&(i...2584
Reverse transition relation is NOT exact ! Due to transitions t111, t125, t128, t159, t166, t181, t205, t214, t231, t297, t299, t300, t301, i0.i1.t127, i1....854
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 360/360 places, 354/354 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 325 transition count 319
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 325 transition count 319
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 74 place count 325 transition count 315
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 89 place count 310 transition count 300
Iterating global reduction 1 with 15 rules applied. Total rules applied 104 place count 310 transition count 300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 308 transition count 298
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 308 transition count 298
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 306 transition count 296
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 306 transition count 296
Applied a total of 112 rules in 36 ms. Remains 306 /360 variables (removed 54) and now considering 296/354 (removed 58) transitions.
// Phase 1: matrix 296 rows 306 cols
[2024-05-21 01:15:04] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 01:15:04] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-21 01:15:04] [INFO ] Invariant cache hit.
[2024-05-21 01:15:04] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-21 01:15:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-21 01:15:10] [INFO ] Deduced a trap composed of 48 places in 256 ms of which 6 ms to minimize.
[2024-05-21 01:15:10] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 5 ms to minimize.
[2024-05-21 01:15:11] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 5 ms to minimize.
[2024-05-21 01:15:11] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 4 ms to minimize.
[2024-05-21 01:15:11] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 4 ms to minimize.
[2024-05-21 01:15:11] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 4 ms to minimize.
[2024-05-21 01:15:11] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 4 ms to minimize.
[2024-05-21 01:15:12] [INFO ] Deduced a trap composed of 58 places in 196 ms of which 4 ms to minimize.
[2024-05-21 01:15:12] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 4 ms to minimize.
[2024-05-21 01:15:12] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 4 ms to minimize.
[2024-05-21 01:15:12] [INFO ] Deduced a trap composed of 55 places in 175 ms of which 4 ms to minimize.
[2024-05-21 01:15:13] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 4 ms to minimize.
[2024-05-21 01:15:13] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 5 ms to minimize.
[2024-05-21 01:15:13] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 4 ms to minimize.
[2024-05-21 01:15:13] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 5 ms to minimize.
[2024-05-21 01:15:14] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 4 ms to minimize.
[2024-05-21 01:15:14] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 4 ms to minimize.
[2024-05-21 01:15:14] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 4 ms to minimize.
[2024-05-21 01:15:14] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 3 ms to minimize.
[2024-05-21 01:15:14] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-21 01:15:19] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 3 ms to minimize.
[2024-05-21 01:15:19] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-21 01:15:19] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-21 01:15:22] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 3 ms to minimize.
[2024-05-21 01:15:22] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 3 ms to minimize.
[2024-05-21 01:15:22] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 3 ms to minimize.
[2024-05-21 01:15:22] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 3 ms to minimize.
[2024-05-21 01:15:24] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 3 ms to minimize.
[2024-05-21 01:15:24] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 3 ms to minimize.
[2024-05-21 01:15:24] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 3 ms to minimize.
[2024-05-21 01:15:24] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 4 ms to minimize.
[2024-05-21 01:15:25] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 3 ms to minimize.
[2024-05-21 01:15:25] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 2 ms to minimize.
[2024-05-21 01:15:25] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 4 ms to minimize.
[2024-05-21 01:15:25] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 4 ms to minimize.
[2024-05-21 01:15:26] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-21 01:15:26] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
[2024-05-21 01:15:26] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-21 01:15:28] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/602 variables, and 67 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 39/67 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-21 01:15:38] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 4 ms to minimize.
[2024-05-21 01:15:39] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 2 ms to minimize.
[2024-05-21 01:15:39] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 2 ms to minimize.
[2024-05-21 01:15:39] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 3 ms to minimize.
[2024-05-21 01:15:39] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-21 01:15:40] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-21 01:15:40] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-21 01:15:43] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-21 01:15:46] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 3 ms to minimize.
[2024-05-21 01:15:46] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 3 ms to minimize.
[2024-05-21 01:15:47] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-21 01:15:50] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-05-21 01:15:52] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 4 ms to minimize.
[2024-05-21 01:15:52] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-21 01:15:54] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 296/602 variables, 306/388 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/602 variables, 295/683 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-21 01:16:02] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
[2024-05-21 01:16:02] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 4 ms to minimize.
[2024-05-21 01:16:03] [INFO ] Deduced a trap composed of 60 places in 189 ms of which 4 ms to minimize.
[2024-05-21 01:16:04] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 3 ms to minimize.
[2024-05-21 01:16:04] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 3 ms to minimize.
[2024-05-21 01:16:04] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/602 variables, and 689 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 60/60 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in LTL mode, iteration 1 : 306/360 places, 296/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60724 ms. Remains : 306/360 places, 296/354 transitions.
[2024-05-21 01:16:04] [INFO ] Flatten gal took : 11 ms
[2024-05-21 01:16:04] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:16:04] [INFO ] Input system was already deterministic with 296 transitions.
[2024-05-21 01:16:04] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:16:04] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:16:05] [INFO ] Time to serialize gal into /tmp/CTLFireability11698195674762348030.gal : 2 ms
[2024-05-21 01:16:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10666793487788114859.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/CTLFireability11698195674762348030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10666793487788114859.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 01:16:35] [INFO ] Flatten gal took : 6 ms
[2024-05-21 01:16:35] [INFO ] Applying decomposition
[2024-05-21 01:16:35] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18206053234989158571.txt' '-o' '/tmp/graph18206053234989158571.bin' '-w' '/tmp/graph18206053234989158571.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18206053234989158571.bin' '-l' '-1' '-v' '-w' '/tmp/graph18206053234989158571.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:16:35] [INFO ] Decomposing Gal with order
[2024-05-21 01:16:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:16:35] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-21 01:16:35] [INFO ] Flatten gal took : 14 ms
[2024-05-21 01:16:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 01:16:35] [INFO ] Time to serialize gal into /tmp/CTLFireability16927842258814032281.gal : 4 ms
[2024-05-21 01:16:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7772673487142472178.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/CTLFireability16927842258814032281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7772673487142472178.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,5.60767e+22,0.695747,20440,3309,16,34320,208,584,46386,35,412,0


Converting to forward existential form...Done !
original formula: AX(AF(AG(AX(((i8.u41.p146==1)&&(i2.u10.p32==1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(E(TRUE U !(!(EX(!(((i8.u41.p146==1)&&(i2.u10.p32==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t92, t95, t118, t121, t152, t159, t174, t181, t203, t218, t285, t287, t288, t289, i0.i1.t94, ...763
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 360/360 places, 354/354 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 324 transition count 318
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 324 transition count 318
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 76 place count 324 transition count 314
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 92 place count 308 transition count 298
Iterating global reduction 1 with 16 rules applied. Total rules applied 108 place count 308 transition count 298
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 306 transition count 296
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 306 transition count 296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 304 transition count 294
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 304 transition count 294
Applied a total of 116 rules in 25 ms. Remains 304 /360 variables (removed 56) and now considering 294/354 (removed 60) transitions.
// Phase 1: matrix 294 rows 304 cols
[2024-05-21 01:17:05] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 01:17:05] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 01:17:05] [INFO ] Invariant cache hit.
[2024-05-21 01:17:05] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-21 01:17:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:17:12] [INFO ] Deduced a trap composed of 19 places in 267 ms of which 6 ms to minimize.
[2024-05-21 01:17:12] [INFO ] Deduced a trap composed of 57 places in 267 ms of which 4 ms to minimize.
[2024-05-21 01:17:12] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 4 ms to minimize.
[2024-05-21 01:17:13] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 5 ms to minimize.
[2024-05-21 01:17:13] [INFO ] Deduced a trap composed of 50 places in 227 ms of which 5 ms to minimize.
[2024-05-21 01:17:13] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 4 ms to minimize.
[2024-05-21 01:17:13] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 4 ms to minimize.
[2024-05-21 01:17:13] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 5 ms to minimize.
[2024-05-21 01:17:14] [INFO ] Deduced a trap composed of 58 places in 194 ms of which 4 ms to minimize.
[2024-05-21 01:17:14] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 4 ms to minimize.
[2024-05-21 01:17:14] [INFO ] Deduced a trap composed of 49 places in 250 ms of which 5 ms to minimize.
[2024-05-21 01:17:14] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 5 ms to minimize.
[2024-05-21 01:17:15] [INFO ] Deduced a trap composed of 54 places in 254 ms of which 5 ms to minimize.
[2024-05-21 01:17:15] [INFO ] Deduced a trap composed of 53 places in 241 ms of which 4 ms to minimize.
[2024-05-21 01:17:15] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 4 ms to minimize.
[2024-05-21 01:17:16] [INFO ] Deduced a trap composed of 53 places in 228 ms of which 4 ms to minimize.
[2024-05-21 01:17:16] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 4 ms to minimize.
[2024-05-21 01:17:16] [INFO ] Deduced a trap composed of 46 places in 207 ms of which 4 ms to minimize.
[2024-05-21 01:17:16] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 4 ms to minimize.
[2024-05-21 01:17:17] [INFO ] Deduced a trap composed of 45 places in 222 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:17:20] [INFO ] Deduced a trap composed of 58 places in 184 ms of which 3 ms to minimize.
[2024-05-21 01:17:20] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 3 ms to minimize.
[2024-05-21 01:17:20] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 4 ms to minimize.
[2024-05-21 01:17:21] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 4 ms to minimize.
[2024-05-21 01:17:21] [INFO ] Deduced a trap composed of 54 places in 163 ms of which 3 ms to minimize.
[2024-05-21 01:17:21] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 3 ms to minimize.
[2024-05-21 01:17:22] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 5 ms to minimize.
[2024-05-21 01:17:22] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 5 ms to minimize.
[2024-05-21 01:17:22] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 4 ms to minimize.
[2024-05-21 01:17:22] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 3 ms to minimize.
[2024-05-21 01:17:22] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 2 ms to minimize.
[2024-05-21 01:17:22] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 3 ms to minimize.
[2024-05-21 01:17:23] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 3 ms to minimize.
[2024-05-21 01:17:23] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 3 ms to minimize.
[2024-05-21 01:17:23] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 3 ms to minimize.
[2024-05-21 01:17:23] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 4 ms to minimize.
[2024-05-21 01:17:23] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 3 ms to minimize.
[2024-05-21 01:17:24] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 3 ms to minimize.
[2024-05-21 01:17:24] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 3 ms to minimize.
[2024-05-21 01:17:24] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:17:25] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 3 ms to minimize.
[2024-05-21 01:17:25] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 3 ms to minimize.
[2024-05-21 01:17:25] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 4 ms to minimize.
[2024-05-21 01:17:25] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 4 ms to minimize.
[2024-05-21 01:17:26] [INFO ] Deduced a trap composed of 70 places in 176 ms of which 4 ms to minimize.
[2024-05-21 01:17:26] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 3 ms to minimize.
[2024-05-21 01:17:26] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 3 ms to minimize.
[2024-05-21 01:17:26] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 3 ms to minimize.
[2024-05-21 01:17:26] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 3 ms to minimize.
[2024-05-21 01:17:27] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 3 ms to minimize.
[2024-05-21 01:17:28] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 3 ms to minimize.
[2024-05-21 01:17:28] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 4 ms to minimize.
[2024-05-21 01:17:29] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 3 ms to minimize.
[2024-05-21 01:17:29] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2024-05-21 01:17:29] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-21 01:17:29] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 4 ms to minimize.
[2024-05-21 01:17:29] [INFO ] Deduced a trap composed of 71 places in 156 ms of which 4 ms to minimize.
[2024-05-21 01:17:29] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 3 ms to minimize.
[2024-05-21 01:17:30] [INFO ] Deduced a trap composed of 63 places in 156 ms of which 4 ms to minimize.
[2024-05-21 01:17:30] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:17:31] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 3 ms to minimize.
[2024-05-21 01:17:31] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 2 ms to minimize.
[2024-05-21 01:17:31] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 4 ms to minimize.
[2024-05-21 01:17:32] [INFO ] Deduced a trap composed of 61 places in 142 ms of which 3 ms to minimize.
[2024-05-21 01:17:32] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 4 ms to minimize.
[2024-05-21 01:17:33] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/598 variables, and 94 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 66/94 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:17:40] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 3 ms to minimize.
[2024-05-21 01:17:40] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 4 ms to minimize.
[2024-05-21 01:17:40] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 3 ms to minimize.
[2024-05-21 01:17:40] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:17:43] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 3 ms to minimize.
[2024-05-21 01:17:44] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:17:47] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 3 ms to minimize.
[2024-05-21 01:17:47] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 4 ms to minimize.
[2024-05-21 01:17:47] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:17:51] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 294/598 variables, 304/408 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 293/701 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:17:59] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 5 ms to minimize.
[2024-05-21 01:18:01] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 4 ms to minimize.
[2024-05-21 01:18:01] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 4 ms to minimize.
[2024-05-21 01:18:01] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 3 ms to minimize.
[2024-05-21 01:18:01] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 3 ms to minimize.
[2024-05-21 01:18:02] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 707 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 82/82 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 304/360 places, 294/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60674 ms. Remains : 304/360 places, 294/354 transitions.
[2024-05-21 01:18:05] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:18:05] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:18:05] [INFO ] Input system was already deterministic with 294 transitions.
[2024-05-21 01:18:05] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:18:05] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:18:05] [INFO ] Time to serialize gal into /tmp/CTLFireability1402451607064088979.gal : 3 ms
[2024-05-21 01:18:05] [INFO ] Time to serialize properties into /tmp/CTLFireability16434191437826667794.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/CTLFireability1402451607064088979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16434191437826667794.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,5.14719e+22,20.3382,462728,2,129777,5,1.54453e+06,6,0,1512,2.92427e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 01:18:35] [INFO ] Flatten gal took : 5 ms
[2024-05-21 01:18:35] [INFO ] Applying decomposition
[2024-05-21 01:18:35] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11939819750070301437.txt' '-o' '/tmp/graph11939819750070301437.bin' '-w' '/tmp/graph11939819750070301437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11939819750070301437.bin' '-l' '-1' '-v' '-w' '/tmp/graph11939819750070301437.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:18:36] [INFO ] Decomposing Gal with order
[2024-05-21 01:18:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:18:36] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-21 01:18:36] [INFO ] Flatten gal took : 14 ms
[2024-05-21 01:18:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 01:18:36] [INFO ] Time to serialize gal into /tmp/CTLFireability12028750366034581522.gal : 3 ms
[2024-05-21 01:18:36] [INFO ] Time to serialize properties into /tmp/CTLFireability11616517887524096180.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/CTLFireability12028750366034581522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11616517887524096180.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.14719e+22,0.247956,11180,1958,15,15433,219,593,16211,35,419,0


Converting to forward existential form...Done !
original formula: AX(EF(EG(((i0.i0.u2.p7==1)||((i6.i1.u36.p131==1)&&(i11.u80.p271==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U EG(((i0.i0.u2.p7==1)||((i6.i1.u36.p131==1)&&(i11.u80.p271==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t91, t94, t104, t107, t130, t133, t151, t158, t173, t180, t195, t202, t217, t283, t285, t286,...731
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
(forward)formula 0,0,11.2811,305276,1,0,810210,219,3460,596409,157,419,1009572
FORMULA AutoFlight-PT-04b-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 354/354 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 326 transition count 320
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 326 transition count 320
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 72 place count 326 transition count 316
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 88 place count 310 transition count 300
Iterating global reduction 1 with 16 rules applied. Total rules applied 104 place count 310 transition count 300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 308 transition count 298
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 308 transition count 298
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 306 transition count 296
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 306 transition count 296
Applied a total of 112 rules in 20 ms. Remains 306 /360 variables (removed 54) and now considering 296/354 (removed 58) transitions.
// Phase 1: matrix 296 rows 306 cols
[2024-05-21 01:18:47] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 01:18:47] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-21 01:18:47] [INFO ] Invariant cache hit.
[2024-05-21 01:18:48] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-21 01:18:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-21 01:18:54] [INFO ] Deduced a trap composed of 51 places in 267 ms of which 5 ms to minimize.
[2024-05-21 01:18:55] [INFO ] Deduced a trap composed of 44 places in 259 ms of which 5 ms to minimize.
[2024-05-21 01:18:55] [INFO ] Deduced a trap composed of 54 places in 248 ms of which 5 ms to minimize.
[2024-05-21 01:18:55] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 5 ms to minimize.
[2024-05-21 01:18:55] [INFO ] Deduced a trap composed of 63 places in 199 ms of which 5 ms to minimize.
[2024-05-21 01:18:56] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 4 ms to minimize.
[2024-05-21 01:18:56] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 4 ms to minimize.
[2024-05-21 01:18:56] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 5 ms to minimize.
[2024-05-21 01:18:56] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 4 ms to minimize.
[2024-05-21 01:18:56] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 4 ms to minimize.
[2024-05-21 01:18:57] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 4 ms to minimize.
[2024-05-21 01:18:57] [INFO ] Deduced a trap composed of 52 places in 246 ms of which 5 ms to minimize.
[2024-05-21 01:18:57] [INFO ] Deduced a trap composed of 44 places in 218 ms of which 5 ms to minimize.
[2024-05-21 01:18:57] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 4 ms to minimize.
[2024-05-21 01:18:58] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 4 ms to minimize.
[2024-05-21 01:18:58] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 4 ms to minimize.
[2024-05-21 01:18:58] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 4 ms to minimize.
[2024-05-21 01:18:58] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 4 ms to minimize.
[2024-05-21 01:18:59] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-21 01:18:59] [INFO ] Deduced a trap composed of 51 places in 195 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-21 01:19:02] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 4 ms to minimize.
[2024-05-21 01:19:03] [INFO ] Deduced a trap composed of 63 places in 219 ms of which 5 ms to minimize.
[2024-05-21 01:19:03] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 4 ms to minimize.
[2024-05-21 01:19:03] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 4 ms to minimize.
[2024-05-21 01:19:03] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 3 ms to minimize.
[2024-05-21 01:19:03] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2024-05-21 01:19:04] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 3 ms to minimize.
[2024-05-21 01:19:04] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 3 ms to minimize.
[2024-05-21 01:19:04] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 4 ms to minimize.
[2024-05-21 01:19:05] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 3 ms to minimize.
[2024-05-21 01:19:05] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 3 ms to minimize.
[2024-05-21 01:19:05] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 2 ms to minimize.
[2024-05-21 01:19:05] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 3 ms to minimize.
[2024-05-21 01:19:05] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2024-05-21 01:19:06] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 4 ms to minimize.
[2024-05-21 01:19:06] [INFO ] Deduced a trap composed of 73 places in 165 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-21 01:19:09] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 3 ms to minimize.
[2024-05-21 01:19:09] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 3 ms to minimize.
[2024-05-21 01:19:10] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 3 ms to minimize.
[2024-05-21 01:19:10] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-21 01:19:13] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 3 ms to minimize.
[2024-05-21 01:19:13] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 3 ms to minimize.
[2024-05-21 01:19:14] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/602 variables, and 71 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 43/71 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/602 variables, 306/377 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 295/672 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-21 01:19:27] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 3 ms to minimize.
[2024-05-21 01:19:27] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 01:19:27] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-21 01:19:27] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 4 ms to minimize.
[2024-05-21 01:19:28] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 4 ms to minimize.
[2024-05-21 01:19:28] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 4 ms to minimize.
[2024-05-21 01:19:28] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 3 ms to minimize.
[2024-05-21 01:19:29] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 3 ms to minimize.
[2024-05-21 01:19:29] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 3 ms to minimize.
[2024-05-21 01:19:30] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 3 ms to minimize.
[2024-05-21 01:19:32] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 4 ms to minimize.
[2024-05-21 01:19:32] [INFO ] Deduced a trap composed of 57 places in 159 ms of which 4 ms to minimize.
[2024-05-21 01:19:32] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 3 ms to minimize.
[2024-05-21 01:19:36] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 14/686 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-21 01:19:41] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-05-21 01:19:41] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 4 ms to minimize.
[2024-05-21 01:19:42] [INFO ] Deduced a trap composed of 63 places in 131 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/602 variables, and 689 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 60/60 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in LTL mode, iteration 1 : 306/360 places, 296/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60742 ms. Remains : 306/360 places, 296/354 transitions.
[2024-05-21 01:19:48] [INFO ] Flatten gal took : 6 ms
[2024-05-21 01:19:48] [INFO ] Flatten gal took : 6 ms
[2024-05-21 01:19:48] [INFO ] Input system was already deterministic with 296 transitions.
[2024-05-21 01:19:48] [INFO ] Flatten gal took : 9 ms
[2024-05-21 01:19:48] [INFO ] Flatten gal took : 9 ms
[2024-05-21 01:19:48] [INFO ] Time to serialize gal into /tmp/CTLFireability15457902697436695054.gal : 6 ms
[2024-05-21 01:19:48] [INFO ] Time to serialize properties into /tmp/CTLFireability15390150925447872998.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/CTLFireability15457902697436695054.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15390150925447872998.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 01:20:18] [INFO ] Flatten gal took : 6 ms
[2024-05-21 01:20:18] [INFO ] Applying decomposition
[2024-05-21 01:20:18] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16845155051117882644.txt' '-o' '/tmp/graph16845155051117882644.bin' '-w' '/tmp/graph16845155051117882644.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16845155051117882644.bin' '-l' '-1' '-v' '-w' '/tmp/graph16845155051117882644.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:20:18] [INFO ] Decomposing Gal with order
[2024-05-21 01:20:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:20:18] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-21 01:20:18] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:20:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 01:20:18] [INFO ] Time to serialize gal into /tmp/CTLFireability9388234750137952458.gal : 5 ms
[2024-05-21 01:20:18] [INFO ] Time to serialize properties into /tmp/CTLFireability8529101781324928916.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/CTLFireability9388234750137952458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8529101781324928916.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.7289e+22,1.20985,32852,4485,14,56963,196,625,91527,31,407,0


Converting to forward existential form...Done !
original formula: EX(EG(!(A(((i3.u13.p41==1)&&((i6.i1.u35.p133==1)||(i15.i2.u89.p287==1))) U (EG((i16.i1.u91.p314==1)) * ((i5.u20.p69==1)||(i9.i2.u43.p157=...164
=> equivalent forward existential formula: [FwdG(EY(Init),!(!((E(!((EG((i16.i1.u91.p314==1)) * ((i5.u20.p69==1)||(i9.i2.u43.p157==1)))) U (!(((i3.u13.p41==...370
Reverse transition relation is NOT exact ! Due to transitions t92, t95, t108, t134, t159, t175, t182, t197, t204, t219, t285, t286, t287, t289, i0.i1.t94, ...768
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 360/360 places, 354/354 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 324 transition count 318
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 324 transition count 318
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 76 place count 324 transition count 314
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 90 place count 310 transition count 300
Iterating global reduction 1 with 14 rules applied. Total rules applied 104 place count 310 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 309 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 309 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 308 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 308 transition count 298
Applied a total of 108 rules in 19 ms. Remains 308 /360 variables (removed 52) and now considering 298/354 (removed 56) transitions.
// Phase 1: matrix 298 rows 308 cols
[2024-05-21 01:20:48] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 01:20:48] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-21 01:20:48] [INFO ] Invariant cache hit.
[2024-05-21 01:20:48] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2024-05-21 01:20:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:20:53] [INFO ] Deduced a trap composed of 59 places in 202 ms of which 3 ms to minimize.
[2024-05-21 01:20:53] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 3 ms to minimize.
[2024-05-21 01:20:53] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 2 ms to minimize.
[2024-05-21 01:20:53] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 4 ms to minimize.
[2024-05-21 01:20:54] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 3 ms to minimize.
[2024-05-21 01:20:54] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 3 ms to minimize.
[2024-05-21 01:20:54] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 3 ms to minimize.
[2024-05-21 01:20:54] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 2 ms to minimize.
[2024-05-21 01:20:54] [INFO ] Deduced a trap composed of 52 places in 214 ms of which 4 ms to minimize.
[2024-05-21 01:20:55] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 3 ms to minimize.
[2024-05-21 01:20:55] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 3 ms to minimize.
[2024-05-21 01:20:55] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 2 ms to minimize.
[2024-05-21 01:20:55] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 3 ms to minimize.
[2024-05-21 01:20:55] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 3 ms to minimize.
[2024-05-21 01:20:56] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 3 ms to minimize.
[2024-05-21 01:20:56] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 3 ms to minimize.
[2024-05-21 01:20:56] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 3 ms to minimize.
[2024-05-21 01:20:56] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 3 ms to minimize.
[2024-05-21 01:20:56] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 3 ms to minimize.
[2024-05-21 01:20:57] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:21:00] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-05-21 01:21:00] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-21 01:21:00] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 2 ms to minimize.
[2024-05-21 01:21:00] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-21 01:21:01] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-21 01:21:01] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 3 ms to minimize.
[2024-05-21 01:21:02] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:21:03] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 3 ms to minimize.
[2024-05-21 01:21:04] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
[2024-05-21 01:21:05] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 3 ms to minimize.
[2024-05-21 01:21:05] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-21 01:21:05] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 3 ms to minimize.
[2024-05-21 01:21:05] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 298/606 variables, 308/369 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:21:13] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 3 ms to minimize.
[2024-05-21 01:21:13] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-21 01:21:13] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/606 variables, 3/372 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:21:18] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 2 ms to minimize.
[2024-05-21 01:21:18] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-21 01:21:18] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-05-21 01:21:18] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 3 ms to minimize.
[2024-05-21 01:21:18] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 606/606 variables, and 377 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 41/69 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:21:22] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-05-21 01:21:22] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 2 ms to minimize.
[2024-05-21 01:21:22] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-05-21 01:21:22] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-21 01:21:23] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 2 ms to minimize.
[2024-05-21 01:21:23] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 2 ms to minimize.
[2024-05-21 01:21:23] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 2 ms to minimize.
[2024-05-21 01:21:23] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 2 ms to minimize.
[2024-05-21 01:21:23] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 2 ms to minimize.
[2024-05-21 01:21:23] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2024-05-21 01:21:23] [INFO ] Deduced a trap composed of 61 places in 155 ms of which 5 ms to minimize.
[2024-05-21 01:21:23] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 3 ms to minimize.
[2024-05-21 01:21:24] [INFO ] Deduced a trap composed of 62 places in 144 ms of which 4 ms to minimize.
[2024-05-21 01:21:24] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 3 ms to minimize.
[2024-05-21 01:21:24] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 3 ms to minimize.
[2024-05-21 01:21:24] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 3 ms to minimize.
[2024-05-21 01:21:25] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 17/86 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:21:26] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-05-21 01:21:26] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-05-21 01:21:26] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-05-21 01:21:27] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-05-21 01:21:27] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
[2024-05-21 01:21:27] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2024-05-21 01:21:28] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 2 ms to minimize.
[2024-05-21 01:21:28] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-21 01:21:28] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 9/95 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:21:30] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 2 ms to minimize.
[2024-05-21 01:21:31] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:21:33] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 3 ms to minimize.
[2024-05-21 01:21:34] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
[2024-05-21 01:21:34] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 2 ms to minimize.
[2024-05-21 01:21:34] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 298/606 variables, 308/409 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 297/706 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:21:41] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-21 01:21:41] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-21 01:21:41] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 2 ms to minimize.
[2024-05-21 01:21:41] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
[2024-05-21 01:21:42] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 3 ms to minimize.
[2024-05-21 01:21:43] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
[2024-05-21 01:21:43] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-05-21 01:21:43] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-05-21 01:21:44] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 3 ms to minimize.
[2024-05-21 01:21:44] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 3 ms to minimize.
[2024-05-21 01:21:44] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-05-21 01:21:47] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-05-21 01:21:47] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 606/606 variables, and 719 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 86/86 constraints]
After SMT, in 60051ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Starting structural reductions in LTL mode, iteration 1 : 308/360 places, 298/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60515 ms. Remains : 308/360 places, 298/354 transitions.
[2024-05-21 01:21:48] [INFO ] Flatten gal took : 6 ms
[2024-05-21 01:21:48] [INFO ] Flatten gal took : 6 ms
[2024-05-21 01:21:48] [INFO ] Input system was already deterministic with 298 transitions.
[2024-05-21 01:21:48] [INFO ] Flatten gal took : 6 ms
[2024-05-21 01:21:48] [INFO ] Flatten gal took : 6 ms
[2024-05-21 01:21:48] [INFO ] Time to serialize gal into /tmp/CTLFireability3501273907793795826.gal : 2 ms
[2024-05-21 01:21:48] [INFO ] Time to serialize properties into /tmp/CTLFireability11849582875488130650.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/CTLFireability3501273907793795826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11849582875488130650.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 01:22:18] [INFO ] Flatten gal took : 6 ms
[2024-05-21 01:22:18] [INFO ] Applying decomposition
[2024-05-21 01:22:18] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13839646170579227933.txt' '-o' '/tmp/graph13839646170579227933.bin' '-w' '/tmp/graph13839646170579227933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13839646170579227933.bin' '-l' '-1' '-v' '-w' '/tmp/graph13839646170579227933.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:22:19] [INFO ] Decomposing Gal with order
[2024-05-21 01:22:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:22:19] [INFO ] Removed a total of 59 redundant transitions.
[2024-05-21 01:22:19] [INFO ] Flatten gal took : 14 ms
[2024-05-21 01:22:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 01:22:19] [INFO ] Time to serialize gal into /tmp/CTLFireability5647664551466178466.gal : 4 ms
[2024-05-21 01:22:19] [INFO ] Time to serialize properties into /tmp/CTLFireability8348779074954881214.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/CTLFireability5647664551466178466.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8348779074954881214.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.0537e+22,1.2419,36828,5725,13,67249,204,588,90248,30,410,0


Converting to forward existential form...Done !
original formula: A(AF((((i4.i0.u25.p99==1) + EF((i11.i1.u53.p188==1))) + ((E((i4.i0.u25.p83==1) U ((i3.u19.p65==1)&&(i3.u85.p274==1))) * (i4.i0.u27.p94==1...328
=> equivalent forward existential formula: [((Init * !(EG(!(!((EX((i8.u43.p147==1)) + !(((i14.i2.u88.p283==1)||(i16.u82.p266==1))))))))) * !(E(!(!((EX((i8....561
Reverse transition relation is NOT exact ! Due to transitions t94, t104, t107, t117, t120, t152, t159, t181, t206, t221, t287, t289, t290, t291, i0.i1.t119...769
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 360/360 places, 354/354 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 359 transition count 227
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 146 rules applied. Total rules applied 272 place count 233 transition count 207
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 281 place count 225 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 282 place count 224 transition count 206
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 282 place count 224 transition count 159
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 376 place count 177 transition count 159
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 403 place count 150 transition count 132
Iterating global reduction 4 with 27 rules applied. Total rules applied 430 place count 150 transition count 132
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 430 place count 150 transition count 122
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 450 place count 140 transition count 122
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 526 place count 102 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 530 place count 102 transition count 80
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 538 place count 98 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 539 place count 97 transition count 75
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 8 rules applied. Total rules applied 547 place count 91 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 549 place count 89 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 549 place count 89 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 557 place count 85 transition count 69
Applied a total of 557 rules in 30 ms. Remains 85 /360 variables (removed 275) and now considering 69/354 (removed 285) transitions.
// Phase 1: matrix 69 rows 85 cols
[2024-05-21 01:22:49] [INFO ] Computed 22 invariants in 1 ms
[2024-05-21 01:22:49] [INFO ] Implicit Places using invariants in 99 ms returned [35, 49, 69, 73, 78, 84]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 99 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 79/360 places, 69/354 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 75 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 75 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 74 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 74 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 73 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 73 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 72 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 72 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 71 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 71 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 59
Applied a total of 20 rules in 7 ms. Remains 69 /79 variables (removed 10) and now considering 59/69 (removed 10) transitions.
// Phase 1: matrix 59 rows 69 cols
[2024-05-21 01:22:49] [INFO ] Computed 16 invariants in 1 ms
[2024-05-21 01:22:49] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 01:22:49] [INFO ] Invariant cache hit.
[2024-05-21 01:22:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 01:22:49] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 69/360 places, 59/354 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 315 ms. Remains : 69/360 places, 59/354 transitions.
[2024-05-21 01:22:49] [INFO ] Flatten gal took : 2 ms
[2024-05-21 01:22:49] [INFO ] Flatten gal took : 2 ms
[2024-05-21 01:22:49] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-21 01:22:49] [INFO ] Flatten gal took : 1 ms
[2024-05-21 01:22:49] [INFO ] Flatten gal took : 2 ms
[2024-05-21 01:22:49] [INFO ] Time to serialize gal into /tmp/CTLFireability6418383841054969057.gal : 0 ms
[2024-05-21 01:22:49] [INFO ] Time to serialize properties into /tmp/CTLFireability14702158806066281751.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/CTLFireability6418383841054969057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14702158806066281751.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.51165e+07,0.026625,4108,2,424,5,2980,6,0,333,3043,0


Converting to forward existential form...Done !
original formula: EF(!(E(AF((p330==1)) U ((p110!=1) * EF((p230==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EG(!((p330==1)))) U ((p110!=1) * E(TRUE U (p230==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t52, t57, Intersection with reachable at each step enabled. (destroyed/reverse/inter...177
(forward)formula 0,1,1.62831,51848,1,0,458,301177,151,215,1979,319795,513
FORMULA AutoFlight-PT-04b-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 354/354 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 325 transition count 319
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 325 transition count 319
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 74 place count 325 transition count 315
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 88 place count 311 transition count 301
Iterating global reduction 1 with 14 rules applied. Total rules applied 102 place count 311 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 310 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 310 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 309 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 309 transition count 299
Applied a total of 106 rules in 21 ms. Remains 309 /360 variables (removed 51) and now considering 299/354 (removed 55) transitions.
// Phase 1: matrix 299 rows 309 cols
[2024-05-21 01:22:51] [INFO ] Computed 28 invariants in 4 ms
[2024-05-21 01:22:51] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-21 01:22:51] [INFO ] Invariant cache hit.
[2024-05-21 01:22:51] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 298 sub problems to find dead transitions.
[2024-05-21 01:22:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/309 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-21 01:22:55] [INFO ] Deduced a trap composed of 65 places in 145 ms of which 4 ms to minimize.
[2024-05-21 01:22:55] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-05-21 01:22:55] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 3 ms to minimize.
[2024-05-21 01:22:56] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 3 ms to minimize.
[2024-05-21 01:22:56] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 3 ms to minimize.
[2024-05-21 01:22:56] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-05-21 01:22:56] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-21 01:22:56] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 3 ms to minimize.
[2024-05-21 01:22:56] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
[2024-05-21 01:22:56] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 3 ms to minimize.
[2024-05-21 01:22:56] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-21 01:22:56] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 3 ms to minimize.
[2024-05-21 01:22:57] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 3 ms to minimize.
[2024-05-21 01:22:57] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 2 ms to minimize.
[2024-05-21 01:22:57] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 2 ms to minimize.
[2024-05-21 01:22:57] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 3 ms to minimize.
[2024-05-21 01:22:57] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
[2024-05-21 01:22:57] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-21 01:22:57] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
[2024-05-21 01:22:58] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-21 01:23:00] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
[2024-05-21 01:23:00] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 2 ms to minimize.
[2024-05-21 01:23:00] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-21 01:23:00] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 3 ms to minimize.
[2024-05-21 01:23:00] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 3 ms to minimize.
[2024-05-21 01:23:00] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 2 ms to minimize.
[2024-05-21 01:23:00] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 3 ms to minimize.
[2024-05-21 01:23:01] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-21 01:23:01] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2024-05-21 01:23:01] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-05-21 01:23:01] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-05-21 01:23:01] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 2 ms to minimize.
[2024-05-21 01:23:01] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-21 01:23:01] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 2 ms to minimize.
[2024-05-21 01:23:01] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-05-21 01:23:01] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 3 ms to minimize.
[2024-05-21 01:23:02] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-05-21 01:23:02] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 2 ms to minimize.
[2024-05-21 01:23:02] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-21 01:23:02] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-21 01:23:02] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 3 ms to minimize.
[2024-05-21 01:23:02] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 3 ms to minimize.
[2024-05-21 01:23:03] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-21 01:23:03] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-05-21 01:23:03] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-21 01:23:03] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-21 01:23:03] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2024-05-21 01:23:03] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-21 01:23:03] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-21 01:23:04] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-05-21 01:23:04] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-05-21 01:23:04] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 2 ms to minimize.
[2024-05-21 01:23:04] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 3 ms to minimize.
[2024-05-21 01:23:05] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 3 ms to minimize.
[2024-05-21 01:23:05] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 3 ms to minimize.
[2024-05-21 01:23:05] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 3 ms to minimize.
[2024-05-21 01:23:06] [INFO ] Deduced a trap composed of 63 places in 153 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 17/85 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-21 01:23:07] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 3 ms to minimize.
[2024-05-21 01:23:07] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-21 01:23:11] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 3 ms to minimize.
[2024-05-21 01:23:12] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-21 01:23:12] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-21 01:23:12] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-05-21 01:23:12] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-21 01:23:13] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2024-05-21 01:23:13] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-05-21 01:23:14] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 2 ms to minimize.
[2024-05-21 01:23:15] [INFO ] Deduced a trap composed of 60 places in 167 ms of which 4 ms to minimize.
[2024-05-21 01:23:15] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 2 ms to minimize.
[2024-05-21 01:23:15] [INFO ] Deduced a trap composed of 85 places in 160 ms of which 4 ms to minimize.
[2024-05-21 01:23:15] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 7/99 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 10 (OVERLAPS) 299/608 variables, 309/408 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-21 01:23:20] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 3 ms to minimize.
[2024-05-21 01:23:21] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 2 ms to minimize.
SMT process timed out in 30063ms, After SMT, problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 30066ms
Starting structural reductions in LTL mode, iteration 1 : 309/360 places, 299/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30558 ms. Remains : 309/360 places, 299/354 transitions.
[2024-05-21 01:23:21] [INFO ] Flatten gal took : 5 ms
[2024-05-21 01:23:21] [INFO ] Flatten gal took : 6 ms
[2024-05-21 01:23:21] [INFO ] Input system was already deterministic with 299 transitions.
[2024-05-21 01:23:21] [INFO ] Flatten gal took : 9 ms
[2024-05-21 01:23:21] [INFO ] Flatten gal took : 9 ms
[2024-05-21 01:23:21] [INFO ] Time to serialize gal into /tmp/CTLFireability11247251371283762980.gal : 3 ms
[2024-05-21 01:23:21] [INFO ] Time to serialize properties into /tmp/CTLFireability9695455498542216231.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/CTLFireability11247251371283762980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9695455498542216231.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 01:23:51] [INFO ] Flatten gal took : 6 ms
[2024-05-21 01:23:51] [INFO ] Applying decomposition
[2024-05-21 01:23:51] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14553187186220563131.txt' '-o' '/tmp/graph14553187186220563131.bin' '-w' '/tmp/graph14553187186220563131.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14553187186220563131.bin' '-l' '-1' '-v' '-w' '/tmp/graph14553187186220563131.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:23:51] [INFO ] Decomposing Gal with order
[2024-05-21 01:23:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:23:51] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-21 01:23:51] [INFO ] Flatten gal took : 14 ms
[2024-05-21 01:23:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 01:23:51] [INFO ] Time to serialize gal into /tmp/CTLFireability18025670727337586182.gal : 3 ms
[2024-05-21 01:23:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17381500244261707987.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/CTLFireability18025670727337586182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17381500244261707987.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.90805e+22,0.907393,28964,4798,14,53063,229,567,70544,29,485,0


Converting to forward existential form...Done !
original formula: EX(EF((AG((((i22.u93.p294==0)||(i22.u131.p388==0))||(i15.u130.p382==1))) * A(!(((i4.u17.p55==1)&&(i7.u33.p119==1))) U !(EG((i8.u37.p123==...163
=> equivalent forward existential formula: [(((FwdU(EY(Init),TRUE) * !(E(TRUE U !((((i22.u93.p294==0)||(i22.u131.p388==0))||(i15.u130.p382==1)))))) * !(EG(...305
Reverse transition relation is NOT exact ! Due to transitions t91, t94, t117, t120, t151, t158, t177, t199, t206, t222, t288, t290, t291, t292, i0.t107, i0...713
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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.
[2024-05-21 01:24:21] [INFO ] Flatten gal took : 7 ms
[2024-05-21 01:24:21] [INFO ] Flatten gal took : 7 ms
[2024-05-21 01:24:21] [INFO ] Applying decomposition
[2024-05-21 01:24:21] [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/graph6163827122465518187.txt' '-o' '/tmp/graph6163827122465518187.bin' '-w' '/tmp/graph6163827122465518187.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6163827122465518187.bin' '-l' '-1' '-v' '-w' '/tmp/graph6163827122465518187.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:24:21] [INFO ] Decomposing Gal with order
[2024-05-21 01:24:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:24:21] [INFO ] Removed a total of 40 redundant transitions.
[2024-05-21 01:24:21] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:24:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 01:24:21] [INFO ] Time to serialize gal into /tmp/CTLFireability11763120119510900145.gal : 4 ms
[2024-05-21 01:24:21] [INFO ] Time to serialize properties into /tmp/CTLFireability1458607115805435117.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/CTLFireability11763120119510900145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1458607115805435117.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 11 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,3.10533e+23,6.84257,172708,14568,26,299805,377,630,661311,46,974,0


Converting to forward existential form...Done !
original formula: A(((i3.u21.p69==1)&&(i3.u124.p339==1)) U (AF(((AX((i11.u5.p12==1)) * (i4.u23.p75==1)) * !((((i4.u23.p73==1)||(i17.u91.p260==1))||((i5.u26...282
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!(((!(EX(!((i11.u5.p12==1)))) * (i4.u23.p75==1)) * !((((i4.u23.p73==1)||(i17.u91.p260==1)...1304
Reverse transition relation is NOT exact ! Due to transitions t132, t149, t161, t164, t342, t343, t345, t346, t347, i0.t31, i0.t29, i0.u54.t28, i0.u54.t30,...1115
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Detected timeout of ITS tools.
[2024-05-21 01:52:40] [INFO ] Applying decomposition
[2024-05-21 01:52:40] [INFO ] Flatten gal took : 8 ms
[2024-05-21 01:52:40] [INFO ] Decomposing Gal with order
[2024-05-21 01:52:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:52:40] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-21 01:52:40] [INFO ] Flatten gal took : 12 ms
[2024-05-21 01:52:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 11 ms.
[2024-05-21 01:52:40] [INFO ] Time to serialize gal into /tmp/CTLFireability10782558769194876276.gal : 7 ms
[2024-05-21 01:52:40] [INFO ] Time to serialize properties into /tmp/CTLFireability1282984788353384508.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10782558769194876276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1282984788353384508.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 11 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-04b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-04b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-smll-171620167000114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-04b.tgz
mv AutoFlight-PT-04b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;