About the Execution of ITS-Tools for EisenbergMcGuire-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13983.308 | 3600000.00 | 3963231.00 | 11799.40 | ??F????F??FF?T?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r158-smll-171636266300170.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 EisenbergMcGuire-PT-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266300170
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 16:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 16:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 753K 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 EisenbergMcGuire-PT-06-CTLFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-2024-04
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-2024-10
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-2024-11
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-2023-12
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-2023-13
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-2023-14
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716520158781
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 03:09:20] [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-24 03:09:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:09:21] [INFO ] Load time of PNML (sax parser for PT used): 472 ms
[2024-05-24 03:09:21] [INFO ] Transformed 414 places.
[2024-05-24 03:09:21] [INFO ] Transformed 1296 transitions.
[2024-05-24 03:09:21] [INFO ] Found NUPN structural information;
[2024-05-24 03:09:21] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 731 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Support contains 104 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 398 transition count 1200
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 398 transition count 1200
Applied a total of 32 rules in 176 ms. Remains 398 /414 variables (removed 16) and now considering 1200/1296 (removed 96) transitions.
[2024-05-24 03:09:22] [INFO ] Flow matrix only has 606 transitions (discarded 594 similar events)
// Phase 1: matrix 606 rows 398 cols
[2024-05-24 03:09:22] [INFO ] Computed 19 invariants in 47 ms
[2024-05-24 03:09:23] [INFO ] Implicit Places using invariants in 888 ms returned []
[2024-05-24 03:09:23] [INFO ] Flow matrix only has 606 transitions (discarded 594 similar events)
[2024-05-24 03:09:23] [INFO ] Invariant cache hit.
[2024-05-24 03:09:23] [INFO ] State equation strengthened by 234 read => feed constraints.
[2024-05-24 03:09:24] [INFO ] Implicit Places using invariants and state equation in 1680 ms returned []
Implicit Place search using SMT with State Equation took 2767 ms to find 0 implicit places.
Running 1194 sub problems to find dead transitions.
[2024-05-24 03:09:24] [INFO ] Flow matrix only has 606 transitions (discarded 594 similar events)
[2024-05-24 03:09:24] [INFO ] Invariant cache hit.
[2024-05-24 03:09:25] [INFO ] State equation strengthened by 234 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-24 03:09:39] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 29 ms to minimize.
[2024-05-24 03:09:39] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 2 ms to minimize.
[2024-05-24 03:09:39] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:09:40] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 2 ms to minimize.
[2024-05-24 03:09:40] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-24 03:09:40] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:09:40] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:09:40] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 3 ms to minimize.
[2024-05-24 03:09:40] [INFO ] Deduced a trap composed of 65 places in 212 ms of which 4 ms to minimize.
[2024-05-24 03:09:41] [INFO ] Deduced a trap composed of 61 places in 229 ms of which 3 ms to minimize.
[2024-05-24 03:09:41] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 4 ms to minimize.
[2024-05-24 03:09:41] [INFO ] Deduced a trap composed of 105 places in 203 ms of which 3 ms to minimize.
[2024-05-24 03:09:41] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:09:41] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 3 ms to minimize.
[2024-05-24 03:09:41] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:09:43] [INFO ] Deduced a trap composed of 54 places in 303 ms of which 6 ms to minimize.
[2024-05-24 03:09:43] [INFO ] Deduced a trap composed of 91 places in 286 ms of which 4 ms to minimize.
[2024-05-24 03:09:43] [INFO ] Deduced a trap composed of 112 places in 399 ms of which 7 ms to minimize.
[2024-05-24 03:09:44] [INFO ] Deduced a trap composed of 99 places in 244 ms of which 3 ms to minimize.
[2024-05-24 03:09:44] [INFO ] Deduced a trap composed of 95 places in 342 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-24 03:09:45] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:09:45] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:09:45] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 3 ms to minimize.
[2024-05-24 03:09:45] [INFO ] Deduced a trap composed of 78 places in 162 ms of which 3 ms to minimize.
[2024-05-24 03:09:46] [INFO ] Deduced a trap composed of 73 places in 244 ms of which 4 ms to minimize.
[2024-05-24 03:09:47] [INFO ] Deduced a trap composed of 78 places in 369 ms of which 6 ms to minimize.
[2024-05-24 03:09:47] [INFO ] Deduced a trap composed of 45 places in 369 ms of which 6 ms to minimize.
[2024-05-24 03:09:47] [INFO ] Deduced a trap composed of 89 places in 223 ms of which 3 ms to minimize.
[2024-05-24 03:09:48] [INFO ] Deduced a trap composed of 82 places in 327 ms of which 6 ms to minimize.
[2024-05-24 03:09:48] [INFO ] Deduced a trap composed of 71 places in 309 ms of which 5 ms to minimize.
[2024-05-24 03:09:48] [INFO ] Deduced a trap composed of 61 places in 295 ms of which 4 ms to minimize.
[2024-05-24 03:09:49] [INFO ] Deduced a trap composed of 95 places in 332 ms of which 4 ms to minimize.
[2024-05-24 03:09:49] [INFO ] Deduced a trap composed of 77 places in 296 ms of which 4 ms to minimize.
[2024-05-24 03:09:49] [INFO ] Deduced a trap composed of 61 places in 293 ms of which 3 ms to minimize.
[2024-05-24 03:09:50] [INFO ] Deduced a trap composed of 95 places in 251 ms of which 3 ms to minimize.
[2024-05-24 03:09:50] [INFO ] Deduced a trap composed of 82 places in 279 ms of which 4 ms to minimize.
[2024-05-24 03:09:50] [INFO ] Deduced a trap composed of 69 places in 218 ms of which 3 ms to minimize.
[2024-05-24 03:09:50] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 2 ms to minimize.
[2024-05-24 03:09:51] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 5 ms to minimize.
[2024-05-24 03:09:51] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 4 ms to minimize.
(s276 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.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 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/1004 variables, and 59 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/398 constraints, ReadFeed: 0/234 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-24 03:09:58] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:09:58] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:09:59] [INFO ] Deduced a trap composed of 82 places in 245 ms of which 4 ms to minimize.
[2024-05-24 03:09:59] [INFO ] Deduced a trap composed of 73 places in 210 ms of which 3 ms to minimize.
[2024-05-24 03:10:00] [INFO ] Deduced a trap composed of 67 places in 214 ms of which 3 ms to minimize.
[2024-05-24 03:10:00] [INFO ] Deduced a trap composed of 97 places in 260 ms of which 4 ms to minimize.
[2024-05-24 03:10:00] [INFO ] Deduced a trap composed of 107 places in 375 ms of which 5 ms to minimize.
[2024-05-24 03:10:01] [INFO ] Deduced a trap composed of 57 places in 367 ms of which 6 ms to minimize.
[2024-05-24 03:10:01] [INFO ] Deduced a trap composed of 78 places in 217 ms of which 3 ms to minimize.
[2024-05-24 03:10:01] [INFO ] Deduced a trap composed of 49 places in 359 ms of which 5 ms to minimize.
[2024-05-24 03:10:02] [INFO ] Deduced a trap composed of 107 places in 351 ms of which 6 ms to minimize.
[2024-05-24 03:10:02] [INFO ] Deduced a trap composed of 95 places in 331 ms of which 6 ms to minimize.
[2024-05-24 03:10:02] [INFO ] Deduced a trap composed of 89 places in 232 ms of which 3 ms to minimize.
[2024-05-24 03:10:03] [INFO ] Deduced a trap composed of 89 places in 287 ms of which 5 ms to minimize.
[2024-05-24 03:10:03] [INFO ] Deduced a trap composed of 66 places in 217 ms of which 4 ms to minimize.
[2024-05-24 03:10:03] [INFO ] Deduced a trap composed of 64 places in 287 ms of which 5 ms to minimize.
[2024-05-24 03:10:03] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 8 ms to minimize.
[2024-05-24 03:10:04] [INFO ] Deduced a trap composed of 96 places in 323 ms of which 5 ms to minimize.
[2024-05-24 03:10:04] [INFO ] Deduced a trap composed of 77 places in 427 ms of which 5 ms to minimize.
[2024-05-24 03:10:05] [INFO ] Deduced a trap composed of 81 places in 374 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-24 03:10:06] [INFO ] Deduced a trap composed of 68 places in 189 ms of which 2 ms to minimize.
[2024-05-24 03:10:06] [INFO ] Deduced a trap composed of 80 places in 183 ms of which 3 ms to minimize.
[2024-05-24 03:10:07] [INFO ] Deduced a trap composed of 47 places in 212 ms of which 4 ms to minimize.
[2024-05-24 03:10:07] [INFO ] Deduced a trap composed of 55 places in 200 ms of which 4 ms to minimize.
[2024-05-24 03:10:07] [INFO ] Deduced a trap composed of 60 places in 275 ms of which 5 ms to minimize.
[2024-05-24 03:10:07] [INFO ] Deduced a trap composed of 66 places in 220 ms of which 4 ms to minimize.
[2024-05-24 03:10:08] [INFO ] Deduced a trap composed of 47 places in 305 ms of which 5 ms to minimize.
[2024-05-24 03:10:08] [INFO ] Deduced a trap composed of 83 places in 326 ms of which 5 ms to minimize.
[2024-05-24 03:10:08] [INFO ] Deduced a trap composed of 81 places in 320 ms of which 6 ms to minimize.
[2024-05-24 03:10:09] [INFO ] Deduced a trap composed of 113 places in 216 ms of which 3 ms to minimize.
[2024-05-24 03:10:09] [INFO ] Deduced a trap composed of 87 places in 209 ms of which 3 ms to minimize.
[2024-05-24 03:10:09] [INFO ] Deduced a trap composed of 91 places in 222 ms of which 4 ms to minimize.
[2024-05-24 03:10:09] [INFO ] Deduced a trap composed of 86 places in 211 ms of which 4 ms to minimize.
[2024-05-24 03:10:10] [INFO ] Deduced a trap composed of 109 places in 150 ms of which 2 ms to minimize.
[2024-05-24 03:10:10] [INFO ] Deduced a trap composed of 99 places in 149 ms of which 3 ms to minimize.
[2024-05-24 03:10:10] [INFO ] Deduced a trap composed of 21 places in 283 ms of which 5 ms to minimize.
[2024-05-24 03:10:11] [INFO ] Deduced a trap composed of 68 places in 192 ms of which 3 ms to minimize.
[2024-05-24 03:10:11] [INFO ] Deduced a trap composed of 67 places in 148 ms of which 2 ms to minimize.
[2024-05-24 03:10:11] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 2 ms to minimize.
[2024-05-24 03:10:11] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-24 03:10:14] [INFO ] Deduced a trap composed of 52 places in 332 ms of which 4 ms to minimize.
[2024-05-24 03:10:14] [INFO ] Deduced a trap composed of 26 places in 328 ms of which 4 ms to minimize.
[2024-05-24 03:10:14] [INFO ] Deduced a trap composed of 92 places in 215 ms of which 3 ms to minimize.
[2024-05-24 03:10:15] [INFO ] Deduced a trap composed of 78 places in 217 ms of which 4 ms to minimize.
[2024-05-24 03:10:15] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:10:16] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:10:17] [INFO ] Deduced a trap composed of 78 places in 357 ms of which 4 ms to minimize.
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 74 places in 355 ms of which 4 ms to minimize.
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 79 places in 361 ms of which 4 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 82 places in 292 ms of which 3 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 95 places in 276 ms of which 3 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 76 places in 279 ms of which 4 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 49 places in 256 ms of which 4 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 44 places in 294 ms of which 4 ms to minimize.
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 122 places in 253 ms of which 4 ms to minimize.
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 4 ms to minimize.
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 90 places in 283 ms of which 4 ms to minimize.
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 93 places in 241 ms of which 4 ms to minimize.
[2024-05-24 03:10:22] [INFO ] Deduced a trap composed of 99 places in 255 ms of which 4 ms to minimize.
[2024-05-24 03:10:22] [INFO ] Deduced a trap composed of 96 places in 273 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-24 03:10:23] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 2 ms to minimize.
[2024-05-24 03:10:25] [INFO ] Deduced a trap composed of 99 places in 244 ms of which 3 ms to minimize.
[2024-05-24 03:10:25] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 3 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 398/1004 variables, and 122 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/398 constraints, ReadFeed: 0/234 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 103/103 constraints]
After SMT, in 61324ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 61405ms
Starting structural reductions in LTL mode, iteration 1 : 398/414 places, 1200/1296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64423 ms. Remains : 398/414 places, 1200/1296 transitions.
Support contains 104 out of 398 places after structural reductions.
[2024-05-24 03:10:26] [INFO ] Flatten gal took : 153 ms
[2024-05-24 03:10:26] [INFO ] Flatten gal took : 112 ms
[2024-05-24 03:10:27] [INFO ] Input system was already deterministic with 1200 transitions.
Support contains 103 out of 398 places (down from 104) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2054 ms. (19 steps per ms) remains 61/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
[2024-05-24 03:10:28] [INFO ] Flow matrix only has 606 transitions (discarded 594 similar events)
[2024-05-24 03:10:28] [INFO ] Invariant cache hit.
[2024-05-24 03:10:28] [INFO ] State equation strengthened by 234 read => feed constraints.
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp56 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 59 unsolved
Problem AtomicPropp77 is UNSAT
At refinement iteration 2 (OVERLAPS) 318/398 variables, 12/13 constraints. Problems are: Problem set: 3 solved, 58 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 6/19 constraints. Problems are: Problem set: 4 solved, 57 unsolved
[2024-05-24 03:10:29] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 2 ms to minimize.
[2024-05-24 03:10:29] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 4 ms to minimize.
[2024-05-24 03:10:29] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:10:29] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 4 ms to minimize.
[2024-05-24 03:10:29] [INFO ] Deduced a trap composed of 3 places in 243 ms of which 4 ms to minimize.
[2024-05-24 03:10:30] [INFO ] Deduced a trap composed of 17 places in 311 ms of which 4 ms to minimize.
[2024-05-24 03:10:30] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 4 ms to minimize.
[2024-05-24 03:10:30] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 4 ms to minimize.
[2024-05-24 03:10:31] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 4 ms to minimize.
[2024-05-24 03:10:31] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:10:31] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:10:31] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-05-24 03:10:31] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:10:31] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 3 ms to minimize.
[2024-05-24 03:10:31] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
Problem AtomicPropp41 is UNSAT
[2024-05-24 03:10:32] [INFO ] Deduced a trap composed of 93 places in 321 ms of which 3 ms to minimize.
[2024-05-24 03:10:32] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-24 03:10:33] [INFO ] Deduced a trap composed of 62 places in 305 ms of which 3 ms to minimize.
[2024-05-24 03:10:33] [INFO ] Deduced a trap composed of 96 places in 313 ms of which 5 ms to minimize.
[2024-05-24 03:10:33] [INFO ] Deduced a trap composed of 81 places in 212 ms of which 4 ms to minimize.
SMT process timed out in 5260ms, After SMT, problems are : Problem set: 4 solved, 57 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 74 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 398 transition count 1196
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 394 transition count 1196
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 8 place count 394 transition count 1093
Deduced a syphon composed of 103 places in 2 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 214 place count 291 transition count 1093
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 220 place count 285 transition count 1057
Iterating global reduction 2 with 6 rules applied. Total rules applied 226 place count 285 transition count 1057
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 284 place count 256 transition count 1028
Applied a total of 284 rules in 167 ms. Remains 256 /398 variables (removed 142) and now considering 1028/1200 (removed 172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 256/398 places, 1028/1200 transitions.
RANDOM walk for 40000 steps (8 resets) in 691 ms. (57 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
Interrupted probabilistic random walk after 136213 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :19 out of 54
Probabilistic random walk after 136213 steps, saw 62572 distinct states, run finished after 3006 ms. (steps per millisecond=45 ) properties seen :19
[2024-05-24 03:10:37] [INFO ] Flow matrix only has 434 transitions (discarded 594 similar events)
// Phase 1: matrix 434 rows 256 cols
[2024-05-24 03:10:37] [INFO ] Computed 19 invariants in 6 ms
[2024-05-24 03:10:37] [INFO ] State equation strengthened by 204 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 201/254 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:10:37] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 3 ms to minimize.
[2024-05-24 03:10:38] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 3 ms to minimize.
[2024-05-24 03:10:38] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 2 ms to minimize.
[2024-05-24 03:10:38] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-24 03:10:38] [INFO ] Deduced a trap composed of 64 places in 211 ms of which 3 ms to minimize.
[2024-05-24 03:10:38] [INFO ] Deduced a trap composed of 89 places in 188 ms of which 2 ms to minimize.
[2024-05-24 03:10:39] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:10:39] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:10:39] [INFO ] Deduced a trap composed of 57 places in 291 ms of which 4 ms to minimize.
[2024-05-24 03:10:39] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:10:40] [INFO ] Deduced a trap composed of 66 places in 301 ms of which 4 ms to minimize.
[2024-05-24 03:10:40] [INFO ] Deduced a trap composed of 77 places in 314 ms of which 4 ms to minimize.
[2024-05-24 03:10:40] [INFO ] Deduced a trap composed of 64 places in 309 ms of which 4 ms to minimize.
[2024-05-24 03:10:41] [INFO ] Deduced a trap composed of 54 places in 316 ms of which 4 ms to minimize.
[2024-05-24 03:10:41] [INFO ] Deduced a trap composed of 63 places in 327 ms of which 4 ms to minimize.
[2024-05-24 03:10:41] [INFO ] Deduced a trap composed of 71 places in 329 ms of which 4 ms to minimize.
[2024-05-24 03:10:42] [INFO ] Deduced a trap composed of 84 places in 318 ms of which 4 ms to minimize.
[2024-05-24 03:10:42] [INFO ] Deduced a trap composed of 58 places in 319 ms of which 4 ms to minimize.
[2024-05-24 03:10:42] [INFO ] Deduced a trap composed of 92 places in 312 ms of which 4 ms to minimize.
[2024-05-24 03:10:43] [INFO ] Deduced a trap composed of 44 places in 308 ms of which 4 ms to minimize.
[2024-05-24 03:10:43] [INFO ] Deduced a trap composed of 87 places in 309 ms of which 4 ms to minimize.
[2024-05-24 03:10:43] [INFO ] Deduced a trap composed of 44 places in 299 ms of which 4 ms to minimize.
[2024-05-24 03:10:44] [INFO ] Deduced a trap composed of 51 places in 328 ms of which 4 ms to minimize.
[2024-05-24 03:10:44] [INFO ] Deduced a trap composed of 67 places in 272 ms of which 3 ms to minimize.
[2024-05-24 03:10:44] [INFO ] Deduced a trap composed of 44 places in 273 ms of which 3 ms to minimize.
[2024-05-24 03:10:44] [INFO ] Deduced a trap composed of 56 places in 263 ms of which 3 ms to minimize.
[2024-05-24 03:10:45] [INFO ] Deduced a trap composed of 63 places in 283 ms of which 4 ms to minimize.
[2024-05-24 03:10:45] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 4 ms to minimize.
[2024-05-24 03:10:45] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 3 ms to minimize.
[2024-05-24 03:10:46] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:10:46] [INFO ] Deduced a trap composed of 72 places in 223 ms of which 3 ms to minimize.
[2024-05-24 03:10:46] [INFO ] Deduced a trap composed of 22 places in 317 ms of which 4 ms to minimize.
[2024-05-24 03:10:47] [INFO ] Deduced a trap composed of 64 places in 292 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 2/256 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:10:48] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2024-05-24 03:10:48] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:10:48] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:10:48] [INFO ] Deduced a trap composed of 59 places in 305 ms of which 4 ms to minimize.
[2024-05-24 03:10:48] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2024-05-24 03:10:49] [INFO ] Deduced a trap composed of 26 places in 251 ms of which 3 ms to minimize.
[2024-05-24 03:10:49] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:10:50] [INFO ] Deduced a trap composed of 70 places in 298 ms of which 4 ms to minimize.
[2024-05-24 03:10:50] [INFO ] Deduced a trap composed of 21 places in 319 ms of which 4 ms to minimize.
[2024-05-24 03:10:50] [INFO ] Deduced a trap composed of 11 places in 306 ms of which 4 ms to minimize.
[2024-05-24 03:10:51] [INFO ] Deduced a trap composed of 55 places in 337 ms of which 4 ms to minimize.
[2024-05-24 03:10:51] [INFO ] Deduced a trap composed of 61 places in 276 ms of which 4 ms to minimize.
[2024-05-24 03:10:51] [INFO ] Deduced a trap composed of 54 places in 281 ms of which 3 ms to minimize.
[2024-05-24 03:10:52] [INFO ] Deduced a trap composed of 18 places in 292 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:10:52] [INFO ] Deduced a trap composed of 38 places in 339 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:10:53] [INFO ] Deduced a trap composed of 70 places in 329 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:10:54] [INFO ] Deduced a trap composed of 41 places in 277 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 434/690 variables, 256/325 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/690 variables, 204/529 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/690 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 18 (OVERLAPS) 0/690 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 529 constraints, problems are : Problem set: 0 solved, 35 unsolved in 20005 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 256/256 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 201/254 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 47 places in 312 ms of which 4 ms to minimize.
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 3 ms to minimize.
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 3 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 53 places in 258 ms of which 4 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 42 places in 315 ms of which 4 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 37 places in 288 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 2/256 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 13/75 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 64 places in 316 ms of which 4 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 67 places in 286 ms of which 3 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 4 ms to minimize.
[2024-05-24 03:11:02] [INFO ] Deduced a trap composed of 73 places in 332 ms of which 4 ms to minimize.
[2024-05-24 03:11:02] [INFO ] Deduced a trap composed of 42 places in 318 ms of which 4 ms to minimize.
[2024-05-24 03:11:03] [INFO ] Deduced a trap composed of 57 places in 340 ms of which 5 ms to minimize.
[2024-05-24 03:11:03] [INFO ] Deduced a trap composed of 46 places in 312 ms of which 4 ms to minimize.
[2024-05-24 03:11:03] [INFO ] Deduced a trap composed of 66 places in 267 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 58 places in 306 ms of which 4 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 53 places in 302 ms of which 4 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 48 places in 290 ms of which 5 ms to minimize.
[2024-05-24 03:11:05] [INFO ] Deduced a trap composed of 53 places in 349 ms of which 4 ms to minimize.
[2024-05-24 03:11:05] [INFO ] Deduced a trap composed of 56 places in 332 ms of which 4 ms to minimize.
[2024-05-24 03:11:05] [INFO ] Deduced a trap composed of 42 places in 325 ms of which 5 ms to minimize.
[2024-05-24 03:11:06] [INFO ] Deduced a trap composed of 40 places in 307 ms of which 4 ms to minimize.
[2024-05-24 03:11:06] [INFO ] Deduced a trap composed of 55 places in 323 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:11:07] [INFO ] Deduced a trap composed of 76 places in 244 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:11:08] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 4 ms to minimize.
[2024-05-24 03:11:08] [INFO ] Deduced a trap composed of 60 places in 309 ms of which 4 ms to minimize.
[2024-05-24 03:11:08] [INFO ] Deduced a trap composed of 41 places in 308 ms of which 4 ms to minimize.
[2024-05-24 03:11:09] [INFO ] Deduced a trap composed of 37 places in 256 ms of which 9 ms to minimize.
[2024-05-24 03:11:09] [INFO ] Deduced a trap composed of 58 places in 221 ms of which 3 ms to minimize.
[2024-05-24 03:11:09] [INFO ] Deduced a trap composed of 61 places in 235 ms of which 3 ms to minimize.
[2024-05-24 03:11:09] [INFO ] Deduced a trap composed of 84 places in 210 ms of which 2 ms to minimize.
[2024-05-24 03:11:10] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:11:10] [INFO ] Deduced a trap composed of 56 places in 216 ms of which 3 ms to minimize.
[2024-05-24 03:11:10] [INFO ] Deduced a trap composed of 68 places in 182 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:11:11] [INFO ] Deduced a trap composed of 66 places in 272 ms of which 4 ms to minimize.
[2024-05-24 03:11:11] [INFO ] Deduced a trap composed of 62 places in 257 ms of which 4 ms to minimize.
[2024-05-24 03:11:11] [INFO ] Deduced a trap composed of 63 places in 257 ms of which 4 ms to minimize.
[2024-05-24 03:11:12] [INFO ] Deduced a trap composed of 57 places in 326 ms of which 4 ms to minimize.
[2024-05-24 03:11:12] [INFO ] Deduced a trap composed of 53 places in 301 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:11:13] [INFO ] Deduced a trap composed of 61 places in 251 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:11:14] [INFO ] Deduced a trap composed of 55 places in 271 ms of which 4 ms to minimize.
[2024-05-24 03:11:14] [INFO ] Deduced a trap composed of 51 places in 295 ms of which 3 ms to minimize.
[2024-05-24 03:11:14] [INFO ] Deduced a trap composed of 86 places in 174 ms of which 2 ms to minimize.
[2024-05-24 03:11:15] [INFO ] Deduced a trap composed of 58 places in 191 ms of which 2 ms to minimize.
[2024-05-24 03:11:15] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/256 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/256 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 17 (OVERLAPS) 434/690 variables, 256/369 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/690 variables, 204/573 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/690 variables, 35/608 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:11:17] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:11:17] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/690 variables, 2/610 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:11:19] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 3 ms to minimize.
[2024-05-24 03:11:20] [INFO ] Deduced a trap composed of 60 places in 333 ms of which 5 ms to minimize.
[2024-05-24 03:11:21] [INFO ] Deduced a trap composed of 15 places in 312 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/690 variables, 3/613 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:11:23] [INFO ] Deduced a trap composed of 44 places in 303 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/690 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:11:25] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-05-24 03:11:26] [INFO ] Deduced a trap composed of 58 places in 265 ms of which 3 ms to minimize.
[2024-05-24 03:11:26] [INFO ] Deduced a trap composed of 85 places in 301 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/690 variables, 3/617 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/690 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:11:32] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/690 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:11:35] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 4 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/690 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/690 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 28 (OVERLAPS) 0/690 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 619 constraints, problems are : Problem set: 0 solved, 35 unsolved in 44856 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 256/256 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 105/105 constraints]
After SMT, in 64918ms problems are : Problem set: 0 solved, 35 unsolved
Parikh walk visited 1 properties in 5566 ms.
Support contains 52 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 1028/1028 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 256 transition count 1017
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 245 transition count 1017
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 241 transition count 993
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 241 transition count 993
Applied a total of 30 rules in 62 ms. Remains 241 /256 variables (removed 15) and now considering 993/1028 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 241/256 places, 993/1028 transitions.
RANDOM walk for 40000 steps (8 resets) in 406 ms. (98 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
Interrupted probabilistic random walk after 161028 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 34
Probabilistic random walk after 161028 steps, saw 66419 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-24 03:11:51] [INFO ] Flow matrix only has 399 transitions (discarded 594 similar events)
// Phase 1: matrix 399 rows 241 cols
[2024-05-24 03:11:51] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 03:11:51] [INFO ] State equation strengthened by 184 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 187/239 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:11:51] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 2 ms to minimize.
[2024-05-24 03:11:51] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-05-24 03:11:52] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
[2024-05-24 03:11:52] [INFO ] Deduced a trap composed of 61 places in 186 ms of which 5 ms to minimize.
[2024-05-24 03:11:52] [INFO ] Deduced a trap composed of 81 places in 343 ms of which 4 ms to minimize.
[2024-05-24 03:11:52] [INFO ] Deduced a trap composed of 50 places in 276 ms of which 4 ms to minimize.
[2024-05-24 03:11:53] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 3 ms to minimize.
[2024-05-24 03:11:53] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
[2024-05-24 03:11:53] [INFO ] Deduced a trap composed of 61 places in 307 ms of which 4 ms to minimize.
[2024-05-24 03:11:53] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:11:54] [INFO ] Deduced a trap composed of 62 places in 231 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:11:54] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 3 ms to minimize.
[2024-05-24 03:11:55] [INFO ] Deduced a trap composed of 81 places in 260 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:11:55] [INFO ] Deduced a trap composed of 77 places in 323 ms of which 4 ms to minimize.
[2024-05-24 03:11:56] [INFO ] Deduced a trap composed of 56 places in 314 ms of which 4 ms to minimize.
[2024-05-24 03:11:56] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 2/241 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:11:57] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:11:57] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:11:57] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:11:57] [INFO ] Deduced a trap composed of 10 places in 327 ms of which 4 ms to minimize.
[2024-05-24 03:11:57] [INFO ] Deduced a trap composed of 20 places in 260 ms of which 3 ms to minimize.
[2024-05-24 03:11:58] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 3 ms to minimize.
[2024-05-24 03:11:58] [INFO ] Deduced a trap composed of 36 places in 281 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:11:58] [INFO ] Deduced a trap composed of 50 places in 252 ms of which 4 ms to minimize.
[2024-05-24 03:11:59] [INFO ] Deduced a trap composed of 47 places in 320 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:11:59] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (OVERLAPS) 399/640 variables, 241/286 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/640 variables, 184/470 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:12:01] [INFO ] Deduced a trap composed of 52 places in 330 ms of which 4 ms to minimize.
[2024-05-24 03:12:01] [INFO ] Deduced a trap composed of 45 places in 336 ms of which 5 ms to minimize.
[2024-05-24 03:12:01] [INFO ] Deduced a trap composed of 11 places in 298 ms of which 4 ms to minimize.
[2024-05-24 03:12:02] [INFO ] Deduced a trap composed of 60 places in 299 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/640 variables, 4/474 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/640 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:12:03] [INFO ] Deduced a trap composed of 62 places in 260 ms of which 4 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/640 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/640 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:12:05] [INFO ] Deduced a trap composed of 55 places in 311 ms of which 4 ms to minimize.
[2024-05-24 03:12:05] [INFO ] Deduced a trap composed of 56 places in 302 ms of which 4 ms to minimize.
[2024-05-24 03:12:05] [INFO ] Deduced a trap composed of 55 places in 306 ms of which 3 ms to minimize.
[2024-05-24 03:12:06] [INFO ] Deduced a trap composed of 48 places in 299 ms of which 4 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/640 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/640 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 22 (OVERLAPS) 0/640 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 640/640 variables, and 479 constraints, problems are : Problem set: 0 solved, 34 unsolved in 16646 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 241/241 constraints, ReadFeed: 184/184 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 187/239 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:12:08] [INFO ] Deduced a trap composed of 45 places in 244 ms of which 4 ms to minimize.
[2024-05-24 03:12:08] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 3 ms to minimize.
[2024-05-24 03:12:09] [INFO ] Deduced a trap composed of 51 places in 276 ms of which 4 ms to minimize.
[2024-05-24 03:12:09] [INFO ] Deduced a trap composed of 21 places in 282 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:12:10] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 3 ms to minimize.
[2024-05-24 03:12:10] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:12:11] [INFO ] Deduced a trap composed of 50 places in 329 ms of which 4 ms to minimize.
[2024-05-24 03:12:11] [INFO ] Deduced a trap composed of 48 places in 313 ms of which 4 ms to minimize.
[2024-05-24 03:12:11] [INFO ] Deduced a trap composed of 53 places in 306 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 2/241 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:12:12] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:12:13] [INFO ] Deduced a trap composed of 52 places in 271 ms of which 3 ms to minimize.
[2024-05-24 03:12:13] [INFO ] Deduced a trap composed of 56 places in 289 ms of which 4 ms to minimize.
[2024-05-24 03:12:14] [INFO ] Deduced a trap composed of 76 places in 336 ms of which 4 ms to minimize.
[2024-05-24 03:12:14] [INFO ] Deduced a trap composed of 49 places in 321 ms of which 4 ms to minimize.
[2024-05-24 03:12:14] [INFO ] Deduced a trap composed of 59 places in 307 ms of which 4 ms to minimize.
[2024-05-24 03:12:15] [INFO ] Deduced a trap composed of 53 places in 321 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:12:15] [INFO ] Deduced a trap composed of 60 places in 257 ms of which 3 ms to minimize.
[2024-05-24 03:12:15] [INFO ] Deduced a trap composed of 57 places in 303 ms of which 4 ms to minimize.
[2024-05-24 03:12:16] [INFO ] Deduced a trap composed of 42 places in 284 ms of which 4 ms to minimize.
[2024-05-24 03:12:16] [INFO ] Deduced a trap composed of 58 places in 274 ms of which 4 ms to minimize.
[2024-05-24 03:12:17] [INFO ] Deduced a trap composed of 42 places in 329 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:12:17] [INFO ] Deduced a trap composed of 47 places in 300 ms of which 4 ms to minimize.
[2024-05-24 03:12:17] [INFO ] Deduced a trap composed of 45 places in 309 ms of which 4 ms to minimize.
[2024-05-24 03:12:18] [INFO ] Deduced a trap composed of 44 places in 286 ms of which 4 ms to minimize.
[2024-05-24 03:12:18] [INFO ] Deduced a trap composed of 35 places in 310 ms of which 4 ms to minimize.
[2024-05-24 03:12:18] [INFO ] Deduced a trap composed of 78 places in 245 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:12:19] [INFO ] Deduced a trap composed of 46 places in 292 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:12:20] [INFO ] Deduced a trap composed of 54 places in 293 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/241 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:12:21] [INFO ] Deduced a trap composed of 38 places in 318 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/241 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:12:22] [INFO ] Deduced a trap composed of 49 places in 305 ms of which 4 ms to minimize.
[2024-05-24 03:12:22] [INFO ] Deduced a trap composed of 40 places in 288 ms of which 3 ms to minimize.
[2024-05-24 03:12:23] [INFO ] Deduced a trap composed of 59 places in 336 ms of which 4 ms to minimize.
[2024-05-24 03:12:23] [INFO ] Deduced a trap composed of 49 places in 300 ms of which 3 ms to minimize.
[2024-05-24 03:12:23] [INFO ] Deduced a trap composed of 50 places in 303 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/241 variables, 5/88 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:12:24] [INFO ] Deduced a trap composed of 36 places in 279 ms of which 4 ms to minimize.
[2024-05-24 03:12:24] [INFO ] Deduced a trap composed of 57 places in 295 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/241 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/241 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 20 (OVERLAPS) 399/640 variables, 241/331 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/640 variables, 184/515 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/640 variables, 34/549 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:12:27] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/640 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:12:29] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/640 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/640 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 03:12:33] [INFO ] Deduced a trap composed of 54 places in 300 ms of which 4 ms to minimize.
[2024-05-24 03:12:33] [INFO ] Deduced a trap composed of 61 places in 261 ms of which 4 ms to minimize.
[2024-05-24 03:12:34] [INFO ] Deduced a trap composed of 63 places in 264 ms of which 4 ms to minimize.
[2024-05-24 03:12:35] [INFO ] Deduced a trap composed of 39 places in 310 ms of which 4 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/640 variables, 4/555 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/640 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 28 (OVERLAPS) 0/640 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 640/640 variables, and 555 constraints, problems are : Problem set: 0 solved, 34 unsolved in 33833 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 241/241 constraints, ReadFeed: 184/184 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 77/77 constraints]
After SMT, in 50539ms problems are : Problem set: 0 solved, 34 unsolved
Parikh walk visited 1 properties in 5278 ms.
Support contains 50 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 993/993 transitions.
Applied a total of 0 rules in 41 ms. Remains 241 /241 variables (removed 0) and now considering 993/993 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 241/241 places, 993/993 transitions.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA EisenbergMcGuire-PT-06-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:12:47] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-24 03:12:47] [INFO ] Flatten gal took : 65 ms
[2024-05-24 03:12:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA EisenbergMcGuire-PT-06-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:12:47] [INFO ] Flatten gal took : 59 ms
[2024-05-24 03:12:47] [INFO ] Input system was already deterministic with 1200 transitions.
Support contains 88 out of 398 places (down from 95) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 385 transition count 1122
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 385 transition count 1122
Applied a total of 26 rules in 31 ms. Remains 385 /398 variables (removed 13) and now considering 1122/1200 (removed 78) transitions.
[2024-05-24 03:12:47] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
// Phase 1: matrix 528 rows 385 cols
[2024-05-24 03:12:47] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 03:12:47] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-24 03:12:47] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-05-24 03:12:47] [INFO ] Invariant cache hit.
[2024-05-24 03:12:48] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-24 03:12:49] [INFO ] Implicit Places using invariants and state equation in 1651 ms returned []
Implicit Place search using SMT with State Equation took 1991 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-05-24 03:12:49] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-05-24 03:12:49] [INFO ] Invariant cache hit.
[2024-05-24 03:12:49] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-24 03:13:03] [INFO ] Deduced a trap composed of 43 places in 269 ms of which 4 ms to minimize.
[2024-05-24 03:13:03] [INFO ] Deduced a trap composed of 54 places in 204 ms of which 3 ms to minimize.
[2024-05-24 03:13:04] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 3 ms to minimize.
[2024-05-24 03:13:04] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 4 ms to minimize.
[2024-05-24 03:13:04] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 3 ms to minimize.
[2024-05-24 03:13:04] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 3 ms to minimize.
[2024-05-24 03:13:04] [INFO ] Deduced a trap composed of 36 places in 284 ms of which 5 ms to minimize.
[2024-05-24 03:13:05] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 3 ms to minimize.
[2024-05-24 03:13:05] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 3 ms to minimize.
[2024-05-24 03:13:05] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 3 ms to minimize.
[2024-05-24 03:13:05] [INFO ] Deduced a trap composed of 59 places in 300 ms of which 5 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:13:07] [INFO ] Deduced a trap composed of 52 places in 287 ms of which 4 ms to minimize.
[2024-05-24 03:13:07] [INFO ] Deduced a trap composed of 77 places in 266 ms of which 3 ms to minimize.
[2024-05-24 03:13:08] [INFO ] Deduced a trap composed of 110 places in 269 ms of which 4 ms to minimize.
[2024-05-24 03:13:08] [INFO ] Deduced a trap composed of 99 places in 232 ms of which 3 ms to minimize.
[2024-05-24 03:13:08] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 3 ms to minimize.
[2024-05-24 03:13:08] [INFO ] Deduced a trap composed of 66 places in 176 ms of which 3 ms to minimize.
[2024-05-24 03:13:09] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 4 ms to minimize.
[2024-05-24 03:13:09] [INFO ] Deduced a trap composed of 92 places in 207 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-24 03:13:10] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:13:10] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-05-24 03:13:10] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 3 ms to minimize.
[2024-05-24 03:13:10] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 4 ms to minimize.
[2024-05-24 03:13:10] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:13:10] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:13:11] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
[2024-05-24 03:13:11] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-24 03:13:11] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 3 ms to minimize.
[2024-05-24 03:13:12] [INFO ] Deduced a trap composed of 97 places in 386 ms of which 5 ms to minimize.
[2024-05-24 03:13:12] [INFO ] Deduced a trap composed of 108 places in 353 ms of which 4 ms to minimize.
[2024-05-24 03:13:13] [INFO ] Deduced a trap composed of 93 places in 447 ms of which 6 ms to minimize.
[2024-05-24 03:13:13] [INFO ] Deduced a trap composed of 97 places in 465 ms of which 6 ms to minimize.
[2024-05-24 03:13:14] [INFO ] Deduced a trap composed of 95 places in 379 ms of which 6 ms to minimize.
[2024-05-24 03:13:14] [INFO ] Deduced a trap composed of 88 places in 375 ms of which 6 ms to minimize.
[2024-05-24 03:13:15] [INFO ] Deduced a trap composed of 88 places in 309 ms of which 4 ms to minimize.
[2024-05-24 03:13:15] [INFO ] Deduced a trap composed of 88 places in 378 ms of which 6 ms to minimize.
[2024-05-24 03:13:15] [INFO ] Deduced a trap composed of 94 places in 323 ms of which 3 ms to minimize.
[2024-05-24 03:13:16] [INFO ] Deduced a trap composed of 84 places in 277 ms of which 3 ms to minimize.
[2024-05-24 03:13:16] [INFO ] Deduced a trap composed of 92 places in 302 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 385/913 variables, and 59 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/385 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 1116/1116 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-24 03:13:22] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:13:23] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:13:23] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:13:23] [INFO ] Deduced a trap composed of 77 places in 184 ms of which 3 ms to minimize.
[2024-05-24 03:13:24] [INFO ] Deduced a trap composed of 89 places in 320 ms of which 5 ms to minimize.
[2024-05-24 03:13:25] [INFO ] Deduced a trap composed of 87 places in 286 ms of which 5 ms to minimize.
[2024-05-24 03:13:25] [INFO ] Deduced a trap composed of 108 places in 275 ms of which 4 ms to minimize.
[2024-05-24 03:13:25] [INFO ] Deduced a trap composed of 91 places in 179 ms of which 3 ms to minimize.
[2024-05-24 03:13:25] [INFO ] Deduced a trap composed of 81 places in 222 ms of which 4 ms to minimize.
[2024-05-24 03:13:26] [INFO ] Deduced a trap composed of 82 places in 286 ms of which 5 ms to minimize.
[2024-05-24 03:13:26] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 3 ms to minimize.
[2024-05-24 03:13:27] [INFO ] Deduced a trap composed of 104 places in 249 ms of which 3 ms to minimize.
[2024-05-24 03:13:27] [INFO ] Deduced a trap composed of 80 places in 229 ms of which 3 ms to minimize.
[2024-05-24 03:13:27] [INFO ] Deduced a trap composed of 82 places in 312 ms of which 4 ms to minimize.
[2024-05-24 03:13:28] [INFO ] Deduced a trap composed of 78 places in 303 ms of which 3 ms to minimize.
[2024-05-24 03:13:28] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:13:28] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:13:29] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 3 ms to minimize.
[2024-05-24 03:13:29] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 2 ms to minimize.
[2024-05-24 03:13:29] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-24 03:13:30] [INFO ] Deduced a trap composed of 96 places in 220 ms of which 4 ms to minimize.
[2024-05-24 03:13:31] [INFO ] Deduced a trap composed of 58 places in 337 ms of which 5 ms to minimize.
[2024-05-24 03:13:31] [INFO ] Deduced a trap composed of 47 places in 344 ms of which 5 ms to minimize.
[2024-05-24 03:13:32] [INFO ] Deduced a trap composed of 81 places in 347 ms of which 5 ms to minimize.
[2024-05-24 03:13:32] [INFO ] Deduced a trap composed of 80 places in 334 ms of which 4 ms to minimize.
[2024-05-24 03:13:32] [INFO ] Deduced a trap composed of 85 places in 260 ms of which 3 ms to minimize.
[2024-05-24 03:13:33] [INFO ] Deduced a trap composed of 43 places in 251 ms of which 4 ms to minimize.
[2024-05-24 03:13:33] [INFO ] Deduced a trap composed of 69 places in 205 ms of which 3 ms to minimize.
[2024-05-24 03:13:33] [INFO ] Deduced a trap composed of 68 places in 207 ms of which 3 ms to minimize.
[2024-05-24 03:13:33] [INFO ] Deduced a trap composed of 55 places in 201 ms of which 3 ms to minimize.
[2024-05-24 03:13:34] [INFO ] Deduced a trap composed of 67 places in 205 ms of which 3 ms to minimize.
[2024-05-24 03:13:34] [INFO ] Deduced a trap composed of 50 places in 215 ms of which 3 ms to minimize.
[2024-05-24 03:13:34] [INFO ] Deduced a trap composed of 60 places in 198 ms of which 3 ms to minimize.
[2024-05-24 03:13:34] [INFO ] Deduced a trap composed of 62 places in 231 ms of which 4 ms to minimize.
[2024-05-24 03:13:35] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 3 ms to minimize.
[2024-05-24 03:13:35] [INFO ] Deduced a trap composed of 105 places in 368 ms of which 6 ms to minimize.
[2024-05-24 03:13:35] [INFO ] Deduced a trap composed of 85 places in 353 ms of which 5 ms to minimize.
[2024-05-24 03:13:35] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:13:36] [INFO ] Deduced a trap composed of 51 places in 220 ms of which 3 ms to minimize.
[2024-05-24 03:13:36] [INFO ] Deduced a trap composed of 85 places in 242 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-24 03:13:38] [INFO ] Deduced a trap composed of 85 places in 306 ms of which 5 ms to minimize.
[2024-05-24 03:13:39] [INFO ] Deduced a trap composed of 88 places in 196 ms of which 5 ms to minimize.
[2024-05-24 03:13:39] [INFO ] Deduced a trap composed of 59 places in 372 ms of which 5 ms to minimize.
[2024-05-24 03:13:39] [INFO ] Deduced a trap composed of 73 places in 354 ms of which 6 ms to minimize.
[2024-05-24 03:13:41] [INFO ] Deduced a trap composed of 100 places in 286 ms of which 3 ms to minimize.
[2024-05-24 03:13:41] [INFO ] Deduced a trap composed of 88 places in 279 ms of which 4 ms to minimize.
[2024-05-24 03:13:42] [INFO ] Deduced a trap composed of 106 places in 286 ms of which 4 ms to minimize.
[2024-05-24 03:13:44] [INFO ] Deduced a trap composed of 76 places in 466 ms of which 6 ms to minimize.
[2024-05-24 03:13:45] [INFO ] Deduced a trap composed of 29 places in 447 ms of which 6 ms to minimize.
[2024-05-24 03:13:50] [INFO ] Deduced a trap composed of 14 places in 433 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/913 variables, and 109 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/385 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 0/1116 constraints, Known Traps: 90/90 constraints]
After SMT, in 60802ms problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 60828ms
Starting structural reductions in LTL mode, iteration 1 : 385/398 places, 1122/1200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62859 ms. Remains : 385/398 places, 1122/1200 transitions.
[2024-05-24 03:13:50] [INFO ] Flatten gal took : 73 ms
[2024-05-24 03:13:50] [INFO ] Flatten gal took : 77 ms
[2024-05-24 03:13:50] [INFO ] Input system was already deterministic with 1122 transitions.
[2024-05-24 03:13:50] [INFO ] Flatten gal took : 67 ms
[2024-05-24 03:13:50] [INFO ] Flatten gal took : 67 ms
[2024-05-24 03:13:50] [INFO ] Time to serialize gal into /tmp/CTLFireability5721549586078703397.gal : 52 ms
[2024-05-24 03:13:50] [INFO ] Time to serialize properties into /tmp/CTLFireability15432885006532835728.ctl : 5 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/CTLFireability5721549586078703397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15432885006532835728.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 03:14:21] [INFO ] Flatten gal took : 59 ms
[2024-05-24 03:14:21] [INFO ] Applying decomposition
[2024-05-24 03:14:21] [INFO ] Flatten gal took : 57 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/graph7011183307765041494.txt' '-o' '/tmp/graph7011183307765041494.bin' '-w' '/tmp/graph7011183307765041494.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7011183307765041494.bin' '-l' '-1' '-v' '-w' '/tmp/graph7011183307765041494.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:14:21] [INFO ] Decomposing Gal with order
[2024-05-24 03:14:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:14:22] [INFO ] Removed a total of 1914 redundant transitions.
[2024-05-24 03:14:22] [INFO ] Flatten gal took : 435 ms
[2024-05-24 03:14:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 386 labels/synchronizations in 101 ms.
[2024-05-24 03:14:22] [INFO ] Time to serialize gal into /tmp/CTLFireability293368434372271848.gal : 25 ms
[2024-05-24 03:14:22] [INFO ] Time to serialize properties into /tmp/CTLFireability16837274259421760161.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/CTLFireability293368434372271848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16837274259421760161.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 385 transition count 1122
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 385 transition count 1122
Applied a total of 26 rules in 24 ms. Remains 385 /398 variables (removed 13) and now considering 1122/1200 (removed 78) transitions.
[2024-05-24 03:14:52] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
// Phase 1: matrix 528 rows 385 cols
[2024-05-24 03:14:52] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 03:14:52] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-24 03:14:52] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-05-24 03:14:52] [INFO ] Invariant cache hit.
[2024-05-24 03:14:53] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-24 03:14:54] [INFO ] Implicit Places using invariants and state equation in 1551 ms returned []
Implicit Place search using SMT with State Equation took 1986 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-05-24 03:14:54] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-05-24 03:14:54] [INFO ] Invariant cache hit.
[2024-05-24 03:14:54] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-24 03:15:06] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 7 ms to minimize.
[2024-05-24 03:15:06] [INFO ] Deduced a trap composed of 43 places in 261 ms of which 5 ms to minimize.
[2024-05-24 03:15:06] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 3 ms to minimize.
[2024-05-24 03:15:06] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 3 ms to minimize.
[2024-05-24 03:15:07] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 3 ms to minimize.
[2024-05-24 03:15:07] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:15:07] [INFO ] Deduced a trap composed of 59 places in 167 ms of which 2 ms to minimize.
[2024-05-24 03:15:07] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:15:07] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:15:08] [INFO ] Deduced a trap composed of 52 places in 275 ms of which 4 ms to minimize.
[2024-05-24 03:15:08] [INFO ] Deduced a trap composed of 71 places in 256 ms of which 3 ms to minimize.
[2024-05-24 03:15:09] [INFO ] Deduced a trap composed of 112 places in 270 ms of which 3 ms to minimize.
[2024-05-24 03:15:09] [INFO ] Deduced a trap composed of 89 places in 269 ms of which 4 ms to minimize.
[2024-05-24 03:15:09] [INFO ] Deduced a trap composed of 94 places in 232 ms of which 3 ms to minimize.
[2024-05-24 03:15:09] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:15:09] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:15:10] [INFO ] Deduced a trap composed of 93 places in 219 ms of which 3 ms to minimize.
[2024-05-24 03:15:10] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 3 ms to minimize.
[2024-05-24 03:15:10] [INFO ] Deduced a trap composed of 88 places in 195 ms of which 3 ms to minimize.
[2024-05-24 03:15:10] [INFO ] Deduced a trap composed of 83 places in 224 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-24 03:15:11] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:15:11] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:15:11] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 3 ms to minimize.
[2024-05-24 03:15:11] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:15:11] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:15:11] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-05-24 03:15:12] [INFO ] Deduced a trap composed of 57 places in 228 ms of which 3 ms to minimize.
[2024-05-24 03:15:13] [INFO ] Deduced a trap composed of 76 places in 213 ms of which 3 ms to minimize.
[2024-05-24 03:15:13] [INFO ] Deduced a trap composed of 94 places in 247 ms of which 4 ms to minimize.
[2024-05-24 03:15:13] [INFO ] Deduced a trap composed of 108 places in 243 ms of which 4 ms to minimize.
[2024-05-24 03:15:13] [INFO ] Deduced a trap composed of 88 places in 198 ms of which 3 ms to minimize.
[2024-05-24 03:15:14] [INFO ] Deduced a trap composed of 95 places in 244 ms of which 4 ms to minimize.
[2024-05-24 03:15:14] [INFO ] Deduced a trap composed of 81 places in 200 ms of which 3 ms to minimize.
[2024-05-24 03:15:14] [INFO ] Deduced a trap composed of 86 places in 245 ms of which 3 ms to minimize.
[2024-05-24 03:15:14] [INFO ] Deduced a trap composed of 85 places in 201 ms of which 3 ms to minimize.
[2024-05-24 03:15:14] [INFO ] Deduced a trap composed of 78 places in 192 ms of which 3 ms to minimize.
[2024-05-24 03:15:15] [INFO ] Deduced a trap composed of 88 places in 225 ms of which 4 ms to minimize.
[2024-05-24 03:15:15] [INFO ] Deduced a trap composed of 89 places in 178 ms of which 3 ms to minimize.
[2024-05-24 03:15:15] [INFO ] Deduced a trap composed of 83 places in 207 ms of which 3 ms to minimize.
[2024-05-24 03:15:15] [INFO ] Deduced a trap composed of 80 places in 197 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 385/913 variables, and 59 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/385 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 1116/1116 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-24 03:15:26] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:15:26] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:15:26] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:15:28] [INFO ] Deduced a trap composed of 88 places in 250 ms of which 4 ms to minimize.
[2024-05-24 03:15:28] [INFO ] Deduced a trap composed of 111 places in 240 ms of which 4 ms to minimize.
[2024-05-24 03:15:28] [INFO ] Deduced a trap composed of 56 places in 240 ms of which 4 ms to minimize.
[2024-05-24 03:15:28] [INFO ] Deduced a trap composed of 69 places in 233 ms of which 3 ms to minimize.
[2024-05-24 03:15:29] [INFO ] Deduced a trap composed of 78 places in 252 ms of which 3 ms to minimize.
[2024-05-24 03:15:29] [INFO ] Deduced a trap composed of 107 places in 251 ms of which 3 ms to minimize.
[2024-05-24 03:15:29] [INFO ] Deduced a trap composed of 75 places in 266 ms of which 6 ms to minimize.
[2024-05-24 03:15:29] [INFO ] Deduced a trap composed of 104 places in 250 ms of which 5 ms to minimize.
[2024-05-24 03:15:30] [INFO ] Deduced a trap composed of 80 places in 319 ms of which 6 ms to minimize.
[2024-05-24 03:15:30] [INFO ] Deduced a trap composed of 97 places in 371 ms of which 6 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 80 places in 362 ms of which 5 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 90 places in 296 ms of which 4 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 84 places in 302 ms of which 5 ms to minimize.
[2024-05-24 03:15:32] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:15:32] [INFO ] Deduced a trap composed of 86 places in 291 ms of which 4 ms to minimize.
[2024-05-24 03:15:33] [INFO ] Deduced a trap composed of 89 places in 321 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-24 03:15:33] [INFO ] Deduced a trap composed of 96 places in 172 ms of which 4 ms to minimize.
[2024-05-24 03:15:34] [INFO ] Deduced a trap composed of 82 places in 164 ms of which 2 ms to minimize.
[2024-05-24 03:15:35] [INFO ] Deduced a trap composed of 55 places in 323 ms of which 5 ms to minimize.
[2024-05-24 03:15:35] [INFO ] Deduced a trap composed of 55 places in 230 ms of which 4 ms to minimize.
[2024-05-24 03:15:35] [INFO ] Deduced a trap composed of 60 places in 198 ms of which 3 ms to minimize.
[2024-05-24 03:15:35] [INFO ] Deduced a trap composed of 79 places in 198 ms of which 3 ms to minimize.
[2024-05-24 03:15:36] [INFO ] Deduced a trap composed of 88 places in 290 ms of which 5 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 61 places in 292 ms of which 5 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 3 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 3 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 3 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:15:38] [INFO ] Deduced a trap composed of 77 places in 242 ms of which 3 ms to minimize.
[2024-05-24 03:15:39] [INFO ] Deduced a trap composed of 56 places in 245 ms of which 3 ms to minimize.
[2024-05-24 03:15:39] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 4 ms to minimize.
[2024-05-24 03:15:39] [INFO ] Deduced a trap composed of 88 places in 335 ms of which 5 ms to minimize.
[2024-05-24 03:15:39] [INFO ] Deduced a trap composed of 58 places in 338 ms of which 6 ms to minimize.
[2024-05-24 03:15:40] [INFO ] Deduced a trap composed of 102 places in 223 ms of which 4 ms to minimize.
[2024-05-24 03:15:40] [INFO ] Deduced a trap composed of 38 places in 242 ms of which 4 ms to minimize.
[2024-05-24 03:15:40] [INFO ] Deduced a trap composed of 39 places in 334 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-24 03:15:42] [INFO ] Deduced a trap composed of 73 places in 185 ms of which 3 ms to minimize.
[2024-05-24 03:15:42] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 3 ms to minimize.
[2024-05-24 03:15:44] [INFO ] Deduced a trap composed of 84 places in 250 ms of which 4 ms to minimize.
[2024-05-24 03:15:44] [INFO ] Deduced a trap composed of 81 places in 224 ms of which 3 ms to minimize.
[2024-05-24 03:15:45] [INFO ] Deduced a trap composed of 73 places in 231 ms of which 3 ms to minimize.
[2024-05-24 03:15:45] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/913 variables, and 105 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/385 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 0/1116 constraints, Known Traps: 86/86 constraints]
After SMT, in 60611ms problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 60628ms
Starting structural reductions in LTL mode, iteration 1 : 385/398 places, 1122/1200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62655 ms. Remains : 385/398 places, 1122/1200 transitions.
[2024-05-24 03:15:55] [INFO ] Flatten gal took : 49 ms
[2024-05-24 03:15:55] [INFO ] Flatten gal took : 54 ms
[2024-05-24 03:15:55] [INFO ] Input system was already deterministic with 1122 transitions.
[2024-05-24 03:15:55] [INFO ] Flatten gal took : 52 ms
[2024-05-24 03:15:55] [INFO ] Flatten gal took : 53 ms
[2024-05-24 03:15:55] [INFO ] Time to serialize gal into /tmp/CTLFireability8676820190699768544.gal : 9 ms
[2024-05-24 03:15:55] [INFO ] Time to serialize properties into /tmp/CTLFireability732987007964263821.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/CTLFireability8676820190699768544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability732987007964263821.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.
Detected timeout of ITS tools.
[2024-05-24 03:16:25] [INFO ] Flatten gal took : 32 ms
[2024-05-24 03:16:25] [INFO ] Applying decomposition
[2024-05-24 03:16:25] [INFO ] Flatten gal took : 33 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/graph4265270772272621275.txt' '-o' '/tmp/graph4265270772272621275.bin' '-w' '/tmp/graph4265270772272621275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4265270772272621275.bin' '-l' '-1' '-v' '-w' '/tmp/graph4265270772272621275.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:16:25] [INFO ] Decomposing Gal with order
[2024-05-24 03:16:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:16:26] [INFO ] Removed a total of 1851 redundant transitions.
[2024-05-24 03:16:26] [INFO ] Flatten gal took : 154 ms
[2024-05-24 03:16:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 385 labels/synchronizations in 38 ms.
[2024-05-24 03:16:26] [INFO ] Time to serialize gal into /tmp/CTLFireability5508218251751424339.gal : 14 ms
[2024-05-24 03:16:26] [INFO ] Time to serialize properties into /tmp/CTLFireability3203345512791100146.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/CTLFireability5508218251751424339.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3203345512791100146.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 384 transition count 1116
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 384 transition count 1116
Applied a total of 28 rules in 27 ms. Remains 384 /398 variables (removed 14) and now considering 1116/1200 (removed 84) transitions.
[2024-05-24 03:16:56] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 03:16:56] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 03:16:56] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-05-24 03:16:56] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 03:16:56] [INFO ] Invariant cache hit.
[2024-05-24 03:16:57] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 03:16:58] [INFO ] Implicit Places using invariants and state equation in 2150 ms returned []
Implicit Place search using SMT with State Equation took 2628 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-05-24 03:16:58] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 03:16:58] [INFO ] Invariant cache hit.
[2024-05-24 03:16:58] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 03:17:15] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 4 ms to minimize.
[2024-05-24 03:17:15] [INFO ] Deduced a trap composed of 34 places in 267 ms of which 4 ms to minimize.
[2024-05-24 03:17:15] [INFO ] Deduced a trap composed of 29 places in 301 ms of which 4 ms to minimize.
[2024-05-24 03:17:15] [INFO ] Deduced a trap composed of 32 places in 313 ms of which 5 ms to minimize.
[2024-05-24 03:17:16] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 3 ms to minimize.
[2024-05-24 03:17:16] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 3 ms to minimize.
[2024-05-24 03:17:16] [INFO ] Deduced a trap composed of 35 places in 207 ms of which 3 ms to minimize.
[2024-05-24 03:17:16] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 3 ms to minimize.
[2024-05-24 03:17:17] [INFO ] Deduced a trap composed of 23 places in 352 ms of which 5 ms to minimize.
[2024-05-24 03:17:17] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 2 ms to minimize.
[2024-05-24 03:17:17] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 2 ms to minimize.
[2024-05-24 03:17:17] [INFO ] Deduced a trap composed of 96 places in 287 ms of which 5 ms to minimize.
[2024-05-24 03:17:18] [INFO ] Deduced a trap composed of 29 places in 287 ms of which 5 ms to minimize.
[2024-05-24 03:17:18] [INFO ] Deduced a trap composed of 58 places in 285 ms of which 5 ms to minimize.
[2024-05-24 03:17:20] [INFO ] Deduced a trap composed of 54 places in 463 ms of which 6 ms to minimize.
[2024-05-24 03:17:20] [INFO ] Deduced a trap composed of 80 places in 429 ms of which 6 ms to minimize.
[2024-05-24 03:17:21] [INFO ] Deduced a trap composed of 72 places in 427 ms of which 6 ms to minimize.
[2024-05-24 03:17:21] [INFO ] Deduced a trap composed of 78 places in 431 ms of which 6 ms to minimize.
[2024-05-24 03:17:22] [INFO ] Deduced a trap composed of 74 places in 288 ms of which 4 ms to minimize.
[2024-05-24 03:17:22] [INFO ] Deduced a trap composed of 50 places in 308 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 03:17:23] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 3 ms to minimize.
[2024-05-24 03:17:23] [INFO ] Deduced a trap composed of 74 places in 268 ms of which 4 ms to minimize.
[2024-05-24 03:17:25] [INFO ] Deduced a trap composed of 89 places in 286 ms of which 3 ms to minimize.
[2024-05-24 03:17:25] [INFO ] Deduced a trap composed of 76 places in 270 ms of which 4 ms to minimize.
[2024-05-24 03:17:25] [INFO ] Deduced a trap composed of 86 places in 332 ms of which 5 ms to minimize.
[2024-05-24 03:17:26] [INFO ] Deduced a trap composed of 75 places in 322 ms of which 4 ms to minimize.
[2024-05-24 03:17:26] [INFO ] Deduced a trap composed of 76 places in 332 ms of which 4 ms to minimize.
[2024-05-24 03:17:27] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 5 ms to minimize.
[2024-05-24 03:17:27] [INFO ] Deduced a trap composed of 3 places in 420 ms of which 6 ms to minimize.
[2024-05-24 03:17:27] [INFO ] Deduced a trap composed of 86 places in 356 ms of which 5 ms to minimize.
[2024-05-24 03:17:28] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 7 ms to minimize.
[2024-05-24 03:17:28] [INFO ] Deduced a trap composed of 86 places in 342 ms of which 5 ms to minimize.
[2024-05-24 03:17:28] [INFO ] Deduced a trap composed of 86 places in 315 ms of which 4 ms to minimize.
[2024-05-24 03:17:29] [INFO ] Deduced a trap composed of 102 places in 409 ms of which 5 ms to minimize.
[2024-05-24 03:17:29] [INFO ] Deduced a trap composed of 72 places in 410 ms of which 6 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 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.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 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 54 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 03:17:32] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:17:32] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-05-24 03:17:32] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 4 ms to minimize.
[2024-05-24 03:17:33] [INFO ] Deduced a trap composed of 59 places in 286 ms of which 4 ms to minimize.
[2024-05-24 03:17:33] [INFO ] Deduced a trap composed of 95 places in 243 ms of which 4 ms to minimize.
[2024-05-24 03:17:34] [INFO ] Deduced a trap composed of 83 places in 313 ms of which 4 ms to minimize.
[2024-05-24 03:17:35] [INFO ] Deduced a trap composed of 86 places in 301 ms of which 5 ms to minimize.
[2024-05-24 03:17:35] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-24 03:17:35] [INFO ] Deduced a trap composed of 72 places in 313 ms of which 4 ms to minimize.
[2024-05-24 03:17:36] [INFO ] Deduced a trap composed of 60 places in 339 ms of which 5 ms to minimize.
[2024-05-24 03:17:36] [INFO ] Deduced a trap composed of 89 places in 332 ms of which 5 ms to minimize.
[2024-05-24 03:17:37] [INFO ] Deduced a trap composed of 105 places in 349 ms of which 5 ms to minimize.
[2024-05-24 03:17:37] [INFO ] Deduced a trap composed of 43 places in 392 ms of which 5 ms to minimize.
[2024-05-24 03:17:37] [INFO ] Deduced a trap composed of 68 places in 383 ms of which 5 ms to minimize.
[2024-05-24 03:17:38] [INFO ] Deduced a trap composed of 94 places in 300 ms of which 5 ms to minimize.
[2024-05-24 03:17:38] [INFO ] Deduced a trap composed of 58 places in 341 ms of which 5 ms to minimize.
[2024-05-24 03:17:38] [INFO ] Deduced a trap composed of 92 places in 319 ms of which 5 ms to minimize.
[2024-05-24 03:17:39] [INFO ] Deduced a trap composed of 88 places in 314 ms of which 5 ms to minimize.
[2024-05-24 03:17:39] [INFO ] Deduced a trap composed of 18 places in 353 ms of which 5 ms to minimize.
[2024-05-24 03:17:40] [INFO ] Deduced a trap composed of 82 places in 353 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 03:17:41] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-05-24 03:17:41] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2024-05-24 03:17:41] [INFO ] Deduced a trap composed of 96 places in 161 ms of which 3 ms to minimize.
[2024-05-24 03:17:42] [INFO ] Deduced a trap composed of 90 places in 403 ms of which 5 ms to minimize.
[2024-05-24 03:17:43] [INFO ] Deduced a trap composed of 85 places in 321 ms of which 4 ms to minimize.
[2024-05-24 03:17:43] [INFO ] Deduced a trap composed of 90 places in 338 ms of which 5 ms to minimize.
[2024-05-24 03:17:44] [INFO ] Deduced a trap composed of 17 places in 412 ms of which 6 ms to minimize.
[2024-05-24 03:17:45] [INFO ] Deduced a trap composed of 48 places in 394 ms of which 6 ms to minimize.
[2024-05-24 03:17:45] [INFO ] Deduced a trap composed of 46 places in 349 ms of which 5 ms to minimize.
[2024-05-24 03:17:46] [INFO ] Deduced a trap composed of 43 places in 343 ms of which 5 ms to minimize.
[2024-05-24 03:17:46] [INFO ] Deduced a trap composed of 41 places in 353 ms of which 5 ms to minimize.
[2024-05-24 03:17:46] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:17:47] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2024-05-24 03:17:48] [INFO ] Deduced a trap composed of 56 places in 398 ms of which 6 ms to minimize.
[2024-05-24 03:17:48] [INFO ] Deduced a trap composed of 106 places in 392 ms of which 6 ms to minimize.
[2024-05-24 03:17:49] [INFO ] Deduced a trap composed of 101 places in 409 ms of which 5 ms to minimize.
[2024-05-24 03:17:49] [INFO ] Deduced a trap composed of 95 places in 431 ms of which 5 ms to minimize.
[2024-05-24 03:17:49] [INFO ] Deduced a trap composed of 39 places in 412 ms of which 5 ms to minimize.
[2024-05-24 03:17:50] [INFO ] Deduced a trap composed of 107 places in 401 ms of which 5 ms to minimize.
[2024-05-24 03:17:50] [INFO ] Deduced a trap composed of 104 places in 393 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 03:17:53] [INFO ] Deduced a trap composed of 102 places in 342 ms of which 5 ms to minimize.
[2024-05-24 03:17:53] [INFO ] Deduced a trap composed of 95 places in 375 ms of which 5 ms to minimize.
[2024-05-24 03:17:54] [INFO ] Deduced a trap composed of 96 places in 350 ms of which 5 ms to minimize.
[2024-05-24 03:17:54] [INFO ] Deduced a trap composed of 120 places in 286 ms of which 4 ms to minimize.
[2024-05-24 03:17:54] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-24 03:17:55] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 3 ms to minimize.
[2024-05-24 03:17:55] [INFO ] Deduced a trap composed of 72 places in 233 ms of which 3 ms to minimize.
[2024-05-24 03:17:55] [INFO ] Deduced a trap composed of 103 places in 202 ms of which 3 ms to minimize.
[2024-05-24 03:17:56] [INFO ] Deduced a trap composed of 99 places in 199 ms of which 3 ms to minimize.
[2024-05-24 03:17:56] [INFO ] Deduced a trap composed of 56 places in 236 ms of which 4 ms to minimize.
[2024-05-24 03:17:57] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 3 ms to minimize.
[2024-05-24 03:17:58] [INFO ] Deduced a trap composed of 39 places in 295 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/906 variables, and 106 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/1110 constraints, Known Traps: 87/87 constraints]
After SMT, in 60796ms problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 60818ms
Starting structural reductions in LTL mode, iteration 1 : 384/398 places, 1116/1200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63478 ms. Remains : 384/398 places, 1116/1200 transitions.
[2024-05-24 03:17:59] [INFO ] Flatten gal took : 35 ms
[2024-05-24 03:17:59] [INFO ] Flatten gal took : 47 ms
[2024-05-24 03:17:59] [INFO ] Input system was already deterministic with 1116 transitions.
[2024-05-24 03:17:59] [INFO ] Flatten gal took : 34 ms
[2024-05-24 03:18:00] [INFO ] Flatten gal took : 34 ms
[2024-05-24 03:18:00] [INFO ] Time to serialize gal into /tmp/CTLFireability11288258767763971654.gal : 6 ms
[2024-05-24 03:18:00] [INFO ] Time to serialize properties into /tmp/CTLFireability15538026778211762070.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/CTLFireability11288258767763971654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15538026778211762070.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 03:18:30] [INFO ] Flatten gal took : 33 ms
[2024-05-24 03:18:30] [INFO ] Applying decomposition
[2024-05-24 03:18:30] [INFO ] Flatten gal took : 31 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/graph14653234989408614020.txt' '-o' '/tmp/graph14653234989408614020.bin' '-w' '/tmp/graph14653234989408614020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14653234989408614020.bin' '-l' '-1' '-v' '-w' '/tmp/graph14653234989408614020.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:18:30] [INFO ] Decomposing Gal with order
[2024-05-24 03:18:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:18:30] [INFO ] Removed a total of 1853 redundant transitions.
[2024-05-24 03:18:30] [INFO ] Flatten gal took : 94 ms
[2024-05-24 03:18:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 353 labels/synchronizations in 39 ms.
[2024-05-24 03:18:30] [INFO ] Time to serialize gal into /tmp/CTLFireability11310890706810366607.gal : 12 ms
[2024-05-24 03:18:30] [INFO ] Time to serialize properties into /tmp/CTLFireability15809627313396218415.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/CTLFireability11310890706810366607.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15809627313396218415.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 385 transition count 1122
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 385 transition count 1122
Applied a total of 26 rules in 13 ms. Remains 385 /398 variables (removed 13) and now considering 1122/1200 (removed 78) transitions.
[2024-05-24 03:19:00] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
// Phase 1: matrix 528 rows 385 cols
[2024-05-24 03:19:00] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 03:19:01] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-24 03:19:01] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-05-24 03:19:01] [INFO ] Invariant cache hit.
[2024-05-24 03:19:01] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-24 03:19:03] [INFO ] Implicit Places using invariants and state equation in 2086 ms returned []
Implicit Place search using SMT with State Equation took 2552 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-05-24 03:19:03] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-05-24 03:19:03] [INFO ] Invariant cache hit.
[2024-05-24 03:19:03] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-24 03:19:19] [INFO ] Deduced a trap composed of 34 places in 244 ms of which 4 ms to minimize.
[2024-05-24 03:19:19] [INFO ] Deduced a trap composed of 69 places in 267 ms of which 7 ms to minimize.
[2024-05-24 03:19:20] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 3 ms to minimize.
[2024-05-24 03:19:20] [INFO ] Deduced a trap composed of 35 places in 299 ms of which 4 ms to minimize.
[2024-05-24 03:19:20] [INFO ] Deduced a trap composed of 32 places in 334 ms of which 5 ms to minimize.
[2024-05-24 03:19:20] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 3 ms to minimize.
[2024-05-24 03:19:21] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 3 ms to minimize.
[2024-05-24 03:19:21] [INFO ] Deduced a trap composed of 23 places in 318 ms of which 4 ms to minimize.
[2024-05-24 03:19:21] [INFO ] Deduced a trap composed of 58 places in 335 ms of which 4 ms to minimize.
[2024-05-24 03:19:22] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 3 ms to minimize.
[2024-05-24 03:19:22] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 2 ms to minimize.
[2024-05-24 03:19:22] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:19:24] [INFO ] Deduced a trap composed of 39 places in 504 ms of which 7 ms to minimize.
[2024-05-24 03:19:24] [INFO ] Deduced a trap composed of 81 places in 446 ms of which 5 ms to minimize.
[2024-05-24 03:19:25] [INFO ] Deduced a trap composed of 109 places in 457 ms of which 7 ms to minimize.
[2024-05-24 03:19:25] [INFO ] Deduced a trap composed of 92 places in 392 ms of which 6 ms to minimize.
[2024-05-24 03:19:25] [INFO ] Deduced a trap composed of 76 places in 326 ms of which 5 ms to minimize.
[2024-05-24 03:19:26] [INFO ] Deduced a trap composed of 43 places in 357 ms of which 5 ms to minimize.
[2024-05-24 03:19:27] [INFO ] Deduced a trap composed of 81 places in 403 ms of which 6 ms to minimize.
[2024-05-24 03:19:28] [INFO ] Deduced a trap composed of 77 places in 359 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-24 03:19:29] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 2 ms to minimize.
[2024-05-24 03:19:29] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:19:29] [INFO ] Deduced a trap composed of 58 places in 302 ms of which 5 ms to minimize.
[2024-05-24 03:19:29] [INFO ] Deduced a trap composed of 74 places in 261 ms of which 4 ms to minimize.
[2024-05-24 03:19:29] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 2 ms to minimize.
[2024-05-24 03:19:30] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-05-24 03:19:31] [INFO ] Deduced a trap composed of 54 places in 231 ms of which 3 ms to minimize.
[2024-05-24 03:19:31] [INFO ] Deduced a trap composed of 68 places in 192 ms of which 3 ms to minimize.
[2024-05-24 03:19:32] [INFO ] Deduced a trap composed of 56 places in 172 ms of which 3 ms to minimize.
[2024-05-24 03:19:32] [INFO ] Deduced a trap composed of 87 places in 219 ms of which 3 ms to minimize.
[2024-05-24 03:19:32] [INFO ] Deduced a trap composed of 57 places in 219 ms of which 4 ms to minimize.
[2024-05-24 03:19:32] [INFO ] Deduced a trap composed of 81 places in 215 ms of which 3 ms to minimize.
[2024-05-24 03:19:33] [INFO ] Deduced a trap composed of 67 places in 217 ms of which 3 ms to minimize.
[2024-05-24 03:19:33] [INFO ] Deduced a trap composed of 96 places in 216 ms of which 3 ms to minimize.
[2024-05-24 03:19:33] [INFO ] Deduced a trap composed of 86 places in 214 ms of which 3 ms to minimize.
[2024-05-24 03:19:33] [INFO ] Deduced a trap composed of 79 places in 209 ms of which 3 ms to minimize.
[2024-05-24 03:19:34] [INFO ] Deduced a trap composed of 94 places in 200 ms of which 3 ms to minimize.
SMT process timed out in 30995ms, After SMT, problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 31017ms
Starting structural reductions in LTL mode, iteration 1 : 385/398 places, 1122/1200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33586 ms. Remains : 385/398 places, 1122/1200 transitions.
[2024-05-24 03:19:34] [INFO ] Flatten gal took : 26 ms
[2024-05-24 03:19:34] [INFO ] Flatten gal took : 29 ms
[2024-05-24 03:19:34] [INFO ] Input system was already deterministic with 1122 transitions.
[2024-05-24 03:19:34] [INFO ] Flatten gal took : 29 ms
[2024-05-24 03:19:34] [INFO ] Flatten gal took : 48 ms
[2024-05-24 03:19:34] [INFO ] Time to serialize gal into /tmp/CTLFireability3269497233215730945.gal : 9 ms
[2024-05-24 03:19:34] [INFO ] Time to serialize properties into /tmp/CTLFireability2934442932816486028.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/CTLFireability3269497233215730945.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2934442932816486028.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 03:20:04] [INFO ] Flatten gal took : 26 ms
[2024-05-24 03:20:04] [INFO ] Applying decomposition
[2024-05-24 03:20:04] [INFO ] Flatten gal took : 27 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/graph1289025061886758754.txt' '-o' '/tmp/graph1289025061886758754.bin' '-w' '/tmp/graph1289025061886758754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1289025061886758754.bin' '-l' '-1' '-v' '-w' '/tmp/graph1289025061886758754.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:20:04] [INFO ] Decomposing Gal with order
[2024-05-24 03:20:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:20:04] [INFO ] Removed a total of 1896 redundant transitions.
[2024-05-24 03:20:04] [INFO ] Flatten gal took : 85 ms
[2024-05-24 03:20:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 354 labels/synchronizations in 39 ms.
[2024-05-24 03:20:04] [INFO ] Time to serialize gal into /tmp/CTLFireability5645815041351843531.gal : 9 ms
[2024-05-24 03:20:04] [INFO ] Time to serialize properties into /tmp/CTLFireability5976370170822006844.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/CTLFireability5645815041351843531.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5976370170822006844.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 386 transition count 1128
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 386 transition count 1128
Applied a total of 24 rules in 11 ms. Remains 386 /398 variables (removed 12) and now considering 1128/1200 (removed 72) transitions.
[2024-05-24 03:20:34] [INFO ] Flow matrix only has 534 transitions (discarded 594 similar events)
// Phase 1: matrix 534 rows 386 cols
[2024-05-24 03:20:34] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 03:20:35] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-05-24 03:20:35] [INFO ] Flow matrix only has 534 transitions (discarded 594 similar events)
[2024-05-24 03:20:35] [INFO ] Invariant cache hit.
[2024-05-24 03:20:35] [INFO ] State equation strengthened by 174 read => feed constraints.
[2024-05-24 03:20:37] [INFO ] Implicit Places using invariants and state equation in 1989 ms returned []
Implicit Place search using SMT with State Equation took 2341 ms to find 0 implicit places.
Running 1122 sub problems to find dead transitions.
[2024-05-24 03:20:37] [INFO ] Flow matrix only has 534 transitions (discarded 594 similar events)
[2024-05-24 03:20:37] [INFO ] Invariant cache hit.
[2024-05-24 03:20:37] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
[2024-05-24 03:20:52] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 3 ms to minimize.
[2024-05-24 03:20:52] [INFO ] Deduced a trap composed of 70 places in 250 ms of which 4 ms to minimize.
[2024-05-24 03:20:53] [INFO ] Deduced a trap composed of 29 places in 352 ms of which 5 ms to minimize.
[2024-05-24 03:20:53] [INFO ] Deduced a trap composed of 35 places in 382 ms of which 5 ms to minimize.
[2024-05-24 03:20:54] [INFO ] Deduced a trap composed of 23 places in 388 ms of which 5 ms to minimize.
[2024-05-24 03:20:54] [INFO ] Deduced a trap composed of 32 places in 380 ms of which 5 ms to minimize.
[2024-05-24 03:20:54] [INFO ] Deduced a trap composed of 63 places in 365 ms of which 5 ms to minimize.
[2024-05-24 03:20:55] [INFO ] Deduced a trap composed of 26 places in 339 ms of which 4 ms to minimize.
[2024-05-24 03:20:55] [INFO ] Deduced a trap composed of 58 places in 321 ms of which 5 ms to minimize.
[2024-05-24 03:20:55] [INFO ] Deduced a trap composed of 58 places in 269 ms of which 7 ms to minimize.
[2024-05-24 03:20:56] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 2 ms to minimize.
[2024-05-24 03:20:56] [INFO ] Deduced a trap composed of 26 places in 318 ms of which 5 ms to minimize.
[2024-05-24 03:20:56] [INFO ] Deduced a trap composed of 32 places in 294 ms of which 4 ms to minimize.
[2024-05-24 03:20:58] [INFO ] Deduced a trap composed of 54 places in 458 ms of which 6 ms to minimize.
[2024-05-24 03:20:58] [INFO ] Deduced a trap composed of 70 places in 412 ms of which 5 ms to minimize.
[2024-05-24 03:20:59] [INFO ] Deduced a trap composed of 104 places in 419 ms of which 6 ms to minimize.
[2024-05-24 03:20:59] [INFO ] Deduced a trap composed of 101 places in 412 ms of which 6 ms to minimize.
[2024-05-24 03:21:00] [INFO ] Deduced a trap composed of 107 places in 433 ms of which 6 ms to minimize.
[2024-05-24 03:21:00] [INFO ] Deduced a trap composed of 88 places in 450 ms of which 5 ms to minimize.
[2024-05-24 03:21:01] [INFO ] Deduced a trap composed of 57 places in 418 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
[2024-05-24 03:21:01] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:21:01] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:21:02] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 3 ms to minimize.
[2024-05-24 03:21:02] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:21:02] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-05-24 03:21:04] [INFO ] Deduced a trap composed of 59 places in 421 ms of which 6 ms to minimize.
[2024-05-24 03:21:04] [INFO ] Deduced a trap composed of 63 places in 241 ms of which 3 ms to minimize.
[2024-05-24 03:21:04] [INFO ] Deduced a trap composed of 73 places in 240 ms of which 4 ms to minimize.
[2024-05-24 03:21:04] [INFO ] Deduced a trap composed of 68 places in 201 ms of which 3 ms to minimize.
[2024-05-24 03:21:05] [INFO ] Deduced a trap composed of 58 places in 203 ms of which 3 ms to minimize.
[2024-05-24 03:21:05] [INFO ] Deduced a trap composed of 54 places in 289 ms of which 4 ms to minimize.
[2024-05-24 03:21:06] [INFO ] Deduced a trap composed of 39 places in 363 ms of which 6 ms to minimize.
[2024-05-24 03:21:07] [INFO ] Deduced a trap composed of 46 places in 240 ms of which 3 ms to minimize.
[2024-05-24 03:21:07] [INFO ] Deduced a trap composed of 62 places in 343 ms of which 4 ms to minimize.
[2024-05-24 03:21:07] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 5 ms to minimize.
[2024-05-24 03:21:07] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:21:08] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
SMT process timed out in 30876ms, After SMT, problems are : Problem set: 0 solved, 1122 unsolved
Search for dead transitions found 0 dead transitions in 30898ms
Starting structural reductions in LTL mode, iteration 1 : 386/398 places, 1128/1200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33254 ms. Remains : 386/398 places, 1128/1200 transitions.
[2024-05-24 03:21:08] [INFO ] Flatten gal took : 38 ms
[2024-05-24 03:21:08] [INFO ] Flatten gal took : 44 ms
[2024-05-24 03:21:08] [INFO ] Input system was already deterministic with 1128 transitions.
[2024-05-24 03:21:08] [INFO ] Flatten gal took : 43 ms
[2024-05-24 03:21:08] [INFO ] Flatten gal took : 44 ms
[2024-05-24 03:21:08] [INFO ] Time to serialize gal into /tmp/CTLFireability7692581416987384107.gal : 7 ms
[2024-05-24 03:21:08] [INFO ] Time to serialize properties into /tmp/CTLFireability8919838894690858703.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/CTLFireability7692581416987384107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8919838894690858703.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 03:21:38] [INFO ] Flatten gal took : 27 ms
[2024-05-24 03:21:38] [INFO ] Applying decomposition
[2024-05-24 03:21:38] [INFO ] Flatten gal took : 27 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/graph4666537742134487772.txt' '-o' '/tmp/graph4666537742134487772.bin' '-w' '/tmp/graph4666537742134487772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4666537742134487772.bin' '-l' '-1' '-v' '-w' '/tmp/graph4666537742134487772.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:21:38] [INFO ] Decomposing Gal with order
[2024-05-24 03:21:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:21:38] [INFO ] Removed a total of 1918 redundant transitions.
[2024-05-24 03:21:38] [INFO ] Flatten gal took : 90 ms
[2024-05-24 03:21:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 285 labels/synchronizations in 22 ms.
[2024-05-24 03:21:38] [INFO ] Time to serialize gal into /tmp/CTLFireability16137200138065416578.gal : 7 ms
[2024-05-24 03:21:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11848280977214483540.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/CTLFireability16137200138065416578.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11848280977214483540.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 398/398 places, 1200/1200 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 0 with 6 rules applied. Total rules applied 6 place count 398 transition count 1194
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 392 transition count 1194
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 392 transition count 1080
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 278 transition count 1080
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 254 place count 264 transition count 996
Iterating global reduction 2 with 14 rules applied. Total rules applied 268 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 328 place count 234 transition count 966
Applied a total of 328 rules in 124 ms. Remains 234 /398 variables (removed 164) and now considering 966/1200 (removed 234) transitions.
[2024-05-24 03:22:08] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-05-24 03:22:08] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 03:22:09] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-24 03:22:09] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:22:09] [INFO ] Invariant cache hit.
[2024-05-24 03:22:09] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 03:22:10] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
[2024-05-24 03:22:10] [INFO ] Redundant transitions in 74 ms returned []
Running 960 sub problems to find dead transitions.
[2024-05-24 03:22:10] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:22:10] [INFO ] Invariant cache hit.
[2024-05-24 03:22:10] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:22:20] [INFO ] Deduced a trap composed of 3 places in 299 ms of which 4 ms to minimize.
[2024-05-24 03:22:20] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 2 ms to minimize.
[2024-05-24 03:22:20] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:22:20] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
[2024-05-24 03:22:20] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 3 ms to minimize.
[2024-05-24 03:22:21] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 3 ms to minimize.
[2024-05-24 03:22:21] [INFO ] Deduced a trap composed of 67 places in 213 ms of which 3 ms to minimize.
[2024-05-24 03:22:22] [INFO ] Deduced a trap composed of 58 places in 232 ms of which 4 ms to minimize.
[2024-05-24 03:22:22] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 3 ms to minimize.
[2024-05-24 03:22:22] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 4 ms to minimize.
[2024-05-24 03:22:22] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:22:23] [INFO ] Deduced a trap composed of 53 places in 241 ms of which 3 ms to minimize.
[2024-05-24 03:22:23] [INFO ] Deduced a trap composed of 70 places in 215 ms of which 3 ms to minimize.
[2024-05-24 03:22:23] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2024-05-24 03:22:23] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-05-24 03:22:23] [INFO ] Deduced a trap composed of 48 places in 249 ms of which 3 ms to minimize.
[2024-05-24 03:22:24] [INFO ] Deduced a trap composed of 44 places in 220 ms of which 3 ms to minimize.
[2024-05-24 03:22:24] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 3 ms to minimize.
[2024-05-24 03:22:24] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-05-24 03:22:25] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:22:27] [INFO ] Deduced a trap composed of 54 places in 218 ms of which 3 ms to minimize.
[2024-05-24 03:22:27] [INFO ] Deduced a trap composed of 45 places in 237 ms of which 3 ms to minimize.
[2024-05-24 03:22:27] [INFO ] Deduced a trap composed of 39 places in 226 ms of which 3 ms to minimize.
[2024-05-24 03:22:28] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 3 ms to minimize.
[2024-05-24 03:22:28] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 4 ms to minimize.
[2024-05-24 03:22:28] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 3 ms to minimize.
[2024-05-24 03:22:28] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 3 ms to minimize.
[2024-05-24 03:22:28] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:22:30] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 3 ms to minimize.
[2024-05-24 03:22:30] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 3 ms to minimize.
[2024-05-24 03:22:30] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 3 ms to minimize.
[2024-05-24 03:22:31] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 3 ms to minimize.
[2024-05-24 03:22:31] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 3 ms to minimize.
[2024-05-24 03:22:31] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 4 ms to minimize.
[2024-05-24 03:22:32] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 3 ms to minimize.
[2024-05-24 03:22:32] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 3 ms to minimize.
[2024-05-24 03:22:33] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 3 ms to minimize.
[2024-05-24 03:22:33] [INFO ] Deduced a trap composed of 53 places in 228 ms of which 3 ms to minimize.
[2024-05-24 03:22:33] [INFO ] Deduced a trap composed of 49 places in 251 ms of which 4 ms to minimize.
[2024-05-24 03:22:34] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 59 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:22:43] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 2 ms to minimize.
[2024-05-24 03:22:43] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 2 ms to minimize.
[2024-05-24 03:22:43] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 2 ms to minimize.
[2024-05-24 03:22:43] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 3 ms to minimize.
[2024-05-24 03:22:43] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 2 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 2 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 51 places in 183 ms of which 2 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 3 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 2 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 3 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 2 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 3 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 2 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 2 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 2 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 2 ms to minimize.
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 2 ms to minimize.
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 2 ms to minimize.
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 3 ms to minimize.
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:22:49] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:22:51] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 3 ms to minimize.
[2024-05-24 03:22:51] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 2 ms to minimize.
[2024-05-24 03:22:52] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:22:52] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:22:52] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 3 ms to minimize.
[2024-05-24 03:22:52] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 2 ms to minimize.
[2024-05-24 03:22:53] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 1 ms to minimize.
[2024-05-24 03:22:53] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 2 ms to minimize.
[2024-05-24 03:22:53] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 2 ms to minimize.
[2024-05-24 03:22:53] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 2 ms to minimize.
[2024-05-24 03:22:53] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 2 ms to minimize.
[2024-05-24 03:22:53] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:22:53] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 2 ms to minimize.
[2024-05-24 03:22:54] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 2 ms to minimize.
[2024-05-24 03:22:54] [INFO ] Deduced a trap composed of 60 places in 143 ms of which 2 ms to minimize.
[2024-05-24 03:22:54] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 2 ms to minimize.
[2024-05-24 03:22:54] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 2 ms to minimize.
[2024-05-24 03:22:54] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 2 ms to minimize.
[2024-05-24 03:22:55] [INFO ] Deduced a trap composed of 64 places in 162 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 44 places in 231 ms of which 4 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 3 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 46 places in 217 ms of which 4 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 45 places in 247 ms of which 3 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 44 places in 234 ms of which 4 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 2 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 3 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 2 ms to minimize.
[2024-05-24 03:23:03] [INFO ] Deduced a trap composed of 53 places in 140 ms of which 2 ms to minimize.
[2024-05-24 03:23:03] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/606 variables, and 109 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 90/90 constraints]
After SMT, in 60608ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60621ms
Starting structural reductions in SI_CTL mode, iteration 1 : 234/398 places, 966/1200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62213 ms. Remains : 234/398 places, 966/1200 transitions.
[2024-05-24 03:23:10] [INFO ] Flatten gal took : 22 ms
[2024-05-24 03:23:11] [INFO ] Flatten gal took : 24 ms
[2024-05-24 03:23:11] [INFO ] Input system was already deterministic with 966 transitions.
[2024-05-24 03:23:11] [INFO ] Flatten gal took : 24 ms
RANDOM walk for 40000 steps (8 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
[2024-05-24 03:23:11] [INFO ] Flatten gal took : 47 ms
[2024-05-24 03:23:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5412413448492519256.gal : 4 ms
[2024-05-24 03:23:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10206072399070653521.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5412413448492519256.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10206072399070653521.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality10206072399070653521.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 26
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :26 after 51
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :51 after 199
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :199 after 372
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :372 after 728
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :728 after 2771
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2771 after 4196
Interrupted probabilistic random walk after 679049 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :0 out of 1
Probabilistic random walk after 679049 steps, saw 166899 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :0
[2024-05-24 03:23:14] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:23:14] [INFO ] Invariant cache hit.
[2024-05-24 03:23:14] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:23:14] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/82 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:23:14] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 164/246 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 26/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 72/318 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 17/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 112/430 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/438 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 168/606 variables, 120/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 121/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/606 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/82 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 164/246 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 26/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/318 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 17/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 112/430 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/438 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:23:14] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2024-05-24 03:23:14] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/438 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 168/606 variables, 120/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 8192
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 121/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :4196 after 14298
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/606 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 422 constraints, problems are : Problem set: 0 solved, 1 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 924ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 35 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 234/234 places, 966/966 transitions.
RANDOM walk for 22060 steps (0 resets) in 239 ms. (91 steps per ms) remains 0/3 properties
RANDOM walk for 4000000 steps (8 resets) in 12117 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2848 ms. (1404 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :14298 after 24614
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :24614 after 77940
Interrupted probabilistic random walk after 2110633 steps, run timeout after 9001 ms. (steps per millisecond=234 ) properties seen :0 out of 1
Probabilistic random walk after 2110633 steps, saw 430150 distinct states, run finished after 9001 ms. (steps per millisecond=234 ) properties seen :0
[2024-05-24 03:23:28] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:23:28] [INFO ] Invariant cache hit.
[2024-05-24 03:23:28] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:23:28] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/82 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:23:28] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 164/246 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 26/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 72/318 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 17/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 112/430 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/438 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 168/606 variables, 120/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 121/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/606 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/82 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 164/246 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 26/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/318 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 17/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 112/430 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/438 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:23:28] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-05-24 03:23:28] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/438 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 168/606 variables, 120/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 121/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/606 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 422 constraints, problems are : Problem set: 0 solved, 1 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 819ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 27 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 25 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-05-24 03:23:29] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:23:29] [INFO ] Invariant cache hit.
[2024-05-24 03:23:29] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-24 03:23:29] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:23:29] [INFO ] Invariant cache hit.
[2024-05-24 03:23:29] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 03:23:30] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
[2024-05-24 03:23:30] [INFO ] Redundant transitions in 41 ms returned []
Running 960 sub problems to find dead transitions.
[2024-05-24 03:23:30] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:23:30] [INFO ] Invariant cache hit.
[2024-05-24 03:23:30] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:23:36] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 2 ms to minimize.
[2024-05-24 03:23:36] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:23:36] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:23:36] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:23:36] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:23:37] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 3 ms to minimize.
[2024-05-24 03:23:37] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 3 ms to minimize.
[2024-05-24 03:23:37] [INFO ] Deduced a trap composed of 58 places in 200 ms of which 3 ms to minimize.
[2024-05-24 03:23:37] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 3 ms to minimize.
[2024-05-24 03:23:38] [INFO ] Deduced a trap composed of 28 places in 222 ms of which 3 ms to minimize.
[2024-05-24 03:23:38] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-24 03:23:38] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 2 ms to minimize.
[2024-05-24 03:23:38] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 3 ms to minimize.
[2024-05-24 03:23:38] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:23:38] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:23:38] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 3 ms to minimize.
[2024-05-24 03:23:39] [INFO ] Deduced a trap composed of 44 places in 192 ms of which 2 ms to minimize.
[2024-05-24 03:23:39] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 3 ms to minimize.
[2024-05-24 03:23:39] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:23:39] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:23:41] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 65536
[2024-05-24 03:23:41] [INFO ] Deduced a trap composed of 45 places in 197 ms of which 3 ms to minimize.
SDD size :77940 after 321916
[2024-05-24 03:23:41] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 3 ms to minimize.
[2024-05-24 03:23:41] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 3 ms to minimize.
[2024-05-24 03:23:42] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 3 ms to minimize.
[2024-05-24 03:23:42] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 3 ms to minimize.
[2024-05-24 03:23:42] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 3 ms to minimize.
[2024-05-24 03:23:42] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:23:43] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 4 ms to minimize.
[2024-05-24 03:23:43] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 3 ms to minimize.
[2024-05-24 03:23:43] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 3 ms to minimize.
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 3 ms to minimize.
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 3 ms to minimize.
[2024-05-24 03:23:45] [INFO ] Deduced a trap composed of 33 places in 282 ms of which 3 ms to minimize.
[2024-05-24 03:23:45] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 3 ms to minimize.
[2024-05-24 03:23:46] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 3 ms to minimize.
[2024-05-24 03:23:46] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 3 ms to minimize.
[2024-05-24 03:23:46] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 3 ms to minimize.
[2024-05-24 03:23:46] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:23:57] [INFO ] Deduced a trap composed of 60 places in 310 ms of which 4 ms to minimize.
[2024-05-24 03:23:57] [INFO ] Deduced a trap composed of 60 places in 326 ms of which 4 ms to minimize.
[2024-05-24 03:23:58] [INFO ] Deduced a trap composed of 44 places in 334 ms of which 3 ms to minimize.
[2024-05-24 03:23:58] [INFO ] Deduced a trap composed of 56 places in 280 ms of which 3 ms to minimize.
[2024-05-24 03:23:58] [INFO ] Deduced a trap composed of 63 places in 233 ms of which 3 ms to minimize.
[2024-05-24 03:23:58] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 3 ms to minimize.
[2024-05-24 03:23:59] [INFO ] Deduced a trap composed of 55 places in 215 ms of which 3 ms to minimize.
[2024-05-24 03:23:59] [INFO ] Deduced a trap composed of 55 places in 243 ms of which 3 ms to minimize.
[2024-05-24 03:23:59] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 3 ms to minimize.
[2024-05-24 03:23:59] [INFO ] Deduced a trap composed of 58 places in 229 ms of which 4 ms to minimize.
[2024-05-24 03:24:00] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 3 ms to minimize.
[2024-05-24 03:24:00] [INFO ] Deduced a trap composed of 45 places in 227 ms of which 3 ms to minimize.
[2024-05-24 03:24:00] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 72 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 53/72 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:24:07] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:24:08] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :321916 after 932469
[2024-05-24 03:24:10] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 4 ms to minimize.
[2024-05-24 03:24:10] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 3 ms to minimize.
[2024-05-24 03:24:10] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-24 03:24:10] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:24:11] [INFO ] Deduced a trap composed of 45 places in 288 ms of which 4 ms to minimize.
[2024-05-24 03:24:12] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 4 ms to minimize.
[2024-05-24 03:24:12] [INFO ] Deduced a trap composed of 44 places in 266 ms of which 3 ms to minimize.
[2024-05-24 03:24:12] [INFO ] Deduced a trap composed of 46 places in 236 ms of which 3 ms to minimize.
[2024-05-24 03:24:12] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 3 ms to minimize.
[2024-05-24 03:24:13] [INFO ] Deduced a trap composed of 55 places in 238 ms of which 3 ms to minimize.
[2024-05-24 03:24:13] [INFO ] Deduced a trap composed of 60 places in 231 ms of which 3 ms to minimize.
[2024-05-24 03:24:13] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 3 ms to minimize.
[2024-05-24 03:24:13] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:24:14] [INFO ] Deduced a trap composed of 56 places in 294 ms of which 4 ms to minimize.
[2024-05-24 03:24:14] [INFO ] Deduced a trap composed of 56 places in 293 ms of which 4 ms to minimize.
[2024-05-24 03:24:16] [INFO ] Deduced a trap composed of 56 places in 329 ms of which 4 ms to minimize.
[2024-05-24 03:24:17] [INFO ] Deduced a trap composed of 69 places in 314 ms of which 4 ms to minimize.
[2024-05-24 03:24:20] [INFO ] Deduced a trap composed of 44 places in 321 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:24:29] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 3 ms to minimize.
[2024-05-24 03:24:29] [INFO ] Deduced a trap composed of 52 places in 218 ms of which 3 ms to minimize.
[2024-05-24 03:24:29] [INFO ] Deduced a trap composed of 63 places in 229 ms of which 4 ms to minimize.
[2024-05-24 03:24:30] [INFO ] Deduced a trap composed of 59 places in 230 ms of which 4 ms to minimize.
[2024-05-24 03:24:30] [INFO ] Deduced a trap composed of 57 places in 249 ms of which 3 ms to minimize.
[2024-05-24 03:24:30] [INFO ] Deduced a trap composed of 58 places in 226 ms of which 3 ms to minimize.
[2024-05-24 03:24:30] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 4 ms to minimize.
SMT process timed out in 60541ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60552ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61781 ms. Remains : 234/234 places, 966/966 transitions.
RANDOM walk for 27027 steps (0 resets) in 99 ms. (270 steps per ms) remains 0/3 properties
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 6 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 245 place count 79 transition count 163
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 274 place count 79 transition count 134
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 284 place count 74 transition count 134
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 289 place count 74 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 295 place count 74 transition count 123
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 326 place count 74 transition count 92
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 357 place count 43 transition count 92
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 363 place count 43 transition count 92
Applied a total of 363 rules in 104 ms. Remains 43 /234 variables (removed 191) and now considering 92/966 (removed 874) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 92 rows 43 cols
[2024-05-24 03:24:31] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 03:24:31] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-24 03:24:31] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 03:24:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-24 03:24:31] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 03:24:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 03:24:31] [INFO ] After 12ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 03:24:31] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:24:31] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:24:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
TRAPS : Iteration 1
[2024-05-24 03:24:31] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:24:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
TRAPS : Iteration 2
[2024-05-24 03:24:31] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 03:24:31] [INFO ] After 261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-24 03:24:31] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:24:31] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:24:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15843733211273635472.gal : 1 ms
[2024-05-24 03:24:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13945400527077786351.prop : 15 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15843733211273635472.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13945400527077786351.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13945400527077786351.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 70
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :70 after 104
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :104 after 420
Reachability property EisenbergMcGuire-PT-06-CTLFireability-2024-06 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,45000,0.089294,4296,2,119,11,1310,6,0,267,715,0
Total reachable state count : 45000
Verifying 1 reachability properties.
Reachability property EisenbergMcGuire-PT-06-CTLFireability-2024-06 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-06-CTLFireability-2024-06,625,0.114495,4668,2,78,11,1310,7,0,276,715,0
Over-approximation ignoring read arcs solved 0 properties in 660 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 03:24:31] [INFO ] Flatten gal took : 30 ms
[2024-05-24 03:24:31] [INFO ] Applying decomposition
[2024-05-24 03:24:31] [INFO ] Flatten gal took : 25 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/graph9767734040426828785.txt' '-o' '/tmp/graph9767734040426828785.bin' '-w' '/tmp/graph9767734040426828785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9767734040426828785.bin' '-l' '-1' '-v' '-w' '/tmp/graph9767734040426828785.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:24:31] [INFO ] Decomposing Gal with order
[2024-05-24 03:24:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:24:31] [INFO ] Removed a total of 1803 redundant transitions.
[2024-05-24 03:24:32] [INFO ] Flatten gal took : 61 ms
[2024-05-24 03:24:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 317 labels/synchronizations in 20 ms.
[2024-05-24 03:24:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1978302672796089301.gal : 11 ms
[2024-05-24 03:24:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11897676664344725933.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1978302672796089301.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11897676664344725933.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality11897676664344725933.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3276
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3276 after 26991
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :26991 after 29823
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :29823 after 40029
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :40029 after 746259
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.13639e+07 after 1.13639e+07
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.89726e+07 after 2.10305e+07
Detected timeout of ITS tools.
[2024-05-24 03:34:32] [INFO ] Flatten gal took : 23 ms
[2024-05-24 03:34:32] [INFO ] Flatten gal took : 23 ms
[2024-05-24 03:34:32] [INFO ] Time to serialize gal into /tmp/CTLFireability12967565800268590172.gal : 4 ms
[2024-05-24 03:34:32] [INFO ] Time to serialize properties into /tmp/CTLFireability7044152336333557708.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/CTLFireability12967565800268590172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7044152336333557708.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 03:35:02] [INFO ] Flatten gal took : 22 ms
[2024-05-24 03:35:02] [INFO ] Applying decomposition
[2024-05-24 03:35:02] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11633788766848145341.txt' '-o' '/tmp/graph11633788766848145341.bin' '-w' '/tmp/graph11633788766848145341.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11633788766848145341.bin' '-l' '-1' '-v' '-w' '/tmp/graph11633788766848145341.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:35:02] [INFO ] Decomposing Gal with order
[2024-05-24 03:35:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:35:02] [INFO ] Removed a total of 1784 redundant transitions.
[2024-05-24 03:35:02] [INFO ] Flatten gal took : 72 ms
[2024-05-24 03:35:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 339 labels/synchronizations in 29 ms.
[2024-05-24 03:35:02] [INFO ] Time to serialize gal into /tmp/CTLFireability17354096558850446240.gal : 9 ms
[2024-05-24 03:35:02] [INFO ] Time to serialize properties into /tmp/CTLFireability3998964024329093129.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/CTLFireability17354096558850446240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3998964024329093129.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 398/398 places, 1200/1200 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 0 with 6 rules applied. Total rules applied 6 place count 398 transition count 1194
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 392 transition count 1194
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 392 transition count 1080
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 278 transition count 1080
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 253 place count 265 transition count 1002
Iterating global reduction 2 with 13 rules applied. Total rules applied 266 place count 265 transition count 1002
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 326 place count 235 transition count 972
Applied a total of 326 rules in 66 ms. Remains 235 /398 variables (removed 163) and now considering 972/1200 (removed 228) transitions.
[2024-05-24 03:35:32] [INFO ] Flow matrix only has 378 transitions (discarded 594 similar events)
// Phase 1: matrix 378 rows 235 cols
[2024-05-24 03:35:32] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 03:35:33] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-24 03:35:33] [INFO ] Flow matrix only has 378 transitions (discarded 594 similar events)
[2024-05-24 03:35:33] [INFO ] Invariant cache hit.
[2024-05-24 03:35:33] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-24 03:35:34] [INFO ] Implicit Places using invariants and state equation in 1283 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
[2024-05-24 03:35:34] [INFO ] Redundant transitions in 26 ms returned []
Running 966 sub problems to find dead transitions.
[2024-05-24 03:35:34] [INFO ] Flow matrix only has 378 transitions (discarded 594 similar events)
[2024-05-24 03:35:34] [INFO ] Invariant cache hit.
[2024-05-24 03:35:34] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-24 03:35:44] [INFO ] Deduced a trap composed of 3 places in 280 ms of which 4 ms to minimize.
[2024-05-24 03:35:44] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2024-05-24 03:35:44] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-05-24 03:35:44] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:35:44] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 2 ms to minimize.
[2024-05-24 03:35:45] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 3 ms to minimize.
[2024-05-24 03:35:46] [INFO ] Deduced a trap composed of 68 places in 207 ms of which 4 ms to minimize.
[2024-05-24 03:35:46] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 4 ms to minimize.
[2024-05-24 03:35:46] [INFO ] Deduced a trap composed of 28 places in 255 ms of which 3 ms to minimize.
[2024-05-24 03:35:46] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2024-05-24 03:35:46] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:35:47] [INFO ] Deduced a trap composed of 55 places in 261 ms of which 4 ms to minimize.
[2024-05-24 03:35:47] [INFO ] Deduced a trap composed of 56 places in 228 ms of which 3 ms to minimize.
[2024-05-24 03:35:47] [INFO ] Deduced a trap composed of 51 places in 256 ms of which 3 ms to minimize.
[2024-05-24 03:35:47] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:35:47] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 3 ms to minimize.
[2024-05-24 03:35:48] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2024-05-24 03:35:48] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 3 ms to minimize.
[2024-05-24 03:35:48] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 3 ms to minimize.
[2024-05-24 03:35:48] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-24 03:35:51] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:35:51] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 2 ms to minimize.
[2024-05-24 03:35:52] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 3 ms to minimize.
[2024-05-24 03:35:53] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 3 ms to minimize.
[2024-05-24 03:35:54] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:35:55] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-24 03:35:57] [INFO ] Deduced a trap composed of 17 places in 285 ms of which 3 ms to minimize.
[2024-05-24 03:35:57] [INFO ] Deduced a trap composed of 19 places in 290 ms of which 4 ms to minimize.
[2024-05-24 03:35:58] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 2 ms to minimize.
[2024-05-24 03:35:58] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 2 ms to minimize.
[2024-05-24 03:35:59] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 4 ms to minimize.
[2024-05-24 03:35:59] [INFO ] Deduced a trap composed of 46 places in 213 ms of which 2 ms to minimize.
[2024-05-24 03:35:59] [INFO ] Deduced a trap composed of 45 places in 213 ms of which 3 ms to minimize.
[2024-05-24 03:35:59] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:35:59] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 4 ms to minimize.
[2024-05-24 03:36:00] [INFO ] Deduced a trap composed of 39 places in 287 ms of which 4 ms to minimize.
[2024-05-24 03:36:00] [INFO ] Deduced a trap composed of 45 places in 227 ms of which 2 ms to minimize.
[2024-05-24 03:36:00] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:36:00] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 2 ms to minimize.
[2024-05-24 03:36:01] [INFO ] Deduced a trap composed of 44 places in 292 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/613 variables, and 59 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-24 03:36:08] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 3 ms to minimize.
[2024-05-24 03:36:08] [INFO ] Deduced a trap composed of 52 places in 220 ms of which 3 ms to minimize.
[2024-05-24 03:36:09] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 3 ms to minimize.
[2024-05-24 03:36:09] [INFO ] Deduced a trap composed of 54 places in 211 ms of which 3 ms to minimize.
[2024-05-24 03:36:10] [INFO ] Deduced a trap composed of 33 places in 226 ms of which 3 ms to minimize.
[2024-05-24 03:36:10] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 3 ms to minimize.
[2024-05-24 03:36:10] [INFO ] Deduced a trap composed of 54 places in 234 ms of which 3 ms to minimize.
[2024-05-24 03:36:11] [INFO ] Deduced a trap composed of 45 places in 302 ms of which 4 ms to minimize.
[2024-05-24 03:36:11] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 4 ms to minimize.
[2024-05-24 03:36:12] [INFO ] Deduced a trap composed of 35 places in 207 ms of which 3 ms to minimize.
[2024-05-24 03:36:12] [INFO ] Deduced a trap composed of 48 places in 232 ms of which 3 ms to minimize.
[2024-05-24 03:36:12] [INFO ] Deduced a trap composed of 48 places in 214 ms of which 3 ms to minimize.
[2024-05-24 03:36:12] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 3 ms to minimize.
[2024-05-24 03:36:13] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 3 ms to minimize.
[2024-05-24 03:36:13] [INFO ] Deduced a trap composed of 54 places in 248 ms of which 3 ms to minimize.
[2024-05-24 03:36:14] [INFO ] Deduced a trap composed of 45 places in 242 ms of which 3 ms to minimize.
[2024-05-24 03:36:14] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 3 ms to minimize.
[2024-05-24 03:36:14] [INFO ] Deduced a trap composed of 34 places in 230 ms of which 3 ms to minimize.
[2024-05-24 03:36:15] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 3 ms to minimize.
[2024-05-24 03:36:15] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-24 03:36:19] [INFO ] Deduced a trap composed of 68 places in 239 ms of which 4 ms to minimize.
[2024-05-24 03:36:20] [INFO ] Deduced a trap composed of 43 places in 258 ms of which 4 ms to minimize.
[2024-05-24 03:36:20] [INFO ] Deduced a trap composed of 39 places in 239 ms of which 4 ms to minimize.
[2024-05-24 03:36:21] [INFO ] Deduced a trap composed of 55 places in 263 ms of which 3 ms to minimize.
[2024-05-24 03:36:21] [INFO ] Deduced a trap composed of 70 places in 256 ms of which 7 ms to minimize.
[2024-05-24 03:36:21] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 3 ms to minimize.
[2024-05-24 03:36:23] [INFO ] Deduced a trap composed of 55 places in 230 ms of which 3 ms to minimize.
[2024-05-24 03:36:24] [INFO ] Deduced a trap composed of 50 places in 266 ms of which 4 ms to minimize.
[2024-05-24 03:36:24] [INFO ] Deduced a trap composed of 44 places in 306 ms of which 4 ms to minimize.
[2024-05-24 03:36:25] [INFO ] Deduced a trap composed of 69 places in 252 ms of which 4 ms to minimize.
[2024-05-24 03:36:26] [INFO ] Deduced a trap composed of 20 places in 281 ms of which 3 ms to minimize.
[2024-05-24 03:36:26] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 3 ms to minimize.
[2024-05-24 03:36:27] [INFO ] Deduced a trap composed of 51 places in 277 ms of which 3 ms to minimize.
[2024-05-24 03:36:27] [INFO ] Deduced a trap composed of 52 places in 318 ms of which 3 ms to minimize.
[2024-05-24 03:36:28] [INFO ] Deduced a trap composed of 54 places in 316 ms of which 4 ms to minimize.
[2024-05-24 03:36:28] [INFO ] Deduced a trap composed of 51 places in 307 ms of which 3 ms to minimize.
[2024-05-24 03:36:29] [INFO ] Deduced a trap composed of 47 places in 269 ms of which 4 ms to minimize.
[2024-05-24 03:36:29] [INFO ] Deduced a trap composed of 34 places in 268 ms of which 3 ms to minimize.
[2024-05-24 03:36:30] [INFO ] Deduced a trap composed of 59 places in 286 ms of which 3 ms to minimize.
[2024-05-24 03:36:30] [INFO ] Deduced a trap composed of 56 places in 301 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-24 03:36:33] [INFO ] Deduced a trap composed of 61 places in 199 ms of which 3 ms to minimize.
[2024-05-24 03:36:34] [INFO ] Deduced a trap composed of 48 places in 220 ms of which 3 ms to minimize.
[2024-05-24 03:36:34] [INFO ] Deduced a trap composed of 54 places in 256 ms of which 4 ms to minimize.
[2024-05-24 03:36:34] [INFO ] Deduced a trap composed of 73 places in 232 ms of which 3 ms to minimize.
[2024-05-24 03:36:34] [INFO ] Deduced a trap composed of 62 places in 228 ms of which 3 ms to minimize.
[2024-05-24 03:36:35] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/613 variables, and 105 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 86/86 constraints]
After SMT, in 60668ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 60683ms
Starting structural reductions in SI_CTL mode, iteration 1 : 235/398 places, 972/1200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62484 ms. Remains : 235/398 places, 972/1200 transitions.
[2024-05-24 03:36:35] [INFO ] Flatten gal took : 34 ms
[2024-05-24 03:36:35] [INFO ] Flatten gal took : 39 ms
[2024-05-24 03:36:35] [INFO ] Input system was already deterministic with 972 transitions.
[2024-05-24 03:36:35] [INFO ] Flatten gal took : 39 ms
[2024-05-24 03:36:35] [INFO ] Flatten gal took : 39 ms
[2024-05-24 03:36:35] [INFO ] Time to serialize gal into /tmp/CTLFireability11107864310770835970.gal : 6 ms
[2024-05-24 03:36:35] [INFO ] Time to serialize properties into /tmp/CTLFireability11930139310022133996.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/CTLFireability11107864310770835970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11930139310022133996.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 03:37:05] [INFO ] Flatten gal took : 24 ms
[2024-05-24 03:37:05] [INFO ] Applying decomposition
[2024-05-24 03:37:05] [INFO ] Flatten gal took : 23 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/graph5499068785810989813.txt' '-o' '/tmp/graph5499068785810989813.bin' '-w' '/tmp/graph5499068785810989813.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5499068785810989813.bin' '-l' '-1' '-v' '-w' '/tmp/graph5499068785810989813.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:37:05] [INFO ] Decomposing Gal with order
[2024-05-24 03:37:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:37:05] [INFO ] Removed a total of 1808 redundant transitions.
[2024-05-24 03:37:05] [INFO ] Flatten gal took : 93 ms
[2024-05-24 03:37:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 356 labels/synchronizations in 31 ms.
[2024-05-24 03:37:05] [INFO ] Time to serialize gal into /tmp/CTLFireability8819217938871890511.gal : 11 ms
[2024-05-24 03:37:05] [INFO ] Time to serialize properties into /tmp/CTLFireability12613374886636008173.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/CTLFireability8819217938871890511.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12613374886636008173.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 398/398 places, 1200/1200 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 0 with 6 rules applied. Total rules applied 6 place count 398 transition count 1194
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 392 transition count 1194
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 12 place count 392 transition count 1083
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 234 place count 281 transition count 1083
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 245 place count 270 transition count 1017
Iterating global reduction 2 with 11 rules applied. Total rules applied 256 place count 270 transition count 1017
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 316 place count 240 transition count 987
Applied a total of 316 rules in 76 ms. Remains 240 /398 variables (removed 158) and now considering 987/1200 (removed 213) transitions.
[2024-05-24 03:37:36] [INFO ] Flow matrix only has 393 transitions (discarded 594 similar events)
// Phase 1: matrix 393 rows 240 cols
[2024-05-24 03:37:36] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 03:37:36] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-24 03:37:36] [INFO ] Flow matrix only has 393 transitions (discarded 594 similar events)
[2024-05-24 03:37:36] [INFO ] Invariant cache hit.
[2024-05-24 03:37:36] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-24 03:37:37] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 1500 ms to find 0 implicit places.
[2024-05-24 03:37:37] [INFO ] Redundant transitions in 17 ms returned []
Running 981 sub problems to find dead transitions.
[2024-05-24 03:37:37] [INFO ] Flow matrix only has 393 transitions (discarded 594 similar events)
[2024-05-24 03:37:37] [INFO ] Invariant cache hit.
[2024-05-24 03:37:37] [INFO ] State equation strengthened by 179 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 981 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 981 unsolved
[2024-05-24 03:37:47] [INFO ] Deduced a trap composed of 3 places in 261 ms of which 4 ms to minimize.
[2024-05-24 03:37:47] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 2 ms to minimize.
[2024-05-24 03:37:47] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:37:48] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:37:48] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 3 ms to minimize.
[2024-05-24 03:37:49] [INFO ] Deduced a trap composed of 44 places in 201 ms of which 3 ms to minimize.
[2024-05-24 03:37:49] [INFO ] Deduced a trap composed of 52 places in 246 ms of which 4 ms to minimize.
[2024-05-24 03:37:49] [INFO ] Deduced a trap composed of 76 places in 251 ms of which 4 ms to minimize.
[2024-05-24 03:37:50] [INFO ] Deduced a trap composed of 47 places in 251 ms of which 3 ms to minimize.
[2024-05-24 03:37:50] [INFO ] Deduced a trap composed of 57 places in 232 ms of which 3 ms to minimize.
[2024-05-24 03:37:50] [INFO ] Deduced a trap composed of 70 places in 232 ms of which 4 ms to minimize.
[2024-05-24 03:37:50] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 3 ms to minimize.
[2024-05-24 03:37:51] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 3 ms to minimize.
[2024-05-24 03:37:51] [INFO ] Deduced a trap composed of 59 places in 230 ms of which 3 ms to minimize.
[2024-05-24 03:37:51] [INFO ] Deduced a trap composed of 18 places in 251 ms of which 3 ms to minimize.
[2024-05-24 03:37:51] [INFO ] Deduced a trap composed of 55 places in 244 ms of which 3 ms to minimize.
[2024-05-24 03:37:51] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:37:52] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:37:52] [INFO ] Deduced a trap composed of 55 places in 212 ms of which 3 ms to minimize.
[2024-05-24 03:37:52] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 981 unsolved
[2024-05-24 03:37:53] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 3 ms to minimize.
[2024-05-24 03:37:54] [INFO ] Deduced a trap composed of 48 places in 235 ms of which 3 ms to minimize.
[2024-05-24 03:37:54] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 3 ms to minimize.
[2024-05-24 03:37:54] [INFO ] Deduced a trap composed of 57 places in 236 ms of which 4 ms to minimize.
[2024-05-24 03:37:54] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 4 ms to minimize.
[2024-05-24 03:37:55] [INFO ] Deduced a trap composed of 55 places in 258 ms of which 3 ms to minimize.
[2024-05-24 03:37:55] [INFO ] Deduced a trap composed of 86 places in 251 ms of which 3 ms to minimize.
[2024-05-24 03:37:55] [INFO ] Deduced a trap composed of 60 places in 236 ms of which 3 ms to minimize.
[2024-05-24 03:37:55] [INFO ] Deduced a trap composed of 59 places in 224 ms of which 3 ms to minimize.
[2024-05-24 03:37:56] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 4 ms to minimize.
[2024-05-24 03:37:56] [INFO ] Deduced a trap composed of 53 places in 211 ms of which 3 ms to minimize.
[2024-05-24 03:37:56] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:37:56] [INFO ] Deduced a trap composed of 52 places in 238 ms of which 3 ms to minimize.
[2024-05-24 03:37:57] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 3 ms to minimize.
[2024-05-24 03:37:57] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 3 ms to minimize.
[2024-05-24 03:37:57] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 4 ms to minimize.
[2024-05-24 03:37:57] [INFO ] Deduced a trap composed of 25 places in 270 ms of which 3 ms to minimize.
[2024-05-24 03:37:58] [INFO ] Deduced a trap composed of 21 places in 275 ms of which 4 ms to minimize.
[2024-05-24 03:37:58] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 3 ms to minimize.
[2024-05-24 03:37:58] [INFO ] Deduced a trap composed of 45 places in 226 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 981 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/633 variables, and 59 constraints, problems are : Problem set: 0 solved, 981 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/240 constraints, ReadFeed: 0/179 constraints, PredecessorRefiner: 981/981 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 981 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 981 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 981 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 981 unsolved
[2024-05-24 03:38:11] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:38:11] [INFO ] Deduced a trap composed of 53 places in 164 ms of which 2 ms to minimize.
[2024-05-24 03:38:11] [INFO ] Deduced a trap composed of 47 places in 272 ms of which 3 ms to minimize.
[2024-05-24 03:38:12] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 2 ms to minimize.
[2024-05-24 03:38:12] [INFO ] Deduced a trap composed of 22 places in 301 ms of which 4 ms to minimize.
[2024-05-24 03:38:12] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-24 03:38:12] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 3 ms to minimize.
[2024-05-24 03:38:13] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 3 ms to minimize.
[2024-05-24 03:38:13] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 3 ms to minimize.
[2024-05-24 03:38:13] [INFO ] Deduced a trap composed of 60 places in 294 ms of which 4 ms to minimize.
[2024-05-24 03:38:13] [INFO ] Deduced a trap composed of 71 places in 263 ms of which 4 ms to minimize.
[2024-05-24 03:38:14] [INFO ] Deduced a trap composed of 58 places in 264 ms of which 4 ms to minimize.
[2024-05-24 03:38:14] [INFO ] Deduced a trap composed of 54 places in 242 ms of which 3 ms to minimize.
[2024-05-24 03:38:14] [INFO ] Deduced a trap composed of 58 places in 259 ms of which 4 ms to minimize.
[2024-05-24 03:38:14] [INFO ] Deduced a trap composed of 56 places in 264 ms of which 3 ms to minimize.
[2024-05-24 03:38:15] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 3 ms to minimize.
[2024-05-24 03:38:15] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 4 ms to minimize.
[2024-05-24 03:38:15] [INFO ] Deduced a trap composed of 35 places in 301 ms of which 4 ms to minimize.
[2024-05-24 03:38:16] [INFO ] Deduced a trap composed of 47 places in 293 ms of which 4 ms to minimize.
[2024-05-24 03:38:16] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 981 unsolved
[2024-05-24 03:38:18] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 3 ms to minimize.
[2024-05-24 03:38:18] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 3 ms to minimize.
[2024-05-24 03:38:19] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 3 ms to minimize.
[2024-05-24 03:38:21] [INFO ] Deduced a trap composed of 52 places in 244 ms of which 3 ms to minimize.
[2024-05-24 03:38:21] [INFO ] Deduced a trap composed of 51 places in 233 ms of which 4 ms to minimize.
[2024-05-24 03:38:22] [INFO ] Deduced a trap composed of 59 places in 256 ms of which 3 ms to minimize.
[2024-05-24 03:38:22] [INFO ] Deduced a trap composed of 62 places in 278 ms of which 4 ms to minimize.
[2024-05-24 03:38:23] [INFO ] Deduced a trap composed of 53 places in 261 ms of which 3 ms to minimize.
[2024-05-24 03:38:23] [INFO ] Deduced a trap composed of 57 places in 237 ms of which 3 ms to minimize.
[2024-05-24 03:38:23] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 3 ms to minimize.
[2024-05-24 03:38:24] [INFO ] Deduced a trap composed of 63 places in 207 ms of which 3 ms to minimize.
[2024-05-24 03:38:24] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 3 ms to minimize.
[2024-05-24 03:38:24] [INFO ] Deduced a trap composed of 81 places in 280 ms of which 4 ms to minimize.
[2024-05-24 03:38:25] [INFO ] Deduced a trap composed of 78 places in 187 ms of which 3 ms to minimize.
[2024-05-24 03:38:25] [INFO ] Deduced a trap composed of 71 places in 248 ms of which 4 ms to minimize.
[2024-05-24 03:38:25] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 3 ms to minimize.
[2024-05-24 03:38:25] [INFO ] Deduced a trap composed of 60 places in 178 ms of which 3 ms to minimize.
[2024-05-24 03:38:26] [INFO ] Deduced a trap composed of 56 places in 219 ms of which 4 ms to minimize.
[2024-05-24 03:38:26] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 3 ms to minimize.
[2024-05-24 03:38:26] [INFO ] Deduced a trap composed of 56 places in 238 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 981 unsolved
[2024-05-24 03:38:28] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 4 ms to minimize.
[2024-05-24 03:38:28] [INFO ] Deduced a trap composed of 52 places in 234 ms of which 3 ms to minimize.
[2024-05-24 03:38:29] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 3 ms to minimize.
[2024-05-24 03:38:30] [INFO ] Deduced a trap composed of 48 places in 233 ms of which 4 ms to minimize.
[2024-05-24 03:38:33] [INFO ] Deduced a trap composed of 57 places in 246 ms of which 3 ms to minimize.
[2024-05-24 03:38:34] [INFO ] Deduced a trap composed of 53 places in 188 ms of which 2 ms to minimize.
[2024-05-24 03:38:34] [INFO ] Deduced a trap composed of 30 places in 249 ms of which 4 ms to minimize.
[2024-05-24 03:38:35] [INFO ] Deduced a trap composed of 71 places in 264 ms of which 3 ms to minimize.
[2024-05-24 03:38:36] [INFO ] Deduced a trap composed of 48 places in 219 ms of which 3 ms to minimize.
[2024-05-24 03:38:36] [INFO ] Deduced a trap composed of 61 places in 248 ms of which 4 ms to minimize.
[2024-05-24 03:38:36] [INFO ] Deduced a trap composed of 50 places in 248 ms of which 3 ms to minimize.
[2024-05-24 03:38:37] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 4 ms to minimize.
[2024-05-24 03:38:37] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 3 ms to minimize.
[2024-05-24 03:38:37] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 3 ms to minimize.
[2024-05-24 03:38:38] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-24 03:38:38] [INFO ] Deduced a trap composed of 64 places in 239 ms of which 2 ms to minimize.
SMT process timed out in 60869ms, After SMT, problems are : Problem set: 0 solved, 981 unsolved
Search for dead transitions found 0 dead transitions in 60887ms
Starting structural reductions in SI_CTL mode, iteration 1 : 240/398 places, 987/1200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62490 ms. Remains : 240/398 places, 987/1200 transitions.
[2024-05-24 03:38:38] [INFO ] Flatten gal took : 34 ms
[2024-05-24 03:38:38] [INFO ] Flatten gal took : 40 ms
[2024-05-24 03:38:38] [INFO ] Input system was already deterministic with 987 transitions.
[2024-05-24 03:38:38] [INFO ] Flatten gal took : 38 ms
[2024-05-24 03:38:38] [INFO ] Flatten gal took : 40 ms
[2024-05-24 03:38:38] [INFO ] Time to serialize gal into /tmp/CTLFireability4920085850220021669.gal : 6 ms
[2024-05-24 03:38:38] [INFO ] Time to serialize properties into /tmp/CTLFireability8533149698789239872.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/CTLFireability4920085850220021669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8533149698789239872.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 03:39:08] [INFO ] Flatten gal took : 24 ms
[2024-05-24 03:39:08] [INFO ] Applying decomposition
[2024-05-24 03:39:08] [INFO ] Flatten gal took : 24 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/graph13157606418426475500.txt' '-o' '/tmp/graph13157606418426475500.bin' '-w' '/tmp/graph13157606418426475500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13157606418426475500.bin' '-l' '-1' '-v' '-w' '/tmp/graph13157606418426475500.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:39:08] [INFO ] Decomposing Gal with order
[2024-05-24 03:39:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:39:08] [INFO ] Removed a total of 1824 redundant transitions.
[2024-05-24 03:39:08] [INFO ] Flatten gal took : 59 ms
[2024-05-24 03:39:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 369 labels/synchronizations in 22 ms.
[2024-05-24 03:39:08] [INFO ] Time to serialize gal into /tmp/CTLFireability13892510976669928383.gal : 7 ms
[2024-05-24 03:39:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10901839565218449608.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/CTLFireability13892510976669928383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10901839565218449608.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 398/398 places, 1200/1200 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 0 with 6 rules applied. Total rules applied 6 place count 398 transition count 1194
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 392 transition count 1194
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 392 transition count 1080
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 278 transition count 1080
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 254 place count 264 transition count 996
Iterating global reduction 2 with 14 rules applied. Total rules applied 268 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 328 place count 234 transition count 966
Applied a total of 328 rules in 61 ms. Remains 234 /398 variables (removed 164) and now considering 966/1200 (removed 234) transitions.
[2024-05-24 03:39:39] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-05-24 03:39:39] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 03:39:39] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-24 03:39:39] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:39:39] [INFO ] Invariant cache hit.
[2024-05-24 03:39:39] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 03:39:40] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
[2024-05-24 03:39:40] [INFO ] Redundant transitions in 11 ms returned []
Running 960 sub problems to find dead transitions.
[2024-05-24 03:39:40] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:39:40] [INFO ] Invariant cache hit.
[2024-05-24 03:39:40] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:39:49] [INFO ] Deduced a trap composed of 3 places in 272 ms of which 4 ms to minimize.
[2024-05-24 03:39:50] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2024-05-24 03:39:50] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:39:50] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:39:50] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 3 ms to minimize.
[2024-05-24 03:39:51] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 3 ms to minimize.
[2024-05-24 03:39:51] [INFO ] Deduced a trap composed of 67 places in 224 ms of which 3 ms to minimize.
[2024-05-24 03:39:51] [INFO ] Deduced a trap composed of 58 places in 242 ms of which 3 ms to minimize.
[2024-05-24 03:39:52] [INFO ] Deduced a trap composed of 27 places in 265 ms of which 4 ms to minimize.
[2024-05-24 03:39:52] [INFO ] Deduced a trap composed of 28 places in 253 ms of which 4 ms to minimize.
[2024-05-24 03:39:52] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-05-24 03:39:52] [INFO ] Deduced a trap composed of 53 places in 230 ms of which 3 ms to minimize.
[2024-05-24 03:39:53] [INFO ] Deduced a trap composed of 70 places in 200 ms of which 4 ms to minimize.
[2024-05-24 03:39:53] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-05-24 03:39:53] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:39:53] [INFO ] Deduced a trap composed of 48 places in 238 ms of which 4 ms to minimize.
[2024-05-24 03:39:53] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 3 ms to minimize.
[2024-05-24 03:39:54] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 3 ms to minimize.
[2024-05-24 03:39:54] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-24 03:39:54] [INFO ] Deduced a trap composed of 19 places in 281 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:39:56] [INFO ] Deduced a trap composed of 54 places in 207 ms of which 4 ms to minimize.
[2024-05-24 03:39:57] [INFO ] Deduced a trap composed of 45 places in 235 ms of which 4 ms to minimize.
[2024-05-24 03:39:57] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 4 ms to minimize.
[2024-05-24 03:39:57] [INFO ] Deduced a trap composed of 34 places in 250 ms of which 3 ms to minimize.
[2024-05-24 03:39:57] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 3 ms to minimize.
[2024-05-24 03:39:58] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 3 ms to minimize.
[2024-05-24 03:39:58] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 3 ms to minimize.
[2024-05-24 03:39:58] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2024-05-24 03:39:59] [INFO ] Deduced a trap composed of 41 places in 251 ms of which 3 ms to minimize.
[2024-05-24 03:40:00] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 3 ms to minimize.
[2024-05-24 03:40:00] [INFO ] Deduced a trap composed of 47 places in 227 ms of which 3 ms to minimize.
[2024-05-24 03:40:00] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 3 ms to minimize.
[2024-05-24 03:40:00] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 3 ms to minimize.
[2024-05-24 03:40:01] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 3 ms to minimize.
[2024-05-24 03:40:02] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 4 ms to minimize.
[2024-05-24 03:40:02] [INFO ] Deduced a trap composed of 46 places in 208 ms of which 3 ms to minimize.
[2024-05-24 03:40:03] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 3 ms to minimize.
[2024-05-24 03:40:03] [INFO ] Deduced a trap composed of 53 places in 213 ms of which 3 ms to minimize.
[2024-05-24 03:40:03] [INFO ] Deduced a trap composed of 49 places in 259 ms of which 3 ms to minimize.
[2024-05-24 03:40:03] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 59 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:40:14] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 3 ms to minimize.
[2024-05-24 03:40:14] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 4 ms to minimize.
[2024-05-24 03:40:14] [INFO ] Deduced a trap composed of 39 places in 258 ms of which 3 ms to minimize.
[2024-05-24 03:40:15] [INFO ] Deduced a trap composed of 36 places in 294 ms of which 4 ms to minimize.
[2024-05-24 03:40:15] [INFO ] Deduced a trap composed of 58 places in 260 ms of which 4 ms to minimize.
[2024-05-24 03:40:16] [INFO ] Deduced a trap composed of 54 places in 303 ms of which 4 ms to minimize.
[2024-05-24 03:40:16] [INFO ] Deduced a trap composed of 51 places in 307 ms of which 4 ms to minimize.
[2024-05-24 03:40:16] [INFO ] Deduced a trap composed of 44 places in 305 ms of which 4 ms to minimize.
[2024-05-24 03:40:17] [INFO ] Deduced a trap composed of 36 places in 264 ms of which 4 ms to minimize.
[2024-05-24 03:40:17] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 3 ms to minimize.
[2024-05-24 03:40:17] [INFO ] Deduced a trap composed of 56 places in 253 ms of which 3 ms to minimize.
[2024-05-24 03:40:17] [INFO ] Deduced a trap composed of 17 places in 291 ms of which 4 ms to minimize.
[2024-05-24 03:40:18] [INFO ] Deduced a trap composed of 53 places in 267 ms of which 3 ms to minimize.
[2024-05-24 03:40:18] [INFO ] Deduced a trap composed of 35 places in 250 ms of which 3 ms to minimize.
[2024-05-24 03:40:18] [INFO ] Deduced a trap composed of 36 places in 237 ms of which 3 ms to minimize.
[2024-05-24 03:40:19] [INFO ] Deduced a trap composed of 36 places in 251 ms of which 3 ms to minimize.
[2024-05-24 03:40:19] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 3 ms to minimize.
[2024-05-24 03:40:19] [INFO ] Deduced a trap composed of 61 places in 250 ms of which 3 ms to minimize.
[2024-05-24 03:40:19] [INFO ] Deduced a trap composed of 43 places in 283 ms of which 3 ms to minimize.
[2024-05-24 03:40:20] [INFO ] Deduced a trap composed of 34 places in 256 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:40:23] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:40:26] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 3 ms to minimize.
[2024-05-24 03:40:26] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 3 ms to minimize.
[2024-05-24 03:40:26] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-24 03:40:26] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:40:27] [INFO ] Deduced a trap composed of 45 places in 304 ms of which 4 ms to minimize.
[2024-05-24 03:40:28] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 2 ms to minimize.
[2024-05-24 03:40:28] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 2 ms to minimize.
[2024-05-24 03:40:28] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 2 ms to minimize.
[2024-05-24 03:40:28] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 3 ms to minimize.
[2024-05-24 03:40:28] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 2 ms to minimize.
[2024-05-24 03:40:28] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2024-05-24 03:40:29] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:40:29] [INFO ] Deduced a trap composed of 53 places in 218 ms of which 3 ms to minimize.
[2024-05-24 03:40:29] [INFO ] Deduced a trap composed of 54 places in 199 ms of which 3 ms to minimize.
[2024-05-24 03:40:29] [INFO ] Deduced a trap composed of 60 places in 176 ms of which 2 ms to minimize.
[2024-05-24 03:40:29] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 2 ms to minimize.
[2024-05-24 03:40:30] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 2 ms to minimize.
[2024-05-24 03:40:30] [INFO ] Deduced a trap composed of 51 places in 287 ms of which 4 ms to minimize.
[2024-05-24 03:40:31] [INFO ] Deduced a trap composed of 64 places in 275 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:40:38] [INFO ] Deduced a trap composed of 44 places in 239 ms of which 4 ms to minimize.
[2024-05-24 03:40:38] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 3 ms to minimize.
[2024-05-24 03:40:38] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 3 ms to minimize.
[2024-05-24 03:40:39] [INFO ] Deduced a trap composed of 45 places in 250 ms of which 4 ms to minimize.
[2024-05-24 03:40:39] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 3 ms to minimize.
[2024-05-24 03:40:39] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 4 ms to minimize.
[2024-05-24 03:40:39] [INFO ] Deduced a trap composed of 44 places in 256 ms of which 4 ms to minimize.
[2024-05-24 03:40:40] [INFO ] Deduced a trap composed of 46 places in 249 ms of which 4 ms to minimize.
[2024-05-24 03:40:41] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 3 ms to minimize.
SMT process timed out in 60661ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60672ms
Starting structural reductions in SI_CTL mode, iteration 1 : 234/398 places, 966/1200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62104 ms. Remains : 234/398 places, 966/1200 transitions.
[2024-05-24 03:40:41] [INFO ] Flatten gal took : 34 ms
[2024-05-24 03:40:41] [INFO ] Flatten gal took : 39 ms
[2024-05-24 03:40:41] [INFO ] Input system was already deterministic with 966 transitions.
[2024-05-24 03:40:41] [INFO ] Flatten gal took : 23 ms
[2024-05-24 03:40:41] [INFO ] Flatten gal took : 22 ms
[2024-05-24 03:40:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9367619504013352057.gal : 4 ms
[2024-05-24 03:40:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17353648195515581988.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9367619504013352057.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17353648195515581988.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (8 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality17353648195515581988.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 26
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :26 after 51
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :51 after 199
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :199 after 372
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :372 after 728
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :728 after 2771
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2771 after 4196
Interrupted probabilistic random walk after 614404 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 1
Probabilistic random walk after 614404 steps, saw 151966 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
[2024-05-24 03:40:44] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:40:44] [INFO ] Invariant cache hit.
[2024-05-24 03:40:44] [INFO ] State equation strengthened by 164 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/82 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 164/246 variables, 82/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/318 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 17/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 112/430 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/438 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 168/606 variables, 120/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/606 variables, 121/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/606 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/82 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 164/246 variables, 82/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/318 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 17/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 112/430 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/438 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:40:44] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:40:45] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:40:45] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:40:45] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/438 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:40:45] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 168/606 variables, 120/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 121/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:40:45] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:40:45] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/606 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 865 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1149ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 24 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 234/234 places, 966/966 transitions.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4196 after 14298
RANDOM walk for 400000 steps (8 resets) in 1179 ms. (338 steps per ms) remains 1/3 properties
Running SMT prover for 1 properties.
[2024-05-24 03:40:45] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:40:45] [INFO ] Invariant cache hit.
[2024-05-24 03:40:46] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 03:40:46] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 03:40:46] [INFO ] After 140ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 03:40:46] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 03:40:46] [INFO ] After 34ms SMT Verify possible using 164 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 03:40:46] [INFO ] After 69ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 03:40:46] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 03:40:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-24 03:40:46] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 03:40:46] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 03:40:46] [INFO ] After 28ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 03:40:46] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:40:46] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:40:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
TRAPS : Iteration 1
[2024-05-24 03:40:46] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 03:40:46] [INFO ] After 416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (8 resets) in 11444 ms. (349 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2811 ms. (1422 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :14298 after 24614
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :24614 after 77940
Interrupted probabilistic random walk after 2055053 steps, run timeout after 9001 ms. (steps per millisecond=228 ) properties seen :0 out of 1
Probabilistic random walk after 2055053 steps, saw 421763 distinct states, run finished after 9001 ms. (steps per millisecond=228 ) properties seen :0
[2024-05-24 03:40:59] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:40:59] [INFO ] Invariant cache hit.
[2024-05-24 03:40:59] [INFO ] State equation strengthened by 164 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/82 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 164/246 variables, 82/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/318 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 17/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 112/430 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/438 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 168/606 variables, 120/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/606 variables, 121/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/606 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/82 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 164/246 variables, 82/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/318 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 17/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 112/430 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/438 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:40:59] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:40:59] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
[2024-05-24 03:41:00] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:41:00] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/438 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:41:00] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 168/606 variables, 120/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 121/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:41:00] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:41:00] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/606 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 867 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1152ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 27 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 22 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-05-24 03:41:00] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:41:00] [INFO ] Invariant cache hit.
[2024-05-24 03:41:00] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-24 03:41:00] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:41:00] [INFO ] Invariant cache hit.
[2024-05-24 03:41:01] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 03:41:01] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1190 ms to find 0 implicit places.
[2024-05-24 03:41:01] [INFO ] Redundant transitions in 11 ms returned []
Running 960 sub problems to find dead transitions.
[2024-05-24 03:41:01] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:41:01] [INFO ] Invariant cache hit.
[2024-05-24 03:41:01] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:41:08] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
[2024-05-24 03:41:08] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:41:08] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:41:08] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:41:08] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:41:09] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-05-24 03:41:09] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 2 ms to minimize.
[2024-05-24 03:41:09] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 2 ms to minimize.
[2024-05-24 03:41:09] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-05-24 03:41:09] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 2 ms to minimize.
[2024-05-24 03:41:10] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:41:10] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 2 ms to minimize.
[2024-05-24 03:41:10] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2024-05-24 03:41:10] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:41:10] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:41:10] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 2 ms to minimize.
[2024-05-24 03:41:10] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 3 ms to minimize.
[2024-05-24 03:41:11] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 2 ms to minimize.
[2024-05-24 03:41:11] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:41:11] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:41:12] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 2 ms to minimize.
[2024-05-24 03:41:13] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 2 ms to minimize.
[2024-05-24 03:41:13] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 1 ms to minimize.
[2024-05-24 03:41:13] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 2 ms to minimize.
[2024-05-24 03:41:13] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:41:13] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-24 03:41:13] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 3 ms to minimize.
[2024-05-24 03:41:13] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:41:14] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2024-05-24 03:41:14] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-05-24 03:41:15] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 2 ms to minimize.
[2024-05-24 03:41:15] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 1 ms to minimize.
[2024-05-24 03:41:15] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-05-24 03:41:15] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :77940 after 321916
[2024-05-24 03:41:16] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 3 ms to minimize.
[2024-05-24 03:41:16] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:41:16] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 2 ms to minimize.
[2024-05-24 03:41:16] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 2 ms to minimize.
[2024-05-24 03:41:16] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2024-05-24 03:41:17] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:41:24] [INFO ] Deduced a trap composed of 60 places in 149 ms of which 2 ms to minimize.
[2024-05-24 03:41:24] [INFO ] Deduced a trap composed of 60 places in 180 ms of which 3 ms to minimize.
[2024-05-24 03:41:24] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 3 ms to minimize.
[2024-05-24 03:41:24] [INFO ] Deduced a trap composed of 56 places in 179 ms of which 2 ms to minimize.
[2024-05-24 03:41:24] [INFO ] Deduced a trap composed of 63 places in 131 ms of which 3 ms to minimize.
[2024-05-24 03:41:24] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2024-05-24 03:41:25] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 2 ms to minimize.
[2024-05-24 03:41:25] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 2 ms to minimize.
[2024-05-24 03:41:25] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-05-24 03:41:25] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 2 ms to minimize.
[2024-05-24 03:41:25] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
[2024-05-24 03:41:25] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 2 ms to minimize.
[2024-05-24 03:41:25] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 2 ms to minimize.
[2024-05-24 03:41:26] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 2 ms to minimize.
[2024-05-24 03:41:26] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
[2024-05-24 03:41:26] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 2 ms to minimize.
[2024-05-24 03:41:26] [INFO ] Deduced a trap composed of 66 places in 146 ms of which 2 ms to minimize.
[2024-05-24 03:41:27] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 2 ms to minimize.
[2024-05-24 03:41:27] [INFO ] Deduced a trap composed of 66 places in 134 ms of which 2 ms to minimize.
[2024-05-24 03:41:27] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:41:28] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-05-24 03:41:31] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:41:31] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 3 ms to minimize.
[2024-05-24 03:41:32] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 2 ms to minimize.
[2024-05-24 03:41:32] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 2 ms to minimize.
SMT process timed out in 30453ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 30464ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31696 ms. Remains : 234/234 places, 966/966 transitions.
RANDOM walk for 400000 steps (8 resets) in 989 ms. (404 steps per ms) remains 1/3 properties
Running SMT prover for 1 properties.
[2024-05-24 03:41:32] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:41:32] [INFO ] Invariant cache hit.
[2024-05-24 03:41:32] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-24 03:41:32] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 03:41:32] [INFO ] After 155ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 03:41:32] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 03:41:32] [INFO ] After 34ms SMT Verify possible using 164 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 03:41:32] [INFO ] After 68ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 03:41:32] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 03:41:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-24 03:41:32] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 03:41:33] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 03:41:33] [INFO ] After 29ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 03:41:33] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-05-24 03:41:33] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:41:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
TRAPS : Iteration 1
[2024-05-24 03:41:33] [INFO ] After 225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 03:41:33] [INFO ] After 423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 1613 steps (0 resets) in 7 ms. (201 steps per ms) remains 0/1 properties
RANDOM walk for 1666 steps (0 resets) in 9 ms. (166 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 36244 steps, run visited all 1 properties in 174 ms. (steps per millisecond=208 )
Probabilistic random walk after 36244 steps, saw 20427 distinct states, run finished after 184 ms. (steps per millisecond=196 ) properties seen :1
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 245 place count 79 transition count 163
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 274 place count 79 transition count 134
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 282 place count 75 transition count 134
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 286 place count 75 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 291 place count 75 transition count 125
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 322 place count 75 transition count 94
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 353 place count 44 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 359 place count 44 transition count 94
Applied a total of 359 rules in 32 ms. Remains 44 /234 variables (removed 190) and now considering 94/966 (removed 872) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 44 cols
[2024-05-24 03:41:33] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 03:41:33] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 03:41:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-24 03:41:33] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 03:41:33] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 03:41:33] [INFO ] After 7ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 03:41:33] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 03:41:33] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-24 03:41:33] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:41:33] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:41:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4422344624489397687.gal : 1 ms
[2024-05-24 03:41:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12391100192229825577.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4422344624489397687.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12391100192229825577.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12391100192229825577.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 32
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :32 after 67
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :67 after 84
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :84 after 359
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :359 after 22500
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,135000,0.023569,4312,2,130,11,1377,7,0,277,881,0
Total reachable state count : 135000
Verifying 1 reachability properties.
Invariant property EisenbergMcGuire-PT-06-CTLFireability-2024-10 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-06-CTLFireability-2024-10,375,0.02421,4688,2,78,11,1377,7,0,281,881,0
Over-approximation ignoring read arcs solved 0 properties in 191 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 03:41:33] [INFO ] Flatten gal took : 25 ms
[2024-05-24 03:41:33] [INFO ] Applying decomposition
[2024-05-24 03:41:33] [INFO ] Flatten gal took : 25 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/graph16836063886572595708.txt' '-o' '/tmp/graph16836063886572595708.bin' '-w' '/tmp/graph16836063886572595708.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16836063886572595708.bin' '-l' '-1' '-v' '-w' '/tmp/graph16836063886572595708.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:41:33] [INFO ] Decomposing Gal with order
[2024-05-24 03:41:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:41:34] [INFO ] Removed a total of 1803 redundant transitions.
[2024-05-24 03:41:34] [INFO ] Flatten gal took : 58 ms
[2024-05-24 03:41:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 329 labels/synchronizations in 17 ms.
[2024-05-24 03:41:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1318514855963237320.gal : 9 ms
[2024-05-24 03:41:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12635323633206270861.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1318514855963237320.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12635323633206270861.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12635323633206270861.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 500
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :500 after 56457
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :56457 after 76677
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :76677 after 1.30129e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.16998e+07 after 1.16998e+07
Invariant property EisenbergMcGuire-PT-06-CTLFireability-2024-10 does not hold.
FORMULA EisenbergMcGuire-PT-06-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.79886e+07,396.92,3223080,109353,9313,4.18185e+06,107099,1861,8.83279e+06,315,1.14684e+06,0
Total reachable state count : 27988612
Verifying 1 reachability properties.
Invariant property EisenbergMcGuire-PT-06-CTLFireability-2024-10 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-06-CTLFireability-2024-10,76977,398.22,3223080,934,472,4.18185e+06,107099,1879,8.83279e+06,323,1.14684e+06,0
[2024-05-24 03:48:12] [INFO ] Flatten gal took : 23 ms
[2024-05-24 03:48:12] [INFO ] Flatten gal took : 23 ms
[2024-05-24 03:48:12] [INFO ] Time to serialize gal into /tmp/CTLFireability4920199927981144891.gal : 4 ms
[2024-05-24 03:48:13] [INFO ] Time to serialize properties into /tmp/CTLFireability7858526287986983946.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/CTLFireability4920199927981144891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7858526287986983946.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 0 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 384 transition count 1116
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 384 transition count 1116
Applied a total of 28 rules in 17 ms. Remains 384 /398 variables (removed 14) and now considering 1116/1200 (removed 84) transitions.
[2024-05-24 03:48:43] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 03:48:43] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 03:48:43] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-24 03:48:43] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 03:48:43] [INFO ] Invariant cache hit.
[2024-05-24 03:48:43] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 03:48:45] [INFO ] Implicit Places using invariants and state equation in 1778 ms returned []
Implicit Place search using SMT with State Equation took 2243 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-05-24 03:48:45] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 03:48:45] [INFO ] Invariant cache hit.
[2024-05-24 03:48:45] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 03:49:00] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 3 ms to minimize.
[2024-05-24 03:49:00] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 3 ms to minimize.
[2024-05-24 03:49:00] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 3 ms to minimize.
[2024-05-24 03:49:00] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 3 ms to minimize.
[2024-05-24 03:49:00] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 2 ms to minimize.
[2024-05-24 03:49:01] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 3 ms to minimize.
[2024-05-24 03:49:01] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 3 ms to minimize.
[2024-05-24 03:49:01] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 3 ms to minimize.
[2024-05-24 03:49:01] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 4 ms to minimize.
[2024-05-24 03:49:01] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:49:02] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 3 ms to minimize.
[2024-05-24 03:49:02] [INFO ] Deduced a trap composed of 96 places in 291 ms of which 5 ms to minimize.
[2024-05-24 03:49:02] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 3 ms to minimize.
[2024-05-24 03:49:02] [INFO ] Deduced a trap composed of 58 places in 190 ms of which 3 ms to minimize.
[2024-05-24 03:49:04] [INFO ] Deduced a trap composed of 54 places in 425 ms of which 6 ms to minimize.
[2024-05-24 03:49:04] [INFO ] Deduced a trap composed of 80 places in 329 ms of which 4 ms to minimize.
[2024-05-24 03:49:05] [INFO ] Deduced a trap composed of 72 places in 316 ms of which 5 ms to minimize.
[2024-05-24 03:49:05] [INFO ] Deduced a trap composed of 78 places in 417 ms of which 6 ms to minimize.
[2024-05-24 03:49:05] [INFO ] Deduced a trap composed of 74 places in 202 ms of which 2 ms to minimize.
[2024-05-24 03:49:06] [INFO ] Deduced a trap composed of 50 places in 233 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 03:49:06] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 2 ms to minimize.
[2024-05-24 03:49:07] [INFO ] Deduced a trap composed of 74 places in 259 ms of which 4 ms to minimize.
[2024-05-24 03:49:08] [INFO ] Deduced a trap composed of 89 places in 274 ms of which 4 ms to minimize.
[2024-05-24 03:49:09] [INFO ] Deduced a trap composed of 76 places in 353 ms of which 5 ms to minimize.
[2024-05-24 03:49:09] [INFO ] Deduced a trap composed of 86 places in 361 ms of which 5 ms to minimize.
[2024-05-24 03:49:10] [INFO ] Deduced a trap composed of 75 places in 352 ms of which 5 ms to minimize.
[2024-05-24 03:49:10] [INFO ] Deduced a trap composed of 76 places in 355 ms of which 5 ms to minimize.
[2024-05-24 03:49:10] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 6 ms to minimize.
[2024-05-24 03:49:11] [INFO ] Deduced a trap composed of 3 places in 384 ms of which 6 ms to minimize.
[2024-05-24 03:49:11] [INFO ] Deduced a trap composed of 86 places in 372 ms of which 5 ms to minimize.
[2024-05-24 03:49:11] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 3 ms to minimize.
[2024-05-24 03:49:12] [INFO ] Deduced a trap composed of 86 places in 359 ms of which 5 ms to minimize.
[2024-05-24 03:49:12] [INFO ] Deduced a trap composed of 86 places in 315 ms of which 4 ms to minimize.
[2024-05-24 03:49:13] [INFO ] Deduced a trap composed of 102 places in 399 ms of which 6 ms to minimize.
[2024-05-24 03:49:13] [INFO ] Deduced a trap composed of 72 places in 396 ms of which 5 ms to minimize.
[2024-05-24 03:49:13] [INFO ] Deduced a trap composed of 20 places in 336 ms of which 5 ms to minimize.
[2024-05-24 03:49:14] [INFO ] Deduced a trap composed of 105 places in 392 ms of which 6 ms to minimize.
[2024-05-24 03:49:14] [INFO ] Deduced a trap composed of 50 places in 402 ms of which 6 ms to minimize.
[2024-05-24 03:49:15] [INFO ] Deduced a trap composed of 77 places in 395 ms of which 6 ms to minimize.
[2024-05-24 03:49:15] [INFO ] Deduced a trap composed of 100 places in 393 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 59 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 03:49:18] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:49:18] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:49:19] [INFO ] Deduced a trap composed of 86 places in 218 ms of which 3 ms to minimize.
[2024-05-24 03:49:20] [INFO ] Deduced a trap composed of 91 places in 204 ms of which 5 ms to minimize.
[2024-05-24 03:49:20] [INFO ] Deduced a trap composed of 54 places in 216 ms of which 4 ms to minimize.
[2024-05-24 03:49:20] [INFO ] Deduced a trap composed of 70 places in 251 ms of which 4 ms to minimize.
[2024-05-24 03:49:21] [INFO ] Deduced a trap composed of 90 places in 300 ms of which 4 ms to minimize.
[2024-05-24 03:49:21] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 2 ms to minimize.
[2024-05-24 03:49:22] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
[2024-05-24 03:49:22] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:49:23] [INFO ] Deduced a trap composed of 77 places in 428 ms of which 5 ms to minimize.
[2024-05-24 03:49:23] [INFO ] Deduced a trap composed of 58 places in 417 ms of which 6 ms to minimize.
[2024-05-24 03:49:24] [INFO ] Deduced a trap composed of 98 places in 367 ms of which 5 ms to minimize.
[2024-05-24 03:49:24] [INFO ] Deduced a trap composed of 38 places in 413 ms of which 5 ms to minimize.
[2024-05-24 03:49:24] [INFO ] Deduced a trap composed of 55 places in 392 ms of which 6 ms to minimize.
[2024-05-24 03:49:25] [INFO ] Deduced a trap composed of 103 places in 331 ms of which 5 ms to minimize.
[2024-05-24 03:49:25] [INFO ] Deduced a trap composed of 108 places in 342 ms of which 5 ms to minimize.
[2024-05-24 03:49:26] [INFO ] Deduced a trap composed of 39 places in 335 ms of which 5 ms to minimize.
[2024-05-24 03:49:26] [INFO ] Deduced a trap composed of 87 places in 333 ms of which 6 ms to minimize.
[2024-05-24 03:49:26] [INFO ] Deduced a trap composed of 39 places in 419 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 03:49:27] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 3 ms to minimize.
[2024-05-24 03:49:29] [INFO ] Deduced a trap composed of 114 places in 428 ms of which 6 ms to minimize.
[2024-05-24 03:49:29] [INFO ] Deduced a trap composed of 93 places in 381 ms of which 6 ms to minimize.
[2024-05-24 03:49:30] [INFO ] Deduced a trap composed of 91 places in 271 ms of which 3 ms to minimize.
[2024-05-24 03:49:30] [INFO ] Deduced a trap composed of 93 places in 378 ms of which 6 ms to minimize.
[2024-05-24 03:49:31] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 3 ms to minimize.
[2024-05-24 03:49:31] [INFO ] Deduced a trap composed of 22 places in 266 ms of which 4 ms to minimize.
[2024-05-24 03:49:31] [INFO ] Deduced a trap composed of 84 places in 260 ms of which 3 ms to minimize.
[2024-05-24 03:49:32] [INFO ] Deduced a trap composed of 93 places in 275 ms of which 4 ms to minimize.
[2024-05-24 03:49:32] [INFO ] Deduced a trap composed of 72 places in 254 ms of which 3 ms to minimize.
[2024-05-24 03:49:32] [INFO ] Deduced a trap composed of 82 places in 269 ms of which 3 ms to minimize.
[2024-05-24 03:49:33] [INFO ] Deduced a trap composed of 69 places in 258 ms of which 4 ms to minimize.
[2024-05-24 03:49:33] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:49:33] [INFO ] Deduced a trap composed of 95 places in 219 ms of which 3 ms to minimize.
[2024-05-24 03:49:34] [INFO ] Deduced a trap composed of 96 places in 331 ms of which 4 ms to minimize.
[2024-05-24 03:49:34] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:49:36] [INFO ] Deduced a trap composed of 89 places in 388 ms of which 6 ms to minimize.
[2024-05-24 03:49:36] [INFO ] Deduced a trap composed of 103 places in 384 ms of which 5 ms to minimize.
[2024-05-24 03:49:36] [INFO ] Deduced a trap composed of 38 places in 385 ms of which 6 ms to minimize.
[2024-05-24 03:49:37] [INFO ] Deduced a trap composed of 113 places in 388 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 03:49:38] [INFO ] Deduced a trap composed of 90 places in 155 ms of which 2 ms to minimize.
[2024-05-24 03:49:41] [INFO ] Deduced a trap composed of 60 places in 239 ms of which 3 ms to minimize.
[2024-05-24 03:49:41] [INFO ] Deduced a trap composed of 41 places in 323 ms of which 5 ms to minimize.
[2024-05-24 03:49:41] [INFO ] Deduced a trap composed of 86 places in 301 ms of which 4 ms to minimize.
[2024-05-24 03:49:43] [INFO ] Deduced a trap composed of 93 places in 295 ms of which 5 ms to minimize.
[2024-05-24 03:49:43] [INFO ] Deduced a trap composed of 75 places in 388 ms of which 6 ms to minimize.
[2024-05-24 03:49:43] [INFO ] Deduced a trap composed of 78 places in 347 ms of which 5 ms to minimize.
[2024-05-24 03:49:45] [INFO ] Deduced a trap composed of 43 places in 392 ms of which 6 ms to minimize.
[2024-05-24 03:49:45] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 1)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/906 variables, and 108 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/1110 constraints, Known Traps: 89/89 constraints]
After SMT, in 60585ms problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 60597ms
Starting structural reductions in LTL mode, iteration 1 : 384/398 places, 1116/1200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62862 ms. Remains : 384/398 places, 1116/1200 transitions.
[2024-05-24 03:49:45] [INFO ] Flatten gal took : 37 ms
[2024-05-24 03:49:46] [INFO ] Flatten gal took : 43 ms
[2024-05-24 03:49:46] [INFO ] Input system was already deterministic with 1116 transitions.
[2024-05-24 03:49:46] [INFO ] Flatten gal took : 43 ms
[2024-05-24 03:49:46] [INFO ] Flatten gal took : 42 ms
[2024-05-24 03:49:46] [INFO ] Time to serialize gal into /tmp/CTLFireability1425463209256749328.gal : 7 ms
[2024-05-24 03:49:46] [INFO ] Time to serialize properties into /tmp/CTLFireability725702245558197079.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/CTLFireability1425463209256749328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability725702245558197079.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.
Detected timeout of ITS tools.
[2024-05-24 03:50:16] [INFO ] Flatten gal took : 25 ms
[2024-05-24 03:50:16] [INFO ] Applying decomposition
[2024-05-24 03:50:16] [INFO ] Flatten gal took : 26 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/graph8357272412732398435.txt' '-o' '/tmp/graph8357272412732398435.bin' '-w' '/tmp/graph8357272412732398435.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8357272412732398435.bin' '-l' '-1' '-v' '-w' '/tmp/graph8357272412732398435.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:50:16] [INFO ] Decomposing Gal with order
[2024-05-24 03:50:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:50:16] [INFO ] Removed a total of 1867 redundant transitions.
[2024-05-24 03:50:16] [INFO ] Flatten gal took : 62 ms
[2024-05-24 03:50:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 363 labels/synchronizations in 16 ms.
[2024-05-24 03:50:16] [INFO ] Time to serialize gal into /tmp/CTLFireability4458894540509924311.gal : 8 ms
[2024-05-24 03:50:16] [INFO ] Time to serialize properties into /tmp/CTLFireability11726404944128661979.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/CTLFireability4458894540509924311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11726404944128661979.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 398/398 places, 1200/1200 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 0 with 6 rules applied. Total rules applied 6 place count 398 transition count 1194
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 392 transition count 1194
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 392 transition count 1080
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 278 transition count 1080
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 254 place count 264 transition count 996
Iterating global reduction 2 with 14 rules applied. Total rules applied 268 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 328 place count 234 transition count 966
Applied a total of 328 rules in 58 ms. Remains 234 /398 variables (removed 164) and now considering 966/1200 (removed 234) transitions.
[2024-05-24 03:50:46] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-05-24 03:50:46] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 03:50:46] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-24 03:50:46] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:50:46] [INFO ] Invariant cache hit.
[2024-05-24 03:50:47] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 03:50:48] [INFO ] Implicit Places using invariants and state equation in 1355 ms returned []
Implicit Place search using SMT with State Equation took 1701 ms to find 0 implicit places.
[2024-05-24 03:50:48] [INFO ] Redundant transitions in 19 ms returned []
Running 960 sub problems to find dead transitions.
[2024-05-24 03:50:48] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:50:48] [INFO ] Invariant cache hit.
[2024-05-24 03:50:48] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:50:58] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 3 ms to minimize.
[2024-05-24 03:50:58] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-05-24 03:50:58] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:50:58] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:50:58] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 3 ms to minimize.
[2024-05-24 03:50:59] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 3 ms to minimize.
[2024-05-24 03:51:00] [INFO ] Deduced a trap composed of 67 places in 224 ms of which 4 ms to minimize.
[2024-05-24 03:51:00] [INFO ] Deduced a trap composed of 58 places in 227 ms of which 3 ms to minimize.
[2024-05-24 03:51:00] [INFO ] Deduced a trap composed of 27 places in 259 ms of which 3 ms to minimize.
[2024-05-24 03:51:00] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 4 ms to minimize.
[2024-05-24 03:51:00] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-05-24 03:51:01] [INFO ] Deduced a trap composed of 53 places in 245 ms of which 3 ms to minimize.
[2024-05-24 03:51:01] [INFO ] Deduced a trap composed of 70 places in 229 ms of which 3 ms to minimize.
[2024-05-24 03:51:01] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-24 03:51:01] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
[2024-05-24 03:51:02] [INFO ] Deduced a trap composed of 48 places in 240 ms of which 3 ms to minimize.
[2024-05-24 03:51:02] [INFO ] Deduced a trap composed of 44 places in 232 ms of which 3 ms to minimize.
[2024-05-24 03:51:02] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 3 ms to minimize.
[2024-05-24 03:51:02] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-05-24 03:51:03] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:51:05] [INFO ] Deduced a trap composed of 54 places in 218 ms of which 4 ms to minimize.
[2024-05-24 03:51:05] [INFO ] Deduced a trap composed of 45 places in 249 ms of which 3 ms to minimize.
[2024-05-24 03:51:06] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 3 ms to minimize.
[2024-05-24 03:51:06] [INFO ] Deduced a trap composed of 34 places in 233 ms of which 3 ms to minimize.
[2024-05-24 03:51:06] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 3 ms to minimize.
[2024-05-24 03:51:06] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 4 ms to minimize.
[2024-05-24 03:51:07] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 3 ms to minimize.
[2024-05-24 03:51:07] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:51:08] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 3 ms to minimize.
[2024-05-24 03:51:08] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 3 ms to minimize.
[2024-05-24 03:51:09] [INFO ] Deduced a trap composed of 47 places in 231 ms of which 4 ms to minimize.
[2024-05-24 03:51:09] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 3 ms to minimize.
[2024-05-24 03:51:09] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 3 ms to minimize.
[2024-05-24 03:51:09] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 3 ms to minimize.
[2024-05-24 03:51:10] [INFO ] Deduced a trap composed of 33 places in 271 ms of which 4 ms to minimize.
[2024-05-24 03:51:11] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 3 ms to minimize.
[2024-05-24 03:51:11] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 4 ms to minimize.
[2024-05-24 03:51:11] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 3 ms to minimize.
[2024-05-24 03:51:12] [INFO ] Deduced a trap composed of 49 places in 265 ms of which 4 ms to minimize.
[2024-05-24 03:51:12] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 59 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:51:22] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 4 ms to minimize.
[2024-05-24 03:51:22] [INFO ] Deduced a trap composed of 41 places in 259 ms of which 3 ms to minimize.
[2024-05-24 03:51:23] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 3 ms to minimize.
[2024-05-24 03:51:23] [INFO ] Deduced a trap composed of 36 places in 301 ms of which 4 ms to minimize.
[2024-05-24 03:51:23] [INFO ] Deduced a trap composed of 58 places in 260 ms of which 3 ms to minimize.
[2024-05-24 03:51:24] [INFO ] Deduced a trap composed of 54 places in 313 ms of which 3 ms to minimize.
[2024-05-24 03:51:24] [INFO ] Deduced a trap composed of 51 places in 327 ms of which 4 ms to minimize.
[2024-05-24 03:51:25] [INFO ] Deduced a trap composed of 44 places in 307 ms of which 4 ms to minimize.
[2024-05-24 03:51:25] [INFO ] Deduced a trap composed of 36 places in 274 ms of which 3 ms to minimize.
[2024-05-24 03:51:25] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 3 ms to minimize.
[2024-05-24 03:51:25] [INFO ] Deduced a trap composed of 56 places in 257 ms of which 4 ms to minimize.
[2024-05-24 03:51:26] [INFO ] Deduced a trap composed of 17 places in 298 ms of which 4 ms to minimize.
[2024-05-24 03:51:26] [INFO ] Deduced a trap composed of 53 places in 263 ms of which 3 ms to minimize.
[2024-05-24 03:51:26] [INFO ] Deduced a trap composed of 35 places in 267 ms of which 3 ms to minimize.
[2024-05-24 03:51:27] [INFO ] Deduced a trap composed of 36 places in 237 ms of which 3 ms to minimize.
[2024-05-24 03:51:27] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 3 ms to minimize.
[2024-05-24 03:51:27] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 3 ms to minimize.
[2024-05-24 03:51:27] [INFO ] Deduced a trap composed of 61 places in 256 ms of which 3 ms to minimize.
[2024-05-24 03:51:28] [INFO ] Deduced a trap composed of 43 places in 268 ms of which 4 ms to minimize.
[2024-05-24 03:51:28] [INFO ] Deduced a trap composed of 34 places in 267 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 03:51:33] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:51:36] [INFO ] Deduced a trap composed of 19 places in 294 ms of which 3 ms to minimize.
[2024-05-24 03:51:36] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 3 ms to minimize.
[2024-05-24 03:51:37] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-24 03:51:37] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:51:38] [INFO ] Deduced a trap composed of 45 places in 269 ms of which 4 ms to minimize.
[2024-05-24 03:51:38] [INFO ] Deduced a trap composed of 51 places in 252 ms of which 4 ms to minimize.
[2024-05-24 03:51:38] [INFO ] Deduced a trap composed of 45 places in 230 ms of which 4 ms to minimize.
[2024-05-24 03:51:38] [INFO ] Deduced a trap composed of 47 places in 219 ms of which 4 ms to minimize.
[2024-05-24 03:51:39] [INFO ] Deduced a trap composed of 45 places in 244 ms of which 3 ms to minimize.
[2024-05-24 03:51:39] [INFO ] Deduced a trap composed of 45 places in 219 ms of which 3 ms to minimize.
[2024-05-24 03:51:39] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 3 ms to minimize.
[2024-05-24 03:51:39] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-24 03:51:40] [INFO ] Deduced a trap composed of 53 places in 296 ms of which 3 ms to minimize.
[2024-05-24 03:51:40] [INFO ] Deduced a trap composed of 54 places in 279 ms of which 4 ms to minimize.
[2024-05-24 03:51:40] [INFO ] Deduced a trap composed of 60 places in 267 ms of which 3 ms to minimize.
[2024-05-24 03:51:40] [INFO ] Deduced a trap composed of 56 places in 258 ms of which 3 ms to minimize.
[2024-05-24 03:51:41] [INFO ] Deduced a trap composed of 53 places in 252 ms of which 3 ms to minimize.
[2024-05-24 03:51:41] [INFO ] Deduced a trap composed of 51 places in 293 ms of which 3 ms to minimize.
[2024-05-24 03:51:42] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/606 variables, and 99 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 80/80 constraints]
After SMT, in 60780ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60798ms
Starting structural reductions in SI_CTL mode, iteration 1 : 234/398 places, 966/1200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62588 ms. Remains : 234/398 places, 966/1200 transitions.
[2024-05-24 03:51:49] [INFO ] Flatten gal took : 33 ms
[2024-05-24 03:51:49] [INFO ] Flatten gal took : 40 ms
[2024-05-24 03:51:49] [INFO ] Input system was already deterministic with 966 transitions.
[2024-05-24 03:51:49] [INFO ] Flatten gal took : 40 ms
RANDOM walk for 40000 steps (8 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
[2024-05-24 03:51:49] [INFO ] Flatten gal took : 39 ms
[2024-05-24 03:51:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13076288661296677980.gal : 6 ms
[2024-05-24 03:51:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7815945647911097672.prop : 10 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13076288661296677980.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7815945647911097672.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7815945647911097672.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 26
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :26 after 51
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :51 after 199
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :199 after 372
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :372 after 728
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :728 after 2771
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2771 after 4196
Interrupted probabilistic random walk after 639086 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :0 out of 1
Probabilistic random walk after 639086 steps, saw 158306 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
[2024-05-24 03:51:52] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 03:51:52] [INFO ] Invariant cache hit.
[2024-05-24 03:51:52] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:51:52] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/82 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 164/246 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 24/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/318 variables, 32/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 112/430 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/438 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/438 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 168/606 variables, 120/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 120/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/82 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:51:52] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 164/246 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 24/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/318 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 112/430 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/438 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:51:52] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:51:53] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2024-05-24 03:51:53] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 1 ms to minimize.
[2024-05-24 03:51:53] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:51:53] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 5/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/438 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 168/606 variables, 120/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 120/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/606 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 836 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1182ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 9584 steps, including 349 resets, run visited all 1 properties in 31 ms. (steps per millisecond=309 )
FORMULA EisenbergMcGuire-PT-06-CTLFireability-2023-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 39 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 386 transition count 1128
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 386 transition count 1128
Applied a total of 24 rules in 12 ms. Remains 386 /398 variables (removed 12) and now considering 1128/1200 (removed 72) transitions.
[2024-05-24 03:51:53] [INFO ] Flow matrix only has 534 transitions (discarded 594 similar events)
// Phase 1: matrix 534 rows 386 cols
[2024-05-24 03:51:53] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 03:51:54] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-24 03:51:54] [INFO ] Flow matrix only has 534 transitions (discarded 594 similar events)
[2024-05-24 03:51:54] [INFO ] Invariant cache hit.
[2024-05-24 03:51:54] [INFO ] State equation strengthened by 174 read => feed constraints.
[2024-05-24 03:51:55] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1586 ms to find 0 implicit places.
Running 1122 sub problems to find dead transitions.
[2024-05-24 03:51:55] [INFO ] Flow matrix only has 534 transitions (discarded 594 similar events)
[2024-05-24 03:51:55] [INFO ] Invariant cache hit.
[2024-05-24 03:51:55] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
[2024-05-24 03:52:08] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2024-05-24 03:52:08] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 3 ms to minimize.
[2024-05-24 03:52:09] [INFO ] Deduced a trap composed of 55 places in 324 ms of which 5 ms to minimize.
[2024-05-24 03:52:09] [INFO ] Deduced a trap composed of 111 places in 330 ms of which 5 ms to minimize.
[2024-05-24 03:52:09] [INFO ] Deduced a trap composed of 29 places in 326 ms of which 6 ms to minimize.
[2024-05-24 03:52:10] [INFO ] Deduced a trap composed of 26 places in 326 ms of which 5 ms to minimize.
[2024-05-24 03:52:10] [INFO ] Deduced a trap composed of 35 places in 327 ms of which 5 ms to minimize.
[2024-05-24 03:52:10] [INFO ] Deduced a trap composed of 34 places in 337 ms of which 5 ms to minimize.
[2024-05-24 03:52:11] [INFO ] Deduced a trap composed of 75 places in 322 ms of which 4 ms to minimize.
[2024-05-24 03:52:11] [INFO ] Deduced a trap composed of 59 places in 288 ms of which 5 ms to minimize.
[2024-05-24 03:52:11] [INFO ] Deduced a trap composed of 59 places in 300 ms of which 5 ms to minimize.
[2024-05-24 03:52:12] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 4 ms to minimize.
[2024-05-24 03:52:12] [INFO ] Deduced a trap composed of 59 places in 220 ms of which 3 ms to minimize.
[2024-05-24 03:52:12] [INFO ] Deduced a trap composed of 59 places in 318 ms of which 5 ms to minimize.
[2024-05-24 03:52:12] [INFO ] Deduced a trap composed of 59 places in 203 ms of which 3 ms to minimize.
[2024-05-24 03:52:13] [INFO ] Deduced a trap composed of 75 places in 219 ms of which 5 ms to minimize.
[2024-05-24 03:52:14] [INFO ] Deduced a trap composed of 43 places in 387 ms of which 6 ms to minimize.
[2024-05-24 03:52:15] [INFO ] Deduced a trap composed of 75 places in 415 ms of which 6 ms to minimize.
[2024-05-24 03:52:15] [INFO ] Deduced a trap composed of 59 places in 404 ms of which 6 ms to minimize.
[2024-05-24 03:52:15] [INFO ] Deduced a trap composed of 62 places in 403 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
[2024-05-24 03:52:16] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2024-05-24 03:52:18] [INFO ] Deduced a trap composed of 72 places in 329 ms of which 4 ms to minimize.
[2024-05-24 03:52:18] [INFO ] Deduced a trap composed of 67 places in 402 ms of which 5 ms to minimize.
[2024-05-24 03:52:19] [INFO ] Deduced a trap composed of 101 places in 433 ms of which 6 ms to minimize.
[2024-05-24 03:52:19] [INFO ] Deduced a trap composed of 102 places in 435 ms of which 6 ms to minimize.
[2024-05-24 03:52:20] [INFO ] Deduced a trap composed of 105 places in 371 ms of which 5 ms to minimize.
[2024-05-24 03:52:20] [INFO ] Deduced a trap composed of 92 places in 369 ms of which 5 ms to minimize.
[2024-05-24 03:52:20] [INFO ] Deduced a trap composed of 97 places in 365 ms of which 6 ms to minimize.
[2024-05-24 03:52:21] [INFO ] Deduced a trap composed of 91 places in 392 ms of which 4 ms to minimize.
[2024-05-24 03:52:21] [INFO ] Deduced a trap composed of 88 places in 359 ms of which 5 ms to minimize.
[2024-05-24 03:52:21] [INFO ] Deduced a trap composed of 98 places in 367 ms of which 5 ms to minimize.
[2024-05-24 03:52:22] [INFO ] Deduced a trap composed of 95 places in 310 ms of which 5 ms to minimize.
[2024-05-24 03:52:22] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:52:22] [INFO ] Deduced a trap composed of 56 places in 351 ms of which 5 ms to minimize.
[2024-05-24 03:52:23] [INFO ] Deduced a trap composed of 56 places in 301 ms of which 3 ms to minimize.
[2024-05-24 03:52:23] [INFO ] Deduced a trap composed of 80 places in 320 ms of which 5 ms to minimize.
[2024-05-24 03:52:23] [INFO ] Deduced a trap composed of 52 places in 323 ms of which 6 ms to minimize.
[2024-05-24 03:52:23] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2024-05-24 03:52:24] [INFO ] Deduced a trap composed of 71 places in 456 ms of which 6 ms to minimize.
[2024-05-24 03:52:24] [INFO ] Deduced a trap composed of 86 places in 282 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/920 variables, and 59 constraints, problems are : Problem set: 0 solved, 1122 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/386 constraints, ReadFeed: 0/174 constraints, PredecessorRefiner: 1122/1122 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
[2024-05-24 03:52:27] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:52:27] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:52:27] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:52:29] [INFO ] Deduced a trap composed of 94 places in 343 ms of which 5 ms to minimize.
[2024-05-24 03:52:29] [INFO ] Deduced a trap composed of 104 places in 317 ms of which 5 ms to minimize.
[2024-05-24 03:52:30] [INFO ] Deduced a trap composed of 26 places in 379 ms of which 6 ms to minimize.
[2024-05-24 03:52:30] [INFO ] Deduced a trap composed of 17 places in 315 ms of which 5 ms to minimize.
[2024-05-24 03:52:30] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2024-05-24 03:52:30] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-24 03:52:31] [INFO ] Deduced a trap composed of 96 places in 418 ms of which 5 ms to minimize.
[2024-05-24 03:52:31] [INFO ] Deduced a trap composed of 95 places in 404 ms of which 6 ms to minimize.
[2024-05-24 03:52:32] [INFO ] Deduced a trap composed of 92 places in 395 ms of which 6 ms to minimize.
[2024-05-24 03:52:32] [INFO ] Deduced a trap composed of 85 places in 288 ms of which 3 ms to minimize.
[2024-05-24 03:52:32] [INFO ] Deduced a trap composed of 88 places in 239 ms of which 3 ms to minimize.
[2024-05-24 03:52:33] [INFO ] Deduced a trap composed of 98 places in 323 ms of which 5 ms to minimize.
[2024-05-24 03:52:33] [INFO ] Deduced a trap composed of 123 places in 263 ms of which 4 ms to minimize.
[2024-05-24 03:52:33] [INFO ] Deduced a trap composed of 111 places in 392 ms of which 6 ms to minimize.
[2024-05-24 03:52:34] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 3 ms to minimize.
[2024-05-24 03:52:34] [INFO ] Deduced a trap composed of 94 places in 295 ms of which 4 ms to minimize.
[2024-05-24 03:52:35] [INFO ] Deduced a trap composed of 97 places in 288 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
[2024-05-24 03:52:37] [INFO ] Deduced a trap composed of 88 places in 229 ms of which 4 ms to minimize.
[2024-05-24 03:52:37] [INFO ] Deduced a trap composed of 91 places in 388 ms of which 6 ms to minimize.
[2024-05-24 03:52:38] [INFO ] Deduced a trap composed of 105 places in 254 ms of which 4 ms to minimize.
[2024-05-24 03:52:38] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 2 ms to minimize.
[2024-05-24 03:52:38] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2024-05-24 03:52:39] [INFO ] Deduced a trap composed of 94 places in 234 ms of which 4 ms to minimize.
[2024-05-24 03:52:39] [INFO ] Deduced a trap composed of 95 places in 261 ms of which 3 ms to minimize.
[2024-05-24 03:52:39] [INFO ] Deduced a trap composed of 75 places in 370 ms of which 5 ms to minimize.
[2024-05-24 03:52:40] [INFO ] Deduced a trap composed of 70 places in 283 ms of which 3 ms to minimize.
[2024-05-24 03:52:40] [INFO ] Deduced a trap composed of 75 places in 326 ms of which 4 ms to minimize.
[2024-05-24 03:52:40] [INFO ] Deduced a trap composed of 96 places in 234 ms of which 3 ms to minimize.
[2024-05-24 03:52:41] [INFO ] Deduced a trap composed of 68 places in 239 ms of which 4 ms to minimize.
[2024-05-24 03:52:41] [INFO ] Deduced a trap composed of 19 places in 382 ms of which 5 ms to minimize.
[2024-05-24 03:52:41] [INFO ] Deduced a trap composed of 20 places in 205 ms of which 3 ms to minimize.
[2024-05-24 03:52:42] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-05-24 03:52:42] [INFO ] Deduced a trap composed of 51 places in 277 ms of which 3 ms to minimize.
[2024-05-24 03:52:43] [INFO ] Deduced a trap composed of 53 places in 351 ms of which 3 ms to minimize.
[2024-05-24 03:52:43] [INFO ] Deduced a trap composed of 44 places in 379 ms of which 5 ms to minimize.
[2024-05-24 03:52:44] [INFO ] Deduced a trap composed of 86 places in 402 ms of which 6 ms to minimize.
[2024-05-24 03:52:44] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
[2024-05-24 03:52:46] [INFO ] Deduced a trap composed of 84 places in 347 ms of which 5 ms to minimize.
[2024-05-24 03:52:46] [INFO ] Deduced a trap composed of 76 places in 332 ms of which 5 ms to minimize.
[2024-05-24 03:52:47] [INFO ] Deduced a trap composed of 62 places in 348 ms of which 5 ms to minimize.
[2024-05-24 03:52:47] [INFO ] Deduced a trap composed of 54 places in 412 ms of which 5 ms to minimize.
[2024-05-24 03:52:48] [INFO ] Deduced a trap composed of 68 places in 353 ms of which 5 ms to minimize.
[2024-05-24 03:52:48] [INFO ] Deduced a trap composed of 57 places in 348 ms of which 5 ms to minimize.
[2024-05-24 03:52:48] [INFO ] Deduced a trap composed of 55 places in 353 ms of which 5 ms to minimize.
[2024-05-24 03:52:49] [INFO ] Deduced a trap composed of 97 places in 360 ms of which 5 ms to minimize.
[2024-05-24 03:52:49] [INFO ] Deduced a trap composed of 79 places in 299 ms of which 5 ms to minimize.
[2024-05-24 03:52:50] [INFO ] Deduced a trap composed of 82 places in 300 ms of which 5 ms to minimize.
[2024-05-24 03:52:50] [INFO ] Deduced a trap composed of 95 places in 315 ms of which 5 ms to minimize.
[2024-05-24 03:52:50] [INFO ] Deduced a trap composed of 95 places in 293 ms of which 5 ms to minimize.
[2024-05-24 03:52:51] [INFO ] Deduced a trap composed of 84 places in 304 ms of which 4 ms to minimize.
[2024-05-24 03:52:51] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 3 ms to minimize.
[2024-05-24 03:52:51] [INFO ] Deduced a trap composed of 97 places in 180 ms of which 3 ms to minimize.
[2024-05-24 03:52:52] [INFO ] Deduced a trap composed of 98 places in 245 ms of which 4 ms to minimize.
[2024-05-24 03:52:52] [INFO ] Deduced a trap composed of 96 places in 236 ms of which 3 ms to minimize.
[2024-05-24 03:52:52] [INFO ] Deduced a trap composed of 93 places in 240 ms of which 4 ms to minimize.
[2024-05-24 03:52:52] [INFO ] Deduced a trap composed of 101 places in 194 ms of which 2 ms to minimize.
[2024-05-24 03:52:53] [INFO ] Deduced a trap composed of 64 places in 226 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
[2024-05-24 03:52:55] [INFO ] Deduced a trap composed of 52 places in 404 ms of which 6 ms to minimize.
SMT process timed out in 60651ms, After SMT, problems are : Problem set: 0 solved, 1122 unsolved
Search for dead transitions found 0 dead transitions in 60663ms
Starting structural reductions in LTL mode, iteration 1 : 386/398 places, 1128/1200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62263 ms. Remains : 386/398 places, 1128/1200 transitions.
[2024-05-24 03:52:55] [INFO ] Flatten gal took : 38 ms
[2024-05-24 03:52:55] [INFO ] Flatten gal took : 43 ms
[2024-05-24 03:52:55] [INFO ] Input system was already deterministic with 1128 transitions.
[2024-05-24 03:52:56] [INFO ] Flatten gal took : 42 ms
[2024-05-24 03:52:56] [INFO ] Flatten gal took : 44 ms
[2024-05-24 03:52:56] [INFO ] Time to serialize gal into /tmp/CTLFireability15872380916968047008.gal : 7 ms
[2024-05-24 03:52:56] [INFO ] Time to serialize properties into /tmp/CTLFireability5768439216402406312.ctl : 51 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/CTLFireability15872380916968047008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5768439216402406312.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 03:53:26] [INFO ] Flatten gal took : 26 ms
[2024-05-24 03:53:26] [INFO ] Applying decomposition
[2024-05-24 03:53:26] [INFO ] Flatten gal took : 26 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/graph13331665124014501724.txt' '-o' '/tmp/graph13331665124014501724.bin' '-w' '/tmp/graph13331665124014501724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13331665124014501724.bin' '-l' '-1' '-v' '-w' '/tmp/graph13331665124014501724.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:53:26] [INFO ] Decomposing Gal with order
[2024-05-24 03:53:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:53:26] [INFO ] Removed a total of 1935 redundant transitions.
[2024-05-24 03:53:26] [INFO ] Flatten gal took : 60 ms
[2024-05-24 03:53:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 271 labels/synchronizations in 12 ms.
[2024-05-24 03:53:26] [INFO ] Time to serialize gal into /tmp/CTLFireability8436975753544770741.gal : 6 ms
[2024-05-24 03:53:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6900116623458369244.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/CTLFireability8436975753544770741.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6900116623458369244.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.
Detected timeout of ITS tools.
[2024-05-24 03:53:56] [INFO ] Flatten gal took : 28 ms
[2024-05-24 03:53:56] [INFO ] Flatten gal took : 28 ms
[2024-05-24 03:53:56] [INFO ] Applying decomposition
[2024-05-24 03:53:56] [INFO ] Flatten gal took : 28 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/graph17608258653699617017.txt' '-o' '/tmp/graph17608258653699617017.bin' '-w' '/tmp/graph17608258653699617017.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17608258653699617017.bin' '-l' '-1' '-v' '-w' '/tmp/graph17608258653699617017.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:53:56] [INFO ] Decomposing Gal with order
[2024-05-24 03:53:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:53:56] [INFO ] Removed a total of 2096 redundant transitions.
[2024-05-24 03:53:56] [INFO ] Flatten gal took : 60 ms
[2024-05-24 03:53:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 307 labels/synchronizations in 19 ms.
[2024-05-24 03:53:56] [INFO ] Time to serialize gal into /tmp/CTLFireability11688175679935857587.gal : 7 ms
[2024-05-24 03:53:56] [INFO ] Time to serialize properties into /tmp/CTLFireability17310500763814101392.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/CTLFireability11688175679935857587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17310500763814101392.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 10 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-06"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-06, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r158-smll-171636266300170"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-06.tgz
mv EisenbergMcGuire-PT-06 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;