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-171620167000098.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-03b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167000098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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 Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 22:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 22:14 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 70K 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-03b-CTLFireability-2024-00
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-2024-01
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-2024-02
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-2024-03
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-2024-04
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-2024-05
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-2024-06
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-2024-07
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-2024-08
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-2024-09
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-2024-10
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-2024-11
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-2023-12
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-2023-13
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-2023-14
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716248824924

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-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-20 23:47:07] [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-20 23:47:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 23:47:07] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2024-05-20 23:47:07] [INFO ] Transformed 298 places.
[2024-05-20 23:47:07] [INFO ] Transformed 296 transitions.
[2024-05-20 23:47:07] [INFO ] Found NUPN structural information;
[2024-05-20 23:47:07] [INFO ] Parsed PT model containing 298 places and 296 transitions and 692 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 36 ms.
Support contains 119 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 296/296 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 281 transition count 279
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 281 transition count 279
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 281 transition count 276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 276 transition count 271
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 276 transition count 271
Applied a total of 47 rules in 129 ms. Remains 276 /298 variables (removed 22) and now considering 271/296 (removed 25) transitions.
// Phase 1: matrix 271 rows 276 cols
[2024-05-20 23:47:08] [INFO ] Computed 22 invariants in 21 ms
[2024-05-20 23:47:08] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-05-20 23:47:08] [INFO ] Invariant cache hit.
[2024-05-20 23:47:09] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-20 23:47:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-20 23:47:15] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 44 ms to minimize.
[2024-05-20 23:47:15] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 3 ms to minimize.
[2024-05-20 23:47:15] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 3 ms to minimize.
[2024-05-20 23:47:15] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-20 23:47:16] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-20 23:47:16] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 3 ms to minimize.
[2024-05-20 23:47:16] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-05-20 23:47:16] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 3 ms to minimize.
[2024-05-20 23:47:16] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 3 ms to minimize.
[2024-05-20 23:47:16] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 3 ms to minimize.
[2024-05-20 23:47:16] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-20 23:47:16] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 3 ms to minimize.
[2024-05-20 23:47:17] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 4 ms to minimize.
[2024-05-20 23:47:17] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 3 ms to minimize.
[2024-05-20 23:47:17] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 3 ms to minimize.
[2024-05-20 23:47:17] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 3 ms to minimize.
[2024-05-20 23:47:17] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 4 ms to minimize.
[2024-05-20 23:47:17] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 3 ms to minimize.
[2024-05-20 23:47:18] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 3 ms to minimize.
[2024-05-20 23:47:18] [INFO ] Deduced a trap composed of 18 places in 207 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-20 23:47:20] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 3 ms to minimize.
[2024-05-20 23:47:21] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 3 ms to minimize.
[2024-05-20 23:47:21] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 3 ms to minimize.
[2024-05-20 23:47:21] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 3 ms to minimize.
[2024-05-20 23:47:21] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 2 ms to minimize.
[2024-05-20 23:47:21] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 4 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 4 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 3 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 3 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 2 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 4 ms to minimize.
[2024-05-20 23:47:23] [INFO ] Deduced a trap composed of 61 places in 178 ms of which 10 ms to minimize.
[2024-05-20 23:47:23] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 4 ms to minimize.
[2024-05-20 23:47:23] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 3 ms to minimize.
[2024-05-20 23:47:23] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 3 ms to minimize.
[2024-05-20 23:47:23] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 3 ms to minimize.
[2024-05-20 23:47:23] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-20 23:47:24] [INFO ] Deduced a trap composed of 36 places in 236 ms of which 7 ms to minimize.
[2024-05-20 23:47:24] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 4 ms to minimize.
[2024-05-20 23:47:25] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 4 ms to minimize.
[2024-05-20 23:47:25] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 3 ms to minimize.
[2024-05-20 23:47:25] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 3 ms to minimize.
[2024-05-20 23:47:25] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 3 ms to minimize.
[2024-05-20 23:47:25] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 3 ms to minimize.
[2024-05-20 23:47:25] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 5 ms to minimize.
[2024-05-20 23:47:25] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 3 ms to minimize.
[2024-05-20 23:47:26] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 4 ms to minimize.
[2024-05-20 23:47:26] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 4 ms to minimize.
[2024-05-20 23:47:26] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 3 ms to minimize.
[2024-05-20 23:47:26] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 4 ms to minimize.
[2024-05-20 23:47:27] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 4 ms to minimize.
[2024-05-20 23:47:27] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 3 ms to minimize.
[2024-05-20 23:47:27] [INFO ] Deduced a trap composed of 64 places in 136 ms of which 20 ms to minimize.
[2024-05-20 23:47:27] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 4 ms to minimize.
[2024-05-20 23:47:27] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 3 ms to minimize.
[2024-05-20 23:47:27] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 3 ms to minimize.
[2024-05-20 23:47:28] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-20 23:47:28] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 5 ms to minimize.
[2024-05-20 23:47:28] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 4 ms to minimize.
[2024-05-20 23:47:28] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 4 ms to minimize.
[2024-05-20 23:47:29] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 4 ms to minimize.
[2024-05-20 23:47:29] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 4 ms to minimize.
[2024-05-20 23:47:29] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 4 ms to minimize.
[2024-05-20 23:47:29] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 4 ms to minimize.
[2024-05-20 23:47:29] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 4 ms to minimize.
[2024-05-20 23:47:30] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 3 ms to minimize.
[2024-05-20 23:47:30] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 3 ms to minimize.
[2024-05-20 23:47:30] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 3 ms to minimize.
[2024-05-20 23:47:30] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 4 ms to minimize.
[2024-05-20 23:47:30] [INFO ] Deduced a trap composed of 53 places in 164 ms of which 4 ms to minimize.
[2024-05-20 23:47:30] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 4 ms to minimize.
[2024-05-20 23:47:31] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:47:31] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 4 ms to minimize.
[2024-05-20 23:47:31] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 3 ms to minimize.
[2024-05-20 23:47:31] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 3 ms to minimize.
[2024-05-20 23:47:31] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 3 ms to minimize.
[2024-05-20 23:47:31] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-20 23:47:35] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 3 ms to minimize.
[2024-05-20 23:47:35] [INFO ] Deduced a trap composed of 65 places in 181 ms of which 4 ms to minimize.
[2024-05-20 23:47:35] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 3 ms to minimize.
[2024-05-20 23:47:35] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 6 ms to minimize.
[2024-05-20 23:47:35] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-05-20 23:47:36] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 4 ms to minimize.
[2024-05-20 23:47:36] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-05-20 23:47:36] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2024-05-20 23:47:36] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2024-05-20 23:47:36] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-20 23:47:36] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 3 ms to minimize.
[2024-05-20 23:47:37] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-20 23:47:38] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-05-20 23:47:38] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 14/116 constraints. Problems are: Problem set: 0 solved, 270 unsolved
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 1.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 1.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 1.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 1.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 1.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 1.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 1.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 1.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 1.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 1.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 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.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 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.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 1.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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/547 variables, and 116 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/276 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 94/94 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-20 23:47:43] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 3 ms to minimize.
[2024-05-20 23:47:43] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 3 ms to minimize.
[2024-05-20 23:47:43] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 3 ms to minimize.
[2024-05-20 23:47:44] [INFO ] Deduced a trap composed of 61 places in 166 ms of which 4 ms to minimize.
[2024-05-20 23:47:44] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 4 ms to minimize.
[2024-05-20 23:47:44] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 3 ms to minimize.
[2024-05-20 23:47:45] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-20 23:47:46] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 3 ms to minimize.
[2024-05-20 23:47:47] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 4 ms to minimize.
[2024-05-20 23:47:47] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 4 ms to minimize.
[2024-05-20 23:47:48] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 3 ms to minimize.
[2024-05-20 23:47:48] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 3 ms to minimize.
[2024-05-20 23:47:48] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 3 ms to minimize.
[2024-05-20 23:47:49] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 2 ms to minimize.
[2024-05-20 23:47:49] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 3 ms to minimize.
[2024-05-20 23:47:49] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 9/132 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-20 23:47:51] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-20 23:47:54] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 3 ms to minimize.
[2024-05-20 23:47:54] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-05-20 23:47:54] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 2 ms to minimize.
[2024-05-20 23:47:55] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 3 ms to minimize.
[2024-05-20 23:47:55] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-20 23:47:57] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:47:58] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-20 23:47:59] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 3 ms to minimize.
[2024-05-20 23:48:00] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
[2024-05-20 23:48:00] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 11 (OVERLAPS) 271/547 variables, 276/419 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 270/689 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-20 23:48:06] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 3 ms to minimize.
[2024-05-20 23:48:06] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 3 ms to minimize.
[2024-05-20 23:48:06] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 3 ms to minimize.
[2024-05-20 23:48:06] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 3 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 3 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 3 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 3 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 3 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 3 ms to minimize.
[2024-05-20 23:48:08] [INFO ] Deduced a trap composed of 68 places in 165 ms of which 4 ms to minimize.
[2024-05-20 23:48:08] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 6 ms to minimize.
[2024-05-20 23:48:09] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 3 ms to minimize.
[2024-05-20 23:48:09] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 3 ms to minimize.
[2024-05-20 23:48:09] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 3 ms to minimize.
SMT process timed out in 60261ms, After SMT, problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 60304ms
Starting structural reductions in LTL mode, iteration 1 : 276/298 places, 271/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61574 ms. Remains : 276/298 places, 271/296 transitions.
Support contains 119 out of 276 places after structural reductions.
[2024-05-20 23:48:10] [INFO ] Flatten gal took : 104 ms
[2024-05-20 23:48:10] [INFO ] Flatten gal took : 41 ms
[2024-05-20 23:48:10] [INFO ] Input system was already deterministic with 271 transitions.
Support contains 118 out of 276 places (down from 119) after GAL structural reductions.
RANDOM walk for 40000 steps (248 resets) in 2224 ms. (17 steps per ms) remains 12/81 properties
BEST_FIRST walk for 40003 steps (25 resets) in 124 ms. (320 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (26 resets) in 208 ms. (191 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (36 resets) in 120 ms. (330 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (24 resets) in 157 ms. (253 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (32 resets) in 122 ms. (325 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (27 resets) in 90 ms. (439 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (25 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (31 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (26 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (27 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (25 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (26 resets) in 67 ms. (588 steps per ms) remains 11/11 properties
[2024-05-20 23:48:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp44 is UNSAT
At refinement iteration 1 (OVERLAPS) 193/211 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-20 23:48:11] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:48:11] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-20 23:48:12] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 3/16 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 52/263 variables, 8/24 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-20 23:48:12] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 13/276 variables, 1/26 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-20 23:48:12] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 3 ms to minimize.
[2024-05-20 23:48:12] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 3 ms to minimize.
[2024-05-20 23:48:13] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 3 ms to minimize.
[2024-05-20 23:48:13] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 4 ms to minimize.
[2024-05-20 23:48:13] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 3 ms to minimize.
[2024-05-20 23:48:13] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 3 ms to minimize.
[2024-05-20 23:48:13] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 4 ms to minimize.
[2024-05-20 23:48:13] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 4 ms to minimize.
Problem AtomicPropp27 is UNSAT
[2024-05-20 23:48:13] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 9/35 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 271/547 variables, 276/311 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-20 23:48:14] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 3 ms to minimize.
[2024-05-20 23:48:14] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/547 variables, 2/313 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 0/313 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/547 variables, 0/313 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 313 constraints, problems are : Problem set: 2 solved, 9 unsolved in 3405 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 169/183 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 2/12 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 79/262 variables, 11/23 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 5/28 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-20 23:48:15] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-20 23:48:15] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 2/30 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 14/276 variables, 1/31 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 8/39 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-20 23:48:15] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-20 23:48:15] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 3 ms to minimize.
[2024-05-20 23:48:15] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 3 ms to minimize.
[2024-05-20 23:48:15] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-05-20 23:48:15] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 5/44 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 271/547 variables, 276/320 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 9/329 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-20 23:48:16] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 3 ms to minimize.
[2024-05-20 23:48:16] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 3 ms to minimize.
[2024-05-20 23:48:16] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 3 ms to minimize.
[2024-05-20 23:48:16] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 3 ms to minimize.
[2024-05-20 23:48:16] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/547 variables, 5/334 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-20 23:48:17] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 3 ms to minimize.
[2024-05-20 23:48:17] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/547 variables, 2/336 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/547 variables, 0/336 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/547 variables, 0/336 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 547/547 variables, and 336 constraints, problems are : Problem set: 2 solved, 9 unsolved in 3146 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 9/11 constraints, Known Traps: 29/29 constraints]
After SMT, in 6564ms problems are : Problem set: 2 solved, 9 unsolved
Parikh walk visited 6 properties in 4901 ms.
Support contains 6 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 271/271 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 276 transition count 179
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 198 place count 184 transition count 165
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 206 place count 178 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 208 place count 176 transition count 163
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 208 place count 176 transition count 126
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 282 place count 139 transition count 126
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 300 place count 121 transition count 108
Iterating global reduction 4 with 18 rules applied. Total rules applied 318 place count 121 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 319 place count 121 transition count 107
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 319 place count 121 transition count 100
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 333 place count 114 transition count 100
Performed 35 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 403 place count 79 transition count 62
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 415 place count 79 transition count 50
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 427 place count 67 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 428 place count 66 transition count 49
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 14 rules applied. Total rules applied 442 place count 57 transition count 44
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 447 place count 52 transition count 44
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 12 Pre rules applied. Total rules applied 447 place count 52 transition count 32
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 471 place count 40 transition count 32
Applied a total of 471 rules in 102 ms. Remains 40 /276 variables (removed 236) and now considering 32/271 (removed 239) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 40/276 places, 32/271 transitions.
RANDOM walk for 32801 steps (931 resets) in 538 ms. (60 steps per ms) remains 0/3 properties
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-20 23:48:23] [INFO ] Flatten gal took : 40 ms
[2024-05-20 23:48:23] [INFO ] Flatten gal took : 33 ms
[2024-05-20 23:48:23] [INFO ] Input system was already deterministic with 271 transitions.
Computed a total of 81 stabilizing places and 81 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 271/271 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 249 transition count 244
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 249 transition count 244
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 249 transition count 241
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 69 place count 237 transition count 229
Iterating global reduction 1 with 12 rules applied. Total rules applied 81 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 235 transition count 227
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 233 transition count 225
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 233 transition count 225
Applied a total of 89 rules in 67 ms. Remains 233 /276 variables (removed 43) and now considering 225/271 (removed 46) transitions.
// Phase 1: matrix 225 rows 233 cols
[2024-05-20 23:48:23] [INFO ] Computed 22 invariants in 7 ms
[2024-05-20 23:48:23] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-20 23:48:23] [INFO ] Invariant cache hit.
[2024-05-20 23:48:24] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-20 23:48:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-20 23:48:28] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 8 ms to minimize.
[2024-05-20 23:48:28] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 4 ms to minimize.
[2024-05-20 23:48:28] [INFO ] Deduced a trap composed of 53 places in 166 ms of which 3 ms to minimize.
[2024-05-20 23:48:28] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 3 ms to minimize.
[2024-05-20 23:48:28] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 3 ms to minimize.
[2024-05-20 23:48:28] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 3 ms to minimize.
[2024-05-20 23:48:29] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 4 ms to minimize.
[2024-05-20 23:48:29] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 3 ms to minimize.
[2024-05-20 23:48:29] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 3 ms to minimize.
[2024-05-20 23:48:29] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 3 ms to minimize.
[2024-05-20 23:48:29] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 4 ms to minimize.
[2024-05-20 23:48:29] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 3 ms to minimize.
[2024-05-20 23:48:30] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 4 ms to minimize.
[2024-05-20 23:48:30] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 4 ms to minimize.
[2024-05-20 23:48:30] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 3 ms to minimize.
[2024-05-20 23:48:30] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 3 ms to minimize.
[2024-05-20 23:48:30] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 3 ms to minimize.
[2024-05-20 23:48:30] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
[2024-05-20 23:48:31] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 3 ms to minimize.
[2024-05-20 23:48:31] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-20 23:48:33] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 4 ms to minimize.
[2024-05-20 23:48:33] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 3 ms to minimize.
[2024-05-20 23:48:33] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 3 ms to minimize.
[2024-05-20 23:48:34] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 3 ms to minimize.
[2024-05-20 23:48:34] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 3 ms to minimize.
[2024-05-20 23:48:34] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 2 ms to minimize.
[2024-05-20 23:48:34] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-05-20 23:48:35] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-20 23:48:35] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 3 ms to minimize.
[2024-05-20 23:48:35] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-20 23:48:36] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 4 ms to minimize.
[2024-05-20 23:48:36] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 3 ms to minimize.
[2024-05-20 23:48:36] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 4 ms to minimize.
[2024-05-20 23:48:36] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 289 constraints, problems are : Problem set: 0 solved, 224 unsolved in 26220 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 224/513 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-20 23:48:55] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 4 ms to minimize.
[2024-05-20 23:48:56] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 3 ms to minimize.
[2024-05-20 23:48:56] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-05-20 23:48:56] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 3 ms to minimize.
[2024-05-20 23:48:56] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-05-20 23:48:57] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-20 23:49:02] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-20 23:49:03] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-20 23:49:03] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 3 ms to minimize.
[2024-05-20 23:49:03] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 3 ms to minimize.
[2024-05-20 23:49:03] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-05-20 23:49:03] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 6/525 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-20 23:49:10] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 526 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 47/47 constraints]
After SMT, in 56299ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 56310ms
Starting structural reductions in LTL mode, iteration 1 : 233/276 places, 225/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56971 ms. Remains : 233/276 places, 225/271 transitions.
[2024-05-20 23:49:20] [INFO ] Flatten gal took : 23 ms
[2024-05-20 23:49:20] [INFO ] Flatten gal took : 24 ms
[2024-05-20 23:49:20] [INFO ] Input system was already deterministic with 225 transitions.
[2024-05-20 23:49:20] [INFO ] Flatten gal took : 23 ms
[2024-05-20 23:49:20] [INFO ] Flatten gal took : 22 ms
[2024-05-20 23:49:20] [INFO ] Time to serialize gal into /tmp/CTLFireability2309894907502033386.gal : 10 ms
[2024-05-20 23:49:20] [INFO ] Time to serialize properties into /tmp/CTLFireability13748877045252163279.ctl : 4 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/CTLFireability2309894907502033386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13748877045252163279.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.14476e+17,3.74304,90428,2,38479,5,316411,6,0,1159,509810,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 23:49:50] [INFO ] Flatten gal took : 13 ms
[2024-05-20 23:49:50] [INFO ] Applying decomposition
[2024-05-20 23:49:50] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8945902735253653842.txt' '-o' '/tmp/graph8945902735253653842.bin' '-w' '/tmp/graph8945902735253653842.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8945902735253653842.bin' '-l' '-1' '-v' '-w' '/tmp/graph8945902735253653842.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:49:51] [INFO ] Decomposing Gal with order
[2024-05-20 23:49:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:49:51] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-20 23:49:51] [INFO ] Flatten gal took : 147 ms
[2024-05-20 23:49:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-20 23:49:51] [INFO ] Time to serialize gal into /tmp/CTLFireability13204135887872378843.gal : 15 ms
[2024-05-20 23:49:51] [INFO ] Time to serialize properties into /tmp/CTLFireability9948820596719221484.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/CTLFireability13204135887872378843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9948820596719221484.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,4.14476e+17,0.152411,8124,1209,14,9327,182,496,10131,28,380,0


Converting to forward existential form...Done !
original formula: AG(E(!(EX((i16.i2.u98.p295==1))) U (i5.u22.p75==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EX((i16.i2.u98.p295==1))) U (i5.u22.p75==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t72, t75, t85, t88, t119, t126, t141, t148, t163, t216, t217, t219, i0.i1.t87, i1.t159, i1.u1...584
(forward)formula 0,0,2.09566,77556,1,0,188913,182,2251,255545,112,380,359349
FORMULA AutoFlight-PT-03b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 271/271 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 252 transition count 247
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 252 transition count 247
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 252 transition count 244
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 61 place count 242 transition count 234
Iterating global reduction 1 with 10 rules applied. Total rules applied 71 place count 242 transition count 234
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 240 transition count 232
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 240 transition count 232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 239 transition count 231
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 239 transition count 231
Applied a total of 77 rules in 36 ms. Remains 239 /276 variables (removed 37) and now considering 231/271 (removed 40) transitions.
// Phase 1: matrix 231 rows 239 cols
[2024-05-20 23:49:53] [INFO ] Computed 22 invariants in 2 ms
[2024-05-20 23:49:53] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-20 23:49:53] [INFO ] Invariant cache hit.
[2024-05-20 23:49:53] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2024-05-20 23:49:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:49:57] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
[2024-05-20 23:49:57] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 3 ms to minimize.
[2024-05-20 23:49:57] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 3 ms to minimize.
[2024-05-20 23:49:57] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 3 ms to minimize.
[2024-05-20 23:49:57] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 5 ms to minimize.
[2024-05-20 23:49:57] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 4 ms to minimize.
[2024-05-20 23:49:58] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 4 ms to minimize.
[2024-05-20 23:49:58] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 4 ms to minimize.
[2024-05-20 23:49:58] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 5 ms to minimize.
[2024-05-20 23:49:58] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 4 ms to minimize.
[2024-05-20 23:49:58] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 4 ms to minimize.
[2024-05-20 23:49:58] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 3 ms to minimize.
[2024-05-20 23:49:59] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 4 ms to minimize.
[2024-05-20 23:49:59] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 3 ms to minimize.
[2024-05-20 23:49:59] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 3 ms to minimize.
[2024-05-20 23:49:59] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 4 ms to minimize.
[2024-05-20 23:49:59] [INFO ] Deduced a trap composed of 60 places in 147 ms of which 3 ms to minimize.
[2024-05-20 23:49:59] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 3 ms to minimize.
[2024-05-20 23:50:00] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 4 ms to minimize.
[2024-05-20 23:50:00] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:50:02] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 4 ms to minimize.
[2024-05-20 23:50:02] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 3 ms to minimize.
[2024-05-20 23:50:02] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 3 ms to minimize.
[2024-05-20 23:50:03] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 3 ms to minimize.
[2024-05-20 23:50:03] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2024-05-20 23:50:03] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 3 ms to minimize.
[2024-05-20 23:50:03] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 4 ms to minimize.
[2024-05-20 23:50:03] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
[2024-05-20 23:50:04] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 2 ms to minimize.
[2024-05-20 23:50:04] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 4 ms to minimize.
[2024-05-20 23:50:04] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 4 ms to minimize.
[2024-05-20 23:50:04] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 3 ms to minimize.
[2024-05-20 23:50:05] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
[2024-05-20 23:50:05] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 3 ms to minimize.
[2024-05-20 23:50:05] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 3 ms to minimize.
[2024-05-20 23:50:05] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 3 ms to minimize.
[2024-05-20 23:50:05] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 4 ms to minimize.
[2024-05-20 23:50:06] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 3 ms to minimize.
[2024-05-20 23:50:06] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:50:07] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 3 ms to minimize.
[2024-05-20 23:50:07] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 3 ms to minimize.
[2024-05-20 23:50:07] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 3 ms to minimize.
[2024-05-20 23:50:08] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 3 ms to minimize.
[2024-05-20 23:50:08] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 4 ms to minimize.
[2024-05-20 23:50:09] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 5 ms to minimize.
[2024-05-20 23:50:09] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 3 ms to minimize.
[2024-05-20 23:50:09] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:50:11] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (OVERLAPS) 231/470 variables, 239/309 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:50:18] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 230 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 470/470 variables, and 310 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 49/71 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:50:26] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 3 ms to minimize.
[2024-05-20 23:50:27] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 231/470 variables, 239/312 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 230/542 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:50:34] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 3 ms to minimize.
[2024-05-20 23:50:34] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 3 ms to minimize.
[2024-05-20 23:50:34] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 3 ms to minimize.
[2024-05-20 23:50:35] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
[2024-05-20 23:50:35] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 3 ms to minimize.
[2024-05-20 23:50:37] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 4 ms to minimize.
[2024-05-20 23:50:38] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
[2024-05-20 23:50:38] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 2 ms to minimize.
[2024-05-20 23:50:39] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-05-20 23:50:39] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 10/552 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:50:41] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:50:42] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-20 23:50:45] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 3/555 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:50:49] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 3 ms to minimize.
[2024-05-20 23:50:49] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2024-05-20 23:50:49] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2024-05-20 23:50:50] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 4/559 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 559 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 68/68 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in LTL mode, iteration 1 : 239/276 places, 231/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60475 ms. Remains : 239/276 places, 231/271 transitions.
[2024-05-20 23:50:53] [INFO ] Flatten gal took : 11 ms
[2024-05-20 23:50:53] [INFO ] Flatten gal took : 11 ms
[2024-05-20 23:50:53] [INFO ] Input system was already deterministic with 231 transitions.
[2024-05-20 23:50:53] [INFO ] Flatten gal took : 10 ms
[2024-05-20 23:50:53] [INFO ] Flatten gal took : 9 ms
[2024-05-20 23:50:53] [INFO ] Time to serialize gal into /tmp/CTLFireability6007499999479061039.gal : 3 ms
[2024-05-20 23:50:53] [INFO ] Time to serialize properties into /tmp/CTLFireability18204824163455416837.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/CTLFireability6007499999479061039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18204824163455416837.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.84166e+17,15.6559,324120,2,80219,5,1.05642e+06,6,0,1189,2.04782e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 23:51:24] [INFO ] Flatten gal took : 9 ms
[2024-05-20 23:51:24] [INFO ] Applying decomposition
[2024-05-20 23:51:24] [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/graph10376650029547166848.txt' '-o' '/tmp/graph10376650029547166848.bin' '-w' '/tmp/graph10376650029547166848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10376650029547166848.bin' '-l' '-1' '-v' '-w' '/tmp/graph10376650029547166848.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:51:24] [INFO ] Decomposing Gal with order
[2024-05-20 23:51:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:51:24] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-20 23:51:24] [INFO ] Flatten gal took : 25 ms
[2024-05-20 23:51:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2024-05-20 23:51:24] [INFO ] Time to serialize gal into /tmp/CTLFireability10462401315164638902.gal : 8 ms
[2024-05-20 23:51:24] [INFO ] Time to serialize properties into /tmp/CTLFireability13882746954056531874.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/CTLFireability10462401315164638902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13882746954056531874.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,4.84166e+17,0.478872,16348,2044,14,26683,186,490,36792,29,392,0


Converting to forward existential form...Done !
original formula: AF((EX(EX(((i12.i1.u51.p178==0)&&(i9.u37.p123==0)))) * ((i6.u27.p86==1) + E(((i16.i0.u79.p259==1)||(!(((i8.u32.p109==1)&&(i1.u9.p21==1))&...227
=> equivalent forward existential formula: [FwdG(Init,!((EX(EX(((i12.i1.u51.p178==0)&&(i9.u37.p123==0)))) * ((i6.u27.p86==1) + E(((i16.i0.u79.p259==1)||(!(...278
Reverse transition relation is NOT exact ! Due to transitions t78, t101, t104, t124, t131, t154, t169, t221, t222, t223, t225, i0.t91, i0.t88, i0.i2.t90, i...643
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 276/276 places, 271/271 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 250 transition count 245
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 250 transition count 245
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 250 transition count 242
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 67 place count 238 transition count 230
Iterating global reduction 1 with 12 rules applied. Total rules applied 79 place count 238 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 236 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 236 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 235 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 235 transition count 227
Applied a total of 85 rules in 37 ms. Remains 235 /276 variables (removed 41) and now considering 227/271 (removed 44) transitions.
// Phase 1: matrix 227 rows 235 cols
[2024-05-20 23:51:54] [INFO ] Computed 22 invariants in 3 ms
[2024-05-20 23:51:54] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-20 23:51:54] [INFO ] Invariant cache hit.
[2024-05-20 23:51:54] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-05-20 23:51:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:51:58] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-20 23:51:58] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-05-20 23:51:59] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 4 ms to minimize.
[2024-05-20 23:51:59] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 3 ms to minimize.
[2024-05-20 23:51:59] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 4 ms to minimize.
[2024-05-20 23:51:59] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 4 ms to minimize.
[2024-05-20 23:52:00] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 3 ms to minimize.
[2024-05-20 23:52:00] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 4 ms to minimize.
[2024-05-20 23:52:00] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 3 ms to minimize.
[2024-05-20 23:52:00] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 3 ms to minimize.
[2024-05-20 23:52:00] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 4 ms to minimize.
[2024-05-20 23:52:00] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 3 ms to minimize.
[2024-05-20 23:52:01] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 3 ms to minimize.
[2024-05-20 23:52:01] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 4 ms to minimize.
[2024-05-20 23:52:01] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 3 ms to minimize.
[2024-05-20 23:52:01] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 3 ms to minimize.
[2024-05-20 23:52:01] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 3 ms to minimize.
[2024-05-20 23:52:02] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 3 ms to minimize.
[2024-05-20 23:52:02] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 3 ms to minimize.
[2024-05-20 23:52:02] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:52:04] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 3 ms to minimize.
[2024-05-20 23:52:04] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 2 ms to minimize.
[2024-05-20 23:52:05] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-20 23:52:05] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 3 ms to minimize.
[2024-05-20 23:52:05] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 3 ms to minimize.
[2024-05-20 23:52:06] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:52:07] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 3 ms to minimize.
[2024-05-20 23:52:07] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 2 ms to minimize.
[2024-05-20 23:52:07] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 2 ms to minimize.
[2024-05-20 23:52:08] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 2 ms to minimize.
[2024-05-20 23:52:08] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 2 ms to minimize.
[2024-05-20 23:52:08] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 2 ms to minimize.
[2024-05-20 23:52:09] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 2 ms to minimize.
[2024-05-20 23:52:09] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 227/462 variables, 235/291 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:52:15] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 3 ms to minimize.
[2024-05-20 23:52:15] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 3 ms to minimize.
[2024-05-20 23:52:15] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 2 ms to minimize.
[2024-05-20 23:52:16] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 3 ms to minimize.
[2024-05-20 23:52:16] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 5/296 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/462 variables, and 296 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 39/61 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:52:27] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 3 ms to minimize.
[2024-05-20 23:52:27] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-05-20 23:52:27] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 3 ms to minimize.
[2024-05-20 23:52:28] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:52:30] [INFO ] Deduced a trap composed of 55 places in 153 ms of which 3 ms to minimize.
[2024-05-20 23:52:30] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 4 ms to minimize.
[2024-05-20 23:52:30] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 4 ms to minimize.
[2024-05-20 23:52:30] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 227/462 variables, 235/304 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 226/530 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:52:39] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:52:42] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 3 ms to minimize.
[2024-05-20 23:52:42] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 533 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 50/50 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 235/276 places, 227/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60711 ms. Remains : 235/276 places, 227/271 transitions.
[2024-05-20 23:52:54] [INFO ] Flatten gal took : 13 ms
[2024-05-20 23:52:55] [INFO ] Flatten gal took : 12 ms
[2024-05-20 23:52:55] [INFO ] Input system was already deterministic with 227 transitions.
[2024-05-20 23:52:55] [INFO ] Flatten gal took : 12 ms
[2024-05-20 23:52:55] [INFO ] Flatten gal took : 11 ms
[2024-05-20 23:52:55] [INFO ] Time to serialize gal into /tmp/CTLFireability9387735034584956693.gal : 4 ms
[2024-05-20 23:52:55] [INFO ] Time to serialize properties into /tmp/CTLFireability598339416285037783.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/CTLFireability9387735034584956693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability598339416285037783.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.21995e+17,7.65234,175900,2,51800,5,600025,6,0,1169,1.05832e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 23:53:25] [INFO ] Flatten gal took : 9 ms
[2024-05-20 23:53:25] [INFO ] Applying decomposition
[2024-05-20 23:53:25] [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/graph14639871353159590325.txt' '-o' '/tmp/graph14639871353159590325.bin' '-w' '/tmp/graph14639871353159590325.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14639871353159590325.bin' '-l' '-1' '-v' '-w' '/tmp/graph14639871353159590325.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:53:25] [INFO ] Decomposing Gal with order
[2024-05-20 23:53:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:53:25] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-20 23:53:25] [INFO ] Flatten gal took : 32 ms
[2024-05-20 23:53:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-20 23:53:25] [INFO ] Time to serialize gal into /tmp/CTLFireability16822060324632881502.gal : 5 ms
[2024-05-20 23:53:25] [INFO ] Time to serialize properties into /tmp/CTLFireability13005236280531200372.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/CTLFireability16822060324632881502.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13005236280531200372.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,4.21995e+17,0.190973,9704,1465,14,12615,194,464,14606,30,422,0


Converting to forward existential form...Done !
original formula: AG(E(!(EX((AX((i4.i0.u22.p74==1)) * (((i19.i0.u92.p286==1)&&(i17.i2.u99.p294==1))||(i5.i0.u3.p8==1))))) U AG(A(((i17.i0.u52.p185==1)&&(i2...190
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EX((!(EX(!((i4.i0.u22.p74==1)))) * (((i19.i0.u92.p286==1)&&(i17.i2.u99.p294==1))||(i5....321
Reverse transition relation is NOT exact ! Due to transitions t76, t99, t102, t120, t127, t149, t165, t218, t219, t221, i0.u8.t0, i0.u8.t174, i1.u10.t1, i1...619
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 271/271 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 250 transition count 245
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 250 transition count 245
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 250 transition count 242
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 67 place count 238 transition count 230
Iterating global reduction 1 with 12 rules applied. Total rules applied 79 place count 238 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 236 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 236 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 234 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 234 transition count 226
Applied a total of 87 rules in 18 ms. Remains 234 /276 variables (removed 42) and now considering 226/271 (removed 45) transitions.
// Phase 1: matrix 226 rows 234 cols
[2024-05-20 23:53:55] [INFO ] Computed 22 invariants in 3 ms
[2024-05-20 23:53:55] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-20 23:53:55] [INFO ] Invariant cache hit.
[2024-05-20 23:53:55] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-20 23:53:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:54:00] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 4 ms to minimize.
[2024-05-20 23:54:00] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 4 ms to minimize.
[2024-05-20 23:54:00] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 4 ms to minimize.
[2024-05-20 23:54:00] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 4 ms to minimize.
[2024-05-20 23:54:00] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 4 ms to minimize.
[2024-05-20 23:54:01] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 4 ms to minimize.
[2024-05-20 23:54:01] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 5 ms to minimize.
[2024-05-20 23:54:01] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 4 ms to minimize.
[2024-05-20 23:54:01] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 3 ms to minimize.
[2024-05-20 23:54:01] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 3 ms to minimize.
[2024-05-20 23:54:01] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 4 ms to minimize.
[2024-05-20 23:54:02] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 3 ms to minimize.
[2024-05-20 23:54:02] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 4 ms to minimize.
[2024-05-20 23:54:02] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 3 ms to minimize.
[2024-05-20 23:54:02] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 3 ms to minimize.
[2024-05-20 23:54:02] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 3 ms to minimize.
[2024-05-20 23:54:03] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 3 ms to minimize.
[2024-05-20 23:54:03] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 4 ms to minimize.
[2024-05-20 23:54:03] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 3 ms to minimize.
[2024-05-20 23:54:03] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:54:05] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 3 ms to minimize.
[2024-05-20 23:54:05] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 3 ms to minimize.
[2024-05-20 23:54:06] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 3 ms to minimize.
[2024-05-20 23:54:06] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 4 ms to minimize.
[2024-05-20 23:54:06] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-20 23:54:06] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-05-20 23:54:07] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:54:08] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 3 ms to minimize.
[2024-05-20 23:54:09] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 3 ms to minimize.
[2024-05-20 23:54:09] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 3 ms to minimize.
[2024-05-20 23:54:09] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 2 ms to minimize.
[2024-05-20 23:54:09] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-20 23:54:10] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 3 ms to minimize.
[2024-05-20 23:54:10] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 3 ms to minimize.
[2024-05-20 23:54:10] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:54:12] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-20 23:54:12] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 3 ms to minimize.
[2024-05-20 23:54:12] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:54:16] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 226/460 variables, 234/295 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:54:24] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 3 ms to minimize.
[2024-05-20 23:54:24] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 3 ms to minimize.
[2024-05-20 23:54:24] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 2 ms to minimize.
[2024-05-20 23:54:25] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 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 1.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 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.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 1.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 1.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 1.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 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.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 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.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 1.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 1.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 1.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 1.0)
(s208 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/460 variables, and 299 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 43/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:54:28] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 3 ms to minimize.
[2024-05-20 23:54:28] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 3 ms to minimize.
[2024-05-20 23:54:29] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 3 ms to minimize.
[2024-05-20 23:54:29] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:54:31] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2024-05-20 23:54:32] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 3 ms to minimize.
[2024-05-20 23:54:32] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 4 ms to minimize.
[2024-05-20 23:54:32] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 2 ms to minimize.
[2024-05-20 23:54:32] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:54:33] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-05-20 23:54:34] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 3 ms to minimize.
[2024-05-20 23:54:35] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 226/460 variables, 234/311 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 225/536 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:54:39] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 2 ms to minimize.
[2024-05-20 23:54:42] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 2/538 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:54:45] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:54:46] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 2/540 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:54:51] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 541 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 60/60 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 234/276 places, 226/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60539 ms. Remains : 234/276 places, 226/271 transitions.
[2024-05-20 23:54:55] [INFO ] Flatten gal took : 15 ms
[2024-05-20 23:54:55] [INFO ] Flatten gal took : 13 ms
[2024-05-20 23:54:55] [INFO ] Input system was already deterministic with 226 transitions.
[2024-05-20 23:54:55] [INFO ] Flatten gal took : 10 ms
[2024-05-20 23:54:55] [INFO ] Flatten gal took : 10 ms
[2024-05-20 23:54:55] [INFO ] Time to serialize gal into /tmp/CTLFireability4419122218281493270.gal : 4 ms
[2024-05-20 23:54:56] [INFO ] Time to serialize properties into /tmp/CTLFireability12049801989954423831.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/CTLFireability4419122218281493270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12049801989954423831.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.63701e+17,8.36428,170200,2,40892,5,576682,6,0,1164,1.03254e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 23:55:26] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:26] [INFO ] Applying decomposition
[2024-05-20 23:55:26] [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/graph10535651029226732594.txt' '-o' '/tmp/graph10535651029226732594.bin' '-w' '/tmp/graph10535651029226732594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10535651029226732594.bin' '-l' '-1' '-v' '-w' '/tmp/graph10535651029226732594.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:55:26] [INFO ] Decomposing Gal with order
[2024-05-20 23:55:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:55:26] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-20 23:55:26] [INFO ] Flatten gal took : 44 ms
[2024-05-20 23:55:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-20 23:55:26] [INFO ] Time to serialize gal into /tmp/CTLFireability11497908470474892914.gal : 6 ms
[2024-05-20 23:55:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17559727342144647458.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/CTLFireability11497908470474892914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17559727342144647458.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,4.63701e+17,0.410691,11868,1625,14,17665,196,497,21374,28,432,0


Converting to forward existential form...Done !
original formula: EG(E((EF(!(((i19.i0.u95.p290==1)||(i4.u19.p64==1)))) + (i3.u15.p51==1)) U EX(((i16.i2.u98.p295!=1) + !(AX((i16.i1.u76.p240==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E((E(TRUE U !(((i19.i0.u95.p290==1)||(i4.u19.p64==1)))) + (i3.u15.p51==1)) U EX(((i16.i2.u98.p295!=1)...205
Reverse transition relation is NOT exact ! Due to transitions t73, t76, t86, t89, t120, t127, t142, t149, t164, t217, t218, t220, i0.t102, i0.t99, i0.i2.t1...612
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 271/271 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 252 transition count 247
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 252 transition count 247
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 252 transition count 245
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 61 place count 241 transition count 234
Iterating global reduction 1 with 11 rules applied. Total rules applied 72 place count 241 transition count 234
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 239 transition count 232
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 239 transition count 232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 238 transition count 231
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 238 transition count 231
Applied a total of 78 rules in 24 ms. Remains 238 /276 variables (removed 38) and now considering 231/271 (removed 40) transitions.
// Phase 1: matrix 231 rows 238 cols
[2024-05-20 23:55:56] [INFO ] Computed 22 invariants in 4 ms
[2024-05-20 23:55:56] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-20 23:55:56] [INFO ] Invariant cache hit.
[2024-05-20 23:55:56] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2024-05-20 23:55:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:56:01] [INFO ] Deduced a trap composed of 55 places in 221 ms of which 4 ms to minimize.
[2024-05-20 23:56:01] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 3 ms to minimize.
[2024-05-20 23:56:01] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 4 ms to minimize.
[2024-05-20 23:56:02] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 4 ms to minimize.
[2024-05-20 23:56:02] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 3 ms to minimize.
[2024-05-20 23:56:02] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 3 ms to minimize.
[2024-05-20 23:56:02] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 3 ms to minimize.
[2024-05-20 23:56:02] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 3 ms to minimize.
[2024-05-20 23:56:02] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 4 ms to minimize.
[2024-05-20 23:56:03] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 3 ms to minimize.
[2024-05-20 23:56:03] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 3 ms to minimize.
[2024-05-20 23:56:03] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 3 ms to minimize.
[2024-05-20 23:56:03] [INFO ] Deduced a trap composed of 54 places in 142 ms of which 3 ms to minimize.
[2024-05-20 23:56:03] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 4 ms to minimize.
[2024-05-20 23:56:03] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 3 ms to minimize.
[2024-05-20 23:56:04] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 4 ms to minimize.
[2024-05-20 23:56:04] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 4 ms to minimize.
[2024-05-20 23:56:04] [INFO ] Deduced a trap composed of 62 places in 201 ms of which 4 ms to minimize.
[2024-05-20 23:56:04] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 3 ms to minimize.
[2024-05-20 23:56:05] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:56:07] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 4 ms to minimize.
[2024-05-20 23:56:07] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 4 ms to minimize.
[2024-05-20 23:56:07] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 3 ms to minimize.
[2024-05-20 23:56:08] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 4 ms to minimize.
[2024-05-20 23:56:08] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 3 ms to minimize.
[2024-05-20 23:56:08] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-05-20 23:56:09] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 3 ms to minimize.
[2024-05-20 23:56:09] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-20 23:56:09] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-20 23:56:09] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 3 ms to minimize.
[2024-05-20 23:56:09] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:56:11] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
[2024-05-20 23:56:11] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 3 ms to minimize.
[2024-05-20 23:56:11] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
[2024-05-20 23:56:11] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 3 ms to minimize.
[2024-05-20 23:56:11] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:56:13] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 3 ms to minimize.
[2024-05-20 23:56:14] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 3 ms to minimize.
[2024-05-20 23:56:14] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 3 ms to minimize.
[2024-05-20 23:56:14] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 3 ms to minimize.
[2024-05-20 23:56:15] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 3 ms to minimize.
[2024-05-20 23:56:15] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 3 ms to minimize.
[2024-05-20 23:56:15] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 3 ms to minimize.
[2024-05-20 23:56:15] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 3 ms to minimize.
[2024-05-20 23:56:16] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 3 ms to minimize.
[2024-05-20 23:56:16] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:56:19] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 3 ms to minimize.
[2024-05-20 23:56:19] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 2 ms to minimize.
[2024-05-20 23:56:19] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 3 ms to minimize.
[2024-05-20 23:56:20] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 3 ms to minimize.
[2024-05-20 23:56:20] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:56:22] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 3 ms to minimize.
[2024-05-20 23:56:23] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 3 ms to minimize.
[2024-05-20 23:56:23] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 3 ms to minimize.
[2024-05-20 23:56:23] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 3 ms to minimize.
[2024-05-20 23:56:24] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 238/469 variables, and 78 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/238 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 56/78 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:56:30] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:56:32] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 3 ms to minimize.
[2024-05-20 23:56:32] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 3 ms to minimize.
[2024-05-20 23:56:32] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 3 ms to minimize.
[2024-05-20 23:56:32] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 2 ms to minimize.
[2024-05-20 23:56:32] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 3 ms to minimize.
[2024-05-20 23:56:33] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:56:35] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-05-20 23:56:35] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
[2024-05-20 23:56:36] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
[2024-05-20 23:56:36] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:56:38] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 2 ms to minimize.
[2024-05-20 23:56:39] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:56:40] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:56:43] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-20 23:56:43] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 11 (OVERLAPS) 231/469 variables, 238/332 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/469 variables, 230/562 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-20 23:56:53] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 2 ms to minimize.
[2024-05-20 23:56:54] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/469 variables, and 564 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 74/74 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in LTL mode, iteration 1 : 238/276 places, 231/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60619 ms. Remains : 238/276 places, 231/271 transitions.
[2024-05-20 23:56:56] [INFO ] Flatten gal took : 15 ms
[2024-05-20 23:56:56] [INFO ] Flatten gal took : 9 ms
[2024-05-20 23:56:56] [INFO ] Input system was already deterministic with 231 transitions.
[2024-05-20 23:56:56] [INFO ] Flatten gal took : 8 ms
[2024-05-20 23:56:56] [INFO ] Flatten gal took : 8 ms
[2024-05-20 23:56:56] [INFO ] Time to serialize gal into /tmp/CTLFireability2944274690214677094.gal : 3 ms
[2024-05-20 23:56:56] [INFO ] Time to serialize properties into /tmp/CTLFireability14744765239038487656.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/CTLFireability2944274690214677094.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14744765239038487656.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.68096e+17,19.583,404888,2,82674,5,1.33796e+06,6,0,1185,2.60294e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 23:57:26] [INFO ] Flatten gal took : 6 ms
[2024-05-20 23:57:26] [INFO ] Applying decomposition
[2024-05-20 23:57:26] [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/graph9733154845792676717.txt' '-o' '/tmp/graph9733154845792676717.bin' '-w' '/tmp/graph9733154845792676717.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9733154845792676717.bin' '-l' '-1' '-v' '-w' '/tmp/graph9733154845792676717.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:57:27] [INFO ] Decomposing Gal with order
[2024-05-20 23:57:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:57:27] [INFO ] Removed a total of 41 redundant transitions.
[2024-05-20 23:57:27] [INFO ] Flatten gal took : 14 ms
[2024-05-20 23:57:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 23:57:27] [INFO ] Time to serialize gal into /tmp/CTLFireability9587538441824978380.gal : 5 ms
[2024-05-20 23:57:27] [INFO ] Time to serialize properties into /tmp/CTLFireability1056961098330485327.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/CTLFireability9587538441824978380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1056961098330485327.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.68096e+17,0.298023,12920,2463,24,18793,268,501,26480,43,604,0


Converting to forward existential form...Done !
original formula: AF((AF(((i1.u34.p123!=1)&&((i18.i1.u65.p213==1)||(i8.u28.p100==1)))) + (!(A(!(((i1.u36.p130==1)&&(i17.i1.u85.p276==1))) U !(EX(((i11.u43....383
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(((i1.u34.p123!=1)&&((i18.i1.u65.p213==1)||(i8.u28.p100==1)))))) + (!(!((E(!(!(EX(((i11.u43....624
Reverse transition relation is NOT exact ! Due to transitions t77, t87, t90, t130, t147, t154, t169, t222, t223, t225, i0.t74, i0.i2.t76, i1.t116, i1.u32.t...643
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 276/276 places, 271/271 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 252 transition count 247
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 252 transition count 247
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 252 transition count 244
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 61 place count 242 transition count 234
Iterating global reduction 1 with 10 rules applied. Total rules applied 71 place count 242 transition count 234
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 240 transition count 232
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 240 transition count 232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 238 transition count 230
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 238 transition count 230
Applied a total of 79 rules in 15 ms. Remains 238 /276 variables (removed 38) and now considering 230/271 (removed 41) transitions.
// Phase 1: matrix 230 rows 238 cols
[2024-05-20 23:57:57] [INFO ] Computed 22 invariants in 2 ms
[2024-05-20 23:57:57] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-20 23:57:57] [INFO ] Invariant cache hit.
[2024-05-20 23:57:57] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2024-05-20 23:57:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-20 23:58:01] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 4 ms to minimize.
[2024-05-20 23:58:01] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 2 ms to minimize.
[2024-05-20 23:58:02] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-05-20 23:58:02] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-20 23:58:02] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 4 ms to minimize.
[2024-05-20 23:58:02] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 4 ms to minimize.
[2024-05-20 23:58:02] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 4 ms to minimize.
[2024-05-20 23:58:02] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 3 ms to minimize.
[2024-05-20 23:58:02] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-05-20 23:58:02] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-20 23:58:03] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 3 ms to minimize.
[2024-05-20 23:58:03] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 2 ms to minimize.
[2024-05-20 23:58:03] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 4 ms to minimize.
[2024-05-20 23:58:03] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 4 ms to minimize.
[2024-05-20 23:58:03] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 4 ms to minimize.
[2024-05-20 23:58:03] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-20 23:58:03] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 3 ms to minimize.
[2024-05-20 23:58:04] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-05-20 23:58:04] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-20 23:58:05] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-20 23:58:07] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
[2024-05-20 23:58:07] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-05-20 23:58:07] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 3 ms to minimize.
[2024-05-20 23:58:08] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-20 23:58:09] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 230/468 variables, 238/285 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (OVERLAPS) 0/468 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 285 constraints, problems are : Problem set: 0 solved, 229 unsolved in 26549 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-20 23:58:26] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 3 ms to minimize.
[2024-05-20 23:58:26] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 3 ms to minimize.
[2024-05-20 23:58:26] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 3 ms to minimize.
[2024-05-20 23:58:26] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 3 ms to minimize.
[2024-05-20 23:58:26] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 3 ms to minimize.
[2024-05-20 23:58:27] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 3 ms to minimize.
[2024-05-20 23:58:27] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 2 ms to minimize.
[2024-05-20 23:58:27] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
[2024-05-20 23:58:27] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-20 23:58:29] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-20 23:58:29] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-20 23:58:30] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
[2024-05-20 23:58:30] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 230/468 variables, 238/298 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 229/527 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-20 23:58:34] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-20 23:58:34] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 2 ms to minimize.
[2024-05-20 23:58:34] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-20 23:58:34] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 3 ms to minimize.
[2024-05-20 23:58:34] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 3 ms to minimize.
[2024-05-20 23:58:35] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 6/533 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-20 23:58:39] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 3 ms to minimize.
[2024-05-20 23:58:40] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 2 ms to minimize.
[2024-05-20 23:58:40] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 3/536 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-20 23:58:45] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-20 23:58:45] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 4 ms to minimize.
[2024-05-20 23:58:46] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-05-20 23:58:47] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-20 23:58:49] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 5/541 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 541 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 52/52 constraints]
After SMT, in 56614ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 56618ms
Starting structural reductions in LTL mode, iteration 1 : 238/276 places, 230/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57025 ms. Remains : 238/276 places, 230/271 transitions.
[2024-05-20 23:58:54] [INFO ] Flatten gal took : 9 ms
[2024-05-20 23:58:54] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:58:54] [INFO ] Input system was already deterministic with 230 transitions.
[2024-05-20 23:58:54] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:58:54] [INFO ] Flatten gal took : 8 ms
[2024-05-20 23:58:54] [INFO ] Time to serialize gal into /tmp/CTLFireability15060819139474355455.gal : 4 ms
[2024-05-20 23:58:54] [INFO ] Time to serialize properties into /tmp/CTLFireability5539177188545406910.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/CTLFireability15060819139474355455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5539177188545406910.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.7848e+17,8.11086,172016,2,62531,5,585916,6,0,1184,1.03599e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 23:59:24] [INFO ] Flatten gal took : 5 ms
[2024-05-20 23:59:24] [INFO ] Applying decomposition
[2024-05-20 23:59:24] [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/graph1854955275651911752.txt' '-o' '/tmp/graph1854955275651911752.bin' '-w' '/tmp/graph1854955275651911752.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1854955275651911752.bin' '-l' '-1' '-v' '-w' '/tmp/graph1854955275651911752.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:59:24] [INFO ] Decomposing Gal with order
[2024-05-20 23:59:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:59:24] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-20 23:59:24] [INFO ] Flatten gal took : 13 ms
[2024-05-20 23:59:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 23:59:24] [INFO ] Time to serialize gal into /tmp/CTLFireability8897219233957716637.gal : 4 ms
[2024-05-20 23:59:24] [INFO ] Time to serialize properties into /tmp/CTLFireability9637336812288864010.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/CTLFireability8897219233957716637.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9637336812288864010.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.7848e+17,0.364879,10280,1512,23,13519,294,500,17590,38,787,0


Converting to forward existential form...Done !
original formula: (EF(AX((((i13.i1.u97.p289==1)||(i0.u10.p27==1))&&(i3.u18.p56==1)))) * EF((((((i0.u10.p27==0) * EG((i19.i0.u54.p188==0))) + ((i19.i0.u54.p...295
=> equivalent forward existential formula: ((([FwdG((FwdU((Init * E(TRUE U !(EX(!((((i13.i1.u97.p289==1)||(i0.u10.p27==1))&&(i3.u18.p56==1))))))),TRUE) * (...831
Reverse transition relation is NOT exact ! Due to transitions t87, t90, t100, t103, t123, t130, t167, t221, t222, t224, i0.t180, i0.t175, i0.u8.t1, i0.u8.t...623
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,1,22.9992,574184,1,0,1.55485e+06,305,3710,1.20746e+06,199,933,1627371
FORMULA AutoFlight-PT-03b-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 271/271 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 254 transition count 249
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 254 transition count 249
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 254 transition count 247
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 57 place count 243 transition count 236
Iterating global reduction 1 with 11 rules applied. Total rules applied 68 place count 243 transition count 236
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 241 transition count 234
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 241 transition count 234
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 239 transition count 232
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 239 transition count 232
Applied a total of 76 rules in 16 ms. Remains 239 /276 variables (removed 37) and now considering 232/271 (removed 39) transitions.
// Phase 1: matrix 232 rows 239 cols
[2024-05-20 23:59:47] [INFO ] Computed 22 invariants in 2 ms
[2024-05-20 23:59:47] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-20 23:59:47] [INFO ] Invariant cache hit.
[2024-05-20 23:59:47] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-20 23:59:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-20 23:59:52] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-05-20 23:59:52] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 3 ms to minimize.
[2024-05-20 23:59:52] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
[2024-05-20 23:59:52] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-05-20 23:59:52] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2024-05-20 23:59:52] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-05-20 23:59:52] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 2 ms to minimize.
[2024-05-20 23:59:52] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-05-20 23:59:52] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-05-20 23:59:52] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 3 ms to minimize.
[2024-05-20 23:59:53] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 1 ms to minimize.
[2024-05-20 23:59:53] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2024-05-20 23:59:53] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 3 ms to minimize.
[2024-05-20 23:59:53] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 3 ms to minimize.
[2024-05-20 23:59:53] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 3 ms to minimize.
[2024-05-20 23:59:53] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
[2024-05-20 23:59:53] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
[2024-05-20 23:59:53] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2024-05-20 23:59:54] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-05-20 23:59:54] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-20 23:59:56] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 3 ms to minimize.
[2024-05-20 23:59:56] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 2 ms to minimize.
[2024-05-20 23:59:56] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 4 ms to minimize.
[2024-05-20 23:59:56] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 3 ms to minimize.
[2024-05-20 23:59:56] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-20 23:59:56] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 3 ms to minimize.
[2024-05-20 23:59:57] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 2 ms to minimize.
[2024-05-20 23:59:57] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-05-20 23:59:57] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-20 23:59:57] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
[2024-05-20 23:59:57] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2024-05-20 23:59:57] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-20 23:59:57] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 2 ms to minimize.
[2024-05-20 23:59:57] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 2 ms to minimize.
[2024-05-20 23:59:58] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-20 23:59:58] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 00:00:00] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-05-21 00:00:00] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 3 ms to minimize.
[2024-05-21 00:00:00] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 3 ms to minimize.
[2024-05-21 00:00:00] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 4 ms to minimize.
[2024-05-21 00:00:00] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-21 00:00:00] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 00:00:01] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-05-21 00:00:01] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 3 ms to minimize.
[2024-05-21 00:00:01] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 00:00:03] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (OVERLAPS) 232/471 variables, 239/307 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 00:00:07] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 2 ms to minimize.
[2024-05-21 00:00:08] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 0/471 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 309 constraints, problems are : Problem set: 0 solved, 231 unsolved in 28720 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 48/70 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 00:00:18] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 00:00:20] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 3 ms to minimize.
[2024-05-21 00:00:21] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 00:00:22] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 3 ms to minimize.
[2024-05-21 00:00:22] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 3 ms to minimize.
[2024-05-21 00:00:22] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (OVERLAPS) 232/471 variables, 239/315 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 231/546 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 2 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 2 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 2 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 3 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-21 00:00:27] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-05-21 00:00:27] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 2 ms to minimize.
[2024-05-21 00:00:27] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 2 ms to minimize.
[2024-05-21 00:00:27] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2024-05-21 00:00:27] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-05-21 00:00:28] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 2 ms to minimize.
[2024-05-21 00:00:28] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 2 ms to minimize.
[2024-05-21 00:00:28] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 3 ms to minimize.
[2024-05-21 00:00:28] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-05-21 00:00:28] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 18/564 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 00:00:36] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/471 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 00:00:43] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 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 Int declared 471/471 variables, and 566 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 74/74 constraints]
After SMT, in 58758ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 58760ms
Starting structural reductions in LTL mode, iteration 1 : 239/276 places, 232/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59234 ms. Remains : 239/276 places, 232/271 transitions.
[2024-05-21 00:00:46] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:00:46] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:00:46] [INFO ] Input system was already deterministic with 232 transitions.
[2024-05-21 00:00:46] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:00:46] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:00:46] [INFO ] Time to serialize gal into /tmp/CTLFireability3894434259991001868.gal : 2 ms
[2024-05-21 00:00:46] [INFO ] Time to serialize properties into /tmp/CTLFireability668643803936290493.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/CTLFireability3894434259991001868.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability668643803936290493.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.34007e+17,6.94019,149616,2,55115,5,503204,6,0,1190,898240,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 00:01:16] [INFO ] Flatten gal took : 8 ms
[2024-05-21 00:01:16] [INFO ] Applying decomposition
[2024-05-21 00:01:16] [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/graph2622826819796564128.txt' '-o' '/tmp/graph2622826819796564128.bin' '-w' '/tmp/graph2622826819796564128.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2622826819796564128.bin' '-l' '-1' '-v' '-w' '/tmp/graph2622826819796564128.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:01:16] [INFO ] Decomposing Gal with order
[2024-05-21 00:01:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:01:16] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-21 00:01:16] [INFO ] Flatten gal took : 19 ms
[2024-05-21 00:01:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 00:01:16] [INFO ] Time to serialize gal into /tmp/CTLFireability5477509038474575625.gal : 6 ms
[2024-05-21 00:01:16] [INFO ] Time to serialize properties into /tmp/CTLFireability8363173691733087554.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/CTLFireability5477509038474575625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8363173691733087554.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.34007e+17,0.575803,17956,2274,23,29317,286,529,41158,45,690,0


Converting to forward existential form...Done !
original formula: EF(((AG(EX((i14.i0.u33.p129==0))) + (AG(AX(((i4.u14.p48==1)&&(i7.u56.p204==1)))) * (i14.i0.u30.p119==1))) + ((EG((i16.i0.u49.p185==0)) * ...254
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U !(EX((i14.i0.u33.p129==0))))))] != FALSE + [((FwdU(Init,TRUE) * (i14.i0.u30.p11...396
Reverse transition relation is NOT exact ! Due to transitions t89, t92, t123, t130, t153, t168, t222, t223, t224, t226, i0.t76, i0.i1.u44.t14, i0.i1.u44.t8...692
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 276/276 places, 271/271 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 249 transition count 244
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 249 transition count 244
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 249 transition count 241
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 69 place count 237 transition count 229
Iterating global reduction 1 with 12 rules applied. Total rules applied 81 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 235 transition count 227
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 233 transition count 225
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 233 transition count 225
Applied a total of 89 rules in 15 ms. Remains 233 /276 variables (removed 43) and now considering 225/271 (removed 46) transitions.
// Phase 1: matrix 225 rows 233 cols
[2024-05-21 00:01:46] [INFO ] Computed 22 invariants in 7 ms
[2024-05-21 00:01:47] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-21 00:01:47] [INFO ] Invariant cache hit.
[2024-05-21 00:01:47] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-21 00:01:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:01:51] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 5 ms to minimize.
[2024-05-21 00:01:51] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 3 ms to minimize.
[2024-05-21 00:01:51] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 2 ms to minimize.
[2024-05-21 00:01:51] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-05-21 00:01:52] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 4 ms to minimize.
[2024-05-21 00:01:52] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 2 ms to minimize.
[2024-05-21 00:01:52] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 3 ms to minimize.
[2024-05-21 00:01:52] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 3 ms to minimize.
[2024-05-21 00:01:52] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 3 ms to minimize.
[2024-05-21 00:01:52] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-05-21 00:01:53] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 3 ms to minimize.
[2024-05-21 00:01:53] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-21 00:01:53] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 3 ms to minimize.
[2024-05-21 00:01:53] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 3 ms to minimize.
[2024-05-21 00:01:53] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 4 ms to minimize.
[2024-05-21 00:01:53] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 3 ms to minimize.
[2024-05-21 00:01:53] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 3 ms to minimize.
[2024-05-21 00:01:54] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2024-05-21 00:01:54] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 2 ms to minimize.
[2024-05-21 00:01:54] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:01:56] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-05-21 00:01:56] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 3 ms to minimize.
[2024-05-21 00:01:56] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 3 ms to minimize.
[2024-05-21 00:01:57] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 3 ms to minimize.
[2024-05-21 00:01:57] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 3 ms to minimize.
[2024-05-21 00:01:57] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-05-21 00:01:57] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-21 00:01:58] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-21 00:01:58] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 3 ms to minimize.
[2024-05-21 00:01:58] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:01:59] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 3 ms to minimize.
[2024-05-21 00:01:59] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 3 ms to minimize.
[2024-05-21 00:01:59] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 3 ms to minimize.
[2024-05-21 00:01:59] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 289 constraints, problems are : Problem set: 0 solved, 224 unsolved in 27184 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 224/513 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:02:20] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 4 ms to minimize.
[2024-05-21 00:02:21] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 3 ms to minimize.
[2024-05-21 00:02:21] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 3 ms to minimize.
[2024-05-21 00:02:21] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 3 ms to minimize.
[2024-05-21 00:02:21] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 3 ms to minimize.
[2024-05-21 00:02:21] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:02:27] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
[2024-05-21 00:02:28] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2024-05-21 00:02:28] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 3 ms to minimize.
[2024-05-21 00:02:28] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 3 ms to minimize.
[2024-05-21 00:02:29] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 3 ms to minimize.
[2024-05-21 00:02:29] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 6/525 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:02:37] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 526 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 47/47 constraints]
After SMT, in 57238ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 57242ms
Starting structural reductions in LTL mode, iteration 1 : 233/276 places, 225/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57727 ms. Remains : 233/276 places, 225/271 transitions.
[2024-05-21 00:02:44] [INFO ] Flatten gal took : 8 ms
[2024-05-21 00:02:44] [INFO ] Flatten gal took : 7 ms
[2024-05-21 00:02:44] [INFO ] Input system was already deterministic with 225 transitions.
[2024-05-21 00:02:44] [INFO ] Flatten gal took : 8 ms
[2024-05-21 00:02:44] [INFO ] Flatten gal took : 8 ms
[2024-05-21 00:02:44] [INFO ] Time to serialize gal into /tmp/CTLFireability4590382738224813859.gal : 3 ms
[2024-05-21 00:02:44] [INFO ] Time to serialize properties into /tmp/CTLFireability13011462519114313515.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/CTLFireability4590382738224813859.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13011462519114313515.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.14476e+17,3.94836,89924,2,38479,5,316411,6,0,1159,509810,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 00:03:14] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:03:14] [INFO ] Applying decomposition
[2024-05-21 00:03:14] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12563299765343009219.txt' '-o' '/tmp/graph12563299765343009219.bin' '-w' '/tmp/graph12563299765343009219.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12563299765343009219.bin' '-l' '-1' '-v' '-w' '/tmp/graph12563299765343009219.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:03:14] [INFO ] Decomposing Gal with order
[2024-05-21 00:03:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:03:14] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-21 00:03:14] [INFO ] Flatten gal took : 12 ms
[2024-05-21 00:03:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-21 00:03:14] [INFO ] Time to serialize gal into /tmp/CTLFireability1925775361778122672.gal : 5 ms
[2024-05-21 00:03:14] [INFO ] Time to serialize properties into /tmp/CTLFireability15210503598860614079.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/CTLFireability1925775361778122672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15210503598860614079.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,4.14476e+17,0.146132,8136,1228,14,8987,176,507,10035,29,355,0


Converting to forward existential form...Done !
original formula: EG(AX(((i1.u7.p21==0)||(i1.u61.p207==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(((i1.u7.p21==0)||(i1.u61.p207==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t72, t75, t88, t101, t119, t126, t141, t148, t163, t216, t217, t219, i0.t98, i0.i1.t100, i1.u...578
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 271/271 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 249 transition count 244
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 249 transition count 244
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 249 transition count 241
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 69 place count 237 transition count 229
Iterating global reduction 1 with 12 rules applied. Total rules applied 81 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 235 transition count 227
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 233 transition count 225
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 233 transition count 225
Applied a total of 89 rules in 17 ms. Remains 233 /276 variables (removed 43) and now considering 225/271 (removed 46) transitions.
[2024-05-21 00:03:44] [INFO ] Invariant cache hit.
[2024-05-21 00:03:45] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 00:03:45] [INFO ] Invariant cache hit.
[2024-05-21 00:03:45] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-21 00:03:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:03:49] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 4 ms to minimize.
[2024-05-21 00:03:49] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 4 ms to minimize.
[2024-05-21 00:03:49] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 4 ms to minimize.
[2024-05-21 00:03:49] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 4 ms to minimize.
[2024-05-21 00:03:49] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 4 ms to minimize.
[2024-05-21 00:03:50] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 4 ms to minimize.
[2024-05-21 00:03:50] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 3 ms to minimize.
[2024-05-21 00:03:50] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 4 ms to minimize.
[2024-05-21 00:03:50] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 3 ms to minimize.
[2024-05-21 00:03:50] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 3 ms to minimize.
[2024-05-21 00:03:50] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 3 ms to minimize.
[2024-05-21 00:03:51] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 3 ms to minimize.
[2024-05-21 00:03:51] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 3 ms to minimize.
[2024-05-21 00:03:51] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 4 ms to minimize.
[2024-05-21 00:03:51] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
[2024-05-21 00:03:51] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 3 ms to minimize.
[2024-05-21 00:03:51] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-21 00:03:52] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 3 ms to minimize.
[2024-05-21 00:03:52] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 3 ms to minimize.
[2024-05-21 00:03:52] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:03:54] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 3 ms to minimize.
[2024-05-21 00:03:55] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 3 ms to minimize.
[2024-05-21 00:03:55] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-05-21 00:03:55] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 3 ms to minimize.
[2024-05-21 00:03:55] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 3 ms to minimize.
[2024-05-21 00:03:55] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 3 ms to minimize.
[2024-05-21 00:03:56] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 3 ms to minimize.
[2024-05-21 00:03:56] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-21 00:03:56] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 3 ms to minimize.
[2024-05-21 00:03:56] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:03:57] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 4 ms to minimize.
[2024-05-21 00:03:57] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 3 ms to minimize.
[2024-05-21 00:03:58] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 3 ms to minimize.
[2024-05-21 00:03:58] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 289 constraints, problems are : Problem set: 0 solved, 224 unsolved in 27434 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 224/513 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:04:18] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 6 ms to minimize.
[2024-05-21 00:04:18] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 3 ms to minimize.
[2024-05-21 00:04:18] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 4 ms to minimize.
[2024-05-21 00:04:19] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 3 ms to minimize.
[2024-05-21 00:04:19] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 3 ms to minimize.
[2024-05-21 00:04:19] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:04:24] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 3 ms to minimize.
[2024-05-21 00:04:25] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 3 ms to minimize.
[2024-05-21 00:04:25] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-21 00:04:25] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 3 ms to minimize.
[2024-05-21 00:04:26] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 3 ms to minimize.
[2024-05-21 00:04:26] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 6/525 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:04:33] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 526 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 47/47 constraints]
After SMT, in 57480ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 57482ms
Starting structural reductions in LTL mode, iteration 1 : 233/276 places, 225/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57832 ms. Remains : 233/276 places, 225/271 transitions.
[2024-05-21 00:04:42] [INFO ] Flatten gal took : 6 ms
[2024-05-21 00:04:42] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:04:42] [INFO ] Input system was already deterministic with 225 transitions.
[2024-05-21 00:04:42] [INFO ] Flatten gal took : 7 ms
[2024-05-21 00:04:42] [INFO ] Flatten gal took : 14 ms
[2024-05-21 00:04:42] [INFO ] Time to serialize gal into /tmp/CTLFireability11464402948839041284.gal : 2 ms
[2024-05-21 00:04:42] [INFO ] Time to serialize properties into /tmp/CTLFireability8874128817134578366.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/CTLFireability11464402948839041284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8874128817134578366.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.14476e+17,4.31171,90484,2,38479,5,316411,6,0,1159,509810,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 00:05:12] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:05:12] [INFO ] Applying decomposition
[2024-05-21 00:05:12] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6131181067415478667.txt' '-o' '/tmp/graph6131181067415478667.bin' '-w' '/tmp/graph6131181067415478667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6131181067415478667.bin' '-l' '-1' '-v' '-w' '/tmp/graph6131181067415478667.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:05:12] [INFO ] Decomposing Gal with order
[2024-05-21 00:05:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:05:12] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-21 00:05:12] [INFO ] Flatten gal took : 34 ms
[2024-05-21 00:05:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 00:05:12] [INFO ] Time to serialize gal into /tmp/CTLFireability10599489554479191680.gal : 25 ms
[2024-05-21 00:05:12] [INFO ] Time to serialize properties into /tmp/CTLFireability17547914220113688265.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/CTLFireability10599489554479191680.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17547914220113688265.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,4.14476e+17,0.165625,8144,1156,14,9363,177,491,10432,28,337,0


Converting to forward existential form...Done !
original formula: AF(EX((i16.i0.u64.p212==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EX((i16.i0.u64.p212==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t72, t75, t88, t98, t101, t126, t148, t163, t216, t217, t219, i0.t85, i0.i1.t87, i1.u11.t1, i...590
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 271/271 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 250 transition count 245
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 250 transition count 245
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 250 transition count 242
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 67 place count 238 transition count 230
Iterating global reduction 1 with 12 rules applied. Total rules applied 79 place count 238 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 236 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 236 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 234 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 234 transition count 226
Applied a total of 87 rules in 20 ms. Remains 234 /276 variables (removed 42) and now considering 226/271 (removed 45) transitions.
// Phase 1: matrix 226 rows 234 cols
[2024-05-21 00:05:43] [INFO ] Computed 22 invariants in 11 ms
[2024-05-21 00:05:43] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 00:05:43] [INFO ] Invariant cache hit.
[2024-05-21 00:05:43] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-21 00:05:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:05:47] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 4 ms to minimize.
[2024-05-21 00:05:48] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 4 ms to minimize.
[2024-05-21 00:05:48] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 3 ms to minimize.
[2024-05-21 00:05:48] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 4 ms to minimize.
[2024-05-21 00:05:48] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 4 ms to minimize.
[2024-05-21 00:05:48] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 3 ms to minimize.
[2024-05-21 00:05:49] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 3 ms to minimize.
[2024-05-21 00:05:49] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 4 ms to minimize.
[2024-05-21 00:05:49] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 4 ms to minimize.
[2024-05-21 00:05:49] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 3 ms to minimize.
[2024-05-21 00:05:49] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 3 ms to minimize.
[2024-05-21 00:05:49] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 3 ms to minimize.
[2024-05-21 00:05:50] [INFO ] Deduced a trap composed of 58 places in 182 ms of which 4 ms to minimize.
[2024-05-21 00:05:50] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 3 ms to minimize.
[2024-05-21 00:05:50] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 4 ms to minimize.
[2024-05-21 00:05:50] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 4 ms to minimize.
[2024-05-21 00:05:50] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 4 ms to minimize.
[2024-05-21 00:05:50] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-21 00:05:51] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 3 ms to minimize.
[2024-05-21 00:05:51] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:05:53] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 3 ms to minimize.
[2024-05-21 00:05:53] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 4 ms to minimize.
[2024-05-21 00:05:53] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 2 ms to minimize.
[2024-05-21 00:05:53] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 4 ms to minimize.
[2024-05-21 00:05:54] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 3 ms to minimize.
[2024-05-21 00:05:54] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 4 ms to minimize.
[2024-05-21 00:05:54] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 3 ms to minimize.
[2024-05-21 00:05:54] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-21 00:05:54] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 2 ms to minimize.
[2024-05-21 00:05:55] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
[2024-05-21 00:05:55] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 3 ms to minimize.
[2024-05-21 00:05:56] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 3 ms to minimize.
[2024-05-21 00:05:56] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 3 ms to minimize.
[2024-05-21 00:05:56] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:05:57] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 3 ms to minimize.
[2024-05-21 00:05:57] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 3 ms to minimize.
[2024-05-21 00:05:57] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 3 ms to minimize.
[2024-05-21 00:05:58] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-05-21 00:05:59] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:06:01] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:06:04] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 2 ms to minimize.
[2024-05-21 00:06:05] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 3 ms to minimize.
[2024-05-21 00:06:05] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 3 ms to minimize.
[2024-05-21 00:06:05] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 3 ms to minimize.
[2024-05-21 00:06:06] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:06:07] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:06:09] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-21 00:06:09] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:06:12] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/460 variables, and 71 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 49/71 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:06:16] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 3 ms to minimize.
[2024-05-21 00:06:16] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 3 ms to minimize.
[2024-05-21 00:06:16] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:06:18] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 3 ms to minimize.
[2024-05-21 00:06:18] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 226/460 variables, 234/310 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 225/535 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:06:26] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (OVERLAPS) 0/460 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 536 constraints, problems are : Problem set: 0 solved, 225 unsolved in 28637 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 55/55 constraints]
After SMT, in 58687ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 58691ms
Starting structural reductions in LTL mode, iteration 1 : 234/276 places, 226/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59273 ms. Remains : 234/276 places, 226/271 transitions.
[2024-05-21 00:06:42] [INFO ] Flatten gal took : 8 ms
[2024-05-21 00:06:42] [INFO ] Flatten gal took : 7 ms
[2024-05-21 00:06:42] [INFO ] Input system was already deterministic with 226 transitions.
[2024-05-21 00:06:42] [INFO ] Flatten gal took : 9 ms
[2024-05-21 00:06:42] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:06:42] [INFO ] Time to serialize gal into /tmp/CTLFireability705060624829720242.gal : 2 ms
[2024-05-21 00:06:42] [INFO ] Time to serialize properties into /tmp/CTLFireability14402105536674710628.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability705060624829720242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14402105536674710628.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.3136e+17,11.6028,247412,2,66138,5,822583,6,0,1164,1.56591e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 00:07:12] [INFO ] Flatten gal took : 6 ms
[2024-05-21 00:07:12] [INFO ] Applying decomposition
[2024-05-21 00:07:12] [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/graph14830689268702833185.txt' '-o' '/tmp/graph14830689268702833185.bin' '-w' '/tmp/graph14830689268702833185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14830689268702833185.bin' '-l' '-1' '-v' '-w' '/tmp/graph14830689268702833185.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:07:12] [INFO ] Decomposing Gal with order
[2024-05-21 00:07:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:07:12] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-21 00:07:12] [INFO ] Flatten gal took : 12 ms
[2024-05-21 00:07:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 00:07:12] [INFO ] Time to serialize gal into /tmp/CTLFireability8039781363269289207.gal : 4 ms
[2024-05-21 00:07:12] [INFO ] Time to serialize properties into /tmp/CTLFireability6842304304049408219.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/CTLFireability8039781363269289207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6842304304049408219.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,4.3136e+17,0.203689,9736,1365,21,12870,197,514,15450,37,414,0


Converting to forward existential form...Done !
original formula: AF(AG((EX((EG((i3.u10.p31==1)) + (i14.i0.u59.p198==1))) * (((i19.i0.u87.p272==1) + (EF(((i0.u32.p110==1)&&(i6.u75.p238==1))) * ((i10.u43....260
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((EX((EG((i3.u10.p31==1)) + (i14.i0.u59.p198==1))) * (((i19.i0.u87.p272==1) + (E(TRUE U...323
Reverse transition relation is NOT exact ! Due to transitions t73, t76, t86, t89, t102, t120, t127, t142, t149, t164, t217, t218, t220, i0.u30.t8, i0.u30.t...610
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 271/271 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 250 transition count 245
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 250 transition count 245
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 250 transition count 242
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 67 place count 238 transition count 230
Iterating global reduction 1 with 12 rules applied. Total rules applied 79 place count 238 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 236 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 236 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 234 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 234 transition count 226
Applied a total of 87 rules in 13 ms. Remains 234 /276 variables (removed 42) and now considering 226/271 (removed 45) transitions.
// Phase 1: matrix 226 rows 234 cols
[2024-05-21 00:07:42] [INFO ] Computed 22 invariants in 2 ms
[2024-05-21 00:07:42] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 00:07:42] [INFO ] Invariant cache hit.
[2024-05-21 00:07:42] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-21 00:07:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:07:46] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 3 ms to minimize.
[2024-05-21 00:07:46] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 3 ms to minimize.
[2024-05-21 00:07:46] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 3 ms to minimize.
[2024-05-21 00:07:47] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 4 ms to minimize.
[2024-05-21 00:07:47] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 4 ms to minimize.
[2024-05-21 00:07:47] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 2 ms to minimize.
[2024-05-21 00:07:47] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-05-21 00:07:47] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 3 ms to minimize.
[2024-05-21 00:07:47] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-21 00:07:47] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 3 ms to minimize.
[2024-05-21 00:07:48] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 3 ms to minimize.
[2024-05-21 00:07:48] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 3 ms to minimize.
[2024-05-21 00:07:48] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-05-21 00:07:48] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-05-21 00:07:48] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 3 ms to minimize.
[2024-05-21 00:07:48] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 3 ms to minimize.
[2024-05-21 00:07:48] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 4 ms to minimize.
[2024-05-21 00:07:49] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:07:52] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 3 ms to minimize.
[2024-05-21 00:07:52] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 2 ms to minimize.
[2024-05-21 00:07:52] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-05-21 00:07:52] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-21 00:07:52] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 2 ms to minimize.
[2024-05-21 00:07:52] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 3 ms to minimize.
[2024-05-21 00:07:52] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 2 ms to minimize.
[2024-05-21 00:07:52] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 3 ms to minimize.
[2024-05-21 00:07:53] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-05-21 00:07:53] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-21 00:07:53] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 2 ms to minimize.
[2024-05-21 00:07:53] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-05-21 00:07:53] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:07:55] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 2 ms to minimize.
[2024-05-21 00:07:55] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 2 ms to minimize.
[2024-05-21 00:07:55] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:07:57] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-21 00:07:57] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-21 00:07:57] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 2 ms to minimize.
[2024-05-21 00:07:57] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 2 ms to minimize.
[2024-05-21 00:07:57] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 3 ms to minimize.
[2024-05-21 00:07:58] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 3 ms to minimize.
[2024-05-21 00:07:58] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-05-21 00:07:58] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:08:01] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:08:02] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 2 ms to minimize.
[2024-05-21 00:08:02] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:08:04] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 2 ms to minimize.
[2024-05-21 00:08:04] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
[2024-05-21 00:08:04] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-21 00:08:04] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
[2024-05-21 00:08:04] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 2 ms to minimize.
[2024-05-21 00:08:05] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (OVERLAPS) 226/460 variables, 234/307 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:08:10] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
[2024-05-21 00:08:10] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 3 ms to minimize.
[2024-05-21 00:08:10] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/460 variables, and 310 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 54/76 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 226/460 variables, 234/310 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 225/535 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:08:17] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 2 ms to minimize.
[2024-05-21 00:08:18] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 2 ms to minimize.
[2024-05-21 00:08:18] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 3 ms to minimize.
[2024-05-21 00:08:18] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 3 ms to minimize.
[2024-05-21 00:08:19] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2024-05-21 00:08:19] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 2 ms to minimize.
[2024-05-21 00:08:20] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 7/542 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:08:24] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:08:30] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 544 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 63/63 constraints]
After SMT, in 60045ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60047ms
Starting structural reductions in LTL mode, iteration 1 : 234/276 places, 226/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60405 ms. Remains : 234/276 places, 226/271 transitions.
[2024-05-21 00:08:42] [INFO ] Flatten gal took : 10 ms
[2024-05-21 00:08:42] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:08:43] [INFO ] Input system was already deterministic with 226 transitions.
[2024-05-21 00:08:43] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:08:43] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:08:43] [INFO ] Time to serialize gal into /tmp/CTLFireability9344253174839783388.gal : 1 ms
[2024-05-21 00:08:43] [INFO ] Time to serialize properties into /tmp/CTLFireability7499404561162582955.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/CTLFireability9344253174839783388.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7499404561162582955.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.24241e+17,8.3309,181396,2,56124,5,617966,6,0,1164,1.10345e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 00:09:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:09:13] [INFO ] Applying decomposition
[2024-05-21 00:09:13] [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/graph4837225204875068912.txt' '-o' '/tmp/graph4837225204875068912.bin' '-w' '/tmp/graph4837225204875068912.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4837225204875068912.bin' '-l' '-1' '-v' '-w' '/tmp/graph4837225204875068912.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:09:13] [INFO ] Decomposing Gal with order
[2024-05-21 00:09:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:09:13] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-21 00:09:13] [INFO ] Flatten gal took : 13 ms
[2024-05-21 00:09:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 00:09:13] [INFO ] Time to serialize gal into /tmp/CTLFireability8692912911679204751.gal : 3 ms
[2024-05-21 00:09:13] [INFO ] Time to serialize properties into /tmp/CTLFireability14767377327622771512.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8692912911679204751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14767377327622771512.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,4.24241e+17,0.569028,14740,2200,22,24055,396,481,28501,36,1211,0


Converting to forward existential form...Done !
original formula: EF((AG((((i7.u28.p91==0) + AG((i3.u10.p20==0))) + AX(FALSE))) + ((i4.u13.p32==1)&&(i4.u75.p236==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((((i7.u28.p91==0) + !(E(TRUE U !((i3.u10.p20==0))))) + !(EX(!(FALSE))))))))] !...232
Reverse transition relation is NOT exact ! Due to transitions t86, t89, t120, t127, t149, t164, t217, t218, t220, i0.t76, i0.t73, i0.i2.t75, i1.u33.t8, i1....614
(forward)formula 0,1,8.09065,261316,1,0,618147,396,2769,944277,156,1211,1164135
FORMULA AutoFlight-PT-03b-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 271/271 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 249 transition count 244
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 249 transition count 244
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 249 transition count 241
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 69 place count 237 transition count 229
Iterating global reduction 1 with 12 rules applied. Total rules applied 81 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 235 transition count 227
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 233 transition count 225
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 233 transition count 225
Applied a total of 89 rules in 16 ms. Remains 233 /276 variables (removed 43) and now considering 225/271 (removed 46) transitions.
// Phase 1: matrix 225 rows 233 cols
[2024-05-21 00:09:21] [INFO ] Computed 22 invariants in 2 ms
[2024-05-21 00:09:21] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 00:09:21] [INFO ] Invariant cache hit.
[2024-05-21 00:09:21] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-21 00:09:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:09:25] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 4 ms to minimize.
[2024-05-21 00:09:25] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-05-21 00:09:26] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 3 ms to minimize.
[2024-05-21 00:09:26] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 3 ms to minimize.
[2024-05-21 00:09:26] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 3 ms to minimize.
[2024-05-21 00:09:26] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-05-21 00:09:26] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-21 00:09:26] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-05-21 00:09:26] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2024-05-21 00:09:26] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-21 00:09:26] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2024-05-21 00:09:27] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 3 ms to minimize.
[2024-05-21 00:09:27] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-21 00:09:27] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-05-21 00:09:27] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-21 00:09:27] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-21 00:09:27] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-05-21 00:09:27] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2024-05-21 00:09:27] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 3 ms to minimize.
[2024-05-21 00:09:27] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:09:30] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-05-21 00:09:30] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-05-21 00:09:30] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 3 ms to minimize.
[2024-05-21 00:09:30] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 3 ms to minimize.
[2024-05-21 00:09:30] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-21 00:09:30] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 2 ms to minimize.
[2024-05-21 00:09:31] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-21 00:09:31] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-21 00:09:31] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-21 00:09:31] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:09:32] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 3 ms to minimize.
[2024-05-21 00:09:32] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 2 ms to minimize.
[2024-05-21 00:09:32] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 2 ms to minimize.
[2024-05-21 00:09:33] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 289 constraints, problems are : Problem set: 0 solved, 224 unsolved in 25594 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 224/513 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:09:52] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 3 ms to minimize.
[2024-05-21 00:09:53] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2024-05-21 00:09:53] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 3 ms to minimize.
[2024-05-21 00:09:53] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 2 ms to minimize.
[2024-05-21 00:09:54] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 3 ms to minimize.
[2024-05-21 00:09:54] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:10:00] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 3 ms to minimize.
[2024-05-21 00:10:00] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 3 ms to minimize.
[2024-05-21 00:10:00] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 3 ms to minimize.
[2024-05-21 00:10:01] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 3 ms to minimize.
[2024-05-21 00:10:01] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
[2024-05-21 00:10:01] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 6/525 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:10:09] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 526 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 47/47 constraints]
After SMT, in 55636ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 55639ms
Starting structural reductions in LTL mode, iteration 1 : 233/276 places, 225/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55990 ms. Remains : 233/276 places, 225/271 transitions.
[2024-05-21 00:10:17] [INFO ] Flatten gal took : 8 ms
[2024-05-21 00:10:17] [INFO ] Flatten gal took : 7 ms
[2024-05-21 00:10:17] [INFO ] Input system was already deterministic with 225 transitions.
[2024-05-21 00:10:17] [INFO ] Flatten gal took : 7 ms
[2024-05-21 00:10:17] [INFO ] Flatten gal took : 7 ms
[2024-05-21 00:10:17] [INFO ] Time to serialize gal into /tmp/CTLFireability11194517547068044184.gal : 3 ms
[2024-05-21 00:10:17] [INFO ] Time to serialize properties into /tmp/CTLFireability8990813279139138886.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/CTLFireability11194517547068044184.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8990813279139138886.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.14476e+17,4.05846,91424,2,38479,5,316411,6,0,1159,509810,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 00:10:47] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:10:47] [INFO ] Applying decomposition
[2024-05-21 00:10:47] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6772014405686842502.txt' '-o' '/tmp/graph6772014405686842502.bin' '-w' '/tmp/graph6772014405686842502.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6772014405686842502.bin' '-l' '-1' '-v' '-w' '/tmp/graph6772014405686842502.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:10:47] [INFO ] Decomposing Gal with order
[2024-05-21 00:10:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:10:47] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-21 00:10:47] [INFO ] Flatten gal took : 28 ms
[2024-05-21 00:10:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 00:10:47] [INFO ] Time to serialize gal into /tmp/CTLFireability17733487548053407215.gal : 3 ms
[2024-05-21 00:10:47] [INFO ] Time to serialize properties into /tmp/CTLFireability8919942276008119518.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/CTLFireability17733487548053407215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8919942276008119518.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,4.14476e+17,0.153011,7880,1188,14,8551,173,492,8602,29,342,0


Converting to forward existential form...Done !
original formula: AG(AF(!(E(EX((i0.i1.u39.p143==1)) U !(((i8.i1.u25.p87==1)&&(i8.i2.u60.p205==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(E(EX((i0.i1.u39.p143==1)) U !(((i8.i1.u25.p87==1)&&(i8.i2.u60.p205==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t72, t75, t85, t88, t101, t119, t126, t148, t163, t216, t217, t219, i0.t98, i0.i2.t100, i1.t1...585
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,27.2885,647420,1,0,1.78638e+06,173,2573,1.19577e+06,125,342,1958626
FORMULA AutoFlight-PT-03b-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 271/271 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 256 transition count 251
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 256 transition count 251
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 256 transition count 248
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 247 transition count 239
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 247 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 246 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 246 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 245 transition count 237
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 245 transition count 237
Applied a total of 65 rules in 15 ms. Remains 245 /276 variables (removed 31) and now considering 237/271 (removed 34) transitions.
// Phase 1: matrix 237 rows 245 cols
[2024-05-21 00:11:14] [INFO ] Computed 22 invariants in 5 ms
[2024-05-21 00:11:15] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 00:11:15] [INFO ] Invariant cache hit.
[2024-05-21 00:11:15] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2024-05-21 00:11:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 00:11:18] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 2 ms to minimize.
[2024-05-21 00:11:18] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 2 ms to minimize.
[2024-05-21 00:11:18] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 2 ms to minimize.
[2024-05-21 00:11:18] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-21 00:11:18] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-21 00:11:18] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-05-21 00:11:19] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 3 ms to minimize.
[2024-05-21 00:11:19] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-05-21 00:11:19] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-05-21 00:11:19] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-05-21 00:11:19] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 3 ms to minimize.
[2024-05-21 00:11:19] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 3 ms to minimize.
[2024-05-21 00:11:20] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 3 ms to minimize.
[2024-05-21 00:11:20] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2024-05-21 00:11:20] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 3 ms to minimize.
[2024-05-21 00:11:20] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 3 ms to minimize.
[2024-05-21 00:11:20] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 3 ms to minimize.
[2024-05-21 00:11:20] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 4 ms to minimize.
[2024-05-21 00:11:20] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 4 ms to minimize.
[2024-05-21 00:11:21] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 00:11:23] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 3 ms to minimize.
[2024-05-21 00:11:23] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-05-21 00:11:23] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 2 ms to minimize.
[2024-05-21 00:11:23] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-21 00:11:23] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 3 ms to minimize.
[2024-05-21 00:11:23] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 3 ms to minimize.
[2024-05-21 00:11:23] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-05-21 00:11:24] [INFO ] Deduced a trap composed of 45 places in 172 ms of which 3 ms to minimize.
[2024-05-21 00:11:24] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-05-21 00:11:24] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 00:11:25] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 3 ms to minimize.
[2024-05-21 00:11:26] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 3 ms to minimize.
[2024-05-21 00:11:26] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2024-05-21 00:11:26] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-05-21 00:11:26] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 3 ms to minimize.
[2024-05-21 00:11:26] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 3 ms to minimize.
[2024-05-21 00:11:26] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 3 ms to minimize.
[2024-05-21 00:11:27] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 4 ms to minimize.
[2024-05-21 00:11:27] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 14 ms to minimize.
[2024-05-21 00:11:27] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 3 ms to minimize.
[2024-05-21 00:11:27] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-05-21 00:11:27] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 3 ms to minimize.
[2024-05-21 00:11:28] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 00:11:29] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 3 ms to minimize.
[2024-05-21 00:11:29] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-05-21 00:11:30] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 3 ms to minimize.
[2024-05-21 00:11:30] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 2 ms to minimize.
[2024-05-21 00:11:30] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 00:11:33] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-21 00:11:34] [INFO ] Deduced a trap composed of 54 places in 160 ms of which 3 ms to minimize.
[2024-05-21 00:11:34] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 00:11:35] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 2 ms to minimize.
[2024-05-21 00:11:35] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 2 ms to minimize.
[2024-05-21 00:11:35] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 3 ms to minimize.
[2024-05-21 00:11:36] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-05-21 00:11:36] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 00:11:37] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 3 ms to minimize.
[2024-05-21 00:11:37] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 00:11:41] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 12 (OVERLAPS) 237/482 variables, 245/326 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 326 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 59/81 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 237/482 variables, 245/326 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 236/562 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 00:11:51] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-21 00:11:51] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-05-21 00:11:52] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-21 00:11:52] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 3 ms to minimize.
[2024-05-21 00:11:52] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 5/567 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 00:11:57] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-21 00:11:57] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 2 ms to minimize.
[2024-05-21 00:11:57] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2024-05-21 00:11:57] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-05-21 00:11:57] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 2 ms to minimize.
[2024-05-21 00:11:57] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 2 ms to minimize.
[2024-05-21 00:11:58] [INFO ] Deduced a trap composed of 60 places in 143 ms of which 3 ms to minimize.
[2024-05-21 00:11:58] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 3 ms to minimize.
[2024-05-21 00:11:59] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-21 00:12:01] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 10/577 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 10 (OVERLAPS) 0/482 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 577 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 74/74 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in LTL mode, iteration 1 : 245/276 places, 237/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60412 ms. Remains : 245/276 places, 237/271 transitions.
[2024-05-21 00:12:15] [INFO ] Flatten gal took : 8 ms
[2024-05-21 00:12:15] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:12:15] [INFO ] Input system was already deterministic with 237 transitions.
[2024-05-21 00:12:15] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:12:15] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:12:15] [INFO ] Time to serialize gal into /tmp/CTLFireability7406628381676930970.gal : 1 ms
[2024-05-21 00:12:15] [INFO ] Time to serialize properties into /tmp/CTLFireability2127579241745791350.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/CTLFireability7406628381676930970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2127579241745791350.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.57267e+17,18.2299,391504,2,90575,5,1.33015e+06,6,0,1219,2.4693e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 00:12:45] [INFO ] Flatten gal took : 6 ms
[2024-05-21 00:12:45] [INFO ] Applying decomposition
[2024-05-21 00:12:45] [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/graph33867207227106330.txt' '-o' '/tmp/graph33867207227106330.bin' '-w' '/tmp/graph33867207227106330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph33867207227106330.bin' '-l' '-1' '-v' '-w' '/tmp/graph33867207227106330.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:12:45] [INFO ] Decomposing Gal with order
[2024-05-21 00:12:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:12:45] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-21 00:12:45] [INFO ] Flatten gal took : 11 ms
[2024-05-21 00:12:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 00:12:45] [INFO ] Time to serialize gal into /tmp/CTLFireability7544456432644355252.gal : 3 ms
[2024-05-21 00:12:45] [INFO ] Time to serialize properties into /tmp/CTLFireability16510543678509192786.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/CTLFireability7544456432644355252.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16510543678509192786.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.57267e+17,0.684006,18260,3057,19,30121,277,528,38123,40,623,0


Converting to forward existential form...Done !
original formula: (EG(((AG(AF(((i7.u28.p87==0)||(i10.u64.p205==0)))) * AF((i14.i0.u55.p186==1))) * ((i5.u20.p63==0)&&(i4.i0.u13.p40==0)))) + (AG((((!(A((i7...590
=> equivalent forward existential formula: ((([(FwdU((FwdU((Init * !(EG(((!(E(TRUE U !(!(EG(!(((i7.u28.p87==0)||(i10.u64.p205==0)))))))) * !(EG(!((i14.i0.u...1651
Reverse transition relation is NOT exact ! Due to transitions t80, t92, t95, t126, t133, t155, t175, t229, t230, t231, i0.t77, i0.i1.t79, i1.t108, i1.t105,...688
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 276/276 places, 271/271 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 251 transition count 246
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 251 transition count 246
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 251 transition count 244
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 63 place count 240 transition count 233
Iterating global reduction 1 with 11 rules applied. Total rules applied 74 place count 240 transition count 233
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 238 transition count 231
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 238 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 236 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 236 transition count 229
Applied a total of 82 rules in 18 ms. Remains 236 /276 variables (removed 40) and now considering 229/271 (removed 42) transitions.
// Phase 1: matrix 229 rows 236 cols
[2024-05-21 00:13:15] [INFO ] Computed 22 invariants in 1 ms
[2024-05-21 00:13:15] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 00:13:15] [INFO ] Invariant cache hit.
[2024-05-21 00:13:15] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-21 00:13:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 00:13:19] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 3 ms to minimize.
[2024-05-21 00:13:19] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 4 ms to minimize.
[2024-05-21 00:13:19] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2024-05-21 00:13:19] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 3 ms to minimize.
[2024-05-21 00:13:19] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 4 ms to minimize.
[2024-05-21 00:13:19] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 2 ms to minimize.
[2024-05-21 00:13:20] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 4 ms to minimize.
[2024-05-21 00:13:20] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
[2024-05-21 00:13:20] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 3 ms to minimize.
[2024-05-21 00:13:20] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-05-21 00:13:20] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 3 ms to minimize.
[2024-05-21 00:13:20] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 3 ms to minimize.
[2024-05-21 00:13:20] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 3 ms to minimize.
[2024-05-21 00:13:21] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 3 ms to minimize.
[2024-05-21 00:13:21] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-05-21 00:13:21] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-05-21 00:13:21] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 2 ms to minimize.
[2024-05-21 00:13:21] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 4 ms to minimize.
[2024-05-21 00:13:21] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 3 ms to minimize.
[2024-05-21 00:13:21] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 00:13:24] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 00:13:25] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 3 ms to minimize.
[2024-05-21 00:13:26] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 229/465 variables, 236/281 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 00:13:32] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-21 00:13:32] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 00:13:34] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-21 00:13:34] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 3 ms to minimize.
[2024-05-21 00:13:35] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-05-21 00:13:35] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 2 ms to minimize.
[2024-05-21 00:13:35] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 5/288 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 00:13:40] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 00:13:42] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 00:13:44] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-21 00:13:44] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/465 variables, and 292 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 00:13:48] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 2 ms to minimize.
[2024-05-21 00:13:48] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-21 00:13:49] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 3 ms to minimize.
[2024-05-21 00:13:49] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 2 ms to minimize.
[2024-05-21 00:13:49] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 2 ms to minimize.
[2024-05-21 00:13:49] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 3 ms to minimize.
[2024-05-21 00:13:49] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2024-05-21 00:13:49] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 3 ms to minimize.
[2024-05-21 00:13:50] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 3 ms to minimize.
[2024-05-21 00:13:50] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 00:13:51] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 3 ms to minimize.
[2024-05-21 00:13:51] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 3 ms to minimize.
[2024-05-21 00:13:52] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 2 ms to minimize.
[2024-05-21 00:13:52] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 2 ms to minimize.
[2024-05-21 00:13:52] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 2 ms to minimize.
[2024-05-21 00:13:53] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 3 ms to minimize.
[2024-05-21 00:13:53] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 00:13:55] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 3 ms to minimize.
[2024-05-21 00:13:55] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 2 ms to minimize.
[2024-05-21 00:13:55] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 00:13:57] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 3 ms to minimize.
[2024-05-21 00:13:58] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 3 ms to minimize.
[2024-05-21 00:13:58] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 229/465 variables, 236/315 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 228/543 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 00:14:02] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 2 ms to minimize.
[2024-05-21 00:14:03] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-05-21 00:14:05] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 3/546 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 00:14:10] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/465 variables, and 547 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 61/61 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in LTL mode, iteration 1 : 236/276 places, 229/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60396 ms. Remains : 236/276 places, 229/271 transitions.
[2024-05-21 00:14:15] [INFO ] Flatten gal took : 6 ms
[2024-05-21 00:14:15] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:14:15] [INFO ] Input system was already deterministic with 229 transitions.
[2024-05-21 00:14:15] [INFO ] Flatten gal took : 6 ms
[2024-05-21 00:14:15] [INFO ] Flatten gal took : 6 ms
[2024-05-21 00:14:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1005613947949560970.gal : 4 ms
[2024-05-21 00:14:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3940098558256453541.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/CTLFireability1005613947949560970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3940098558256453541.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.08392e+17,9.69944,230240,2,59238,5,783497,6,0,1175,1.43359e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 00:14:46] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:14:46] [INFO ] Applying decomposition
[2024-05-21 00:14:46] [INFO ] Flatten gal took : 13 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/graph1252874126330011443.txt' '-o' '/tmp/graph1252874126330011443.bin' '-w' '/tmp/graph1252874126330011443.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1252874126330011443.bin' '-l' '-1' '-v' '-w' '/tmp/graph1252874126330011443.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:14:46] [INFO ] Decomposing Gal with order
[2024-05-21 00:14:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:14:46] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-21 00:14:46] [INFO ] Flatten gal took : 10 ms
[2024-05-21 00:14:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 00:14:46] [INFO ] Time to serialize gal into /tmp/CTLFireability5924672352763571871.gal : 3 ms
[2024-05-21 00:14:46] [INFO ] Time to serialize properties into /tmp/CTLFireability15499337810836796772.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/CTLFireability5924672352763571871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15499337810836796772.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.08392e+17,0.213533,10004,1916,18,13770,265,517,15757,41,525,0


Converting to forward existential form...Done !
original formula: (AG(!(A(!(((i8.i1.u30.p110==1)&&(i5.u75.p238==1))) U (i7.u29.p97==1)))) + ((!(E(EG(((((i6.u27.p94==1)&&(i5.u20.p71==1))&&(i5.u75.p237==1)...325
=> equivalent forward existential formula: (([(FwdU((Init * !(!(E(TRUE U !(!(!((E(!((i7.u29.p97==1)) U (!(!(((i8.i1.u30.p110==1)&&(i5.u75.p238==1)))) * !((...795
Reverse transition relation is NOT exact ! Due to transitions t72, t75, t85, t88, t101, t126, t145, t152, t167, t220, t221, t223, i1.t163, i1.u13.t160, i2....602
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 271/271 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 252 transition count 247
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 252 transition count 247
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 252 transition count 245
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 60 place count 242 transition count 235
Iterating global reduction 1 with 10 rules applied. Total rules applied 70 place count 242 transition count 235
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 240 transition count 233
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 240 transition count 233
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 238 transition count 231
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 238 transition count 231
Applied a total of 78 rules in 12 ms. Remains 238 /276 variables (removed 38) and now considering 231/271 (removed 40) transitions.
// Phase 1: matrix 231 rows 238 cols
[2024-05-21 00:15:16] [INFO ] Computed 22 invariants in 1 ms
[2024-05-21 00:15:16] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-21 00:15:16] [INFO ] Invariant cache hit.
[2024-05-21 00:15:16] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2024-05-21 00:15:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 00:15:20] [INFO ] Deduced a trap composed of 43 places in 205 ms of which 5 ms to minimize.
[2024-05-21 00:15:20] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 4 ms to minimize.
[2024-05-21 00:15:20] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 3 ms to minimize.
[2024-05-21 00:15:20] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 4 ms to minimize.
[2024-05-21 00:15:21] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 4 ms to minimize.
[2024-05-21 00:15:21] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 3 ms to minimize.
[2024-05-21 00:15:21] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 3 ms to minimize.
[2024-05-21 00:15:21] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 3 ms to minimize.
[2024-05-21 00:15:21] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 3 ms to minimize.
[2024-05-21 00:15:21] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 4 ms to minimize.
[2024-05-21 00:15:22] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2024-05-21 00:15:22] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 8 ms to minimize.
[2024-05-21 00:15:22] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 3 ms to minimize.
[2024-05-21 00:15:22] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 3 ms to minimize.
[2024-05-21 00:15:22] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 3 ms to minimize.
[2024-05-21 00:15:22] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-05-21 00:15:22] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 3 ms to minimize.
[2024-05-21 00:15:23] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 3 ms to minimize.
[2024-05-21 00:15:23] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 3 ms to minimize.
[2024-05-21 00:15:23] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 00:15:26] [INFO ] Deduced a trap composed of 61 places in 144 ms of which 3 ms to minimize.
[2024-05-21 00:15:26] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 3 ms to minimize.
[2024-05-21 00:15:26] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 3 ms to minimize.
[2024-05-21 00:15:26] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 2 ms to minimize.
[2024-05-21 00:15:26] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-21 00:15:26] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-21 00:15:26] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 2 ms to minimize.
[2024-05-21 00:15:27] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 2 ms to minimize.
[2024-05-21 00:15:27] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 2 ms to minimize.
[2024-05-21 00:15:27] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 3 ms to minimize.
[2024-05-21 00:15:27] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 3 ms to minimize.
[2024-05-21 00:15:27] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 3 ms to minimize.
[2024-05-21 00:15:28] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 3 ms to minimize.
[2024-05-21 00:15:28] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 2 ms to minimize.
[2024-05-21 00:15:28] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 2 ms to minimize.
[2024-05-21 00:15:28] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 3 ms to minimize.
[2024-05-21 00:15:29] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 3 ms to minimize.
[2024-05-21 00:15:29] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 3 ms to minimize.
[2024-05-21 00:15:29] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 00:15:31] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 3 ms to minimize.
[2024-05-21 00:15:32] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 3 ms to minimize.
[2024-05-21 00:15:32] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 3 ms to minimize.
[2024-05-21 00:15:32] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 3 ms to minimize.
[2024-05-21 00:15:32] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 00:15:34] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 3 ms to minimize.
[2024-05-21 00:15:34] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 3 ms to minimize.
[2024-05-21 00:15:34] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 3 ms to minimize.
[2024-05-21 00:15:35] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-21 00:15:35] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-21 00:15:35] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 00:15:39] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 4 ms to minimize.
[2024-05-21 00:15:39] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2024-05-21 00:15:39] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 2 ms to minimize.
[2024-05-21 00:15:39] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-05-21 00:15:39] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-05-21 00:15:39] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-21 00:15:40] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 3 ms to minimize.
[2024-05-21 00:15:40] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 3 ms to minimize.
[2024-05-21 00:15:40] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
[2024-05-21 00:15:41] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 9 ms to minimize.
[2024-05-21 00:15:41] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 11/83 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 00:15:42] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 3 ms to minimize.
[2024-05-21 00:15:42] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 00:15:46] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
(s19 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
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 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 238/469 variables, and 86 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/238 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 64/86 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 00:15:49] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 3 ms to minimize.
[2024-05-21 00:15:49] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-05-21 00:15:49] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 1 ms to minimize.
[2024-05-21 00:15:50] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 3 ms to minimize.
[2024-05-21 00:15:50] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 231/469 variables, 238/329 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 230/559 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 00:15:55] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 3 ms to minimize.
[2024-05-21 00:15:55] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 3 ms to minimize.
[2024-05-21 00:15:56] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 3/562 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 00:16:03] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/469 variables, and 563 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 73/73 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 238/276 places, 231/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60445 ms. Remains : 238/276 places, 231/271 transitions.
[2024-05-21 00:16:16] [INFO ] Flatten gal took : 6 ms
[2024-05-21 00:16:16] [INFO ] Flatten gal took : 6 ms
[2024-05-21 00:16:16] [INFO ] Input system was already deterministic with 231 transitions.
[2024-05-21 00:16:16] [INFO ] Flatten gal took : 6 ms
[2024-05-21 00:16:16] [INFO ] Flatten gal took : 6 ms
[2024-05-21 00:16:16] [INFO ] Time to serialize gal into /tmp/CTLFireability13248158191235514354.gal : 2 ms
[2024-05-21 00:16:16] [INFO ] Time to serialize properties into /tmp/CTLFireability17645043249593854714.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/CTLFireability13248158191235514354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17645043249593854714.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.43024e+17,5.71556,128744,2,52524,5,446069,6,0,1185,759782,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 00:16:46] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:16:46] [INFO ] Applying decomposition
[2024-05-21 00:16:46] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12503887028203818754.txt' '-o' '/tmp/graph12503887028203818754.bin' '-w' '/tmp/graph12503887028203818754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12503887028203818754.bin' '-l' '-1' '-v' '-w' '/tmp/graph12503887028203818754.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:16:46] [INFO ] Decomposing Gal with order
[2024-05-21 00:16:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:16:46] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-21 00:16:46] [INFO ] Flatten gal took : 9 ms
[2024-05-21 00:16:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 00:16:46] [INFO ] Time to serialize gal into /tmp/CTLFireability7509614440861520959.gal : 2 ms
[2024-05-21 00:16:46] [INFO ] Time to serialize properties into /tmp/CTLFireability1626479780479282436.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/CTLFireability7509614440861520959.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1626479780479282436.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.43024e+17,0.201605,9492,1830,17,12201,217,504,13936,40,438,0


Converting to forward existential form...Done !
original formula: AG(EF((((i11.u45.p163==0)&&(i9.u31.p108==1)) * ((AX((i0.i2.u52.p181==1)) + (i3.u10.p27==0)) * (((i18.i0.u94.p286==0)||(i14.i2.u101.p294==...209
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i11.u45.p163==0)&&(i9.u31.p108==1)) * ((!(EX(!((i0.i2.u52.p181==1)))) + (i3.u1...275
Reverse transition relation is NOT exact ! Due to transitions t87, t122, t131, t153, t168, t222, t223, t225, i0.t77, i0.t74, i0.i2.t76, i1.t104, i1.t101, i...624
(forward)formula 0,0,3.64089,127764,1,0,292715,217,2950,435569,188,438,617125
FORMULA AutoFlight-PT-03b-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 271/271 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 255 transition count 250
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 255 transition count 250
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 255 transition count 247
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 248 transition count 240
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 248 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 247 transition count 239
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 247 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 246 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 246 transition count 238
Applied a total of 63 rules in 13 ms. Remains 246 /276 variables (removed 30) and now considering 238/271 (removed 33) transitions.
// Phase 1: matrix 238 rows 246 cols
[2024-05-21 00:16:50] [INFO ] Computed 22 invariants in 2 ms
[2024-05-21 00:16:50] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 00:16:50] [INFO ] Invariant cache hit.
[2024-05-21 00:16:50] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2024-05-21 00:16:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-21 00:16:55] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 4 ms to minimize.
[2024-05-21 00:16:55] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 4 ms to minimize.
[2024-05-21 00:16:55] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 4 ms to minimize.
[2024-05-21 00:16:55] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 4 ms to minimize.
[2024-05-21 00:16:56] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 4 ms to minimize.
[2024-05-21 00:16:56] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 4 ms to minimize.
[2024-05-21 00:16:56] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 4 ms to minimize.
[2024-05-21 00:16:56] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 4 ms to minimize.
[2024-05-21 00:16:56] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 3 ms to minimize.
[2024-05-21 00:16:56] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 3 ms to minimize.
[2024-05-21 00:16:57] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2024-05-21 00:16:57] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 4 ms to minimize.
[2024-05-21 00:16:57] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 3 ms to minimize.
[2024-05-21 00:16:57] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 3 ms to minimize.
[2024-05-21 00:16:57] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 3 ms to minimize.
[2024-05-21 00:16:57] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 3 ms to minimize.
[2024-05-21 00:16:58] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 3 ms to minimize.
[2024-05-21 00:16:58] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 3 ms to minimize.
[2024-05-21 00:16:58] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 4 ms to minimize.
[2024-05-21 00:16:58] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-21 00:17:00] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-21 00:17:00] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-21 00:17:01] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-21 00:17:01] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-05-21 00:17:01] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 3 ms to minimize.
[2024-05-21 00:17:01] [INFO ] Deduced a trap composed of 54 places in 163 ms of which 3 ms to minimize.
[2024-05-21 00:17:01] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 3 ms to minimize.
[2024-05-21 00:17:01] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 3 ms to minimize.
[2024-05-21 00:17:01] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 3 ms to minimize.
[2024-05-21 00:17:02] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 3 ms to minimize.
[2024-05-21 00:17:02] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-05-21 00:17:02] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 3 ms to minimize.
[2024-05-21 00:17:02] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-21 00:17:02] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
[2024-05-21 00:17:02] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 3 ms to minimize.
[2024-05-21 00:17:02] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 3 ms to minimize.
[2024-05-21 00:17:03] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 2 ms to minimize.
[2024-05-21 00:17:03] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 2 ms to minimize.
[2024-05-21 00:17:03] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 3 ms to minimize.
[2024-05-21 00:17:03] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-21 00:17:03] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 3 ms to minimize.
[2024-05-21 00:17:04] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 3 ms to minimize.
[2024-05-21 00:17:04] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 2 ms to minimize.
[2024-05-21 00:17:04] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 2 ms to minimize.
[2024-05-21 00:17:04] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-21 00:17:06] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
[2024-05-21 00:17:07] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-21 00:17:07] [INFO ] Deduced a trap composed of 54 places in 144 ms of which 3 ms to minimize.
[2024-05-21 00:17:08] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-21 00:17:10] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 3 ms to minimize.
[2024-05-21 00:17:10] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-05-21 00:17:11] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 3 ms to minimize.
[2024-05-21 00:17:11] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 2 ms to minimize.
[2024-05-21 00:17:11] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-21 00:17:13] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-05-21 00:17:13] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 4 ms to minimize.
[2024-05-21 00:17:13] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 3 ms to minimize.
[2024-05-21 00:17:14] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 2 ms to minimize.
[2024-05-21 00:17:14] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-21 00:17:17] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 3 ms to minimize.
[2024-05-21 00:17:17] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 246/484 variables, and 83 constraints, problems are : Problem set: 0 solved, 237 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/246 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 61/83 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-21 00:17:23] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 3 ms to minimize.
[2024-05-21 00:17:24] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 3 ms to minimize.
[2024-05-21 00:17:25] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (OVERLAPS) 238/484 variables, 246/332 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 237/569 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-21 00:17:29] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-05-21 00:17:29] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-21 00:17:29] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-21 00:17:30] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 3 ms to minimize.
[2024-05-21 00:17:30] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 3 ms to minimize.
[2024-05-21 00:17:30] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 3 ms to minimize.
[2024-05-21 00:17:30] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-05-21 00:17:30] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-21 00:17:31] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 3 ms to minimize.
[2024-05-21 00:17:31] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 3 ms to minimize.
[2024-05-21 00:17:34] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 11/580 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-21 00:17:37] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
[2024-05-21 00:17:37] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-05-21 00:17:38] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 00:17:42] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 3 ms to minimize.
[2024-05-21 00:17:43] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 5/585 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-21 00:17:46] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2024-05-21 00:17:47] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/484 variables, and 587 constraints, problems are : Problem set: 0 solved, 237 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 82/82 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in LTL mode, iteration 1 : 246/276 places, 238/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60488 ms. Remains : 246/276 places, 238/271 transitions.
[2024-05-21 00:17:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 00:17:50] [INFO ] Flatten gal took : 8 ms
[2024-05-21 00:17:50] [INFO ] Input system was already deterministic with 238 transitions.
[2024-05-21 00:17:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 00:17:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 00:17:51] [INFO ] Time to serialize gal into /tmp/CTLFireability17263230412234597394.gal : 2 ms
[2024-05-21 00:17:51] [INFO ] Time to serialize properties into /tmp/CTLFireability11157530287464427969.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/CTLFireability17263230412234597394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11157530287464427969.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.64509e+17,17.1349,385576,2,87755,5,1.2099e+06,6,0,1224,2.49509e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 00:18:21] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:18:21] [INFO ] Applying decomposition
[2024-05-21 00:18:21] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16417330472762369830.txt' '-o' '/tmp/graph16417330472762369830.bin' '-w' '/tmp/graph16417330472762369830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16417330472762369830.bin' '-l' '-1' '-v' '-w' '/tmp/graph16417330472762369830.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:18:21] [INFO ] Decomposing Gal with order
[2024-05-21 00:18:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:18:21] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-21 00:18:21] [INFO ] Flatten gal took : 10 ms
[2024-05-21 00:18:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 00:18:21] [INFO ] Time to serialize gal into /tmp/CTLFireability6836757026150375552.gal : 9 ms
[2024-05-21 00:18:21] [INFO ] Time to serialize properties into /tmp/CTLFireability2581454880122958436.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/CTLFireability6836757026150375552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2581454880122958436.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.64509e+17,0.732381,22756,2522,24,40360,249,499,57289,36,615,0


Converting to forward existential form...Done !
original formula: (EG((((EX(EG((i4.u21.p64==1))) + (((A((i15.i1.u71.p214==1) U ((i4.u20.p60==1)&&(i6.u68.p208==1))) * (AF((i14.i0.u64.p198==1)) + A((i20.u1...609
=> equivalent forward existential formula: ([FwdG(Init,(((EX(EG((i4.u21.p64==1))) + (((!((E(!(((i4.u20.p60==1)&&(i6.u68.p208==1))) U (!((i15.i1.u71.p214==1...942
Reverse transition relation is NOT exact ! Due to transitions t90, t131, t138, t160, t175, t228, t229, t230, t232, i0.t95, i0.u48.t103, i1.t182, i1.t177, i...710
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 00:18:51] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:18:51] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:18:51] [INFO ] Applying decomposition
[2024-05-21 00:18:51] [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/graph9530761380832435074.txt' '-o' '/tmp/graph9530761380832435074.bin' '-w' '/tmp/graph9530761380832435074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9530761380832435074.bin' '-l' '-1' '-v' '-w' '/tmp/graph9530761380832435074.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:18:51] [INFO ] Decomposing Gal with order
[2024-05-21 00:18:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:18:51] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-21 00:18:51] [INFO ] Flatten gal took : 11 ms
[2024-05-21 00:18:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 16 ms.
[2024-05-21 00:18:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9524457294843147175.gal : 3 ms
[2024-05-21 00:18:51] [INFO ] Time to serialize properties into /tmp/CTLFireability361818656833373382.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/CTLFireability9524457294843147175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability361818656833373382.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 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,1.76924e+18,1.02737,27860,3680,28,47858,394,631,75555,54,1064,0


Converting to forward existential form...Done !
original formula: AF((EX(EX(((i11.u63.p178==0)&&(i7.i0.u41.p123==0)))) * ((i4.i0.u29.p86==1) + E(((i16.i0.u90.p259==1)||(!(((i6.u37.p109==1)&&(i1.i0.u6.p21...236
=> equivalent forward existential formula: [FwdG(Init,!((EX(EX(((i11.u63.p178==0)&&(i7.i0.u41.p123==0)))) * ((i4.i0.u29.p86==1) + E(((i16.i0.u90.p259==1)||...287
Reverse transition relation is NOT exact ! Due to transitions t91, t149, t158, t261, t262, t263, t264, t265, i0.t10, i0.u21.t9, i0.u21.t186, i1.i1.t221, i1...977
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19

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-03b"
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-03b, 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-171620167000098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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