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.r576-smll-171734920100130.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 MedleyA-PT-17, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 175K Jun 2 16:33 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 MedleyA-PT-17-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717372292909

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 23:51:35] [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-06-02 23:51:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:51:35] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2024-06-02 23:51:35] [INFO ] Transformed 248 places.
[2024-06-02 23:51:35] [INFO ] Transformed 591 transitions.
[2024-06-02 23:51:35] [INFO ] Found NUPN structural information;
[2024-06-02 23:51:35] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 406 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 110 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 589/589 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 217 transition count 539
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 217 transition count 539
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 78 place count 217 transition count 523
Applied a total of 78 rules in 93 ms. Remains 217 /248 variables (removed 31) and now considering 523/589 (removed 66) transitions.
// Phase 1: matrix 523 rows 217 cols
[2024-06-02 23:51:36] [INFO ] Computed 7 invariants in 37 ms
[2024-06-02 23:51:36] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-06-02 23:51:36] [INFO ] Invariant cache hit.
[2024-06-02 23:51:37] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
Running 522 sub problems to find dead transitions.
[2024-06-02 23:51:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 23:51:46] [INFO ] Deduced a trap composed of 17 places in 328 ms of which 45 ms to minimize.
[2024-06-02 23:51:47] [INFO ] Deduced a trap composed of 18 places in 381 ms of which 5 ms to minimize.
[2024-06-02 23:51:47] [INFO ] Deduced a trap composed of 18 places in 351 ms of which 4 ms to minimize.
[2024-06-02 23:51:47] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 2 ms to minimize.
[2024-06-02 23:51:47] [INFO ] Deduced a trap composed of 123 places in 219 ms of which 3 ms to minimize.
[2024-06-02 23:51:48] [INFO ] Deduced a trap composed of 122 places in 214 ms of which 4 ms to minimize.
[2024-06-02 23:51:48] [INFO ] Deduced a trap composed of 122 places in 207 ms of which 3 ms to minimize.
[2024-06-02 23:51:48] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 5 ms to minimize.
[2024-06-02 23:51:49] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 3 ms to minimize.
[2024-06-02 23:51:50] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 3 ms to minimize.
[2024-06-02 23:51:50] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 3 ms to minimize.
[2024-06-02 23:51:50] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 3 ms to minimize.
[2024-06-02 23:51:51] [INFO ] Deduced a trap composed of 39 places in 306 ms of which 4 ms to minimize.
[2024-06-02 23:51:51] [INFO ] Deduced a trap composed of 48 places in 208 ms of which 4 ms to minimize.
[2024-06-02 23:51:51] [INFO ] Deduced a trap composed of 101 places in 178 ms of which 3 ms to minimize.
[2024-06-02 23:51:51] [INFO ] Deduced a trap composed of 122 places in 245 ms of which 4 ms to minimize.
[2024-06-02 23:51:52] [INFO ] Deduced a trap composed of 26 places in 284 ms of which 4 ms to minimize.
[2024-06-02 23:51:52] [INFO ] Deduced a trap composed of 49 places in 351 ms of which 5 ms to minimize.
[2024-06-02 23:51:52] [INFO ] Deduced a trap composed of 26 places in 279 ms of which 3 ms to minimize.
[2024-06-02 23:51:53] [INFO ] Deduced a trap composed of 26 places in 259 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 23:51:53] [INFO ] Deduced a trap composed of 129 places in 267 ms of which 6 ms to minimize.
[2024-06-02 23:51:55] [INFO ] Deduced a trap composed of 26 places in 330 ms of which 4 ms to minimize.
[2024-06-02 23:51:56] [INFO ] Deduced a trap composed of 43 places in 237 ms of which 3 ms to minimize.
[2024-06-02 23:51:56] [INFO ] Deduced a trap composed of 25 places in 269 ms of which 3 ms to minimize.
[2024-06-02 23:51:56] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 3 ms to minimize.
[2024-06-02 23:51:57] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 3 ms to minimize.
[2024-06-02 23:51:57] [INFO ] Deduced a trap composed of 42 places in 226 ms of which 3 ms to minimize.
[2024-06-02 23:51:57] [INFO ] Deduced a trap composed of 34 places in 244 ms of which 4 ms to minimize.
[2024-06-02 23:51:57] [INFO ] Deduced a trap composed of 22 places in 267 ms of which 4 ms to minimize.
[2024-06-02 23:51:58] [INFO ] Deduced a trap composed of 27 places in 292 ms of which 4 ms to minimize.
[2024-06-02 23:51:58] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 3 ms to minimize.
[2024-06-02 23:51:59] [INFO ] Deduced a trap composed of 22 places in 314 ms of which 4 ms to minimize.
[2024-06-02 23:51:59] [INFO ] Deduced a trap composed of 56 places in 330 ms of which 4 ms to minimize.
[2024-06-02 23:51:59] [INFO ] Deduced a trap composed of 35 places in 265 ms of which 4 ms to minimize.
[2024-06-02 23:52:00] [INFO ] Deduced a trap composed of 26 places in 409 ms of which 3 ms to minimize.
[2024-06-02 23:52:00] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 4 ms to minimize.
[2024-06-02 23:52:00] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 3 ms to minimize.
[2024-06-02 23:52:02] [INFO ] Deduced a trap composed of 41 places in 272 ms of which 3 ms to minimize.
[2024-06-02 23:52:02] [INFO ] Deduced a trap composed of 47 places in 295 ms of which 4 ms to minimize.
[2024-06-02 23:52:03] [INFO ] Deduced a trap composed of 126 places in 247 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 23:52:08] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 4 ms to minimize.
SMT process timed out in 31126ms, After SMT, problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 31192ms
Starting structural reductions in LTL mode, iteration 1 : 217/248 places, 523/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32531 ms. Remains : 217/248 places, 523/589 transitions.
Support contains 110 out of 217 places after structural reductions.
[2024-06-02 23:52:08] [INFO ] Flatten gal took : 179 ms
[2024-06-02 23:52:08] [INFO ] Flatten gal took : 100 ms
[2024-06-02 23:52:09] [INFO ] Input system was already deterministic with 523 transitions.
Reduction of identical properties reduced properties to check from 99 to 98
RANDOM walk for 40000 steps (1376 resets) in 2502 ms. (15 steps per ms) remains 94/98 properties
BEST_FIRST walk for 4004 steps (28 resets) in 93 ms. (42 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (28 resets) in 74 ms. (53 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4002 steps (28 resets) in 76 ms. (51 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (28 resets) in 91 ms. (43 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (29 resets) in 59 ms. (66 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (29 resets) in 46 ms. (85 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (28 resets) in 52 ms. (75 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (28 resets) in 40 ms. (97 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4002 steps (28 resets) in 50 ms. (78 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (28 resets) in 27 ms. (142 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (25 resets) in 28 ms. (138 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (28 resets) in 29 ms. (133 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (28 resets) in 30 ms. (129 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (28 resets) in 32 ms. (121 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (28 resets) in 42 ms. (93 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (28 resets) in 25 ms. (154 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (28 resets) in 20 ms. (190 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (28 resets) in 27 ms. (142 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (29 resets) in 26 ms. (148 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4002 steps (27 resets) in 56 ms. (70 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (29 resets) in 31 ms. (125 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (28 resets) in 24 ms. (160 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (28 resets) in 21 ms. (182 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (28 resets) in 29 ms. (133 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (28 resets) in 24 ms. (160 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (28 resets) in 20 ms. (190 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (27 resets) in 20 ms. (190 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4002 steps (25 resets) in 30 ms. (129 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (28 resets) in 34 ms. (114 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (28 resets) in 32 ms. (121 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (28 resets) in 34 ms. (114 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (28 resets) in 21 ms. (181 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4002 steps (23 resets) in 29 ms. (133 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (28 resets) in 20 ms. (190 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4002 steps (30 resets) in 21 ms. (181 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (28 resets) in 20 ms. (190 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (27 resets) in 25 ms. (153 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (29 resets) in 31 ms. (125 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (28 resets) in 20 ms. (190 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4002 steps (23 resets) in 17 ms. (222 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (28 resets) in 18 ms. (210 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (28 resets) in 27 ms. (142 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (29 resets) in 17 ms. (222 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (28 resets) in 18 ms. (210 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (29 resets) in 21 ms. (182 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (28 resets) in 25 ms. (153 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (29 resets) in 23 ms. (166 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (28 resets) in 18 ms. (210 steps per ms) remains 94/94 properties
Interrupted probabilistic random walk after 261837 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :32 out of 94
Probabilistic random walk after 261837 steps, saw 48618 distinct states, run finished after 3007 ms. (steps per millisecond=87 ) properties seen :32
[2024-06-02 23:52:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp94 is UNSAT
At refinement iteration 1 (OVERLAPS) 143/217 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 56 unsolved
[2024-06-02 23:52:14] [INFO ] Deduced a trap composed of 25 places in 271 ms of which 3 ms to minimize.
[2024-06-02 23:52:14] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2024-06-02 23:52:14] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 2 ms to minimize.
[2024-06-02 23:52:15] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2024-06-02 23:52:15] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2024-06-02 23:52:15] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2024-06-02 23:52:15] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 2 ms to minimize.
[2024-06-02 23:52:15] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 2 ms to minimize.
[2024-06-02 23:52:16] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 4 ms to minimize.
[2024-06-02 23:52:16] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 3 ms to minimize.
[2024-06-02 23:52:16] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 3 ms to minimize.
Problem AtomicPropp56 is UNSAT
[2024-06-02 23:52:16] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 2 ms to minimize.
[2024-06-02 23:52:16] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 3 ms to minimize.
[2024-06-02 23:52:17] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 4 ms to minimize.
[2024-06-02 23:52:17] [INFO ] Deduced a trap composed of 129 places in 226 ms of which 3 ms to minimize.
[2024-06-02 23:52:17] [INFO ] Deduced a trap composed of 39 places in 281 ms of which 8 ms to minimize.
[2024-06-02 23:52:17] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 3 ms to minimize.
[2024-06-02 23:52:18] [INFO ] Deduced a trap composed of 39 places in 302 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 18/25 constraints. Problems are: Problem set: 7 solved, 55 unsolved
[2024-06-02 23:52:18] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 2 ms to minimize.
[2024-06-02 23:52:19] [INFO ] Deduced a trap composed of 27 places in 319 ms of which 3 ms to minimize.
SMT process timed out in 5300ms, After SMT, problems are : Problem set: 7 solved, 55 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 523/523 transitions.
Graph (trivial) has 108 edges and 217 vertex of which 6 / 217 are part of one of the 2 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 213 transition count 491
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 187 transition count 489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 186 transition count 489
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 56 place count 186 transition count 480
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 74 place count 177 transition count 480
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 85 place count 166 transition count 458
Iterating global reduction 3 with 11 rules applied. Total rules applied 96 place count 166 transition count 458
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 124 place count 152 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 152 transition count 443
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 151 transition count 441
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 151 transition count 441
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 150 transition count 440
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 137 place count 146 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 161 place count 146 transition count 426
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 164 place count 143 transition count 423
Iterating global reduction 4 with 3 rules applied. Total rules applied 167 place count 143 transition count 423
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 169 place count 142 transition count 422
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 177 place count 138 transition count 436
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 189 place count 138 transition count 424
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 201 place count 126 transition count 424
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 207 place count 126 transition count 423
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 213 place count 120 transition count 423
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 215 place count 120 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 216 place count 119 transition count 420
Applied a total of 216 rules in 349 ms. Remains 119 /217 variables (removed 98) and now considering 420/523 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 349 ms. Remains : 119/217 places, 420/523 transitions.
RANDOM walk for 40000 steps (3996 resets) in 987 ms. (40 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (78 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (75 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (85 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (80 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (86 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (81 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (77 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (66 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (77 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (76 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (77 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (79 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (77 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (75 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (79 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (66 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (79 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (85 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (79 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (77 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (77 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (76 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (75 resets) in 15 ms. (250 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (82 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (78 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (77 resets) in 12 ms. (308 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (77 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (76 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (79 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (75 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (80 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (88 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (78 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (76 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (84 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (65 resets) in 12 ms. (308 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (76 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (77 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (76 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (76 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (78 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (60 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (74 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (65 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (77 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (78 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (77 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (74 resets) in 12 ms. (308 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (76 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (78 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (88 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (79 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (70 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (81 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (79 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
Interrupted probabilistic random walk after 318728 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :20 out of 54
Probabilistic random walk after 318728 steps, saw 59381 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :20
[2024-06-02 23:52:23] [INFO ] Flow matrix only has 404 transitions (discarded 16 similar events)
// Phase 1: matrix 404 rows 119 cols
[2024-06-02 23:52:23] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:52:23] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 75/119 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 23:52:23] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:52:23] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2024-06-02 23:52:23] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 2 ms to minimize.
[2024-06-02 23:52:24] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2024-06-02 23:52:24] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-06-02 23:52:24] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:52:24] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-06-02 23:52:24] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2024-06-02 23:52:24] [INFO ] Deduced a trap composed of 52 places in 237 ms of which 3 ms to minimize.
[2024-06-02 23:52:25] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 3 ms to minimize.
[2024-06-02 23:52:25] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 404/523 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 14/151 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 23:52:25] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 2 ms to minimize.
[2024-06-02 23:52:26] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 23:52:26] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
[2024-06-02 23:52:26] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 23:52:27] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/523 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/523 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 0/523 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 523/523 variables, and 156 constraints, problems are : Problem set: 0 solved, 34 unsolved in 5525 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 75/119 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 23:52:29] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:52:29] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 1 ms to minimize.
[2024-06-02 23:52:29] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp90 is UNSAT
At refinement iteration 5 (OVERLAPS) 404/523 variables, 119/145 constraints. Problems are: Problem set: 14 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 14/159 constraints. Problems are: Problem set: 14 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 20/179 constraints. Problems are: Problem set: 14 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/523 variables, and 179 constraints, problems are : Problem set: 14 solved, 20 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 20/34 constraints, Known Traps: 19/19 constraints]
After SMT, in 50614ms problems are : Problem set: 14 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 420/420 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 119 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 118 transition count 419
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 118 transition count 416
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 115 transition count 416
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 16 place count 107 transition count 400
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 107 transition count 400
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 104 transition count 397
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 101 transition count 395
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 101 transition count 393
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 100 transition count 394
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 51 place count 100 transition count 383
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 62 place count 89 transition count 383
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 89 transition count 383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 88 transition count 383
Applied a total of 64 rules in 80 ms. Remains 88 /119 variables (removed 31) and now considering 383/420 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 88/119 places, 383/420 transitions.
RANDOM walk for 40000 steps (6552 resets) in 799 ms. (50 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4004 steps (124 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (146 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (133 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (148 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (120 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (136 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (135 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (142 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (148 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (97 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (147 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (144 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (132 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (135 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (134 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (135 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (133 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (80 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
[2024-06-02 23:53:14] [INFO ] Flow matrix only has 349 transitions (discarded 34 similar events)
// Phase 1: matrix 349 rows 88 cols
[2024-06-02 23:53:14] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:53:14] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 55/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 23:53:14] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-06-02 23:53:14] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 349/437 variables, 88/97 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 23:53:15] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/437 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 112 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1107 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 88/88 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 55/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 23:53:15] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 349/437 variables, 88/99 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 14/113 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/437 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 131 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2513 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 88/88 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 4/4 constraints]
After SMT, in 3672ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 2 properties in 9187 ms.
Support contains 32 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 87 transition count 382
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 380
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 85 transition count 380
Applied a total of 6 rules in 23 ms. Remains 85 /88 variables (removed 3) and now considering 380/383 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 85/88 places, 380/383 transitions.
RANDOM walk for 40000 steps (6472 resets) in 321 ms. (124 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (144 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (156 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (172 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (115 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (155 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (62 resets) in 64 ms. (61 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (165 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (156 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (77 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (172 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (149 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (146 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (156 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (149 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (153 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (32 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 420412 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :12 out of 16
Probabilistic random walk after 420412 steps, saw 82743 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :12
[2024-06-02 23:53:30] [INFO ] Flow matrix only has 346 transitions (discarded 34 similar events)
// Phase 1: matrix 346 rows 85 cols
[2024-06-02 23:53:30] [INFO ] Computed 7 invariants in 11 ms
[2024-06-02 23:53:30] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 72/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:53:30] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 346/431 variables, 85/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/431 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 107 constraints, problems are : Problem set: 0 solved, 4 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 72/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:53:31] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2024-06-02 23:53:31] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 2 ms to minimize.
[2024-06-02 23:53:31] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 346/431 variables, 85/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:53:34] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:53:34] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:54:01] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:54:31] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:54:49] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:54:59] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:54:59] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/431 variables, and 121 constraints, problems are : Problem set: 0 solved, 4 unsolved in 90007 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints]
After SMT, in 90508ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 380/380 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 85 transition count 379
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 379
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 83 transition count 378
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 18 place count 76 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 76 transition count 397
Free-agglomeration rule applied 12 times with reduction of 10 identical transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 32 place count 76 transition count 375
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 66 place count 64 transition count 353
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 80 place count 64 transition count 339
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 63 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 84 place count 63 transition count 339
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 62 transition count 333
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 62 transition count 333
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 62 transition count 332
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 61 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 61 transition count 328
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 61 transition count 356
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 96 place count 59 transition count 356
Applied a total of 96 rules in 97 ms. Remains 59 /85 variables (removed 26) and now considering 356/380 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 59/85 places, 356/380 transitions.
Successfully simplified 21 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-17-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 23:55:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 23:55:01] [INFO ] Flatten gal took : 52 ms
[2024-06-02 23:55:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-17-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 23:55:01] [INFO ] Flatten gal took : 49 ms
[2024-06-02 23:55:01] [INFO ] Input system was already deterministic with 523 transitions.
Support contains 81 out of 217 places (down from 96) after GAL structural reductions.
Computed a total of 17 stabilizing places and 17 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 192 transition count 480
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 192 transition count 480
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 68 place count 192 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 190 transition count 458
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 190 transition count 458
Applied a total of 72 rules in 11 ms. Remains 190 /217 variables (removed 27) and now considering 458/523 (removed 65) transitions.
// Phase 1: matrix 458 rows 190 cols
[2024-06-02 23:55:01] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:55:01] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-06-02 23:55:01] [INFO ] Invariant cache hit.
[2024-06-02 23:55:01] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-02 23:55:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 23:55:08] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 3 ms to minimize.
[2024-06-02 23:55:08] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 3 ms to minimize.
[2024-06-02 23:55:08] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-06-02 23:55:08] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:55:09] [INFO ] Deduced a trap composed of 112 places in 165 ms of which 3 ms to minimize.
[2024-06-02 23:55:09] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 3 ms to minimize.
[2024-06-02 23:55:09] [INFO ] Deduced a trap composed of 112 places in 152 ms of which 2 ms to minimize.
[2024-06-02 23:55:09] [INFO ] Deduced a trap composed of 40 places in 290 ms of which 3 ms to minimize.
[2024-06-02 23:55:09] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 2 ms to minimize.
[2024-06-02 23:55:10] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 2 ms to minimize.
[2024-06-02 23:55:10] [INFO ] Deduced a trap composed of 90 places in 157 ms of which 2 ms to minimize.
[2024-06-02 23:55:11] [INFO ] Deduced a trap composed of 96 places in 227 ms of which 3 ms to minimize.
[2024-06-02 23:55:11] [INFO ] Deduced a trap composed of 21 places in 311 ms of which 3 ms to minimize.
[2024-06-02 23:55:12] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 3 ms to minimize.
[2024-06-02 23:55:12] [INFO ] Deduced a trap composed of 39 places in 312 ms of which 3 ms to minimize.
[2024-06-02 23:55:12] [INFO ] Deduced a trap composed of 50 places in 286 ms of which 4 ms to minimize.
[2024-06-02 23:55:12] [INFO ] Deduced a trap composed of 24 places in 309 ms of which 3 ms to minimize.
[2024-06-02 23:55:13] [INFO ] Deduced a trap composed of 36 places in 291 ms of which 4 ms to minimize.
[2024-06-02 23:55:13] [INFO ] Deduced a trap composed of 50 places in 299 ms of which 3 ms to minimize.
[2024-06-02 23:55:13] [INFO ] Deduced a trap composed of 32 places in 287 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 23:55:14] [INFO ] Deduced a trap composed of 111 places in 210 ms of which 3 ms to minimize.
[2024-06-02 23:55:14] [INFO ] Deduced a trap composed of 111 places in 221 ms of which 3 ms to minimize.
[2024-06-02 23:55:14] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 3 ms to minimize.
[2024-06-02 23:55:15] [INFO ] Deduced a trap composed of 32 places in 299 ms of which 4 ms to minimize.
[2024-06-02 23:55:15] [INFO ] Deduced a trap composed of 98 places in 300 ms of which 3 ms to minimize.
[2024-06-02 23:55:15] [INFO ] Deduced a trap composed of 50 places in 299 ms of which 3 ms to minimize.
[2024-06-02 23:55:16] [INFO ] Deduced a trap composed of 39 places in 283 ms of which 3 ms to minimize.
[2024-06-02 23:55:16] [INFO ] Deduced a trap composed of 116 places in 277 ms of which 4 ms to minimize.
[2024-06-02 23:55:16] [INFO ] Deduced a trap composed of 112 places in 266 ms of which 3 ms to minimize.
[2024-06-02 23:55:17] [INFO ] Deduced a trap composed of 37 places in 259 ms of which 4 ms to minimize.
[2024-06-02 23:55:18] [INFO ] Deduced a trap composed of 34 places in 298 ms of which 4 ms to minimize.
[2024-06-02 23:55:18] [INFO ] Deduced a trap composed of 34 places in 292 ms of which 3 ms to minimize.
[2024-06-02 23:55:19] [INFO ] Deduced a trap composed of 24 places in 308 ms of which 4 ms to minimize.
[2024-06-02 23:55:19] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 3 ms to minimize.
[2024-06-02 23:55:19] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 3 ms to minimize.
[2024-06-02 23:55:20] [INFO ] Deduced a trap composed of 37 places in 300 ms of which 3 ms to minimize.
[2024-06-02 23:55:20] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 3 ms to minimize.
[2024-06-02 23:55:20] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 3 ms to minimize.
[2024-06-02 23:55:21] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 3 ms to minimize.
[2024-06-02 23:55:21] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 23:55:26] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 3 ms to minimize.
[2024-06-02 23:55:26] [INFO ] Deduced a trap composed of 115 places in 286 ms of which 4 ms to minimize.
[2024-06-02 23:55:27] [INFO ] Deduced a trap composed of 28 places in 305 ms of which 4 ms to minimize.
[2024-06-02 23:55:27] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 4 ms to minimize.
[2024-06-02 23:55:27] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 3 ms to minimize.
[2024-06-02 23:55:27] [INFO ] Deduced a trap composed of 40 places in 240 ms of which 3 ms to minimize.
[2024-06-02 23:55:28] [INFO ] Deduced a trap composed of 21 places in 269 ms of which 3 ms to minimize.
[2024-06-02 23:55:28] [INFO ] Deduced a trap composed of 115 places in 274 ms of which 4 ms to minimize.
[2024-06-02 23:55:28] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 3 ms to minimize.
[2024-06-02 23:55:30] [INFO ] Deduced a trap composed of 52 places in 224 ms of which 3 ms to minimize.
[2024-06-02 23:55:30] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 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 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/648 variables, and 58 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 51/58 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 23:55:38] [INFO ] Deduced a trap composed of 30 places in 250 ms of which 3 ms to minimize.
[2024-06-02 23:55:38] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 3 ms to minimize.
[2024-06-02 23:55:38] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 3 ms to minimize.
[2024-06-02 23:55:38] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 3 ms to minimize.
[2024-06-02 23:55:39] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 23:55:43] [INFO ] Deduced a trap composed of 35 places in 278 ms of which 3 ms to minimize.
[2024-06-02 23:55:43] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 3 ms to minimize.
[2024-06-02 23:55:44] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 3 ms to minimize.
[2024-06-02 23:55:44] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 23:55:47] [INFO ] Deduced a trap composed of 123 places in 296 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 23:55:53] [INFO ] Deduced a trap composed of 41 places in 271 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 23:55:57] [INFO ] Deduced a trap composed of 90 places in 232 ms of which 4 ms to minimize.
[2024-06-02 23:55:58] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/648 variables, and 71 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 0/457 constraints, Known Traps: 64/64 constraints]
After SMT, in 60514ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 60520ms
Starting structural reductions in LTL mode, iteration 1 : 190/217 places, 458/523 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61142 ms. Remains : 190/217 places, 458/523 transitions.
[2024-06-02 23:56:02] [INFO ] Flatten gal took : 54 ms
[2024-06-02 23:56:02] [INFO ] Flatten gal took : 49 ms
[2024-06-02 23:56:02] [INFO ] Input system was already deterministic with 458 transitions.
[2024-06-02 23:56:02] [INFO ] Flatten gal took : 48 ms
[2024-06-02 23:56:02] [INFO ] Flatten gal took : 47 ms
[2024-06-02 23:56:02] [INFO ] Time to serialize gal into /tmp/CTLFireability4485557213220587348.gal : 37 ms
[2024-06-02 23:56:02] [INFO ] Time to serialize properties into /tmp/CTLFireability4216474291581281745.ctl : 7 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/CTLFireability4485557213220587348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4216474291581281745.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-06-02 23:56:32] [INFO ] Flatten gal took : 25 ms
[2024-06-02 23:56:32] [INFO ] Applying decomposition
[2024-06-02 23:56:33] [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/graph17946670942576555471.txt' '-o' '/tmp/graph17946670942576555471.bin' '-w' '/tmp/graph17946670942576555471.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17946670942576555471.bin' '-l' '-1' '-v' '-w' '/tmp/graph17946670942576555471.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:56:33] [INFO ] Decomposing Gal with order
[2024-06-02 23:56:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:56:33] [INFO ] Removed a total of 1062 redundant transitions.
[2024-06-02 23:56:33] [INFO ] Flatten gal took : 128 ms
[2024-06-02 23:56:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 101 labels/synchronizations in 34 ms.
[2024-06-02 23:56:33] [INFO ] Time to serialize gal into /tmp/CTLFireability9215020045494481301.gal : 12 ms
[2024-06-02 23:56:33] [INFO ] Time to serialize properties into /tmp/CTLFireability18198540831750489054.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/CTLFireability9215020045494481301.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18198540831750489054.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.77138e+07,16.6684,310824,4245,531,217020,9434,985,3.07747e+06,173,48647,0


Converting to forward existential form...Done !
original formula: AX((EF(EG(((A(((((i8.u3.p14==1)&&(u7.p39==1))&&((i1.u57.p70==1)&&(i1.u16.p87==1)))&&(i9.u56.p247==1)) U (i2.u24.p122==1)) + (i9.u19.p104=...241
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U EG(((!((E(!((i2.u24.p122==1)) U (!(((((i8.u3.p14==1)&&(u7.p39==1))&&((i1.u57.p70==1)&&(...381
Reverse transition relation is NOT exact ! Due to transitions t20, t41, t110, t170, t172, t174, t186, t188, t190, t214, t222, t246, t254, t260, t261, t272,...919
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 191 transition count 478
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 191 transition count 478
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 70 place count 191 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 189 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 189 transition count 456
Applied a total of 74 rules in 15 ms. Remains 189 /217 variables (removed 28) and now considering 456/523 (removed 67) transitions.
// Phase 1: matrix 456 rows 189 cols
[2024-06-02 23:57:03] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:57:03] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-02 23:57:03] [INFO ] Invariant cache hit.
[2024-06-02 23:57:04] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-06-02 23:57:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 23:57:11] [INFO ] Deduced a trap composed of 17 places in 277 ms of which 6 ms to minimize.
[2024-06-02 23:57:11] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 4 ms to minimize.
[2024-06-02 23:57:12] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 3 ms to minimize.
[2024-06-02 23:57:12] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:57:12] [INFO ] Deduced a trap composed of 41 places in 270 ms of which 3 ms to minimize.
[2024-06-02 23:57:12] [INFO ] Deduced a trap composed of 47 places in 261 ms of which 3 ms to minimize.
[2024-06-02 23:57:12] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 3 ms to minimize.
[2024-06-02 23:57:13] [INFO ] Deduced a trap composed of 111 places in 210 ms of which 4 ms to minimize.
[2024-06-02 23:57:13] [INFO ] Deduced a trap composed of 85 places in 211 ms of which 4 ms to minimize.
[2024-06-02 23:57:13] [INFO ] Deduced a trap composed of 85 places in 223 ms of which 3 ms to minimize.
[2024-06-02 23:57:13] [INFO ] Deduced a trap composed of 42 places in 280 ms of which 3 ms to minimize.
[2024-06-02 23:57:14] [INFO ] Deduced a trap composed of 38 places in 247 ms of which 3 ms to minimize.
[2024-06-02 23:57:14] [INFO ] Deduced a trap composed of 41 places in 305 ms of which 4 ms to minimize.
[2024-06-02 23:57:15] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 3 ms to minimize.
[2024-06-02 23:57:16] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 3 ms to minimize.
[2024-06-02 23:57:16] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 3 ms to minimize.
[2024-06-02 23:57:16] [INFO ] Deduced a trap composed of 24 places in 290 ms of which 3 ms to minimize.
[2024-06-02 23:57:17] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 3 ms to minimize.
[2024-06-02 23:57:17] [INFO ] Deduced a trap composed of 40 places in 294 ms of which 4 ms to minimize.
[2024-06-02 23:57:17] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 23:57:18] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 4 ms to minimize.
[2024-06-02 23:57:18] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 4 ms to minimize.
[2024-06-02 23:57:18] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 3 ms to minimize.
[2024-06-02 23:57:19] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 3 ms to minimize.
[2024-06-02 23:57:19] [INFO ] Deduced a trap composed of 23 places in 308 ms of which 11 ms to minimize.
[2024-06-02 23:57:20] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 3 ms to minimize.
[2024-06-02 23:57:20] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 3 ms to minimize.
[2024-06-02 23:57:20] [INFO ] Deduced a trap composed of 25 places in 280 ms of which 4 ms to minimize.
[2024-06-02 23:57:21] [INFO ] Deduced a trap composed of 39 places in 284 ms of which 4 ms to minimize.
[2024-06-02 23:57:22] [INFO ] Deduced a trap composed of 28 places in 282 ms of which 3 ms to minimize.
[2024-06-02 23:57:23] [INFO ] Deduced a trap composed of 43 places in 247 ms of which 3 ms to minimize.
[2024-06-02 23:57:23] [INFO ] Deduced a trap composed of 115 places in 250 ms of which 3 ms to minimize.
[2024-06-02 23:57:24] [INFO ] Deduced a trap composed of 43 places in 190 ms of which 2 ms to minimize.
[2024-06-02 23:57:24] [INFO ] Deduced a trap composed of 125 places in 237 ms of which 3 ms to minimize.
[2024-06-02 23:57:24] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 3 ms to minimize.
[2024-06-02 23:57:25] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 23:57:29] [INFO ] Deduced a trap composed of 111 places in 214 ms of which 3 ms to minimize.
[2024-06-02 23:57:29] [INFO ] Deduced a trap composed of 111 places in 188 ms of which 3 ms to minimize.
[2024-06-02 23:57:29] [INFO ] Deduced a trap composed of 111 places in 215 ms of which 3 ms to minimize.
[2024-06-02 23:57:31] [INFO ] Deduced a trap composed of 39 places in 270 ms of which 3 ms to minimize.
[2024-06-02 23:57:31] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 3 ms to minimize.
[2024-06-02 23:57:31] [INFO ] Deduced a trap composed of 28 places in 286 ms of which 3 ms to minimize.
[2024-06-02 23:57:32] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 3 ms to minimize.
[2024-06-02 23:57:32] [INFO ] Deduced a trap composed of 28 places in 280 ms of which 3 ms to minimize.
[2024-06-02 23:57:32] [INFO ] Deduced a trap composed of 90 places in 197 ms of which 3 ms to minimize.
[2024-06-02 23:57:32] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 3 ms to minimize.
[2024-06-02 23:57:34] [INFO ] Deduced a trap composed of 47 places in 256 ms of which 3 ms to minimize.
[2024-06-02 23:57:34] [INFO ] Deduced a trap composed of 40 places in 246 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 Real declared 189/645 variables, and 55 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 23:57:39] [INFO ] Deduced a trap composed of 44 places in 267 ms of which 5 ms to minimize.
[2024-06-02 23:57:40] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 2 ms to minimize.
[2024-06-02 23:57:40] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 23:57:43] [INFO ] Deduced a trap composed of 35 places in 277 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 23:57:47] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 3 ms to minimize.
[2024-06-02 23:57:47] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 3 ms to minimize.
[2024-06-02 23:57:47] [INFO ] Deduced a trap composed of 25 places in 270 ms of which 3 ms to minimize.
[2024-06-02 23:57:48] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 3 ms to minimize.
[2024-06-02 23:57:48] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 3 ms to minimize.
[2024-06-02 23:57:49] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 23:57:52] [INFO ] Deduced a trap composed of 112 places in 214 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 8 (OVERLAPS) 456/645 variables, 189/255 constraints. Problems are: Problem set: 50 solved, 405 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 405/660 constraints. Problems are: Problem set: 50 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 660 constraints, problems are : Problem set: 50 solved, 405 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/455 constraints, Known Traps: 59/59 constraints]
After SMT, in 60433ms problems are : Problem set: 50 solved, 405 unsolved
Search for dead transitions found 50 dead transitions in 60440ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/217 places, 406/523 transitions.
Applied a total of 0 rules in 4 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61068 ms. Remains : 189/217 places, 406/523 transitions.
[2024-06-02 23:58:04] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:58:04] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:58:04] [INFO ] Input system was already deterministic with 406 transitions.
[2024-06-02 23:58:04] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:58:04] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:58:04] [INFO ] Time to serialize gal into /tmp/CTLFireability5755331140878141932.gal : 3 ms
[2024-06-02 23:58:04] [INFO ] Time to serialize properties into /tmp/CTLFireability11117304369995250013.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/CTLFireability5755331140878141932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11117304369995250013.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-06-02 23:58:34] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:58:34] [INFO ] Applying decomposition
[2024-06-02 23:58:34] [INFO ] Flatten gal took : 18 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/graph15852968454282605638.txt' '-o' '/tmp/graph15852968454282605638.bin' '-w' '/tmp/graph15852968454282605638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15852968454282605638.bin' '-l' '-1' '-v' '-w' '/tmp/graph15852968454282605638.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:58:35] [INFO ] Decomposing Gal with order
[2024-06-02 23:58:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:58:35] [INFO ] Removed a total of 926 redundant transitions.
[2024-06-02 23:58:35] [INFO ] Flatten gal took : 48 ms
[2024-06-02 23:58:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 11 ms.
[2024-06-02 23:58:35] [INFO ] Time to serialize gal into /tmp/CTLFireability9671351720563328186.gal : 11 ms
[2024-06-02 23:58:35] [INFO ] Time to serialize properties into /tmp/CTLFireability18056689730479410156.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/CTLFireability9671351720563328186.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18056689730479410156.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.77138e+07,2.03466,55500,2272,42,93468,862,826,292686,90,2416,0


Converting to forward existential form...Done !
original formula: AG(AX((!(E((((i9.u5.p27==1)&&(i9.u23.p105==1))&&((i7.i1.i1.u56.p232==1)&&(i9.u60.p242==1))) U (((i9.u9.p52==1)&&(i2.u19.p97==1))&&((i9.u5...414
=> equivalent forward existential formula: ([(FwdU(EY(FwdU(Init,TRUE)),(((i9.u5.p27==1)&&(i9.u23.p105==1))&&((i7.i1.i1.u56.p232==1)&&(i9.u60.p242==1)))) * ...573
Reverse transition relation is NOT exact ! Due to transitions t59, t93, t97, t107, t162, t168, t170, t178, t184, t186, t212, t220, t244, t252, t257, t258, ...902
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Graph (trivial) has 228 edges and 217 vertex of which 9 / 217 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 210 transition count 486
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 64 place count 180 transition count 483
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 178 transition count 483
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 66 place count 178 transition count 468
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 96 place count 163 transition count 468
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 118 place count 141 transition count 427
Iterating global reduction 3 with 22 rules applied. Total rules applied 140 place count 141 transition count 427
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 156 place count 141 transition count 411
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 156 place count 141 transition count 410
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 140 transition count 410
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 190 place count 124 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 191 place count 124 transition count 393
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 194 place count 121 transition count 363
Iterating global reduction 5 with 3 rules applied. Total rules applied 197 place count 121 transition count 363
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 206 place count 121 transition count 354
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 214 place count 117 transition count 350
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 215 place count 116 transition count 349
Applied a total of 215 rules in 131 ms. Remains 116 /217 variables (removed 101) and now considering 349/523 (removed 174) transitions.
[2024-06-02 23:59:05] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
// Phase 1: matrix 347 rows 116 cols
[2024-06-02 23:59:05] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:59:05] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-02 23:59:05] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
[2024-06-02 23:59:05] [INFO ] Invariant cache hit.
[2024-06-02 23:59:05] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-02 23:59:06] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2024-06-02 23:59:06] [INFO ] Redundant transitions in 41 ms returned []
Running 340 sub problems to find dead transitions.
[2024-06-02 23:59:06] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
[2024-06-02 23:59:06] [INFO ] Invariant cache hit.
[2024-06-02 23:59:06] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-02 23:59:08] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:59:08] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 2 ms to minimize.
[2024-06-02 23:59:09] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 2 ms to minimize.
[2024-06-02 23:59:09] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:59:09] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 2 ms to minimize.
[2024-06-02 23:59:09] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 2 ms to minimize.
[2024-06-02 23:59:10] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 2 ms to minimize.
[2024-06-02 23:59:10] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2024-06-02 23:59:10] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 2 ms to minimize.
[2024-06-02 23:59:10] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:59:10] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 2 ms to minimize.
[2024-06-02 23:59:10] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:59:10] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:59:10] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:59:11] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2024-06-02 23:59:11] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 3 ms to minimize.
[2024-06-02 23:59:11] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (OVERLAPS) 346/462 variables, 116/140 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 64/204 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 1/463 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 8 (OVERLAPS) 0/463 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 205 constraints, problems are : Problem set: 0 solved, 340 unsolved in 26925 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 3 (OVERLAPS) 346/462 variables, 116/140 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 64/204 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 304/508 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/508 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/463 variables, 1/509 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/509 constraints. Problems are: Problem set: 36 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 509 constraints, problems are : Problem set: 36 solved, 304 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 304/340 constraints, Known Traps: 17/17 constraints]
After SMT, in 57475ms problems are : Problem set: 36 solved, 304 unsolved
Search for dead transitions found 36 dead transitions in 57483ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 116/217 places, 313/523 transitions.
Applied a total of 0 rules in 10 ms. Remains 116 /116 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2024-06-03 00:00:03] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 58274 ms. Remains : 116/217 places, 313/523 transitions.
[2024-06-03 00:00:03] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:00:03] [INFO ] Flatten gal took : 11 ms
[2024-06-03 00:00:03] [INFO ] Input system was already deterministic with 313 transitions.
[2024-06-03 00:00:03] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:00:03] [INFO ] Flatten gal took : 10 ms
[2024-06-03 00:00:03] [INFO ] Time to serialize gal into /tmp/CTLFireability10685151758432519716.gal : 3 ms
[2024-06-03 00:00:03] [INFO ] Time to serialize properties into /tmp/CTLFireability12035727947979603379.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/CTLFireability10685151758432519716.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12035727947979603379.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.37532e+06,17.1856,322604,2,40381,5,780482,6,0,777,806808,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.37532e+06,0.499428,16060,555,412,17607,5995,570,39617,118,38491,0


Converting to forward existential form...Done !
original formula: AF(((i7.i0.u26.p188==1)&&(((i1.u7.p70==0)||(i8.u32.p231==0))||(i1.u33.p24==0))))
=> equivalent forward existential formula: [FwdG(Init,!(((i7.i0.u26.p188==1)&&(((i1.u7.p70==0)||(i8.u32.p231==0))||(i1.u33.p24==0)))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,2.78886,66484,1,0,91262,20477,2388,231753,537,183640,225143
FORMULA MedleyA-PT-17-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Graph (trivial) has 194 edges and 217 vertex of which 6 / 217 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 212 transition count 488
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 182 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 181 transition count 486
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 64 place count 181 transition count 470
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 96 place count 165 transition count 470
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 117 place count 144 transition count 431
Iterating global reduction 3 with 21 rules applied. Total rules applied 138 place count 144 transition count 431
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 154 place count 144 transition count 415
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 154 place count 144 transition count 414
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 156 place count 143 transition count 414
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 188 place count 127 transition count 398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 189 place count 127 transition count 397
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 191 place count 125 transition count 379
Iterating global reduction 5 with 2 rules applied. Total rules applied 193 place count 125 transition count 379
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 201 place count 125 transition count 371
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 209 place count 121 transition count 367
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 121 transition count 367
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 120 transition count 366
Applied a total of 211 rules in 62 ms. Remains 120 /217 variables (removed 97) and now considering 366/523 (removed 157) transitions.
[2024-06-03 00:00:36] [INFO ] Flow matrix only has 365 transitions (discarded 1 similar events)
// Phase 1: matrix 365 rows 120 cols
[2024-06-03 00:00:36] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 00:00:36] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-03 00:00:36] [INFO ] Flow matrix only has 365 transitions (discarded 1 similar events)
[2024-06-03 00:00:36] [INFO ] Invariant cache hit.
[2024-06-03 00:00:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-03 00:00:37] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-06-03 00:00:37] [INFO ] Redundant transitions in 6 ms returned []
Running 357 sub problems to find dead transitions.
[2024-06-03 00:00:37] [INFO ] Flow matrix only has 365 transitions (discarded 1 similar events)
[2024-06-03 00:00:37] [INFO ] Invariant cache hit.
[2024-06-03 00:00:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-03 00:00:39] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-06-03 00:00:39] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 1 ms to minimize.
[2024-06-03 00:00:39] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:00:39] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 2 ms to minimize.
[2024-06-03 00:00:39] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-03 00:00:39] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:00:40] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 2 ms to minimize.
[2024-06-03 00:00:40] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 1 ms to minimize.
[2024-06-03 00:00:40] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 2 ms to minimize.
[2024-06-03 00:00:40] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 3 ms to minimize.
[2024-06-03 00:00:40] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 3 ms to minimize.
[2024-06-03 00:00:41] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-06-03 00:00:41] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-06-03 00:00:41] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-06-03 00:00:41] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:00:42] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-03 00:00:43] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (OVERLAPS) 364/484 variables, 120/144 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (OVERLAPS) 1/485 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 357 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 145 constraints, problems are : Problem set: 0 solved, 357 unsolved in 23554 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 357 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 3 (OVERLAPS) 364/484 variables, 120/144 constraints. Problems are: Problem set: 42 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 315/459 constraints. Problems are: Problem set: 42 solved, 315 unsolved
[2024-06-03 00:01:08] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 1/460 constraints. Problems are: Problem set: 42 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 0/460 constraints. Problems are: Problem set: 42 solved, 315 unsolved
SMT process timed out in 53913ms, After SMT, problems are : Problem set: 42 solved, 315 unsolved
Search for dead transitions found 42 dead transitions in 53931ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 120/217 places, 324/523 transitions.
Applied a total of 0 rules in 12 ms. Remains 120 /120 variables (removed 0) and now considering 324/324 (removed 0) transitions.
[2024-06-03 00:01:31] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 54352 ms. Remains : 120/217 places, 324/523 transitions.
[2024-06-03 00:01:31] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:01:31] [INFO ] Flatten gal took : 11 ms
[2024-06-03 00:01:31] [INFO ] Input system was already deterministic with 324 transitions.
[2024-06-03 00:01:31] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:01:31] [INFO ] Flatten gal took : 11 ms
[2024-06-03 00:01:31] [INFO ] Time to serialize gal into /tmp/CTLFireability16834031608701127664.gal : 5 ms
[2024-06-03 00:01:31] [INFO ] Time to serialize properties into /tmp/CTLFireability18164240597012976171.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/CTLFireability16834031608701127664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18164240597012976171.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.44804e+06,26.4438,560996,2,44131,5,1.20529e+06,6,0,805,1.32951e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-03 00:02:01] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:02:01] [INFO ] Applying decomposition
[2024-06-03 00:02:01] [INFO ] Flatten gal took : 19 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/graph4232675113953080877.txt' '-o' '/tmp/graph4232675113953080877.bin' '-w' '/tmp/graph4232675113953080877.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4232675113953080877.bin' '-l' '-1' '-v' '-w' '/tmp/graph4232675113953080877.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:02:01] [INFO ] Decomposing Gal with order
[2024-06-03 00:02:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:02:01] [INFO ] Removed a total of 432 redundant transitions.
[2024-06-03 00:02:01] [INFO ] Flatten gal took : 47 ms
[2024-06-03 00:02:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 225 labels/synchronizations in 17 ms.
[2024-06-03 00:02:01] [INFO ] Time to serialize gal into /tmp/CTLFireability2486219929641616255.gal : 7 ms
[2024-06-03 00:02:01] [INFO ] Time to serialize properties into /tmp/CTLFireability13331827404676054982.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/CTLFireability2486219929641616255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13331827404676054982.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.44804e+06,2.33736,51524,535,3493,30160,120370,663,60521,272,285263,0


Converting to forward existential form...Done !
original formula: A(AG(((i7.u26.p223==1) + !(AF((((i1.i1.u30.p27==1)&&(i1.i1.u30.p71==1))&&((i4.u16.p167==1)&&(i1.i1.u30.p242==1))))))) U (AF(((((i1.i1.u30...465
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!(((((i1.i1.u30.p25==1)&&(i2.u2.p41==1))&&((i1.i0.u6.p65==1)&&(i1.i1.u30.p103==1)))&&(i1....1230
Reverse transition relation is NOT exact ! Due to transitions t21, t29, t62, t72, t96, t98, t106, t108, t113, t116, t117, t118, t119, t120, t122, t123, t12...639
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 199 transition count 493
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 199 transition count 493
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 53 place count 199 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 198 transition count 474
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 198 transition count 474
Applied a total of 55 rules in 8 ms. Remains 198 /217 variables (removed 19) and now considering 474/523 (removed 49) transitions.
// Phase 1: matrix 474 rows 198 cols
[2024-06-03 00:02:31] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 00:02:31] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-03 00:02:31] [INFO ] Invariant cache hit.
[2024-06-03 00:02:31] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-06-03 00:02:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-03 00:02:37] [INFO ] Deduced a trap composed of 18 places in 230 ms of which 3 ms to minimize.
[2024-06-03 00:02:37] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 3 ms to minimize.
[2024-06-03 00:02:37] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-06-03 00:02:37] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-06-03 00:02:37] [INFO ] Deduced a trap composed of 117 places in 231 ms of which 4 ms to minimize.
[2024-06-03 00:02:38] [INFO ] Deduced a trap composed of 115 places in 233 ms of which 3 ms to minimize.
[2024-06-03 00:02:38] [INFO ] Deduced a trap composed of 54 places in 238 ms of which 4 ms to minimize.
[2024-06-03 00:02:38] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 3 ms to minimize.
[2024-06-03 00:02:38] [INFO ] Deduced a trap composed of 45 places in 228 ms of which 3 ms to minimize.
[2024-06-03 00:02:39] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 4 ms to minimize.
[2024-06-03 00:02:39] [INFO ] Deduced a trap composed of 37 places in 221 ms of which 3 ms to minimize.
[2024-06-03 00:02:39] [INFO ] Deduced a trap composed of 115 places in 161 ms of which 3 ms to minimize.
[2024-06-03 00:02:39] [INFO ] Deduced a trap composed of 115 places in 175 ms of which 3 ms to minimize.
[2024-06-03 00:02:40] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 3 ms to minimize.
[2024-06-03 00:02:40] [INFO ] Deduced a trap composed of 119 places in 230 ms of which 4 ms to minimize.
[2024-06-03 00:02:40] [INFO ] Deduced a trap composed of 25 places in 236 ms of which 3 ms to minimize.
[2024-06-03 00:02:41] [INFO ] Deduced a trap composed of 37 places in 237 ms of which 3 ms to minimize.
[2024-06-03 00:02:41] [INFO ] Deduced a trap composed of 28 places in 304 ms of which 4 ms to minimize.
[2024-06-03 00:02:41] [INFO ] Deduced a trap composed of 40 places in 273 ms of which 3 ms to minimize.
[2024-06-03 00:02:42] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-03 00:02:43] [INFO ] Deduced a trap composed of 22 places in 303 ms of which 3 ms to minimize.
[2024-06-03 00:02:43] [INFO ] Deduced a trap composed of 31 places in 304 ms of which 4 ms to minimize.
[2024-06-03 00:02:44] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 2 ms to minimize.
[2024-06-03 00:02:44] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 2 ms to minimize.
[2024-06-03 00:02:44] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 4 ms to minimize.
[2024-06-03 00:02:44] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 3 ms to minimize.
[2024-06-03 00:02:45] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 2 ms to minimize.
[2024-06-03 00:02:45] [INFO ] Deduced a trap composed of 22 places in 290 ms of which 3 ms to minimize.
[2024-06-03 00:02:45] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 3 ms to minimize.
[2024-06-03 00:02:45] [INFO ] Deduced a trap composed of 121 places in 211 ms of which 3 ms to minimize.
[2024-06-03 00:02:46] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 3 ms to minimize.
[2024-06-03 00:02:46] [INFO ] Deduced a trap composed of 46 places in 206 ms of which 3 ms to minimize.
[2024-06-03 00:02:46] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 3 ms to minimize.
[2024-06-03 00:02:46] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 3 ms to minimize.
[2024-06-03 00:02:47] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 2 ms to minimize.
[2024-06-03 00:02:47] [INFO ] Deduced a trap composed of 32 places in 305 ms of which 3 ms to minimize.
[2024-06-03 00:02:47] [INFO ] Deduced a trap composed of 24 places in 301 ms of which 4 ms to minimize.
[2024-06-03 00:02:48] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 3 ms to minimize.
[2024-06-03 00:02:48] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 3 ms to minimize.
[2024-06-03 00:02:49] [INFO ] Deduced a trap composed of 45 places in 263 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-03 00:02:52] [INFO ] Deduced a trap composed of 25 places in 308 ms of which 3 ms to minimize.
[2024-06-03 00:02:52] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 4 ms to minimize.
[2024-06-03 00:02:53] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 4 ms to minimize.
[2024-06-03 00:02:54] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 2 ms to minimize.
[2024-06-03 00:02:55] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 2 ms to minimize.
[2024-06-03 00:02:56] [INFO ] Deduced a trap composed of 22 places in 296 ms of which 3 ms to minimize.
[2024-06-03 00:02:57] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-03 00:02:58] [INFO ] Deduced a trap composed of 120 places in 281 ms of which 3 ms to minimize.
[2024-06-03 00:02:58] [INFO ] Deduced a trap composed of 115 places in 278 ms of which 3 ms to minimize.
[2024-06-03 00:02:59] [INFO ] Deduced a trap composed of 25 places in 242 ms of which 3 ms to minimize.
[2024-06-03 00:02:59] [INFO ] Deduced a trap composed of 127 places in 239 ms of which 3 ms to minimize.
[2024-06-03 00:03:00] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 2 ms to minimize.
[2024-06-03 00:03:00] [INFO ] Deduced a trap composed of 43 places in 216 ms of which 3 ms to minimize.
[2024-06-03 00:03:00] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 3 ms to minimize.
[2024-06-03 00:03:01] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 198/672 variables, and 62 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/198 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 55/62 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-03 00:03:07] [INFO ] Deduced a trap composed of 122 places in 198 ms of which 3 ms to minimize.
[2024-06-03 00:03:07] [INFO ] Deduced a trap composed of 118 places in 292 ms of which 4 ms to minimize.
[2024-06-03 00:03:07] [INFO ] Deduced a trap composed of 134 places in 207 ms of which 3 ms to minimize.
[2024-06-03 00:03:08] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 2 ms to minimize.
[2024-06-03 00:03:08] [INFO ] Deduced a trap composed of 136 places in 225 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-03 00:03:12] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 3 ms to minimize.
[2024-06-03 00:03:12] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 2 ms to minimize.
[2024-06-03 00:03:13] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-03 00:03:16] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 2 ms to minimize.
[2024-06-03 00:03:16] [INFO ] Deduced a trap composed of 90 places in 204 ms of which 3 ms to minimize.
[2024-06-03 00:03:17] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-03 00:03:20] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 8 (OVERLAPS) 474/672 variables, 198/272 constraints. Problems are: Problem set: 50 solved, 423 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/672 variables, 423/695 constraints. Problems are: Problem set: 50 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/672 variables, and 695 constraints, problems are : Problem set: 50 solved, 423 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 423/473 constraints, Known Traps: 67/67 constraints]
After SMT, in 60351ms problems are : Problem set: 50 solved, 423 unsolved
Search for dead transitions found 50 dead transitions in 60357ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 198/217 places, 424/523 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60834 ms. Remains : 198/217 places, 424/523 transitions.
[2024-06-03 00:03:32] [INFO ] Flatten gal took : 24 ms
[2024-06-03 00:03:32] [INFO ] Flatten gal took : 25 ms
[2024-06-03 00:03:32] [INFO ] Input system was already deterministic with 424 transitions.
[2024-06-03 00:03:32] [INFO ] Flatten gal took : 25 ms
[2024-06-03 00:03:32] [INFO ] Flatten gal took : 25 ms
[2024-06-03 00:03:32] [INFO ] Time to serialize gal into /tmp/CTLFireability966068619248557304.gal : 5 ms
[2024-06-03 00:03:32] [INFO ] Time to serialize properties into /tmp/CTLFireability8623670549367781334.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/CTLFireability966068619248557304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8623670549367781334.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-06-03 00:04:02] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:04:02] [INFO ] Applying decomposition
[2024-06-03 00:04:02] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12760141189799032752.txt' '-o' '/tmp/graph12760141189799032752.bin' '-w' '/tmp/graph12760141189799032752.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12760141189799032752.bin' '-l' '-1' '-v' '-w' '/tmp/graph12760141189799032752.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:04:02] [INFO ] Decomposing Gal with order
[2024-06-03 00:04:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:04:02] [INFO ] Removed a total of 966 redundant transitions.
[2024-06-03 00:04:02] [INFO ] Flatten gal took : 36 ms
[2024-06-03 00:04:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 11 ms.
[2024-06-03 00:04:02] [INFO ] Time to serialize gal into /tmp/CTLFireability17847423560057601763.gal : 5 ms
[2024-06-03 00:04:02] [INFO ] Time to serialize properties into /tmp/CTLFireability9064471253396339557.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/CTLFireability17847423560057601763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9064471253396339557.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.63893e+07,11.0358,290988,2998,93,653067,1403,1034,1.26132e+06,113,3929,0


Converting to forward existential form...Done !
original formula: A((E((E((i5.i0.u30.p132==1) U (((((i9.i2.u5.p28==1)&&(i1.u7.p39==1))&&((i2.u14.p70==1)&&(i3.u18.p96==1)))&&(i9.i2.u65.p247==1))||((i6.u4....750
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!((!(EG(!((((i2.u14.p69==1)||((((i9.i2.u5.p25==1)&&(i1.u8.p41==1))&&((i9.i2.u15.p74==1)&&(...1442
Reverse transition relation is NOT exact ! Due to transitions t39, t73, t86, t97, t194, t200, t202, t226, t228, t234, t236, t258, t260, t266, t268, t283, t...1227
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 191 transition count 478
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 191 transition count 478
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 70 place count 191 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 189 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 189 transition count 456
Applied a total of 74 rules in 7 ms. Remains 189 /217 variables (removed 28) and now considering 456/523 (removed 67) transitions.
// Phase 1: matrix 456 rows 189 cols
[2024-06-03 00:04:32] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 00:04:32] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-03 00:04:32] [INFO ] Invariant cache hit.
[2024-06-03 00:04:33] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-06-03 00:04:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:04:40] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 3 ms to minimize.
[2024-06-03 00:04:40] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 2 ms to minimize.
[2024-06-03 00:04:40] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 2 ms to minimize.
[2024-06-03 00:04:40] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:04:41] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 3 ms to minimize.
[2024-06-03 00:04:41] [INFO ] Deduced a trap composed of 47 places in 307 ms of which 3 ms to minimize.
[2024-06-03 00:04:41] [INFO ] Deduced a trap composed of 37 places in 293 ms of which 4 ms to minimize.
[2024-06-03 00:04:41] [INFO ] Deduced a trap composed of 111 places in 171 ms of which 2 ms to minimize.
[2024-06-03 00:04:42] [INFO ] Deduced a trap composed of 85 places in 241 ms of which 3 ms to minimize.
[2024-06-03 00:04:42] [INFO ] Deduced a trap composed of 85 places in 231 ms of which 3 ms to minimize.
[2024-06-03 00:04:42] [INFO ] Deduced a trap composed of 42 places in 291 ms of which 3 ms to minimize.
[2024-06-03 00:04:43] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 3 ms to minimize.
[2024-06-03 00:04:43] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 3 ms to minimize.
[2024-06-03 00:04:43] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 2 ms to minimize.
[2024-06-03 00:04:44] [INFO ] Deduced a trap composed of 24 places in 308 ms of which 4 ms to minimize.
[2024-06-03 00:04:44] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 3 ms to minimize.
[2024-06-03 00:04:45] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 2 ms to minimize.
[2024-06-03 00:04:45] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 3 ms to minimize.
[2024-06-03 00:04:45] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 3 ms to minimize.
[2024-06-03 00:04:45] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:04:46] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 2 ms to minimize.
[2024-06-03 00:04:46] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 3 ms to minimize.
[2024-06-03 00:04:46] [INFO ] Deduced a trap composed of 25 places in 217 ms of which 3 ms to minimize.
[2024-06-03 00:04:46] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 2 ms to minimize.
[2024-06-03 00:04:47] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 2 ms to minimize.
[2024-06-03 00:04:47] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 3 ms to minimize.
[2024-06-03 00:04:47] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 3 ms to minimize.
[2024-06-03 00:04:48] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 3 ms to minimize.
[2024-06-03 00:04:48] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 3 ms to minimize.
[2024-06-03 00:04:49] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 2 ms to minimize.
[2024-06-03 00:04:50] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 2 ms to minimize.
[2024-06-03 00:04:50] [INFO ] Deduced a trap composed of 115 places in 175 ms of which 2 ms to minimize.
[2024-06-03 00:04:50] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 3 ms to minimize.
[2024-06-03 00:04:51] [INFO ] Deduced a trap composed of 125 places in 206 ms of which 2 ms to minimize.
[2024-06-03 00:04:51] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 2 ms to minimize.
[2024-06-03 00:04:51] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:04:54] [INFO ] Deduced a trap composed of 111 places in 110 ms of which 2 ms to minimize.
[2024-06-03 00:04:55] [INFO ] Deduced a trap composed of 111 places in 165 ms of which 3 ms to minimize.
[2024-06-03 00:04:55] [INFO ] Deduced a trap composed of 111 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:04:56] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 3 ms to minimize.
[2024-06-03 00:04:57] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 3 ms to minimize.
[2024-06-03 00:04:57] [INFO ] Deduced a trap composed of 28 places in 302 ms of which 4 ms to minimize.
[2024-06-03 00:04:57] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 3 ms to minimize.
[2024-06-03 00:04:58] [INFO ] Deduced a trap composed of 28 places in 263 ms of which 2 ms to minimize.
[2024-06-03 00:04:58] [INFO ] Deduced a trap composed of 90 places in 198 ms of which 3 ms to minimize.
[2024-06-03 00:04:58] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 3 ms to minimize.
[2024-06-03 00:04:59] [INFO ] Deduced a trap composed of 47 places in 265 ms of which 3 ms to minimize.
[2024-06-03 00:05:00] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:05:03] [INFO ] Deduced a trap composed of 112 places in 285 ms of which 4 ms to minimize.
[2024-06-03 00:05:03] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 4 ms to minimize.
[2024-06-03 00:05:03] [INFO ] Deduced a trap composed of 31 places in 277 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 189/645 variables, and 58 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 51/58 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:05:09] [INFO ] Deduced a trap composed of 35 places in 225 ms of which 3 ms to minimize.
[2024-06-03 00:05:09] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 3 ms to minimize.
[2024-06-03 00:05:10] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 4 ms to minimize.
[2024-06-03 00:05:10] [INFO ] Deduced a trap composed of 21 places in 287 ms of which 4 ms to minimize.
[2024-06-03 00:05:10] [INFO ] Deduced a trap composed of 112 places in 276 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 5 (OVERLAPS) 456/645 variables, 189/252 constraints. Problems are: Problem set: 50 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 405/657 constraints. Problems are: Problem set: 50 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 657 constraints, problems are : Problem set: 50 solved, 405 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/455 constraints, Known Traps: 56/56 constraints]
After SMT, in 60537ms problems are : Problem set: 50 solved, 405 unsolved
Search for dead transitions found 50 dead transitions in 60545ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/217 places, 406/523 transitions.
Applied a total of 0 rules in 3 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61124 ms. Remains : 189/217 places, 406/523 transitions.
[2024-06-03 00:05:33] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:05:33] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:05:34] [INFO ] Input system was already deterministic with 406 transitions.
[2024-06-03 00:05:34] [INFO ] Flatten gal took : 30 ms
[2024-06-03 00:05:34] [INFO ] Flatten gal took : 31 ms
[2024-06-03 00:05:34] [INFO ] Time to serialize gal into /tmp/CTLFireability8535061974810878092.gal : 3 ms
[2024-06-03 00:05:34] [INFO ] Time to serialize properties into /tmp/CTLFireability2129659553933314185.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/CTLFireability8535061974810878092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2129659553933314185.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-06-03 00:06:04] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:06:04] [INFO ] Applying decomposition
[2024-06-03 00:06:04] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15422562396554738857.txt' '-o' '/tmp/graph15422562396554738857.bin' '-w' '/tmp/graph15422562396554738857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15422562396554738857.bin' '-l' '-1' '-v' '-w' '/tmp/graph15422562396554738857.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:06:04] [INFO ] Decomposing Gal with order
[2024-06-03 00:06:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:06:04] [INFO ] Removed a total of 937 redundant transitions.
[2024-06-03 00:06:04] [INFO ] Flatten gal took : 33 ms
[2024-06-03 00:06:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 7 ms.
[2024-06-03 00:06:04] [INFO ] Time to serialize gal into /tmp/CTLFireability17820795339399440129.gal : 7 ms
[2024-06-03 00:06:04] [INFO ] Time to serialize properties into /tmp/CTLFireability10899586015155952365.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/CTLFireability17820795339399440129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10899586015155952365.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.77138e+07,2.64633,88748,2297,45,132631,692,779,599892,88,2187,0


Converting to forward existential form...Done !
original formula: (AG((i7.u58.p223==0)) * EF(EX(EG(((i1.u14.p67==1)&&(i7.u56.p232==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((i7.u58.p223==0)))] = FALSE * [(Init * !(E(TRUE U EX(EG(((i1.u14.p67==1)&&(i7.u56.p232==1...172
Reverse transition relation is NOT exact ! Due to transitions t12, t41, t84, t97, t162, t168, t170, t178, t184, t186, t209, t212, t217, t220, t241, t244, t...952
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Graph (trivial) has 217 edges and 217 vertex of which 6 / 217 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 212 transition count 488
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 182 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 181 transition count 486
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 64 place count 181 transition count 473
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 90 place count 168 transition count 473
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 112 place count 146 transition count 432
Iterating global reduction 3 with 22 rules applied. Total rules applied 134 place count 146 transition count 432
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 150 place count 146 transition count 416
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 150 place count 146 transition count 415
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 152 place count 145 transition count 415
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 184 place count 129 transition count 399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 185 place count 129 transition count 398
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 188 place count 126 transition count 368
Iterating global reduction 5 with 3 rules applied. Total rules applied 191 place count 126 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 199 place count 126 transition count 360
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 207 place count 122 transition count 356
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 208 place count 122 transition count 356
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 121 transition count 355
Applied a total of 209 rules in 55 ms. Remains 121 /217 variables (removed 96) and now considering 355/523 (removed 168) transitions.
[2024-06-03 00:06:34] [INFO ] Flow matrix only has 354 transitions (discarded 1 similar events)
// Phase 1: matrix 354 rows 121 cols
[2024-06-03 00:06:34] [INFO ] Computed 7 invariants in 5 ms
[2024-06-03 00:06:34] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-03 00:06:34] [INFO ] Flow matrix only has 354 transitions (discarded 1 similar events)
[2024-06-03 00:06:34] [INFO ] Invariant cache hit.
[2024-06-03 00:06:34] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-03 00:06:34] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-06-03 00:06:34] [INFO ] Redundant transitions in 3 ms returned []
Running 346 sub problems to find dead transitions.
[2024-06-03 00:06:34] [INFO ] Flow matrix only has 354 transitions (discarded 1 similar events)
[2024-06-03 00:06:34] [INFO ] Invariant cache hit.
[2024-06-03 00:06:34] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-03 00:06:37] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 2 ms to minimize.
[2024-06-03 00:06:37] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:06:37] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 2 ms to minimize.
[2024-06-03 00:06:38] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 2 ms to minimize.
[2024-06-03 00:06:38] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 2 ms to minimize.
[2024-06-03 00:06:38] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 2 ms to minimize.
[2024-06-03 00:06:38] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 2 ms to minimize.
[2024-06-03 00:06:38] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
[2024-06-03 00:06:39] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 2 ms to minimize.
[2024-06-03 00:06:39] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 2 ms to minimize.
[2024-06-03 00:06:39] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-03 00:06:39] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-06-03 00:06:39] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-06-03 00:06:39] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-03 00:06:39] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-06-03 00:06:39] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-03 00:06:42] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 4 (OVERLAPS) 353/474 variables, 121/145 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 64/209 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 7 (OVERLAPS) 1/475 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/475 variables, and 210 constraints, problems are : Problem set: 0 solved, 346 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 346 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 3 (OVERLAPS) 353/474 variables, 121/145 constraints. Problems are: Problem set: 36 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 64/209 constraints. Problems are: Problem set: 36 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/475 variables, and 519 constraints, problems are : Problem set: 36 solved, 310 unsolved in 30144 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 310/346 constraints, Known Traps: 17/17 constraints]
After SMT, in 60515ms problems are : Problem set: 36 solved, 310 unsolved
Search for dead transitions found 36 dead transitions in 60519ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 121/217 places, 319/523 transitions.
Applied a total of 0 rules in 8 ms. Remains 121 /121 variables (removed 0) and now considering 319/319 (removed 0) transitions.
[2024-06-03 00:07:35] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61050 ms. Remains : 121/217 places, 319/523 transitions.
[2024-06-03 00:07:35] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:07:35] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:07:35] [INFO ] Input system was already deterministic with 319 transitions.
[2024-06-03 00:07:35] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:07:35] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:07:35] [INFO ] Time to serialize gal into /tmp/CTLFireability535057820967333253.gal : 3 ms
[2024-06-03 00:07:35] [INFO ] Time to serialize properties into /tmp/CTLFireability10015261297908896511.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/CTLFireability535057820967333253.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10015261297908896511.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.88741e+06,5.63447,124828,2,25760,5,330813,6,0,804,343949,0


Converting to forward existential form...Done !
original formula: AG(((p206==0) + (((p114==0) * ((p57==1) + A(((p70==1)&&(p231==1)) U ((p43==1)&&(p146==1))))) * ((EF(((p43==0)||(p124==0))) + ((p43==1)&&(...192
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !((p206==0))) * !((p114==0)))] = FALSE * ([(FwdU(((FwdU(Init,TRUE) * !((p206==0))) * !((p...538
(forward)formula 0,0,5.65925,124828,1,0,11,330813,11,4,818,343949,2
FORMULA MedleyA-PT-17-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 194 transition count 484
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 194 transition count 484
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 64 place count 194 transition count 466
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 192 transition count 462
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 192 transition count 462
Applied a total of 68 rules in 8 ms. Remains 192 /217 variables (removed 25) and now considering 462/523 (removed 61) transitions.
// Phase 1: matrix 462 rows 192 cols
[2024-06-03 00:07:41] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 00:07:41] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-03 00:07:41] [INFO ] Invariant cache hit.
[2024-06-03 00:07:41] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-06-03 00:07:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 00:07:47] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 4 ms to minimize.
[2024-06-03 00:07:47] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 3 ms to minimize.
[2024-06-03 00:07:48] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 2 ms to minimize.
[2024-06-03 00:07:48] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 3 ms to minimize.
[2024-06-03 00:07:48] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-03 00:07:48] [INFO ] Deduced a trap composed of 112 places in 158 ms of which 2 ms to minimize.
[2024-06-03 00:07:48] [INFO ] Deduced a trap composed of 112 places in 205 ms of which 3 ms to minimize.
[2024-06-03 00:07:49] [INFO ] Deduced a trap composed of 39 places in 287 ms of which 3 ms to minimize.
[2024-06-03 00:07:49] [INFO ] Deduced a trap composed of 114 places in 303 ms of which 4 ms to minimize.
[2024-06-03 00:07:49] [INFO ] Deduced a trap composed of 38 places in 301 ms of which 3 ms to minimize.
[2024-06-03 00:07:50] [INFO ] Deduced a trap composed of 24 places in 311 ms of which 3 ms to minimize.
[2024-06-03 00:07:50] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 4 ms to minimize.
[2024-06-03 00:07:50] [INFO ] Deduced a trap composed of 50 places in 280 ms of which 3 ms to minimize.
[2024-06-03 00:07:50] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 3 ms to minimize.
[2024-06-03 00:07:51] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 2 ms to minimize.
[2024-06-03 00:07:52] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 4 ms to minimize.
[2024-06-03 00:07:52] [INFO ] Deduced a trap composed of 26 places in 237 ms of which 3 ms to minimize.
[2024-06-03 00:07:52] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 3 ms to minimize.
[2024-06-03 00:07:52] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 3 ms to minimize.
[2024-06-03 00:07:53] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 00:07:53] [INFO ] Deduced a trap composed of 112 places in 157 ms of which 2 ms to minimize.
[2024-06-03 00:07:54] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 3 ms to minimize.
[2024-06-03 00:07:55] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 3 ms to minimize.
[2024-06-03 00:07:55] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 3 ms to minimize.
[2024-06-03 00:07:55] [INFO ] Deduced a trap composed of 37 places in 254 ms of which 3 ms to minimize.
[2024-06-03 00:07:55] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 2 ms to minimize.
[2024-06-03 00:07:56] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 2 ms to minimize.
[2024-06-03 00:07:56] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 3 ms to minimize.
[2024-06-03 00:07:56] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 3 ms to minimize.
[2024-06-03 00:07:57] [INFO ] Deduced a trap composed of 21 places in 273 ms of which 3 ms to minimize.
[2024-06-03 00:07:57] [INFO ] Deduced a trap composed of 38 places in 305 ms of which 3 ms to minimize.
[2024-06-03 00:07:57] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 4 ms to minimize.
[2024-06-03 00:07:58] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 3 ms to minimize.
[2024-06-03 00:07:58] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 2 ms to minimize.
[2024-06-03 00:07:58] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 2 ms to minimize.
[2024-06-03 00:07:58] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 2 ms to minimize.
[2024-06-03 00:07:58] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 2 ms to minimize.
[2024-06-03 00:07:59] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 2 ms to minimize.
[2024-06-03 00:08:00] [INFO ] Deduced a trap composed of 52 places in 209 ms of which 3 ms to minimize.
[2024-06-03 00:08:00] [INFO ] Deduced a trap composed of 122 places in 207 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 00:08:05] [INFO ] Deduced a trap composed of 117 places in 220 ms of which 3 ms to minimize.
[2024-06-03 00:08:05] [INFO ] Deduced a trap composed of 120 places in 223 ms of which 3 ms to minimize.
[2024-06-03 00:08:05] [INFO ] Deduced a trap composed of 90 places in 295 ms of which 3 ms to minimize.
[2024-06-03 00:08:07] [INFO ] Deduced a trap composed of 43 places in 236 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 192/654 variables, and 51 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/192 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 00:08:17] [INFO ] Deduced a trap composed of 113 places in 235 ms of which 4 ms to minimize.
[2024-06-03 00:08:18] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 3 ms to minimize.
[2024-06-03 00:08:18] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 2 ms to minimize.
[2024-06-03 00:08:18] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 00:08:21] [INFO ] Deduced a trap composed of 92 places in 241 ms of which 3 ms to minimize.
[2024-06-03 00:08:21] [INFO ] Deduced a trap composed of 112 places in 231 ms of which 3 ms to minimize.
[2024-06-03 00:08:22] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 2 ms to minimize.
[2024-06-03 00:08:22] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 3 ms to minimize.
[2024-06-03 00:08:22] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 00:08:27] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 2 ms to minimize.
[2024-06-03 00:08:28] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 00:08:30] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2024-06-03 00:08:31] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 00:08:35] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 4 ms to minimize.
[2024-06-03 00:08:35] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 3 ms to minimize.
[2024-06-03 00:08:36] [INFO ] Deduced a trap composed of 90 places in 168 ms of which 3 ms to minimize.
[2024-06-03 00:08:37] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 2 ms to minimize.
[2024-06-03 00:08:37] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 3 ms to minimize.
[2024-06-03 00:08:37] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/654 variables, and 70 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/192 constraints, PredecessorRefiner: 0/461 constraints, Known Traps: 63/63 constraints]
After SMT, in 60395ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60404ms
Starting structural reductions in LTL mode, iteration 1 : 192/217 places, 462/523 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60960 ms. Remains : 192/217 places, 462/523 transitions.
[2024-06-03 00:08:42] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:08:42] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:08:42] [INFO ] Input system was already deterministic with 462 transitions.
[2024-06-03 00:08:42] [INFO ] Flatten gal took : 22 ms
[2024-06-03 00:08:42] [INFO ] Flatten gal took : 29 ms
[2024-06-03 00:08:42] [INFO ] Time to serialize gal into /tmp/CTLFireability7618364752652483447.gal : 4 ms
[2024-06-03 00:08:42] [INFO ] Time to serialize properties into /tmp/CTLFireability16297721443777289161.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/CTLFireability7618364752652483447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16297721443777289161.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-06-03 00:09:12] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:09:12] [INFO ] Applying decomposition
[2024-06-03 00:09:12] [INFO ] Flatten gal took : 18 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/graph9606040564453086287.txt' '-o' '/tmp/graph9606040564453086287.bin' '-w' '/tmp/graph9606040564453086287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9606040564453086287.bin' '-l' '-1' '-v' '-w' '/tmp/graph9606040564453086287.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:09:12] [INFO ] Decomposing Gal with order
[2024-06-03 00:09:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:09:12] [INFO ] Removed a total of 1105 redundant transitions.
[2024-06-03 00:09:12] [INFO ] Flatten gal took : 62 ms
[2024-06-03 00:09:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 14 ms.
[2024-06-03 00:09:12] [INFO ] Time to serialize gal into /tmp/CTLFireability8454378950342919252.gal : 17 ms
[2024-06-03 00:09:12] [INFO ] Time to serialize properties into /tmp/CTLFireability14055534897897999505.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/CTLFireability8454378950342919252.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14055534897897999505.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.14262e+07,27.6743,240820,4423,279,174865,5878,1048,1.94626e+06,134,47579,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Graph (trivial) has 235 edges and 217 vertex of which 9 / 217 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 210 transition count 484
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 178 transition count 483
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 66 place count 178 transition count 469
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 94 place count 164 transition count 469
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 117 place count 141 transition count 426
Iterating global reduction 2 with 23 rules applied. Total rules applied 140 place count 141 transition count 426
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 156 place count 141 transition count 410
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 156 place count 141 transition count 409
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 158 place count 140 transition count 409
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 190 place count 124 transition count 393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 191 place count 124 transition count 392
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 194 place count 121 transition count 362
Iterating global reduction 4 with 3 rules applied. Total rules applied 197 place count 121 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 205 place count 121 transition count 354
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 213 place count 117 transition count 350
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 214 place count 116 transition count 349
Applied a total of 214 rules in 62 ms. Remains 116 /217 variables (removed 101) and now considering 349/523 (removed 174) transitions.
[2024-06-03 00:09:42] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
// Phase 1: matrix 347 rows 116 cols
[2024-06-03 00:09:42] [INFO ] Computed 7 invariants in 1 ms
[2024-06-03 00:09:42] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-03 00:09:42] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
[2024-06-03 00:09:42] [INFO ] Invariant cache hit.
[2024-06-03 00:09:43] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-03 00:09:43] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2024-06-03 00:09:43] [INFO ] Redundant transitions in 4 ms returned []
Running 340 sub problems to find dead transitions.
[2024-06-03 00:09:43] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
[2024-06-03 00:09:43] [INFO ] Invariant cache hit.
[2024-06-03 00:09:43] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-03 00:09:46] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 2 ms to minimize.
[2024-06-03 00:09:46] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 2 ms to minimize.
[2024-06-03 00:09:46] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 2 ms to minimize.
[2024-06-03 00:09:47] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 3 ms to minimize.
[2024-06-03 00:09:47] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 2 ms to minimize.
[2024-06-03 00:09:47] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 2 ms to minimize.
[2024-06-03 00:09:47] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-06-03 00:09:47] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 2 ms to minimize.
[2024-06-03 00:09:47] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 2 ms to minimize.
[2024-06-03 00:09:48] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2024-06-03 00:09:48] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2024-06-03 00:09:48] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-06-03 00:09:48] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (OVERLAPS) 346/462 variables, 116/136 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 64/200 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 1/463 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 8 (OVERLAPS) 0/463 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 201 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-03 00:10:14] [INFO ] Deduced a trap composed of 36 places in 198 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-03 00:10:16] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 5 (OVERLAPS) 346/462 variables, 116/138 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 64/202 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 304/506 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 0/506 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 9 (OVERLAPS) 1/463 variables, 1/507 constraints. Problems are: Problem set: 36 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 507 constraints, problems are : Problem set: 36 solved, 304 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 304/340 constraints, Known Traps: 15/15 constraints]
After SMT, in 60493ms problems are : Problem set: 36 solved, 304 unsolved
Search for dead transitions found 36 dead transitions in 60499ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 116/217 places, 313/523 transitions.
Applied a total of 0 rules in 4 ms. Remains 116 /116 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2024-06-03 00:10:43] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61264 ms. Remains : 116/217 places, 313/523 transitions.
[2024-06-03 00:10:43] [INFO ] Flatten gal took : 9 ms
[2024-06-03 00:10:43] [INFO ] Flatten gal took : 9 ms
[2024-06-03 00:10:43] [INFO ] Input system was already deterministic with 313 transitions.
[2024-06-03 00:10:43] [INFO ] Flatten gal took : 8 ms
[2024-06-03 00:10:43] [INFO ] Flatten gal took : 8 ms
[2024-06-03 00:10:43] [INFO ] Time to serialize gal into /tmp/CTLFireability9951621393084781873.gal : 3 ms
[2024-06-03 00:10:43] [INFO ] Time to serialize properties into /tmp/CTLFireability1789303830400501211.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/CTLFireability9951621393084781873.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1789303830400501211.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.36642e+06,11.6409,265320,2,40319,5,639210,6,0,777,609472,0


Converting to forward existential form...Done !
original formula: AF(((p43==1)&&(p211==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((p43==1)&&(p211==1))))] = FALSE
Hit Full ! (commute/partial/dont) 294/0/19
Detected timeout of ITS tools.
[2024-06-03 00:11:14] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:11:14] [INFO ] Applying decomposition
[2024-06-03 00:11:14] [INFO ] Flatten gal took : 15 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/graph14103121048684326721.txt' '-o' '/tmp/graph14103121048684326721.bin' '-w' '/tmp/graph14103121048684326721.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14103121048684326721.bin' '-l' '-1' '-v' '-w' '/tmp/graph14103121048684326721.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:11:14] [INFO ] Decomposing Gal with order
[2024-06-03 00:11:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:11:14] [INFO ] Removed a total of 541 redundant transitions.
[2024-06-03 00:11:14] [INFO ] Flatten gal took : 33 ms
[2024-06-03 00:11:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 6 ms.
[2024-06-03 00:11:14] [INFO ] Time to serialize gal into /tmp/CTLFireability5071272901223119002.gal : 4 ms
[2024-06-03 00:11:14] [INFO ] Time to serialize properties into /tmp/CTLFireability6552114630665875740.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/CTLFireability5071272901223119002.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6552114630665875740.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.36642e+06,0.802483,19456,1228,374,28287,2518,563,64372,119,8114,0


Converting to forward existential form...Done !
original formula: AF(((u3.p43==1)&&(i4.u29.p211==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((u3.p43==1)&&(i4.u29.p211==1))))] = FALSE
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,1.74433,41368,1,0,67606,6641,2469,194443,529,23782,147044
FORMULA MedleyA-PT-17-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 192 transition count 480
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 192 transition count 480
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 68 place count 192 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 190 transition count 458
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 190 transition count 458
Applied a total of 72 rules in 6 ms. Remains 190 /217 variables (removed 27) and now considering 458/523 (removed 65) transitions.
// Phase 1: matrix 458 rows 190 cols
[2024-06-03 00:11:15] [INFO ] Computed 7 invariants in 6 ms
[2024-06-03 00:11:16] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-03 00:11:16] [INFO ] Invariant cache hit.
[2024-06-03 00:11:16] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-03 00:11:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:11:23] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 3 ms to minimize.
[2024-06-03 00:11:23] [INFO ] Deduced a trap composed of 15 places in 257 ms of which 3 ms to minimize.
[2024-06-03 00:11:23] [INFO ] Deduced a trap composed of 17 places in 264 ms of which 3 ms to minimize.
[2024-06-03 00:11:24] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 2 ms to minimize.
[2024-06-03 00:11:24] [INFO ] Deduced a trap composed of 43 places in 300 ms of which 3 ms to minimize.
[2024-06-03 00:11:24] [INFO ] Deduced a trap composed of 113 places in 267 ms of which 4 ms to minimize.
[2024-06-03 00:11:25] [INFO ] Deduced a trap composed of 112 places in 205 ms of which 3 ms to minimize.
[2024-06-03 00:11:25] [INFO ] Deduced a trap composed of 112 places in 202 ms of which 3 ms to minimize.
[2024-06-03 00:11:25] [INFO ] Deduced a trap composed of 116 places in 297 ms of which 3 ms to minimize.
[2024-06-03 00:11:25] [INFO ] Deduced a trap composed of 40 places in 313 ms of which 3 ms to minimize.
[2024-06-03 00:11:26] [INFO ] Deduced a trap composed of 38 places in 310 ms of which 3 ms to minimize.
[2024-06-03 00:11:26] [INFO ] Deduced a trap composed of 39 places in 273 ms of which 3 ms to minimize.
[2024-06-03 00:11:27] [INFO ] Deduced a trap composed of 37 places in 266 ms of which 3 ms to minimize.
[2024-06-03 00:11:27] [INFO ] Deduced a trap composed of 37 places in 293 ms of which 3 ms to minimize.
[2024-06-03 00:11:28] [INFO ] Deduced a trap composed of 35 places in 284 ms of which 4 ms to minimize.
[2024-06-03 00:11:28] [INFO ] Deduced a trap composed of 25 places in 282 ms of which 3 ms to minimize.
[2024-06-03 00:11:28] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 2 ms to minimize.
[2024-06-03 00:11:29] [INFO ] Deduced a trap composed of 30 places in 397 ms of which 3 ms to minimize.
[2024-06-03 00:11:29] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 3 ms to minimize.
[2024-06-03 00:11:29] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:11:30] [INFO ] Deduced a trap composed of 112 places in 158 ms of which 2 ms to minimize.
[2024-06-03 00:11:30] [INFO ] Deduced a trap composed of 41 places in 302 ms of which 3 ms to minimize.
[2024-06-03 00:11:30] [INFO ] Deduced a trap composed of 39 places in 237 ms of which 3 ms to minimize.
[2024-06-03 00:11:31] [INFO ] Deduced a trap composed of 33 places in 282 ms of which 4 ms to minimize.
[2024-06-03 00:11:32] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 2 ms to minimize.
[2024-06-03 00:11:32] [INFO ] Deduced a trap composed of 34 places in 265 ms of which 4 ms to minimize.
[2024-06-03 00:11:32] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 3 ms to minimize.
[2024-06-03 00:11:33] [INFO ] Deduced a trap composed of 25 places in 283 ms of which 3 ms to minimize.
[2024-06-03 00:11:33] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 3 ms to minimize.
[2024-06-03 00:11:33] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 4 ms to minimize.
[2024-06-03 00:11:34] [INFO ] Deduced a trap composed of 21 places in 285 ms of which 3 ms to minimize.
[2024-06-03 00:11:34] [INFO ] Deduced a trap composed of 41 places in 292 ms of which 4 ms to minimize.
[2024-06-03 00:11:34] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 4 ms to minimize.
[2024-06-03 00:11:35] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 3 ms to minimize.
[2024-06-03 00:11:35] [INFO ] Deduced a trap composed of 34 places in 265 ms of which 4 ms to minimize.
[2024-06-03 00:11:35] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 4 ms to minimize.
[2024-06-03 00:11:36] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 4 ms to minimize.
[2024-06-03 00:11:36] [INFO ] Deduced a trap composed of 28 places in 277 ms of which 3 ms to minimize.
[2024-06-03 00:11:36] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 3 ms to minimize.
[2024-06-03 00:11:36] [INFO ] Deduced a trap composed of 35 places in 288 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:11:40] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 2 ms to minimize.
[2024-06-03 00:11:40] [INFO ] Deduced a trap composed of 40 places in 248 ms of which 3 ms to minimize.
[2024-06-03 00:11:41] [INFO ] Deduced a trap composed of 124 places in 175 ms of which 2 ms to minimize.
[2024-06-03 00:11:41] [INFO ] Deduced a trap composed of 34 places in 272 ms of which 3 ms to minimize.
[2024-06-03 00:11:41] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 2 ms to minimize.
[2024-06-03 00:11:42] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 4 ms to minimize.
[2024-06-03 00:11:42] [INFO ] Deduced a trap composed of 90 places in 172 ms of which 3 ms to minimize.
[2024-06-03 00:11:42] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 2 ms to minimize.
[2024-06-03 00:11:42] [INFO ] Deduced a trap composed of 21 places in 287 ms of which 3 ms to minimize.
[2024-06-03 00:11:43] [INFO ] Deduced a trap composed of 39 places in 291 ms of which 4 ms to minimize.
[2024-06-03 00:11:43] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 3 ms to minimize.
[2024-06-03 00:11:43] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 3 ms to minimize.
[2024-06-03 00:11:44] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 3 ms to minimize.
[2024-06-03 00:11:44] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 3 ms to minimize.
[2024-06-03 00:11:45] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 1 ms to minimize.
[2024-06-03 00:11:45] [INFO ] Deduced a trap composed of 124 places in 189 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/648 variables, and 63 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 56/63 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 4 (OVERLAPS) 458/648 variables, 190/253 constraints. Problems are: Problem set: 50 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 407/660 constraints. Problems are: Problem set: 50 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 660 constraints, problems are : Problem set: 50 solved, 407 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 407/457 constraints, Known Traps: 56/56 constraints]
After SMT, in 60528ms problems are : Problem set: 50 solved, 407 unsolved
Search for dead transitions found 50 dead transitions in 60535ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/217 places, 408/523 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61080 ms. Remains : 190/217 places, 408/523 transitions.
[2024-06-03 00:12:17] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:12:17] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:12:17] [INFO ] Input system was already deterministic with 408 transitions.
[2024-06-03 00:12:17] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:12:17] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:12:17] [INFO ] Time to serialize gal into /tmp/CTLFireability11389400220113975904.gal : 2 ms
[2024-06-03 00:12:17] [INFO ] Time to serialize properties into /tmp/CTLFireability4488749427379712104.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/CTLFireability11389400220113975904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4488749427379712104.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-06-03 00:12:47] [INFO ] Flatten gal took : 21 ms
[2024-06-03 00:12:47] [INFO ] Applying decomposition
[2024-06-03 00:12:47] [INFO ] Flatten gal took : 21 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/graph577954493630322384.txt' '-o' '/tmp/graph577954493630322384.bin' '-w' '/tmp/graph577954493630322384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph577954493630322384.bin' '-l' '-1' '-v' '-w' '/tmp/graph577954493630322384.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:12:47] [INFO ] Decomposing Gal with order
[2024-06-03 00:12:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:12:47] [INFO ] Removed a total of 940 redundant transitions.
[2024-06-03 00:12:47] [INFO ] Flatten gal took : 42 ms
[2024-06-03 00:12:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 7 ms.
[2024-06-03 00:12:47] [INFO ] Time to serialize gal into /tmp/CTLFireability17645896214460190122.gal : 6 ms
[2024-06-03 00:12:47] [INFO ] Time to serialize properties into /tmp/CTLFireability17246320986168836562.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/CTLFireability17645896214460190122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17246320986168836562.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.81198e+07,2.70754,71252,2270,39,127053,804,947,371201,92,2096,0


Converting to forward existential form...Done !
original formula: EF(EX(((i6.u4.p12==1)&&(i3.u36.p149==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * ((i6.u4.p12==1)&&(i3.u36.p149==1)))] != FALSE
(forward)formula 0,1,2.84654,71252,1,0,127053,804,1638,371201,118,2096,51027
FORMULA MedleyA-PT-17-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 191 transition count 478
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 191 transition count 478
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 70 place count 191 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 189 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 189 transition count 456
Applied a total of 74 rules in 12 ms. Remains 189 /217 variables (removed 28) and now considering 456/523 (removed 67) transitions.
// Phase 1: matrix 456 rows 189 cols
[2024-06-03 00:12:50] [INFO ] Computed 7 invariants in 8 ms
[2024-06-03 00:12:50] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-06-03 00:12:50] [INFO ] Invariant cache hit.
[2024-06-03 00:12:51] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-06-03 00:12:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:12:58] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 3 ms to minimize.
[2024-06-03 00:12:58] [INFO ] Deduced a trap composed of 15 places in 273 ms of which 3 ms to minimize.
[2024-06-03 00:12:59] [INFO ] Deduced a trap composed of 17 places in 307 ms of which 3 ms to minimize.
[2024-06-03 00:12:59] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-06-03 00:12:59] [INFO ] Deduced a trap composed of 41 places in 287 ms of which 4 ms to minimize.
[2024-06-03 00:12:59] [INFO ] Deduced a trap composed of 47 places in 270 ms of which 3 ms to minimize.
[2024-06-03 00:13:00] [INFO ] Deduced a trap composed of 37 places in 287 ms of which 3 ms to minimize.
[2024-06-03 00:13:00] [INFO ] Deduced a trap composed of 111 places in 220 ms of which 3 ms to minimize.
[2024-06-03 00:13:00] [INFO ] Deduced a trap composed of 85 places in 225 ms of which 3 ms to minimize.
[2024-06-03 00:13:00] [INFO ] Deduced a trap composed of 85 places in 238 ms of which 3 ms to minimize.
[2024-06-03 00:13:01] [INFO ] Deduced a trap composed of 42 places in 278 ms of which 3 ms to minimize.
[2024-06-03 00:13:01] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 3 ms to minimize.
[2024-06-03 00:13:01] [INFO ] Deduced a trap composed of 41 places in 288 ms of which 3 ms to minimize.
[2024-06-03 00:13:02] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 3 ms to minimize.
[2024-06-03 00:13:03] [INFO ] Deduced a trap composed of 24 places in 340 ms of which 3 ms to minimize.
[2024-06-03 00:13:03] [INFO ] Deduced a trap composed of 24 places in 323 ms of which 3 ms to minimize.
[2024-06-03 00:13:03] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 3 ms to minimize.
[2024-06-03 00:13:04] [INFO ] Deduced a trap composed of 24 places in 317 ms of which 3 ms to minimize.
[2024-06-03 00:13:04] [INFO ] Deduced a trap composed of 40 places in 289 ms of which 3 ms to minimize.
[2024-06-03 00:13:04] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:13:05] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 3 ms to minimize.
[2024-06-03 00:13:05] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 4 ms to minimize.
[2024-06-03 00:13:06] [INFO ] Deduced a trap composed of 25 places in 284 ms of which 3 ms to minimize.
[2024-06-03 00:13:06] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 4 ms to minimize.
[2024-06-03 00:13:06] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 3 ms to minimize.
[2024-06-03 00:13:07] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 3 ms to minimize.
[2024-06-03 00:13:07] [INFO ] Deduced a trap composed of 23 places in 345 ms of which 3 ms to minimize.
[2024-06-03 00:13:08] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 3 ms to minimize.
[2024-06-03 00:13:09] [INFO ] Deduced a trap composed of 39 places in 302 ms of which 3 ms to minimize.
[2024-06-03 00:13:09] [INFO ] Deduced a trap composed of 28 places in 289 ms of which 3 ms to minimize.
[2024-06-03 00:13:10] [INFO ] Deduced a trap composed of 43 places in 254 ms of which 3 ms to minimize.
[2024-06-03 00:13:11] [INFO ] Deduced a trap composed of 115 places in 260 ms of which 3 ms to minimize.
[2024-06-03 00:13:11] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 3 ms to minimize.
[2024-06-03 00:13:12] [INFO ] Deduced a trap composed of 125 places in 286 ms of which 3 ms to minimize.
[2024-06-03 00:13:12] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 2 ms to minimize.
[2024-06-03 00:13:13] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:13:17] [INFO ] Deduced a trap composed of 111 places in 184 ms of which 3 ms to minimize.
[2024-06-03 00:13:17] [INFO ] Deduced a trap composed of 111 places in 214 ms of which 3 ms to minimize.
[2024-06-03 00:13:17] [INFO ] Deduced a trap composed of 111 places in 211 ms of which 3 ms to minimize.
[2024-06-03 00:13:19] [INFO ] Deduced a trap composed of 39 places in 287 ms of which 3 ms to minimize.
[2024-06-03 00:13:19] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 3 ms to minimize.
[2024-06-03 00:13:20] [INFO ] Deduced a trap composed of 28 places in 258 ms of which 2 ms to minimize.
[2024-06-03 00:13:20] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 3 ms to minimize.
[2024-06-03 00:13:20] [INFO ] Deduced a trap composed of 28 places in 289 ms of which 3 ms to minimize.
[2024-06-03 00:13:21] [INFO ] Deduced a trap composed of 90 places in 195 ms of which 2 ms to minimize.
[2024-06-03 00:13:21] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 189/645 variables, and 53 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:13:26] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 3 ms to minimize.
[2024-06-03 00:13:27] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 3 ms to minimize.
[2024-06-03 00:13:27] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 4 ms to minimize.
[2024-06-03 00:13:28] [INFO ] Deduced a trap composed of 21 places in 287 ms of which 4 ms to minimize.
[2024-06-03 00:13:28] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 3 ms to minimize.
[2024-06-03 00:13:28] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 3 ms to minimize.
[2024-06-03 00:13:30] [INFO ] Deduced a trap composed of 47 places in 242 ms of which 2 ms to minimize.
[2024-06-03 00:13:30] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 5 (OVERLAPS) 456/645 variables, 189/250 constraints. Problems are: Problem set: 50 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 405/655 constraints. Problems are: Problem set: 50 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 655 constraints, problems are : Problem set: 50 solved, 405 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/455 constraints, Known Traps: 54/54 constraints]
After SMT, in 60641ms problems are : Problem set: 50 solved, 405 unsolved
Search for dead transitions found 50 dead transitions in 60651ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/217 places, 406/523 transitions.
Applied a total of 0 rules in 3 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61450 ms. Remains : 189/217 places, 406/523 transitions.
[2024-06-03 00:13:51] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:13:51] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:13:51] [INFO ] Input system was already deterministic with 406 transitions.
[2024-06-03 00:13:51] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:13:51] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:13:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9111428961259484704.gal : 3 ms
[2024-06-03 00:13:51] [INFO ] Time to serialize properties into /tmp/CTLFireability9790766915762388962.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/CTLFireability9111428961259484704.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9790766915762388962.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-06-03 00:14:21] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:14:21] [INFO ] Applying decomposition
[2024-06-03 00:14:21] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4189874371529528317.txt' '-o' '/tmp/graph4189874371529528317.bin' '-w' '/tmp/graph4189874371529528317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4189874371529528317.bin' '-l' '-1' '-v' '-w' '/tmp/graph4189874371529528317.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:14:21] [INFO ] Decomposing Gal with order
[2024-06-03 00:14:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:14:21] [INFO ] Removed a total of 934 redundant transitions.
[2024-06-03 00:14:21] [INFO ] Flatten gal took : 27 ms
[2024-06-03 00:14:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 6 ms.
[2024-06-03 00:14:21] [INFO ] Time to serialize gal into /tmp/CTLFireability1614802383048405570.gal : 4 ms
[2024-06-03 00:14:21] [INFO ] Time to serialize properties into /tmp/CTLFireability4347995881687917141.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/CTLFireability1614802383048405570.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4347995881687917141.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.77138e+07,5.26572,109740,2559,41,151487,808,920,613100,94,2442,0


Converting to forward existential form...Done !
original formula: EG(!(A(AF(!(EX((i9.i2.u61.p245==1)))) U EF(AG(((i2.u3.p20==1)&&(i4.i1.u26.p113==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!(E(TRUE U !(E(TRUE U !(((i2.u3.p20==1)&&(i4.i1.u26.p113==1))))))) U (!(!(EG(!(!(EX((i9.i2.u61...328
Reverse transition relation is NOT exact ! Due to transitions t28, t37, t93, t115, t162, t168, t170, t178, t184, t186, t212, t220, t244, t252, t257, t258, ...977
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 191 transition count 478
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 191 transition count 478
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 70 place count 191 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 189 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 189 transition count 456
Applied a total of 74 rules in 6 ms. Remains 189 /217 variables (removed 28) and now considering 456/523 (removed 67) transitions.
[2024-06-03 00:14:51] [INFO ] Invariant cache hit.
[2024-06-03 00:14:52] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-03 00:14:52] [INFO ] Invariant cache hit.
[2024-06-03 00:14:52] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-06-03 00:14:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:14:58] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 4 ms to minimize.
[2024-06-03 00:14:58] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-06-03 00:14:58] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 3 ms to minimize.
[2024-06-03 00:14:58] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-06-03 00:14:59] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 3 ms to minimize.
[2024-06-03 00:14:59] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 2 ms to minimize.
[2024-06-03 00:14:59] [INFO ] Deduced a trap composed of 37 places in 222 ms of which 4 ms to minimize.
[2024-06-03 00:14:59] [INFO ] Deduced a trap composed of 111 places in 121 ms of which 2 ms to minimize.
[2024-06-03 00:14:59] [INFO ] Deduced a trap composed of 85 places in 172 ms of which 2 ms to minimize.
[2024-06-03 00:15:00] [INFO ] Deduced a trap composed of 85 places in 173 ms of which 3 ms to minimize.
[2024-06-03 00:15:00] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 3 ms to minimize.
[2024-06-03 00:15:00] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 3 ms to minimize.
[2024-06-03 00:15:00] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 3 ms to minimize.
[2024-06-03 00:15:01] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-06-03 00:15:01] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 2 ms to minimize.
[2024-06-03 00:15:02] [INFO ] Deduced a trap composed of 24 places in 233 ms of which 3 ms to minimize.
[2024-06-03 00:15:02] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 2 ms to minimize.
[2024-06-03 00:15:02] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 3 ms to minimize.
[2024-06-03 00:15:02] [INFO ] Deduced a trap composed of 40 places in 303 ms of which 3 ms to minimize.
[2024-06-03 00:15:02] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:15:03] [INFO ] Deduced a trap composed of 24 places in 306 ms of which 4 ms to minimize.
[2024-06-03 00:15:03] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 3 ms to minimize.
[2024-06-03 00:15:04] [INFO ] Deduced a trap composed of 25 places in 280 ms of which 3 ms to minimize.
[2024-06-03 00:15:04] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 2 ms to minimize.
[2024-06-03 00:15:04] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 3 ms to minimize.
[2024-06-03 00:15:05] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 3 ms to minimize.
[2024-06-03 00:15:05] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 3 ms to minimize.
[2024-06-03 00:15:05] [INFO ] Deduced a trap composed of 25 places in 289 ms of which 3 ms to minimize.
[2024-06-03 00:15:06] [INFO ] Deduced a trap composed of 39 places in 286 ms of which 3 ms to minimize.
[2024-06-03 00:15:07] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 2 ms to minimize.
[2024-06-03 00:15:08] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 2 ms to minimize.
[2024-06-03 00:15:08] [INFO ] Deduced a trap composed of 115 places in 254 ms of which 4 ms to minimize.
[2024-06-03 00:15:08] [INFO ] Deduced a trap composed of 43 places in 232 ms of which 3 ms to minimize.
[2024-06-03 00:15:09] [INFO ] Deduced a trap composed of 125 places in 217 ms of which 2 ms to minimize.
[2024-06-03 00:15:09] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 3 ms to minimize.
[2024-06-03 00:15:10] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:15:12] [INFO ] Deduced a trap composed of 111 places in 173 ms of which 3 ms to minimize.
[2024-06-03 00:15:13] [INFO ] Deduced a trap composed of 111 places in 167 ms of which 3 ms to minimize.
[2024-06-03 00:15:13] [INFO ] Deduced a trap composed of 111 places in 176 ms of which 3 ms to minimize.
[2024-06-03 00:15:14] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 2 ms to minimize.
[2024-06-03 00:15:14] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 3 ms to minimize.
[2024-06-03 00:15:15] [INFO ] Deduced a trap composed of 28 places in 225 ms of which 3 ms to minimize.
[2024-06-03 00:15:15] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 3 ms to minimize.
[2024-06-03 00:15:15] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 2 ms to minimize.
[2024-06-03 00:15:15] [INFO ] Deduced a trap composed of 90 places in 164 ms of which 3 ms to minimize.
[2024-06-03 00:15:16] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 3 ms to minimize.
[2024-06-03 00:15:17] [INFO ] Deduced a trap composed of 47 places in 250 ms of which 3 ms to minimize.
[2024-06-03 00:15:17] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:15:19] [INFO ] Deduced a trap composed of 112 places in 276 ms of which 4 ms to minimize.
[2024-06-03 00:15:20] [INFO ] Deduced a trap composed of 31 places in 280 ms of which 3 ms to minimize.
[2024-06-03 00:15:20] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 2 ms to minimize.
[2024-06-03 00:15:20] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 3 ms to minimize.
[2024-06-03 00:15:21] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 189/645 variables, and 60 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:15:27] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 2 ms to minimize.
[2024-06-03 00:15:27] [INFO ] Deduced a trap composed of 34 places in 208 ms of which 2 ms to minimize.
[2024-06-03 00:15:27] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 2 ms to minimize.
[2024-06-03 00:15:27] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 2 ms to minimize.
[2024-06-03 00:15:27] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 4 ms to minimize.
[2024-06-03 00:15:28] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 3 ms to minimize.
[2024-06-03 00:15:28] [INFO ] Deduced a trap composed of 45 places in 231 ms of which 3 ms to minimize.
[2024-06-03 00:15:28] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 5 (OVERLAPS) 456/645 variables, 189/257 constraints. Problems are: Problem set: 50 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 405/662 constraints. Problems are: Problem set: 50 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 662 constraints, problems are : Problem set: 50 solved, 405 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/455 constraints, Known Traps: 61/61 constraints]
After SMT, in 60321ms problems are : Problem set: 50 solved, 405 unsolved
Search for dead transitions found 50 dead transitions in 60328ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/217 places, 406/523 transitions.
Applied a total of 0 rules in 1 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60803 ms. Remains : 189/217 places, 406/523 transitions.
[2024-06-03 00:15:52] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:15:52] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:15:52] [INFO ] Input system was already deterministic with 406 transitions.
[2024-06-03 00:15:52] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:15:52] [INFO ] Flatten gal took : 45 ms
[2024-06-03 00:15:52] [INFO ] Time to serialize gal into /tmp/CTLFireability12070203969588612773.gal : 2 ms
[2024-06-03 00:15:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1848273867762580988.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/CTLFireability12070203969588612773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1848273867762580988.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-06-03 00:16:22] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:16:22] [INFO ] Applying decomposition
[2024-06-03 00:16:22] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3209474208794941654.txt' '-o' '/tmp/graph3209474208794941654.bin' '-w' '/tmp/graph3209474208794941654.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3209474208794941654.bin' '-l' '-1' '-v' '-w' '/tmp/graph3209474208794941654.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:16:23] [INFO ] Decomposing Gal with order
[2024-06-03 00:16:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:16:23] [INFO ] Removed a total of 943 redundant transitions.
[2024-06-03 00:16:23] [INFO ] Flatten gal took : 40 ms
[2024-06-03 00:16:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2024-06-03 00:16:23] [INFO ] Time to serialize gal into /tmp/CTLFireability5755373790412106180.gal : 4 ms
[2024-06-03 00:16:23] [INFO ] Time to serialize properties into /tmp/CTLFireability15029108395425921797.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/CTLFireability5755373790412106180.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15029108395425921797.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.77138e+07,2.26977,57976,2824,51,112960,530,869,233539,89,1275,0


Converting to forward existential form...Done !
original formula: ((AG(AX((((i1.u2.p21==1)&&(i3.u21.p97==1))&&((i4.u26.p167==1)&&(i1.u62.p242==1))))) + !(E((i5.u36.p158!=1) U !(AG((((i1.u5.p27==1)&&(i3.u...457
=> equivalent forward existential formula: [(FwdU(FwdU(((Init * !(!(!((E(!(EX(((!((E(!((((i1.u2.p21==1)&&(i2.u13.p71==1))&&((i4.u26.p167==1)&&(i1.u62.p242=...1464
Reverse transition relation is NOT exact ! Due to transitions t46, t51, t54, t84, t93, t162, t168, t170, t178, t184, t186, t210, t212, t218, t220, t242, t2...943
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
[2024-06-03 00:16:53] [INFO ] Flatten gal took : 22 ms
[2024-06-03 00:16:53] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:16:53] [INFO ] Applying decomposition
[2024-06-03 00:16:53] [INFO ] Flatten gal took : 19 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/graph1658677676723770910.txt' '-o' '/tmp/graph1658677676723770910.bin' '-w' '/tmp/graph1658677676723770910.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1658677676723770910.bin' '-l' '-1' '-v' '-w' '/tmp/graph1658677676723770910.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:16:53] [INFO ] Decomposing Gal with order
[2024-06-03 00:16:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:16:53] [INFO ] Removed a total of 625 redundant transitions.
[2024-06-03 00:16:53] [INFO ] Flatten gal took : 40 ms
[2024-06-03 00:16:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 7 ms.
[2024-06-03 00:16:53] [INFO ] Time to serialize gal into /tmp/CTLFireability11933411646666182119.gal : 7 ms
[2024-06-03 00:16:53] [INFO ] Time to serialize properties into /tmp/CTLFireability9374787093978059647.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/CTLFireability11933411646666182119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9374787093978059647.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 8 CTL formulae.
ITS-tools command line returned an error code 137
[2024-06-03 00:28:17] [INFO ] Applying decomposition
[2024-06-03 00:28:17] [INFO ] Flatten gal took : 32 ms
[2024-06-03 00:28:17] [INFO ] Decomposing Gal with order
[2024-06-03 00:28:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:28:17] [INFO ] Removed a total of 934 redundant transitions.
[2024-06-03 00:28:17] [INFO ] Flatten gal took : 58 ms
[2024-06-03 00:28:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 241 labels/synchronizations in 5 ms.
[2024-06-03 00:28:17] [INFO ] Time to serialize gal into /tmp/CTLFireability14062901103384255643.gal : 3 ms
[2024-06-03 00:28:17] [INFO ] Time to serialize properties into /tmp/CTLFireability7925794019346850165.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/CTLFireability14062901103384255643.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7925794019346850165.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 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.73497e+07,3.14068,75588,1110,2975,49554,69810,239,229646,531,734821,0


Converting to forward existential form...Done !
original formula: AX((EF(EG(((A(((((i0.i0.i0.u4.p14==1)&&(i0.i0.i0.u5.p39==1))&&((i0.i0.i1.u7.p70==1)&&(i0.i0.i1.u8.p87==1)))&&(u12.p247==1)) U (i0.i1.u10....286
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U EG(((!((E(!((i0.i1.u10.p122==1)) U (!(((((i0.i0.i0.u4.p14==1)&&(i0.i0.i0.u5.p39==1))&&(...432
Reverse transition relation is NOT exact ! Due to transitions t255, t377, i0.t521, i0.t472, i0.i0.i0.u4.t210, i0.i0.i0.u4.t212, i0.i0.i0.u4.t213, i0.i0.i0....2152
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
(forward)formula 0,1,318.62,2711320,1,0,1.21453e+06,2.91949e+06,569,1.66695e+07,1764,1.89676e+07,360529
FORMULA MedleyA-PT-17-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(AX((!(E((((i0.i0.i0.u4.p27==1)&&(i0.i0.i1.u8.p105==1))&&((i0.i1.u11.p232==1)&&(u12.p242==1))) U (((i0.i0.i0.u5.p52==1)&&(i0.i0.i1.u8.p...465
=> equivalent forward existential formula: ([(FwdU(EY(FwdU(Init,TRUE)),(((i0.i0.i0.u4.p27==1)&&(i0.i0.i1.u8.p105==1))&&((i0.i1.u11.p232==1)&&(u12.p242==1))...618
(forward)formula 1,0,646.034,3907040,1,0,1.61834e+06,4.98335e+06,481,2.42907e+07,1673,2.84784e+07,145551
FORMULA MedleyA-PT-17-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(AG(((i0.i1.u11.p223==1) + !(AF((((i0.i0.i0.u4.p27==1)&&(i0.i0.i1.u7.p71==1))&&((i0.i1.u10.p167==1)&&(u12.p242==1))))))) U (AF(((((i0.i0...515
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!(((((i0.i0.i0.u4.p25==1)&&(i0.i0.i0.u5.p41==1))&&((i0.i0.i1.u7.p65==1)&&(i0.i0.i1.u8.p10...1372
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
(forward)formula 2,0,1100.74,4898796,1,0,2.20864e+06,5.35358e+06,439,2.94117e+07,1510,3.30195e+07,121351
FORMULA MedleyA-PT-17-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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="MedleyA-PT-17"
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 MedleyA-PT-17, 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 r576-smll-171734920100130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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