Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200234.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is MedleyA-PT-18, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524200234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 158K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-18-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-18-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-18-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-18-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-18-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-18-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-18-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-18-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-18-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-18-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-18-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-18-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748876357653

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-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 14:59:19] [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]
[2025-06-02 14:59:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 14:59:19] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2025-06-02 14:59:19] [INFO ] Transformed 252 places.
[2025-06-02 14:59:19] [INFO ] Transformed 543 transitions.
[2025-06-02 14:59:19] [INFO ] Found NUPN structural information;
[2025-06-02 14:59:19] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 310 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 100 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 541/541 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 224 transition count 498
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 224 transition count 498
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 223 transition count 497
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 223 transition count 497
Applied a total of 58 rules in 112 ms. Remains 223 /252 variables (removed 29) and now considering 497/541 (removed 44) transitions.
// Phase 1: matrix 497 rows 223 cols
[2025-06-02 14:59:20] [INFO ] Computed 7 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:59:20] [INFO ] Implicit Places using invariants in 387 ms returned []
[2025-06-02 14:59:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:59:21] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2025-06-02 14:59:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:32] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:32] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:33] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:33] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:33] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:33] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:34] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:34] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:34] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:34] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:34] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:34] [INFO ] Deduced a trap composed of 36 places in 255 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:35] [INFO ] Deduced a trap composed of 35 places in 261 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:35] [INFO ] Deduced a trap composed of 133 places in 155 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:35] [INFO ] Deduced a trap composed of 133 places in 170 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:35] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:35] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:37] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:37] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:37] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:37] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:39] [INFO ] Deduced a trap composed of 25 places in 285 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:39] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:39] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:40] [INFO ] Deduced a trap composed of 26 places in 414 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:40] [INFO ] Deduced a trap composed of 26 places in 266 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:40] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:41] [INFO ] Deduced a trap composed of 38 places in 292 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:41] [INFO ] Deduced a trap composed of 119 places in 391 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:41] [INFO ] Deduced a trap composed of 143 places in 344 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:42] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:42] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:42] [INFO ] Deduced a trap composed of 113 places in 242 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:42] [INFO ] Deduced a trap composed of 141 places in 201 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:43] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:43] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:43] [INFO ] Deduced a trap composed of 36 places in 253 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:43] [INFO ] Deduced a trap composed of 139 places in 225 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:44] [INFO ] Deduced a trap composed of 101 places in 327 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:44] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:48] [INFO ] Deduced a trap composed of 135 places in 217 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:48] [INFO ] Deduced a trap composed of 141 places in 203 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:49] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:49] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:49] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:50] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:50] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:50] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:50] [INFO ] Deduced a trap composed of 112 places in 215 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:51] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 32 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 223/720 variables, and 57 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/223 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:56] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:57] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:57] [INFO ] Deduced a trap composed of 138 places in 259 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:57] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:58] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:58] [INFO ] Deduced a trap composed of 21 places in 311 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:58] [INFO ] Deduced a trap composed of 26 places in 303 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:59] [INFO ] Deduced a trap composed of 26 places in 284 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:59] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:59] [INFO ] Deduced a trap composed of 129 places in 280 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:00] [INFO ] Deduced a trap composed of 132 places in 221 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:01] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:04] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:04] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:05] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:05] [INFO ] Deduced a trap composed of 130 places in 201 ms of which 26 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:09] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:10] [INFO ] Deduced a trap composed of 118 places in 226 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:10] [INFO ] Deduced a trap composed of 117 places in 183 ms of which 22 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:14] [INFO ] Deduced a trap composed of 34 places in 229 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:15] [INFO ] Deduced a trap composed of 25 places in 278 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:15] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:20] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 223/720 variables, and 80 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/223 constraints, PredecessorRefiner: 0/496 constraints, Known Traps: 73/73 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60808ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60837ms
Starting structural reductions in LTL mode, iteration 1 : 223/252 places, 497/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61908 ms. Remains : 223/252 places, 497/541 transitions.
Support contains 100 out of 223 places after structural reductions.
[2025-06-02 15:00:22] [INFO ] Flatten gal took : 118 ms
[2025-06-02 15:00:22] [INFO ] Flatten gal took : 74 ms
[2025-06-02 15:00:22] [INFO ] Input system was already deterministic with 497 transitions.
RANDOM walk for 40000 steps (1530 resets) in 3997 ms. (10 steps per ms) remains 73/85 properties
BEST_FIRST walk for 4004 steps (33 resets) in 42 ms. (93 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (33 resets) in 47 ms. (83 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (28 resets) in 48 ms. (81 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (33 resets) in 60 ms. (65 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (36 resets) in 40 ms. (97 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (35 resets) in 24 ms. (160 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (32 resets) in 25 ms. (154 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (34 resets) in 22 ms. (174 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (34 resets) in 23 ms. (166 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (33 resets) in 21 ms. (181 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (34 resets) in 36 ms. (108 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (34 resets) in 26 ms. (148 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (32 resets) in 49 ms. (80 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (33 resets) in 32 ms. (121 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (33 resets) in 20 ms. (190 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (32 resets) in 62 ms. (63 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (32 resets) in 15 ms. (250 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (32 resets) in 15 ms. (250 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (34 resets) in 43 ms. (90 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (34 resets) in 18 ms. (210 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (34 resets) in 32 ms. (121 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (35 resets) in 18 ms. (210 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (34 resets) in 16 ms. (235 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (33 resets) in 20 ms. (190 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (30 resets) in 31 ms. (125 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (34 resets) in 32 ms. (121 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (31 resets) in 28 ms. (138 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (32 resets) in 16 ms. (235 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (35 resets) in 19 ms. (200 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (33 resets) in 24 ms. (160 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (35 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (34 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (32 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (32 resets) in 19 ms. (200 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (34 resets) in 26 ms. (148 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (34 resets) in 18 ms. (210 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (36 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (32 resets) in 18 ms. (210 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (32 resets) in 31 ms. (125 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (36 resets) in 18 ms. (210 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (32 resets) in 19 ms. (200 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (31 resets) in 15 ms. (250 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (33 resets) in 16 ms. (235 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (32 resets) in 15 ms. (250 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (34 resets) in 21 ms. (181 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (34 resets) in 19 ms. (200 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (35 resets) in 19 ms. (200 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (34 resets) in 14 ms. (266 steps per ms) remains 73/73 properties
[2025-06-02 15:00:24] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 1 (OVERLAPS) 129/223 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:25] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:25] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:25] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:25] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:26] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:26] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:26] [INFO ] Deduced a trap composed of 22 places in 246 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:26] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:27] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:27] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:27] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:27] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:27] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 13/20 constraints. Problems are: Problem set: 4 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:28] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:28] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:28] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:29] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:29] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 22 ms to minimize.
SMT process timed out in 5270ms, After SMT, problems are : Problem set: 4 solved, 69 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 91 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 497/497 transitions.
Graph (trivial) has 69 edges and 223 vertex of which 4 / 223 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 220 transition count 480
Reduce places removed 13 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 24 rules applied. Total rules applied 38 place count 207 transition count 469
Reduce places removed 11 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 2 with 13 rules applied. Total rules applied 51 place count 196 transition count 467
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 195 transition count 467
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 52 place count 195 transition count 461
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 64 place count 189 transition count 461
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 68 place count 185 transition count 455
Iterating global reduction 4 with 4 rules applied. Total rules applied 72 place count 185 transition count 455
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 104 place count 169 transition count 439
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 106 place count 167 transition count 435
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 167 transition count 435
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 112 place count 165 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 123 place count 165 transition count 426
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 127 place count 161 transition count 422
Iterating global reduction 4 with 4 rules applied. Total rules applied 131 place count 161 transition count 422
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 135 place count 159 transition count 426
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 140 place count 159 transition count 421
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 145 place count 154 transition count 421
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 148 place count 154 transition count 421
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 153 transition count 419
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 153 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 152 transition count 418
Applied a total of 151 rules in 196 ms. Remains 152 /223 variables (removed 71) and now considering 418/497 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 152/223 places, 418/497 transitions.
RANDOM walk for 40000 steps (2644 resets) in 570 ms. (70 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (54 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (52 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (55 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (55 resets) in 20 ms. (190 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (56 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (56 resets) in 18 ms. (210 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (55 resets) in 21 ms. (181 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (49 resets) in 18 ms. (210 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (52 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (52 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (53 resets) in 25 ms. (154 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (55 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (53 resets) in 20 ms. (190 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (44 resets) in 22 ms. (174 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (48 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (56 resets) in 18 ms. (210 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (53 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (56 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (53 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (54 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (53 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (54 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (54 resets) in 27 ms. (142 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (48 resets) in 20 ms. (190 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (22 resets) in 50 ms. (78 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (55 resets) in 22 ms. (174 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (58 resets) in 23 ms. (166 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (54 resets) in 31 ms. (125 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (52 resets) in 30 ms. (129 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (55 resets) in 26 ms. (148 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (52 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (55 resets) in 22 ms. (174 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (48 resets) in 22 ms. (174 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (55 resets) in 23 ms. (166 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (55 resets) in 23 ms. (166 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (55 resets) in 25 ms. (154 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (48 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (52 resets) in 27 ms. (143 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (57 resets) in 28 ms. (138 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (55 resets) in 21 ms. (182 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (52 resets) in 21 ms. (182 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (55 resets) in 23 ms. (166 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (49 resets) in 21 ms. (182 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (55 resets) in 21 ms. (181 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (43 resets) in 24 ms. (160 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (51 resets) in 20 ms. (190 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (54 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (56 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (55 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (50 resets) in 18 ms. (210 steps per ms) remains 69/69 properties
Interrupted probabilistic random walk after 356805 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :26 out of 69
Probabilistic random walk after 356805 steps, saw 65168 distinct states, run finished after 3009 ms. (steps per millisecond=118 ) properties seen :26
[2025-06-02 15:00:33] [INFO ] Flow matrix only has 414 transitions (discarded 4 similar events)
// Phase 1: matrix 414 rows 152 cols
[2025-06-02 15:00:33] [INFO ] Computed 7 invariants in 5 ms
[2025-06-02 15:00:33] [INFO ] State equation strengthened by 4 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 89/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:34] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:34] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:34] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:34] [INFO ] Deduced a trap composed of 29 places in 228 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:34] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:35] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 414/566 variables, 152/165 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:36] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/566 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 170 constraints, problems are : Problem set: 0 solved, 43 unsolved in 6473 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 43/42 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 89/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:40] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:40] [INFO ] Deduced a trap composed of 13 places in 272 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:41] [INFO ] Deduced a trap composed of 33 places in 217 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 5 (OVERLAPS) 414/566 variables, 152/169 constraints. Problems are: Problem set: 6 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 4/173 constraints. Problems are: Problem set: 6 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 36/209 constraints. Problems are: Problem set: 6 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:01:02] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:01:02] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:01:02] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:01:11] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:01:12] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:01:13] [INFO ] Deduced a trap composed of 77 places in 173 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 6/215 constraints. Problems are: Problem set: 6 solved, 37 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 215 constraints, problems are : Problem set: 6 solved, 37 unsolved in 45010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 37/42 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51530ms problems are : Problem set: 6 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 418/418 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 152 transition count 415
Reduce places removed 3 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 8 rules applied. Total rules applied 11 place count 149 transition count 410
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 16 place count 144 transition count 410
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 144 transition count 408
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 142 transition count 408
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 27 place count 135 transition count 394
Iterating global reduction 3 with 7 rules applied. Total rules applied 34 place count 135 transition count 394
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 3 with 6 rules applied. Total rules applied 40 place count 132 transition count 391
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 131 transition count 389
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 131 transition count 389
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 48 place count 128 transition count 395
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 51 place count 128 transition count 392
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 127 transition count 393
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 62 place count 127 transition count 384
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 74 place count 118 transition count 381
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 75 place count 117 transition count 379
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 117 transition count 379
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 117 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 116 transition count 378
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 79 place count 115 transition count 376
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 115 transition count 376
Applied a total of 80 rules in 86 ms. Remains 115 /152 variables (removed 37) and now considering 376/418 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 115/152 places, 376/418 transitions.
RANDOM walk for 40000 steps (2834 resets) in 782 ms. (51 steps per ms) remains 34/37 properties
BEST_FIRST walk for 4002 steps (56 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (57 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (57 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (59 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (52 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (55 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (56 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (56 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (58 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (58 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (57 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (60 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (56 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (58 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (53 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (60 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (56 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (56 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (53 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (59 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (57 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (53 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (53 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (56 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (58 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (58 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (56 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (55 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (58 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (57 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (56 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (52 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (59 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (59 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
Interrupted probabilistic random walk after 532911 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :17 out of 34
Probabilistic random walk after 532911 steps, saw 89675 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :17
[2025-06-02 15:01:28] [INFO ] Flow matrix only has 368 transitions (discarded 8 similar events)
// Phase 1: matrix 368 rows 115 cols
[2025-06-02 15:01:28] [INFO ] Computed 7 invariants in 5 ms
[2025-06-02 15:01:28] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 79/115 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:01:28] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:01:29] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:01:29] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 368/483 variables, 115/125 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 21/146 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:01:29] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:01:29] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:01:30] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/483 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 483/483 variables, and 149 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2114 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 115/115 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 79/115 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 368/483 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 21/149 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 17/166 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/483 variables, and 166 constraints, problems are : Problem set: 0 solved, 17 unsolved in 75008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 115/115 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 77150ms problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 376/376 transitions.
Graph (trivial) has 34 edges and 115 vertex of which 3 / 115 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 113 transition count 370
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 110 transition count 369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 109 transition count 369
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 109 transition count 368
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 108 transition count 368
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 107 transition count 366
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 107 transition count 366
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 106 transition count 364
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 106 transition count 364
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 104 transition count 362
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 3 with 6 rules applied. Total rules applied 25 place count 101 transition count 365
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 101 transition count 364
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 29 place count 101 transition count 361
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 31 place count 100 transition count 362
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 39 place count 100 transition count 354
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 51 place count 92 transition count 350
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 52 place count 91 transition count 348
Iterating global reduction 5 with 1 rules applied. Total rules applied 53 place count 91 transition count 348
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 55 place count 91 transition count 346
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 57 place count 91 transition count 350
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 61 place count 89 transition count 348
Applied a total of 61 rules in 79 ms. Remains 89 /115 variables (removed 26) and now considering 348/376 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 89/115 places, 348/376 transitions.
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
[2025-06-02 15:02:45] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2025-06-02 15:02:45] [INFO ] Flatten gal took : 52 ms
[2025-06-02 15:02:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-18-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-CTLFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-CTLFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-CTLFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 15:02:45] [INFO ] Flatten gal took : 46 ms
[2025-06-02 15:02:45] [INFO ] Input system was already deterministic with 497 transitions.
Support contains 84 out of 223 places (down from 95) after GAL structural reductions.
FORMULA MedleyA-PT-18-CTLFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 497/497 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 206 transition count 466
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 206 transition count 466
Applied a total of 34 rules in 11 ms. Remains 206 /223 variables (removed 17) and now considering 466/497 (removed 31) transitions.
// Phase 1: matrix 466 rows 206 cols
[2025-06-02 15:02:46] [INFO ] Computed 7 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:02:46] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-02 15:02:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:02:46] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2025-06-02 15:02:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:56] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:56] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:57] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:57] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:57] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:57] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:57] [INFO ] Deduced a trap composed of 33 places in 217 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:58] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:58] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:58] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:58] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:58] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:59] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:00] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:00] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:00] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:00] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:01] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:01] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:01] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:02] [INFO ] Deduced a trap composed of 128 places in 195 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:02] [INFO ] Deduced a trap composed of 128 places in 272 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:03] [INFO ] Deduced a trap composed of 34 places in 293 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:03] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:04] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:04] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:04] [INFO ] Deduced a trap composed of 24 places in 212 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:05] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:05] [INFO ] Deduced a trap composed of 28 places in 277 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:05] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:05] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:06] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:06] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:06] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:07] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:07] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:07] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:11] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:12] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:12] [INFO ] Deduced a trap composed of 109 places in 241 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:13] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:15] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:16] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:16] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:16] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:16] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 29 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 206/672 variables, and 53 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/206 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:21] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:21] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:21] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:21] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:22] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:03:25] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
At refinement iteration 6 (OVERLAPS) 466/672 variables, 206/265 constraints. Problems are: Problem set: 50 solved, 415 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/672 variables, 415/680 constraints. Problems are: Problem set: 50 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/672 variables, and 680 constraints, problems are : Problem set: 50 solved, 415 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 415/465 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60322ms problems are : Problem set: 50 solved, 415 unsolved
Search for dead transitions found 50 dead transitions in 60325ms
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 : 206/223 places, 416/497 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61032 ms. Remains : 206/223 places, 416/497 transitions.
[2025-06-02 15:03:47] [INFO ] Flatten gal took : 32 ms
[2025-06-02 15:03:47] [INFO ] Flatten gal took : 29 ms
[2025-06-02 15:03:47] [INFO ] Input system was already deterministic with 416 transitions.
[2025-06-02 15:03:47] [INFO ] Flatten gal took : 41 ms
[2025-06-02 15:03:47] [INFO ] Flatten gal took : 39 ms
[2025-06-02 15:03:47] [INFO ] Time to serialize gal into /tmp/CTLFireability3493678022623797215.gal : 22 ms
[2025-06-02 15:03:47] [INFO ] Time to serialize properties into /tmp/CTLFireability3826762305279946000.ctl : 8 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3493678022623797215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3826762305279946000.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-02 15:04:17] [INFO ] Flatten gal took : 25 ms
[2025-06-02 15:04:17] [INFO ] Applying decomposition
[2025-06-02 15:04:17] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1537014581125462319.txt' '-o' '/tmp/graph1537014581125462319.bin' '-w' '/tmp/graph1537014581125462319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1537014581125462319.bin' '-l' '-1' '-v' '-w' '/tmp/graph1537014581125462319.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:04:17] [INFO ] Decomposing Gal with order
[2025-06-02 15:04:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:04:17] [INFO ] Removed a total of 947 redundant transitions.
[2025-06-02 15:04:17] [INFO ] Flatten gal took : 112 ms
[2025-06-02 15:04:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 25 ms.
[2025-06-02 15:04:17] [INFO ] Time to serialize gal into /tmp/CTLFireability3777356581570638353.gal : 16 ms
[2025-06-02 15:04:17] [INFO ] Time to serialize properties into /tmp/CTLFireability9253492845321914929.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3777356581570638353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9253492845321914929.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3.06731e+07,6.30454,123600,2469,26,88805,547,934,1.0942e+06,73,1549,0


Converting to forward existential form...Done !
original formula: AG(AX((A((((i2.i2.u43.p160==1)&&(i0.i1.u5.p23==1))&&((i9.i1.u56.p229==1)||(i0.i1.u9.p46==1))) U AF((i1.u21.p93==1))) * ((i4.i1.u32.p118==...282
=> equivalent forward existential formula: (([FwdG((FwdU(EY(FwdU(Init,TRUE)),!(!(EG(!((i1.u21.p93==1)))))) * !((((i2.i2.u43.p160==1)&&(i0.i1.u5.p23==1))&&(...477
(forward)formula 0,0,6.87537,123728,1,0,88805,547,1718,1.0942e+06,92,1549,76012
FORMULA MedleyA-PT-18-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 497/497 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 204 transition count 462
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 204 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 203 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 203 transition count 461
Applied a total of 40 rules in 12 ms. Remains 203 /223 variables (removed 20) and now considering 461/497 (removed 36) transitions.
// Phase 1: matrix 461 rows 203 cols
[2025-06-02 15:04:24] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:04:25] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-06-02 15:04:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:04:25] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-02 15:04:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:35] [INFO ] Deduced a trap composed of 16 places in 273 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:36] [INFO ] Deduced a trap composed of 16 places in 279 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:36] [INFO ] Deduced a trap composed of 16 places in 270 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:36] [INFO ] Deduced a trap composed of 16 places in 274 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:37] [INFO ] Deduced a trap composed of 17 places in 292 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:37] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:37] [INFO ] Deduced a trap composed of 17 places in 315 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:37] [INFO ] Deduced a trap composed of 17 places in 281 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:38] [INFO ] Deduced a trap composed of 16 places in 250 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:38] [INFO ] Deduced a trap composed of 16 places in 257 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:38] [INFO ] Deduced a trap composed of 33 places in 271 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:39] [INFO ] Deduced a trap composed of 35 places in 268 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:39] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:39] [INFO ] Deduced a trap composed of 33 places in 321 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:39] [INFO ] Deduced a trap composed of 125 places in 317 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:40] [INFO ] Deduced a trap composed of 125 places in 320 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:40] [INFO ] Deduced a trap composed of 125 places in 230 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:40] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:41] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:41] [INFO ] Deduced a trap composed of 22 places in 250 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:42] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:43] [INFO ] Deduced a trap composed of 24 places in 326 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:43] [INFO ] Deduced a trap composed of 24 places in 296 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:44] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:44] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:45] [INFO ] Deduced a trap composed of 24 places in 311 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:45] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:45] [INFO ] Deduced a trap composed of 35 places in 248 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:45] [INFO ] Deduced a trap composed of 35 places in 252 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:46] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:46] [INFO ] Deduced a trap composed of 131 places in 330 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:46] [INFO ] Deduced a trap composed of 20 places in 320 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:47] [INFO ] Deduced a trap composed of 23 places in 323 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:48] [INFO ] Deduced a trap composed of 38 places in 255 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:48] [INFO ] Deduced a trap composed of 39 places in 239 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:49] [INFO ] Deduced a trap composed of 38 places in 268 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:49] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:50] [INFO ] Deduced a trap composed of 22 places in 299 ms of which 30 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:55] [INFO ] Deduced a trap composed of 35 places in 306 ms of which 33 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/664 variables, and 46 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 39/46 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:59] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:59] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:00] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:00] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:00] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:00] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:01] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:01] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:01] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:01] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:01] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:05] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:05] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:06] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:06] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:09] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:09] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:09] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:10] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:10] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:14] [INFO ] Deduced a trap composed of 134 places in 199 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:14] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:17] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 21 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:20] [INFO ] Deduced a trap composed of 135 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:20] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:25] [INFO ] Deduced a trap composed of 37 places in 262 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:05:25] [INFO ] Deduced a trap composed of 135 places in 289 ms of which 43 ms to minimize.
SMT process timed out in 60352ms, After SMT, problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60354ms
Starting structural reductions in LTL mode, iteration 1 : 203/223 places, 461/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61060 ms. Remains : 203/223 places, 461/497 transitions.
[2025-06-02 15:05:25] [INFO ] Flatten gal took : 37 ms
[2025-06-02 15:05:25] [INFO ] Flatten gal took : 38 ms
[2025-06-02 15:05:26] [INFO ] Input system was already deterministic with 461 transitions.
[2025-06-02 15:05:26] [INFO ] Flatten gal took : 36 ms
[2025-06-02 15:05:26] [INFO ] Flatten gal took : 36 ms
[2025-06-02 15:05:26] [INFO ] Time to serialize gal into /tmp/CTLFireability7502454184820431638.gal : 9 ms
[2025-06-02 15:05:26] [INFO ] Time to serialize properties into /tmp/CTLFireability4755825244916733628.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7502454184820431638.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4755825244916733628.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-02 15:05:56] [INFO ] Flatten gal took : 21 ms
[2025-06-02 15:05:56] [INFO ] Applying decomposition
[2025-06-02 15:05:56] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16449343177557262531.txt' '-o' '/tmp/graph16449343177557262531.bin' '-w' '/tmp/graph16449343177557262531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16449343177557262531.bin' '-l' '-1' '-v' '-w' '/tmp/graph16449343177557262531.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:05:56] [INFO ] Decomposing Gal with order
[2025-06-02 15:05:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:05:56] [INFO ] Removed a total of 1279 redundant transitions.
[2025-06-02 15:05:56] [INFO ] Flatten gal took : 51 ms
[2025-06-02 15:05:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 15 ms.
[2025-06-02 15:05:56] [INFO ] Time to serialize gal into /tmp/CTLFireability17044492578052798173.gal : 6 ms
[2025-06-02 15:05:56] [INFO ] Time to serialize properties into /tmp/CTLFireability14824856673218165431.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17044492578052798173.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14824856673218165431.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3.08732e+07,25.2568,595244,5306,42,279393,835,1010,6.75288e+06,76,2990,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 497/497 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 202 transition count 459
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 202 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 201 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 201 transition count 458
Applied a total of 44 rules in 8 ms. Remains 201 /223 variables (removed 22) and now considering 458/497 (removed 39) transitions.
// Phase 1: matrix 458 rows 201 cols
[2025-06-02 15:06:26] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:06:26] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-02 15:06:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:06:27] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2025-06-02 15:06:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:36] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:36] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:36] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:36] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:36] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:36] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:37] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:37] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:37] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:37] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:37] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:38] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:39] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:39] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:39] [INFO ] Deduced a trap composed of 36 places in 223 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:39] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:40] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:40] [INFO ] Deduced a trap composed of 22 places in 253 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:40] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:40] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:41] [INFO ] Deduced a trap composed of 125 places in 173 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:41] [INFO ] Deduced a trap composed of 125 places in 202 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:41] [INFO ] Deduced a trap composed of 125 places in 232 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:43] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:43] [INFO ] Deduced a trap composed of 34 places in 221 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:43] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:44] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:44] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:44] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:44] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:44] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:45] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:45] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:45] [INFO ] Deduced a trap composed of 24 places in 245 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:46] [INFO ] Deduced a trap composed of 37 places in 265 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:46] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:47] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:47] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 457 unsolved
SMT process timed out in 30194ms, After SMT, problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 30195ms
Starting structural reductions in LTL mode, iteration 1 : 201/223 places, 458/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30681 ms. Remains : 201/223 places, 458/497 transitions.
[2025-06-02 15:06:57] [INFO ] Flatten gal took : 19 ms
[2025-06-02 15:06:57] [INFO ] Flatten gal took : 18 ms
[2025-06-02 15:06:57] [INFO ] Input system was already deterministic with 458 transitions.
[2025-06-02 15:06:57] [INFO ] Flatten gal took : 18 ms
[2025-06-02 15:06:57] [INFO ] Flatten gal took : 20 ms
[2025-06-02 15:06:57] [INFO ] Time to serialize gal into /tmp/CTLFireability13764679515855749019.gal : 8 ms
[2025-06-02 15:06:57] [INFO ] Time to serialize properties into /tmp/CTLFireability15683284963511552272.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13764679515855749019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15683284963511552272.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:07:27] [INFO ] Flatten gal took : 18 ms
[2025-06-02 15:07:27] [INFO ] Applying decomposition
[2025-06-02 15:07:27] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph2966107912288835696.txt' '-o' '/tmp/graph2966107912288835696.bin' '-w' '/tmp/graph2966107912288835696.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2966107912288835696.bin' '-l' '-1' '-v' '-w' '/tmp/graph2966107912288835696.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:07:27] [INFO ] Decomposing Gal with order
[2025-06-02 15:07:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:07:27] [INFO ] Removed a total of 1316 redundant transitions.
[2025-06-02 15:07:27] [INFO ] Flatten gal took : 44 ms
[2025-06-02 15:07:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 11 ms.
[2025-06-02 15:07:27] [INFO ] Time to serialize gal into /tmp/CTLFireability12187004670062847949.gal : 5 ms
[2025-06-02 15:07:27] [INFO ] Time to serialize properties into /tmp/CTLFireability17127028030591929043.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12187004670062847949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17127028030591929043.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.94267e+07,12.6237,299692,4852,26,219033,505,1015,2.98734e+06,65,1496,0


Converting to forward existential form...Done !
original formula: AX((EG((EF((((i0.u2.p19==1)&&(i2.u16.p73==1))&&((i5.i1.i0.u27.p165==1)&&(i0.u69.p246==1)))) * (i1.u4.p21==0))) * EG(EX((i3.u38.p143==0)))...157
=> equivalent forward existential formula: ([(EY(Init) * !(EG((E(TRUE U (((i0.u2.p19==1)&&(i2.u16.p73==1))&&((i5.i1.i0.u27.p165==1)&&(i0.u69.p246==1)))) * ...236
Reverse transition relation is NOT exact ! Due to transitions t15, t30, t39, t94, t96, t159, t175, t186, t188, t190, t200, t204, t226, t228, t234, t236, t2...983
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Using 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 an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 497/497 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 202 transition count 459
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 202 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 201 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 201 transition count 458
Applied a total of 44 rules in 7 ms. Remains 201 /223 variables (removed 22) and now considering 458/497 (removed 39) transitions.
[2025-06-02 15:07:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:07:58] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-02 15:07:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:07:58] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2025-06-02 15:07:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:08] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:09] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:09] [INFO ] Deduced a trap composed of 15 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:09] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:09] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:10] [INFO ] Deduced a trap composed of 33 places in 271 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:10] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:10] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:10] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:11] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:11] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:12] [INFO ] Deduced a trap composed of 24 places in 350 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:13] [INFO ] Deduced a trap composed of 24 places in 316 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:13] [INFO ] Deduced a trap composed of 24 places in 314 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:13] [INFO ] Deduced a trap composed of 36 places in 244 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:14] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:14] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:14] [INFO ] Deduced a trap composed of 22 places in 282 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:14] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:15] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:16] [INFO ] Deduced a trap composed of 125 places in 215 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:16] [INFO ] Deduced a trap composed of 125 places in 214 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:16] [INFO ] Deduced a trap composed of 125 places in 234 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:18] [INFO ] Deduced a trap composed of 22 places in 313 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:18] [INFO ] Deduced a trap composed of 34 places in 275 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:19] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:19] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:19] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:19] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:20] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:20] [INFO ] Deduced a trap composed of 23 places in 309 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:20] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:20] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:20] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:21] [INFO ] Deduced a trap composed of 37 places in 256 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:22] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:22] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:22] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 201/659 variables, and 45 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/201 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 457 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 4 (OVERLAPS) 458/659 variables, 201/246 constraints. Problems are: Problem set: 50 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/659 variables, 407/653 constraints. Problems are: Problem set: 50 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/659 variables, and 653 constraints, problems are : Problem set: 50 solved, 407 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 407/457 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60354ms problems are : Problem set: 50 solved, 407 unsolved
Search for dead transitions found 50 dead transitions in 60358ms
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 : 201/223 places, 408/497 transitions.
Applied a total of 0 rules in 2 ms. Remains 201 /201 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61025 ms. Remains : 201/223 places, 408/497 transitions.
[2025-06-02 15:08:58] [INFO ] Flatten gal took : 14 ms
[2025-06-02 15:08:58] [INFO ] Flatten gal took : 13 ms
[2025-06-02 15:08:58] [INFO ] Input system was already deterministic with 408 transitions.
[2025-06-02 15:08:58] [INFO ] Flatten gal took : 13 ms
[2025-06-02 15:08:58] [INFO ] Flatten gal took : 13 ms
[2025-06-02 15:08:58] [INFO ] Time to serialize gal into /tmp/CTLFireability14610690683848872050.gal : 4 ms
[2025-06-02 15:08:58] [INFO ] Time to serialize properties into /tmp/CTLFireability9400822639307174582.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14610690683848872050.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9400822639307174582.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-02 15:09:29] [INFO ] Flatten gal took : 13 ms
[2025-06-02 15:09:29] [INFO ] Applying decomposition
[2025-06-02 15:09:29] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph14743068551051538713.txt' '-o' '/tmp/graph14743068551051538713.bin' '-w' '/tmp/graph14743068551051538713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14743068551051538713.bin' '-l' '-1' '-v' '-w' '/tmp/graph14743068551051538713.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:09:29] [INFO ] Decomposing Gal with order
[2025-06-02 15:09:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:09:29] [INFO ] Removed a total of 932 redundant transitions.
[2025-06-02 15:09:29] [INFO ] Flatten gal took : 33 ms
[2025-06-02 15:09:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 8 ms.
[2025-06-02 15:09:29] [INFO ] Time to serialize gal into /tmp/CTLFireability10429341559533198155.gal : 5 ms
[2025-06-02 15:09:29] [INFO ] Time to serialize properties into /tmp/CTLFireability11865876235999523285.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10429341559533198155.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11865876235999523285.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.94267e+07,6.57834,184520,2489,28,111762,415,800,1.96001e+06,63,1037,0


Converting to forward existential form...Done !
original formula: EX(AG(EX((AF(((i9.i1.u4.p16==1)&&(i2.i1.u39.p144==1))) + (i3.i1.u42.p159==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX((!(EG(!(((i9.i1.u4.p16==1)&&(i2.i1.u39.p144==1))))) + (i3.i1.u42.p159==0)))))))] !=...161
Reverse transition relation is NOT exact ! Due to transitions t30, t39, t48, t52, t85, t105, t181, t186, t195, t200, t202, t227, t235, t259, t267, t273, t2...980
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 497/497 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 204 transition count 463
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 204 transition count 463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 203 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 203 transition count 462
Applied a total of 40 rules in 7 ms. Remains 203 /223 variables (removed 20) and now considering 462/497 (removed 35) transitions.
// Phase 1: matrix 462 rows 203 cols
[2025-06-02 15:09:59] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:09:59] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-02 15:09:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:09:59] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2025-06-02 15:09:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:10] [INFO ] Deduced a trap composed of 12 places in 252 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:10] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:10] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:10] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:10] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:11] [INFO ] Deduced a trap composed of 33 places in 265 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:11] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:11] [INFO ] Deduced a trap composed of 126 places in 240 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:12] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:12] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:12] [INFO ] Deduced a trap composed of 35 places in 303 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:13] [INFO ] Deduced a trap composed of 37 places in 278 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:13] [INFO ] Deduced a trap composed of 34 places in 291 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:14] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:15] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:15] [INFO ] Deduced a trap composed of 36 places in 254 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:15] [INFO ] Deduced a trap composed of 22 places in 312 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:15] [INFO ] Deduced a trap composed of 20 places in 312 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:16] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:16] [INFO ] Deduced a trap composed of 24 places in 326 ms of which 33 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:17] [INFO ] Deduced a trap composed of 126 places in 204 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:17] [INFO ] Deduced a trap composed of 126 places in 228 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:17] [INFO ] Deduced a trap composed of 112 places in 215 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:19] [INFO ] Deduced a trap composed of 24 places in 322 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:19] [INFO ] Deduced a trap composed of 24 places in 321 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:20] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:20] [INFO ] Deduced a trap composed of 138 places in 242 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:20] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:21] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:21] [INFO ] Deduced a trap composed of 22 places in 293 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:21] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:22] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:22] [INFO ] Deduced a trap composed of 22 places in 284 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:22] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:23] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:24] [INFO ] Deduced a trap composed of 39 places in 237 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:24] [INFO ] Deduced a trap composed of 37 places in 262 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:24] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/665 variables, and 45 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:33] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:33] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:33] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:34] [INFO ] Deduced a trap composed of 35 places in 216 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:35] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:35] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:35] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:36] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:36] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:36] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Problem TDEAD274 is UNSAT
Problem TDEAD275 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 TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 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 TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 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 TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 5 (OVERLAPS) 462/665 variables, 203/258 constraints. Problems are: Problem set: 50 solved, 411 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 411/669 constraints. Problems are: Problem set: 50 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 665/665 variables, and 669 constraints, problems are : Problem set: 50 solved, 411 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 411/461 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60293ms problems are : Problem set: 50 solved, 411 unsolved
Search for dead transitions found 50 dead transitions in 60296ms
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 : 203/223 places, 412/497 transitions.
Applied a total of 0 rules in 2 ms. Remains 203 /203 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60801 ms. Remains : 203/223 places, 412/497 transitions.
[2025-06-02 15:11:00] [INFO ] Flatten gal took : 12 ms
[2025-06-02 15:11:00] [INFO ] Flatten gal took : 12 ms
[2025-06-02 15:11:00] [INFO ] Input system was already deterministic with 412 transitions.
[2025-06-02 15:11:00] [INFO ] Flatten gal took : 13 ms
[2025-06-02 15:11:00] [INFO ] Flatten gal took : 13 ms
[2025-06-02 15:11:00] [INFO ] Time to serialize gal into /tmp/CTLFireability17810965824364281917.gal : 3 ms
[2025-06-02 15:11:00] [INFO ] Time to serialize properties into /tmp/CTLFireability11738280218559938296.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17810965824364281917.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11738280218559938296.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:11:30] [INFO ] Flatten gal took : 14 ms
[2025-06-02 15:11:30] [INFO ] Applying decomposition
[2025-06-02 15:11:30] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph14497938561969570860.txt' '-o' '/tmp/graph14497938561969570860.bin' '-w' '/tmp/graph14497938561969570860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14497938561969570860.bin' '-l' '-1' '-v' '-w' '/tmp/graph14497938561969570860.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:11:30] [INFO ] Decomposing Gal with order
[2025-06-02 15:11:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:11:30] [INFO ] Removed a total of 941 redundant transitions.
[2025-06-02 15:11:30] [INFO ] Flatten gal took : 32 ms
[2025-06-02 15:11:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 8 ms.
[2025-06-02 15:11:30] [INFO ] Time to serialize gal into /tmp/CTLFireability1455208701847116071.gal : 4 ms
[2025-06-02 15:11:30] [INFO ] Time to serialize properties into /tmp/CTLFireability12232452755783727781.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1455208701847116071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12232452755783727781.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.23992e+07,1.86018,59112,2196,33,88607,395,951,350404,70,1098,0


Converting to forward existential form...Done !
original formula: AF((((E((i3.i0.u30.p121==1) U (i9.i1.u2.p4==1)) * !(A(AX(((((i9.i1.u5.p25==1)&&(i3.i1.u8.p36==1))&&((i9.i1.u16.p74==1)&&(i2.u21.p90==1)))...521
=> equivalent forward existential formula: [FwdG(Init,!((((E((i3.i0.u30.p121==1) U (i9.i1.u2.p4==1)) * !(!((E(!(((((i9.i1.u9.p47==1)&&(i9.i1.u23.p98==1))&&...837
Reverse transition relation is NOT exact ! Due to transitions t16, t30, t35, t48, t82, t114, t123, t183, t190, t197, t230, t232, t238, t240, t262, t264, t2...1139
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 497/497 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 204 transition count 463
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 204 transition count 463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 203 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 203 transition count 462
Applied a total of 40 rules in 7 ms. Remains 203 /223 variables (removed 20) and now considering 462/497 (removed 35) transitions.
// Phase 1: matrix 462 rows 203 cols
[2025-06-02 15:12:00] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:12:00] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-02 15:12:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:12:00] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2025-06-02 15:12:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:11] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:11] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:11] [INFO ] Deduced a trap composed of 15 places in 239 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:11] [INFO ] Deduced a trap composed of 15 places in 241 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:12] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:12] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:12] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:12] [INFO ] Deduced a trap composed of 125 places in 238 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:13] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:13] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:14] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:14] [INFO ] Deduced a trap composed of 34 places in 306 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:14] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:15] [INFO ] Deduced a trap composed of 24 places in 319 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:16] [INFO ] Deduced a trap composed of 24 places in 311 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:16] [INFO ] Deduced a trap composed of 25 places in 310 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:16] [INFO ] Deduced a trap composed of 22 places in 298 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:17] [INFO ] Deduced a trap composed of 36 places in 238 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:17] [INFO ] Deduced a trap composed of 20 places in 305 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:17] [INFO ] Deduced a trap composed of 33 places in 281 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:18] [INFO ] Deduced a trap composed of 125 places in 291 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:18] [INFO ] Deduced a trap composed of 34 places in 306 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:19] [INFO ] Deduced a trap composed of 133 places in 314 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:20] [INFO ] Deduced a trap composed of 24 places in 330 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:21] [INFO ] Deduced a trap composed of 22 places in 302 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:21] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:21] [INFO ] Deduced a trap composed of 24 places in 301 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:22] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:22] [INFO ] Deduced a trap composed of 35 places in 253 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:22] [INFO ] Deduced a trap composed of 35 places in 275 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:23] [INFO ] Deduced a trap composed of 108 places in 271 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:23] [INFO ] Deduced a trap composed of 23 places in 337 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:23] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:24] [INFO ] Deduced a trap composed of 24 places in 318 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:24] [INFO ] Deduced a trap composed of 24 places in 330 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:24] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:25] [INFO ] Deduced a trap composed of 133 places in 321 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:25] [INFO ] Deduced a trap composed of 22 places in 293 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:27] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:27] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:30] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:30] [INFO ] Deduced a trap composed of 130 places in 178 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/665 variables, and 49 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:34] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:35] [INFO ] Deduced a trap composed of 37 places in 308 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:36] [INFO ] Deduced a trap composed of 128 places in 310 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:36] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:36] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:40] [INFO ] Deduced a trap composed of 108 places in 185 ms of which 29 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:43] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:46] [INFO ] Deduced a trap composed of 134 places in 165 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:47] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:51] [INFO ] Deduced a trap composed of 128 places in 204 ms of which 39 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:55] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:56] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:56] [INFO ] Deduced a trap composed of 134 places in 301 ms of which 34 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:00] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 203/665 variables, and 63 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 0/461 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60236ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Starting structural reductions in LTL mode, iteration 1 : 203/223 places, 462/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60686 ms. Remains : 203/223 places, 462/497 transitions.
[2025-06-02 15:13:01] [INFO ] Flatten gal took : 26 ms
[2025-06-02 15:13:01] [INFO ] Flatten gal took : 27 ms
[2025-06-02 15:13:01] [INFO ] Input system was already deterministic with 462 transitions.
[2025-06-02 15:13:01] [INFO ] Flatten gal took : 27 ms
[2025-06-02 15:13:01] [INFO ] Flatten gal took : 27 ms
[2025-06-02 15:13:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13492273816805941609.gal : 5 ms
[2025-06-02 15:13:01] [INFO ] Time to serialize properties into /tmp/CTLFireability12417450530661828507.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13492273816805941609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12417450530661828507.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:13:31] [INFO ] Flatten gal took : 16 ms
[2025-06-02 15:13:31] [INFO ] Applying decomposition
[2025-06-02 15:13:31] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph4769090131142570115.txt' '-o' '/tmp/graph4769090131142570115.bin' '-w' '/tmp/graph4769090131142570115.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4769090131142570115.bin' '-l' '-1' '-v' '-w' '/tmp/graph4769090131142570115.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:13:31] [INFO ] Decomposing Gal with order
[2025-06-02 15:13:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:13:31] [INFO ] Removed a total of 1312 redundant transitions.
[2025-06-02 15:13:31] [INFO ] Flatten gal took : 69 ms
[2025-06-02 15:13:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 17 ms.
[2025-06-02 15:13:31] [INFO ] Time to serialize gal into /tmp/CTLFireability13417346946148563606.gal : 8 ms
[2025-06-02 15:13:31] [INFO ] Time to serialize properties into /tmp/CTLFireability14455893714654980308.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13417346946148563606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14455893714654980308.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3.08533e+07,9.135,174940,3488,34,155605,419,1147,1.47317e+06,76,1319,0


Converting to forward existential form...Done !
original formula: AG((((((i0.u6.p42==1)&&(i1.i0.u17.p73==1))&&((i5.i0.u54.p234==1)&&(i0.u71.p246==1))) + (E(((((i1.i0.u5.p25==1)&&(i6.u9.p41==1))&&((i1.i0....450
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !((E(TRUE U ((i6.u7.p30==0)&&(i1.i0.u10.p46==0))) * !(!((E(!(((i1.i1.u12.p56==1)&&(i3.i0....1052
Reverse transition relation is NOT exact ! Due to transitions t35, t39, t48, t82, t85, t105, t159, t175, t192, t194, t204, t208, t230, t238, t262, t270, t2...1152
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 497/497 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 206 transition count 467
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 206 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 205 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 205 transition count 466
Applied a total of 36 rules in 7 ms. Remains 205 /223 variables (removed 18) and now considering 466/497 (removed 31) transitions.
// Phase 1: matrix 466 rows 205 cols
[2025-06-02 15:14:01] [INFO ] Computed 7 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:14:01] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-02 15:14:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:14:02] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2025-06-02 15:14:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:08] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:08] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:08] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:08] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:09] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:09] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:09] [INFO ] Deduced a trap composed of 126 places in 144 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:09] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:09] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:10] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:11] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:11] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:11] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:11] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:11] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:11] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:12] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:12] [INFO ] Deduced a trap composed of 112 places in 134 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:12] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:12] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:13] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:14] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:14] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:14] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:14] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:14] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:15] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:15] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:15] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:15] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:16] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:16] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:16] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:16] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:17] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:18] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:18] [INFO ] Deduced a trap composed of 39 places in 251 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:19] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 30 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:26] [INFO ] Deduced a trap composed of 35 places in 318 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:26] [INFO ] Deduced a trap composed of 37 places in 255 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:26] [INFO ] Deduced a trap composed of 37 places in 264 ms of which 35 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:30] [INFO ] Deduced a trap composed of 33 places in 273 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:32] [INFO ] Deduced a trap composed of 20 places in 287 ms of which 29 ms to minimize.
SMT process timed out in 30474ms, After SMT, problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 30476ms
Starting structural reductions in LTL mode, iteration 1 : 205/223 places, 466/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30955 ms. Remains : 205/223 places, 466/497 transitions.
[2025-06-02 15:14:32] [INFO ] Flatten gal took : 25 ms
[2025-06-02 15:14:32] [INFO ] Flatten gal took : 27 ms
[2025-06-02 15:14:32] [INFO ] Input system was already deterministic with 466 transitions.
[2025-06-02 15:14:32] [INFO ] Flatten gal took : 26 ms
[2025-06-02 15:14:32] [INFO ] Flatten gal took : 26 ms
[2025-06-02 15:14:32] [INFO ] Time to serialize gal into /tmp/CTLFireability14730273843075833164.gal : 5 ms
[2025-06-02 15:14:32] [INFO ] Time to serialize properties into /tmp/CTLFireability10104321222968252001.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14730273843075833164.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10104321222968252001.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:15:02] [INFO ] Flatten gal took : 18 ms
[2025-06-02 15:15:02] [INFO ] Applying decomposition
[2025-06-02 15:15:02] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12083231000167817932.txt' '-o' '/tmp/graph12083231000167817932.bin' '-w' '/tmp/graph12083231000167817932.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12083231000167817932.bin' '-l' '-1' '-v' '-w' '/tmp/graph12083231000167817932.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:15:02] [INFO ] Decomposing Gal with order
[2025-06-02 15:15:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:15:03] [INFO ] Removed a total of 1309 redundant transitions.
[2025-06-02 15:15:03] [INFO ] Flatten gal took : 59 ms
[2025-06-02 15:15:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 14 ms.
[2025-06-02 15:15:03] [INFO ] Time to serialize gal into /tmp/CTLFireability2488952029069332375.gal : 8 ms
[2025-06-02 15:15:03] [INFO ] Time to serialize properties into /tmp/CTLFireability13012519020514078394.ctl : 8 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2488952029069332375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13012519020514078394.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.68856e+07,21.0693,316692,3254,60,161631,553,1200,3.1899e+06,91,2143,0


Converting to forward existential form...Done !
original formula: ((AF((EX((i0.u4.p15!=1)) * A(((i8.i0.u12.p62==1)&&(i2.i0.u42.p165==1)) U ((((i0.u4.p18==1)&&(i8.i2.u9.p48==1))&&((i8.i2.u17.p74==1)&&(i8....590
=> equivalent forward existential formula: [(FwdU(((FwdU(((Init * !(EG((EX(!(EG(!((((((i0.u3.p13==1)&&(i5.u7.p36==1))&&((i8.i2.u17.p74==1)&&(i8.i1.u22.p90=...920
Reverse transition relation is NOT exact ! Due to transitions t19, t84, t96, t103, t116, t161, t179, t192, t194, t199, t212, t234, t236, t242, t244, t266, ...1219
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 497/497 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 203 transition count 461
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 203 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 202 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 202 transition count 460
Applied a total of 42 rules in 8 ms. Remains 202 /223 variables (removed 21) and now considering 460/497 (removed 37) transitions.
// Phase 1: matrix 460 rows 202 cols
[2025-06-02 15:15:33] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:15:33] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-02 15:15:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:15:33] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2025-06-02 15:15:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:39] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:40] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:40] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:40] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:40] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:41] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:41] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:41] [INFO ] Deduced a trap composed of 125 places in 227 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:41] [INFO ] Deduced a trap composed of 125 places in 225 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:41] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:42] [INFO ] Deduced a trap composed of 37 places in 268 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:43] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:44] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:44] [INFO ] Deduced a trap composed of 22 places in 304 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:44] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:45] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:45] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:45] [INFO ] Deduced a trap composed of 33 places in 296 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:45] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:46] [INFO ] Deduced a trap composed of 20 places in 290 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:46] [INFO ] Deduced a trap composed of 125 places in 227 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:47] [INFO ] Deduced a trap composed of 111 places in 216 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:48] [INFO ] Deduced a trap composed of 24 places in 327 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:49] [INFO ] Deduced a trap composed of 24 places in 310 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:49] [INFO ] Deduced a trap composed of 22 places in 229 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:49] [INFO ] Deduced a trap composed of 34 places in 267 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:50] [INFO ] Deduced a trap composed of 24 places in 265 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:50] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:50] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:51] [INFO ] Deduced a trap composed of 23 places in 302 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:51] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:51] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:52] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:52] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:52] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:52] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:53] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:53] [INFO ] Deduced a trap composed of 24 places in 309 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:53] [INFO ] Deduced a trap composed of 24 places in 290 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:55] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:58] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:59] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:59] [INFO ] Deduced a trap composed of 133 places in 180 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:00] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/662 variables, and 51 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:07] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:13] [INFO ] Deduced a trap composed of 134 places in 307 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:13] [INFO ] Deduced a trap composed of 133 places in 314 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:13] [INFO ] Deduced a trap composed of 133 places in 297 ms of which 39 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:18] [INFO ] Deduced a trap composed of 130 places in 296 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:19] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:24] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:24] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:25] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 202/662 variables, and 60 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 0/459 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60229ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 60231ms
Starting structural reductions in LTL mode, iteration 1 : 202/223 places, 460/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60707 ms. Remains : 202/223 places, 460/497 transitions.
[2025-06-02 15:16:33] [INFO ] Flatten gal took : 26 ms
[2025-06-02 15:16:33] [INFO ] Flatten gal took : 26 ms
[2025-06-02 15:16:33] [INFO ] Input system was already deterministic with 460 transitions.
[2025-06-02 15:16:33] [INFO ] Flatten gal took : 28 ms
[2025-06-02 15:16:33] [INFO ] Flatten gal took : 28 ms
[2025-06-02 15:16:33] [INFO ] Time to serialize gal into /tmp/CTLFireability14488880773749611650.gal : 6 ms
[2025-06-02 15:16:33] [INFO ] Time to serialize properties into /tmp/CTLFireability12193376974938461514.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14488880773749611650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12193376974938461514.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:17:04] [INFO ] Flatten gal took : 16 ms
[2025-06-02 15:17:04] [INFO ] Applying decomposition
[2025-06-02 15:17:04] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph15202020508923937485.txt' '-o' '/tmp/graph15202020508923937485.bin' '-w' '/tmp/graph15202020508923937485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15202020508923937485.bin' '-l' '-1' '-v' '-w' '/tmp/graph15202020508923937485.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:17:04] [INFO ] Decomposing Gal with order
[2025-06-02 15:17:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:17:04] [INFO ] Removed a total of 1316 redundant transitions.
[2025-06-02 15:17:04] [INFO ] Flatten gal took : 35 ms
[2025-06-02 15:17:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 9 ms.
[2025-06-02 15:17:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16288313844521865167.gal : 4 ms
[2025-06-02 15:17:04] [INFO ] Time to serialize properties into /tmp/CTLFireability16391145195353191162.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16288313844521865167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16391145195353191162.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3.07427e+07,12.0098,207924,4501,33,125537,283,1228,1.96669e+06,65,751,0


Converting to forward existential form...Done !
original formula: AX(AF((AG((i1.u3.p17==1)) + (EF((((i8.i1.u5.p24==0)||(i8.i1.u16.p73==0))||((i9.u48.p237==0)||(i9.u73.p246==0)))) * (((i6.i0.u53.p189==1)|...342
=> equivalent forward existential formula: [FwdG(EY(Init),!((!(E(TRUE U !((i1.u3.p17==1)))) + (E(TRUE U (((i8.i1.u5.p24==0)||(i8.i1.u16.p73==0))||((i9.u48....405
Reverse transition relation is NOT exact ! Due to transitions t30, t35, t48, t96, t105, t114, t118, t159, t175, t188, t190, t195, t206, t228, t230, t236, t...1090
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 223/223 places, 497/497 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 205 transition count 465
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 205 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 464
Applied a total of 38 rules in 6 ms. Remains 204 /223 variables (removed 19) and now considering 464/497 (removed 33) transitions.
// Phase 1: matrix 464 rows 204 cols
[2025-06-02 15:17:34] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:17:34] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-02 15:17:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:17:34] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2025-06-02 15:17:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:45] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:45] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:45] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:45] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:46] [INFO ] Deduced a trap composed of 33 places in 234 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:46] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:46] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:46] [INFO ] Deduced a trap composed of 127 places in 222 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:47] [INFO ] Deduced a trap composed of 127 places in 225 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:47] [INFO ] Deduced a trap composed of 112 places in 219 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:48] [INFO ] Deduced a trap composed of 37 places in 270 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:48] [INFO ] Deduced a trap composed of 20 places in 292 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:48] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:49] [INFO ] Deduced a trap composed of 34 places in 295 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:50] [INFO ] Deduced a trap composed of 33 places in 277 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:50] [INFO ] Deduced a trap composed of 22 places in 275 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:50] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:50] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:51] [INFO ] Deduced a trap composed of 36 places in 243 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:51] [INFO ] Deduced a trap composed of 112 places in 227 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:53] [INFO ] Deduced a trap composed of 135 places in 276 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:53] [INFO ] Deduced a trap composed of 24 places in 314 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:54] [INFO ] Deduced a trap composed of 24 places in 313 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:54] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:54] [INFO ] Deduced a trap composed of 35 places in 309 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:55] [INFO ] Deduced a trap composed of 21 places in 285 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:55] [INFO ] Deduced a trap composed of 38 places in 270 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:55] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:56] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:56] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:56] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:57] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:57] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:57] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:58] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:58] [INFO ] Deduced a trap composed of 22 places in 268 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:58] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:59] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:00] [INFO ] Deduced a trap composed of 37 places in 256 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:00] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 204/668 variables, and 47 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 40/47 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:09] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:10] [INFO ] Deduced a trap composed of 35 places in 279 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:10] [INFO ] Deduced a trap composed of 134 places in 306 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:11] [INFO ] Deduced a trap composed of 35 places in 272 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:11] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:16] [INFO ] Deduced a trap composed of 134 places in 299 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:16] [INFO ] Deduced a trap composed of 135 places in 275 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:16] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:17] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:22] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:22] [INFO ] Deduced a trap composed of 28 places in 305 ms of which 28 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:27] [INFO ] Deduced a trap composed of 37 places in 253 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:28] [INFO ] Deduced a trap composed of 36 places in 309 ms of which 43 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 204/668 variables, and 60 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 0/463 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60241ms problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 60244ms
Starting structural reductions in LTL mode, iteration 1 : 204/223 places, 464/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60692 ms. Remains : 204/223 places, 464/497 transitions.
[2025-06-02 15:18:34] [INFO ] Flatten gal took : 25 ms
[2025-06-02 15:18:35] [INFO ] Flatten gal took : 26 ms
[2025-06-02 15:18:35] [INFO ] Input system was already deterministic with 464 transitions.
[2025-06-02 15:18:35] [INFO ] Flatten gal took : 26 ms
[2025-06-02 15:18:35] [INFO ] Flatten gal took : 26 ms
[2025-06-02 15:18:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17967158357993969040.gal : 4 ms
[2025-06-02 15:18:35] [INFO ] Time to serialize properties into /tmp/CTLFireability13656162549765884638.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17967158357993969040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13656162549765884638.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:19:05] [INFO ] Flatten gal took : 16 ms
[2025-06-02 15:19:05] [INFO ] Applying decomposition
[2025-06-02 15:19:05] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph2041969993973147175.txt' '-o' '/tmp/graph2041969993973147175.bin' '-w' '/tmp/graph2041969993973147175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2041969993973147175.bin' '-l' '-1' '-v' '-w' '/tmp/graph2041969993973147175.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:19:05] [INFO ] Decomposing Gal with order
[2025-06-02 15:19:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:19:05] [INFO ] Removed a total of 1333 redundant transitions.
[2025-06-02 15:19:05] [INFO ] Flatten gal took : 48 ms
[2025-06-02 15:19:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 17 ms.
[2025-06-02 15:19:05] [INFO ] Time to serialize gal into /tmp/CTLFireability12362607474639608752.gal : 5 ms
[2025-06-02 15:19:05] [INFO ] Time to serialize properties into /tmp/CTLFireability6342803909695108218.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12362607474639608752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6342803909695108218.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.28287e+07,6.93915,154064,4999,31,106819,357,1034,1.47143e+06,60,755,0


Converting to forward existential form...Done !
original formula: EX(A((AF(((i2.u11.p65==1)&&(i3.u50.p164==1))) * (!(((i1.u8.p29==1)&&(i8.u24.p102==1))) + (EG((i8.u73.p239==1)) * EF((i7.u64.p221==1))))) ...335
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(((EX((i3.u45.p149==1)) + (i3.u42.p143==1)) + (((i3.u31.p121==1)&&(i7.u61.p204==1))||((((i2....776
Reverse transition relation is NOT exact ! Due to transitions t28, t35, t107, t116, t163, t179, t196, t208, t210, t232, t234, t240, t242, t264, t266, t272,...1131
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 497/497 transitions.
Graph (trivial) has 237 edges and 223 vertex of which 13 / 223 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 212 transition count 441
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 95 place count 167 transition count 437
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 165 transition count 437
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 97 place count 165 transition count 428
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 115 place count 156 transition count 428
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 134 place count 137 transition count 392
Iterating global reduction 3 with 19 rules applied. Total rules applied 153 place count 137 transition count 392
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 137 transition count 391
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 155 place count 136 transition count 391
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 155 place count 136 transition count 390
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 157 place count 135 transition count 390
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 158 place count 134 transition count 388
Iterating global reduction 5 with 1 rules applied. Total rules applied 159 place count 134 transition count 388
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 160 place count 133 transition count 386
Iterating global reduction 5 with 1 rules applied. Total rules applied 161 place count 133 transition count 386
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 199 place count 114 transition count 367
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 203 place count 110 transition count 345
Iterating global reduction 5 with 4 rules applied. Total rules applied 207 place count 110 transition count 345
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 208 place count 109 transition count 343
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 109 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 221 place count 109 transition count 331
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 221 place count 109 transition count 329
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 225 place count 107 transition count 329
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 237 place count 101 transition count 323
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 239 place count 99 transition count 315
Iterating global reduction 5 with 2 rules applied. Total rules applied 241 place count 99 transition count 315
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 243 place count 97 transition count 311
Iterating global reduction 5 with 2 rules applied. Total rules applied 245 place count 97 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 96 transition count 310
Applied a total of 246 rules in 107 ms. Remains 96 /223 variables (removed 127) and now considering 310/497 (removed 187) transitions.
[2025-06-02 15:19:35] [INFO ] Flow matrix only has 308 transitions (discarded 2 similar events)
// Phase 1: matrix 308 rows 96 cols
[2025-06-02 15:19:35] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:19:35] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-02 15:19:35] [INFO ] Flow matrix only has 308 transitions (discarded 2 similar events)
[2025-06-02 15:19:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:19:35] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-02 15:19:35] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:19:35] [INFO ] Redundant transitions in 35 ms returned []
Running 305 sub problems to find dead transitions.
[2025-06-02 15:19:35] [INFO ] Flow matrix only has 308 transitions (discarded 2 similar events)
[2025-06-02 15:19:35] [INFO ] Invariant cache hit.
[2025-06-02 15:19:35] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:19:37] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:19:37] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:19:37] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:19:37] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:19:37] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:19:37] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:19:37] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:19:38] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:19:38] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:19:38] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:19:38] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:19:38] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:19:38] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:19:38] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:19:38] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:19:39] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (OVERLAPS) 307/403 variables, 96/119 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 64/183 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (OVERLAPS) 1/404 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (OVERLAPS) 0/404 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 184 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
At refinement iteration 3 (OVERLAPS) 307/403 variables, 96/119 constraints. Problems are: Problem set: 42 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 64/183 constraints. Problems are: Problem set: 42 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 263/446 constraints. Problems are: Problem set: 42 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/404 variables, and 446 constraints, problems are : Problem set: 42 solved, 263 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 263/305 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60234ms problems are : Problem set: 42 solved, 263 unsolved
Search for dead transitions found 42 dead transitions in 60235ms
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 : 96/223 places, 268/497 transitions.
Applied a total of 0 rules in 8 ms. Remains 96 /96 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:20:36] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60779 ms. Remains : 96/223 places, 268/497 transitions.
[2025-06-02 15:20:36] [INFO ] Flatten gal took : 9 ms
[2025-06-02 15:20:36] [INFO ] Flatten gal took : 9 ms
[2025-06-02 15:20:36] [INFO ] Input system was already deterministic with 268 transitions.
[2025-06-02 15:20:36] [INFO ] Flatten gal took : 9 ms
[2025-06-02 15:20:36] [INFO ] Flatten gal took : 9 ms
[2025-06-02 15:20:36] [INFO ] Time to serialize gal into /tmp/CTLFireability12061061031700449280.gal : 2 ms
[2025-06-02 15:20:36] [INFO ] Time to serialize properties into /tmp/CTLFireability14125885220497937990.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12061061031700449280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14125885220497937990.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07318e+06,9.63509,233208,2,27680,5,545162,6,0,652,530842,0


Converting to forward existential form...Done !
original formula: (EF(((p57==1) * AF((p212==0)))) + (EG(EF(((p16==0)||(p129==0)))) * AF((p92==1))))
=> equivalent forward existential formula: ([((Init * !(E(TRUE U ((p57==1) * !(EG(!((p212==0)))))))) * !(EG(E(TRUE U ((p16==0)||(p129==0))))))] = FALSE * [...237
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t8, t10, t11, t18, t24, t25, t26, t28, t31, t32, t40, t44, t45, t46, t49, t51, t52, t...594
Detected timeout of ITS tools.
[2025-06-02 15:21:06] [INFO ] Flatten gal took : 9 ms
[2025-06-02 15:21:06] [INFO ] Applying decomposition
[2025-06-02 15:21:06] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph9779567337807099131.txt' '-o' '/tmp/graph9779567337807099131.bin' '-w' '/tmp/graph9779567337807099131.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9779567337807099131.bin' '-l' '-1' '-v' '-w' '/tmp/graph9779567337807099131.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:21:06] [INFO ] Decomposing Gal with order
[2025-06-02 15:21:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:21:06] [INFO ] Removed a total of 384 redundant transitions.
[2025-06-02 15:21:06] [INFO ] Flatten gal took : 21 ms
[2025-06-02 15:21:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 3 ms.
[2025-06-02 15:21:06] [INFO ] Time to serialize gal into /tmp/CTLFireability13210542577998267462.gal : 2 ms
[2025-06-02 15:21:06] [INFO ] Time to serialize properties into /tmp/CTLFireability7124518924667452203.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13210542577998267462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7124518924667452203.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07318e+06,1.09837,32296,486,3065,13740,41782,514,35835,236,185189,0


Converting to forward existential form...Done !
original formula: (EF(((i1.u4.p57==1) * AF((i8.i0.u23.p212==0)))) + (EG(EF(((u0.p16==0)||(i4.u13.p129==0)))) * AF((i2.u10.p92==1))))
=> equivalent forward existential formula: ([((Init * !(E(TRUE U ((i1.u4.p57==1) * !(EG(!((i8.i0.u23.p212==0)))))))) * !(EG(E(TRUE U ((u0.p16==0)||(i4.u13....286
Reverse transition relation is NOT exact ! Due to transitions t18, t28, t40, t57, t71, t73, t79, t81, t83, t84, t85, t87, t88, t89, t90, t114, t117, t118, ...670
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 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
(forward)formula 0,1,8.60019,186260,1,0,157241,191009,3234,432905,1748,851133,427911
FORMULA MedleyA-PT-18-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 497/497 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 204 transition count 462
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 204 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 203 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 203 transition count 461
Applied a total of 40 rules in 9 ms. Remains 203 /223 variables (removed 20) and now considering 461/497 (removed 36) transitions.
// Phase 1: matrix 461 rows 203 cols
[2025-06-02 15:21:15] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:21:15] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-02 15:21:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:21:15] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-02 15:21:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:24] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:24] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:24] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:24] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:24] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:24] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:25] [INFO ] Deduced a trap composed of 126 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:25] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:25] [INFO ] Deduced a trap composed of 126 places in 153 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:25] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:26] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:26] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:27] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:27] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:27] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:27] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:27] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:28] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:28] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:28] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:29] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:29] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:30] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:30] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:30] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:30] [INFO ] Deduced a trap composed of 24 places in 233 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:31] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:31] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:31] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:31] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:31] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:31] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:32] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:32] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:32] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:32] [INFO ] Deduced a trap composed of 107 places in 233 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:33] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:34] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:34] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:34] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:38] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:39] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:43] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:43] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/664 variables, and 51 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:48] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:49] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:50] [INFO ] Deduced a trap composed of 135 places in 277 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:50] [INFO ] Deduced a trap composed of 107 places in 213 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:21:50] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 5 (OVERLAPS) 461/664 variables, 203/259 constraints. Problems are: Problem set: 50 solved, 410 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 410/669 constraints. Problems are: Problem set: 50 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 664/664 variables, and 669 constraints, problems are : Problem set: 50 solved, 410 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 410/460 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60251ms problems are : Problem set: 50 solved, 410 unsolved
Search for dead transitions found 50 dead transitions in 60253ms
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 : 203/223 places, 411/497 transitions.
Applied a total of 0 rules in 4 ms. Remains 203 /203 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60689 ms. Remains : 203/223 places, 411/497 transitions.
[2025-06-02 15:22:15] [INFO ] Flatten gal took : 23 ms
[2025-06-02 15:22:15] [INFO ] Flatten gal took : 25 ms
[2025-06-02 15:22:15] [INFO ] Input system was already deterministic with 411 transitions.
[2025-06-02 15:22:15] [INFO ] Flatten gal took : 23 ms
[2025-06-02 15:22:15] [INFO ] Flatten gal took : 24 ms
[2025-06-02 15:22:15] [INFO ] Time to serialize gal into /tmp/CTLFireability12725236781786994725.gal : 3 ms
[2025-06-02 15:22:15] [INFO ] Time to serialize properties into /tmp/CTLFireability2643641121621987041.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12725236781786994725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2643641121621987041.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-02 15:22:46] [INFO ] Flatten gal took : 18 ms
[2025-06-02 15:22:46] [INFO ] Applying decomposition
[2025-06-02 15:22:46] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph3647574946982338078.txt' '-o' '/tmp/graph3647574946982338078.bin' '-w' '/tmp/graph3647574946982338078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3647574946982338078.bin' '-l' '-1' '-v' '-w' '/tmp/graph3647574946982338078.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:22:46] [INFO ] Decomposing Gal with order
[2025-06-02 15:22:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:22:46] [INFO ] Removed a total of 916 redundant transitions.
[2025-06-02 15:22:46] [INFO ] Flatten gal took : 29 ms
[2025-06-02 15:22:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 7 ms.
[2025-06-02 15:22:46] [INFO ] Time to serialize gal into /tmp/CTLFireability17193694683998349900.gal : 3 ms
[2025-06-02 15:22:46] [INFO ] Time to serialize properties into /tmp/CTLFireability3340821317837525780.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17193694683998349900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3340821317837525780.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.98225e+07,14.0479,263096,2625,41,237062,413,1060,2.29998e+06,88,1154,0


Converting to forward existential form...Done !
original formula: (AF(((((AG((i9.i1.u17.p75==0)) + (((i9.i0.u5.p24==1)&&(i9.i0.u24.p98==1))&&((i9.i1.u48.p237==1)&&(i9.i1.u70.p246==1)))) + EG(((((i0.u4.p1...774
=> equivalent forward existential formula: [FwdG((Init * !(!(EG(!(((((!(E(TRUE U !((i9.i1.u17.p75==0)))) + (((i9.i0.u5.p24==1)&&(i9.i0.u24.p98==1))&&((i9.i...870
Reverse transition relation is NOT exact ! Due to transitions t19, t39, t81, t87, t116, t178, t184, t189, t191, t198, t203, t229, t231, t237, t239, t261, t...1059
Detected timeout of ITS tools.
[2025-06-02 15:23:16] [INFO ] Flatten gal took : 19 ms
[2025-06-02 15:23:16] [INFO ] Flatten gal took : 18 ms
[2025-06-02 15:23:16] [INFO ] Applying decomposition
[2025-06-02 15:23:16] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph351759924230121859.txt' '-o' '/tmp/graph351759924230121859.bin' '-w' '/tmp/graph351759924230121859.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph351759924230121859.bin' '-l' '-1' '-v' '-w' '/tmp/graph351759924230121859.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:23:16] [INFO ] Decomposing Gal with order
[2025-06-02 15:23:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:23:16] [INFO ] Removed a total of 1262 redundant transitions.
[2025-06-02 15:23:16] [INFO ] Flatten gal took : 37 ms
[2025-06-02 15:23:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 8 ms.
[2025-06-02 15:23:16] [INFO ] Time to serialize gal into /tmp/CTLFireability11413939302648110970.gal : 4 ms
[2025-06-02 15:23:16] [INFO ] Time to serialize properties into /tmp/CTLFireability10620113721299555858.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11413939302648110970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10620113721299555858.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 9 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.48393e+07,3.47352,64272,3053,108,80875,1191,1189,311187,97,3966,0


Converting to forward existential form...Done !
original formula: AF(((AX((i3.i0.u76.p240==0)) + EG(AG(EX((((i0.u4.p19==1)&&(i3.i1.u12.p66==1))&&((i4.i1.u49.p168==1)&&(i4.i1.u77.p246==1))))))) * (A(EG((i...475
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!((i3.i0.u76.p240==0)))) + EG(!(E(TRUE U !(EX((((i0.u4.p19==1)&&(i3.i1.u12.p66==1))&&((i4.i1...1760
Reverse transition relation is NOT exact ! Due to transitions t17, t44, t62, t89, t98, t106, t115, t124, t177, t206, t221, t243, t265, t267, t273, t275, t2...1640
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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
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
(forward)formula 0,0,166.602,2209148,1,0,2.29594e+06,2239,2801,1.35028e+07,191,8745,1474357
FORMULA MedleyA-PT-18-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX((EG((EF((((i0.u4.p19==1)&&(i4.i0.u16.p73==1))&&((i6.u28.p165==1)&&(i4.i1.u77.p246==1)))) * (i3.i0.u5.p21==0))) * EG(EX((i5.i0.u41.p143...163
=> equivalent forward existential formula: ([(EY(Init) * !(EG((E(TRUE U (((i0.u4.p19==1)&&(i4.i0.u16.p73==1))&&((i6.u28.p165==1)&&(i4.i1.u77.p246==1)))) * ...242
Using 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 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 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
(forward)formula 1,1,214.214,2209148,1,0,2.29594e+06,2239,4219,1.35028e+07,261,8745,3953729
FORMULA MedleyA-PT-18-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(AG(EX((AF(((i0.u4.p16==1)&&(i5.i0.u42.p144==1))) + (i7.i2.u46.p159==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX((!(EG(!(((i0.u4.p16==1)&&(i5.i0.u42.p144==1))))) + (i7.i2.u46.p159==0)))))))] != FA...158
(forward)formula 2,0,225.828,2209148,1,0,2.29594e+06,2290,4343,1.35028e+07,264,8745,4907193
FORMULA MedleyA-PT-18-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((((E((i6.u33.p121==1) U (i4.i1.u2.p4==1)) * !(A(AX(((((i3.i0.u5.p25==1)&&(i2.u8.p36==1))&&((i4.i0.u16.p74==1)&&(i1.u22.p90==1)))&&(i3....507
=> equivalent forward existential formula: [FwdG(Init,!((((E((i6.u33.p121==1) U (i4.i1.u2.p4==1)) * !(!((E(!(((((i3.i0.u10.p47==1)&&(i3.i0.u24.p98==1))&&((...825
Using 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 an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 3,1,311.163,2430460,1,0,2.69271e+06,2353,3992,1.44115e+07,262,9039,2414974
FORMULA MedleyA-PT-18-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((((((i2.u9.p42==1)&&(i4.i0.u16.p73==1))&&((i9.i0.u74.p234==1)&&(i4.i1.u77.p246==1))) + (E(((((i3.i0.u5.p25==1)&&(i2.u9.p41==1))&&((i4....447
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !((E(TRUE U ((i2.u7.p30==0)&&(i3.i0.u10.p46==0))) * !(!((E(!(((i3.i1.u12.p56==1)&&(i6.u28...1040
(forward)formula 4,0,515.043,3578936,1,0,3.62411e+06,2353,4002,1.80192e+07,250,9039,912967
FORMULA MedleyA-PT-18-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((AF((EX((i0.u4.p15!=1)) * A(((i3.i1.u13.p62==1)&&(i6.u28.p165==1)) U ((((i0.u4.p18==1)&&(i3.i0.u10.p48==1))&&((i4.i0.u16.p74==1)&&(i3.i0...576
=> equivalent forward existential formula: [(FwdU(((FwdU(((Init * !(EG((EX(!(EG(!((((((i0.u3.p13==1)&&(i2.u8.p36==1))&&((i4.i0.u16.p74==1)&&(i1.u22.p90==1)...908
Using 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 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
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
(forward)formula 5,1,598.427,3578936,1,0,3.62411e+06,2353,4451,1.80192e+07,287,9039,5115175
FORMULA MedleyA-PT-18-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(AF((AG((i0.u4.p17==1)) + (EF((((i3.i0.u5.p24==0)||(i4.i0.u16.p73==0))||((i4.i1.u50.p237==0)||(i4.i1.u77.p246==0)))) * (((i8.u58.p189==...345
=> equivalent forward existential formula: [FwdG(EY(Init),!((!(E(TRUE U !((i0.u4.p17==1)))) + (E(TRUE U (((i3.i0.u5.p24==0)||(i4.i0.u16.p73==0))||((i4.i1.u...408
(forward)formula 6,0,636.846,3578936,1,0,3.62411e+06,2353,4659,1.80192e+07,291,9039,6781092
FORMULA MedleyA-PT-18-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(A((AF(((i3.i1.u11.p65==1)&&(i6.u48.p164==1))) * (!(((i2.u9.p29==1)&&(i4.i1.u49.p102==1))) + (EG((i4.i1.u50.p239==1)) * EF((i10.i0.u71....374
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(((EX((i5.i1.u44.p149==1)) + (i5.i0.u41.p143==1)) + (((i6.u33.p121==1)&&(i10.i0.u64.p204==1)...867
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
(forward)formula 7,0,697.689,3878840,1,0,4.33724e+06,2385,4799,2.10394e+07,291,9039,9350208
FORMULA MedleyA-PT-18-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF(((((AG((i4.i0.u17.p75==0)) + (((i3.i0.u5.p24==1)&&(i3.i0.u24.p98==1))&&((i4.i1.u50.p237==1)&&(i4.i1.u77.p246==1)))) + EG(((((i0.u4.p1...775
=> equivalent forward existential formula: [FwdG((Init * !(!(EG(!(((((!(E(TRUE U !((i4.i0.u17.p75==0)))) + (((i3.i0.u5.p24==1)&&(i3.i0.u24.p98==1))&&((i4.i...871
Using 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 an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 8,0,863.735,3946936,1,0,4.45159e+06,2432,4502,2.12429e+07,267,9039,6270522
FORMULA MedleyA-PT-18-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2302124 ms.

BK_STOP 1748878661825

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-18"
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-5832"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-18, 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 r128-smll-174876524200234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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