Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729800690.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 AutonomousCar-PT-06b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729800690
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 228K 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 AutonomousCar-PT-06b-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2023-15
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2025-00
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2025-01
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2025-02
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2025-03
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2025-04
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2025-05
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2025-06
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2025-07
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2025-08
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2025-09
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2025-10
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748650438687

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-31 00:13:59] [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-05-31 00:13:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:14:00] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2025-05-31 00:14:00] [INFO ] Transformed 289 places.
[2025-05-31 00:14:00] [INFO ] Transformed 644 transitions.
[2025-05-31 00:14:00] [INFO ] Found NUPN structural information;
[2025-05-31 00:14:00] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 94 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 257 transition count 612
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 257 transition count 612
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 251 transition count 606
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 251 transition count 606
Applied a total of 76 rules in 67 ms. Remains 251 /289 variables (removed 38) and now considering 606/644 (removed 38) transitions.
// Phase 1: matrix 606 rows 251 cols
[2025-05-31 00:14:00] [INFO ] Computed 11 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:14:00] [INFO ] Implicit Places using invariants in 226 ms returned []
[2025-05-31 00:14:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:14:00] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2025-05-31 00:14:00] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:09] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:09] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:09] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:10] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:10] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:10] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:10] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:10] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:11] [INFO ] Deduced a trap composed of 33 places in 267 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:11] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:11] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:11] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:11] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:11] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:12] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:12] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:12] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:12] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:12] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:12] [INFO ] Deduced a trap composed of 59 places in 140 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:13] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:13] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:13] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:14] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:14] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:14] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:14] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:14] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:14] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:14] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:14] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:15] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:15] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:15] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:15] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:15] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:15] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:16] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:16] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:16] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:19] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:19] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:19] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:20] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:20] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:20] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:20] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:21] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:21] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:21] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:21] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:21] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:22] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:22] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:22] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:22] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:22] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:22] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:23] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:23] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:23] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:25] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:25] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:25] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:25] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:28] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:28] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:28] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:28] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:29] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:30] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:31] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:31] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 251/857 variables, and 84 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/251 constraints, PredecessorRefiner: 605/315 constraints, Known Traps: 73/73 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 73/84 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:35] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:35] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:35] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:36] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:36] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:36] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:36] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:37] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:37] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 9/93 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD532 is UNSAT
At refinement iteration 5 (OVERLAPS) 606/857 variables, 251/344 constraints. Problems are: Problem set: 2 solved, 603 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/857 variables, 313/657 constraints. Problems are: Problem set: 2 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 857/857 variables, and 657 constraints, problems are : Problem set: 2 solved, 603 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 603/315 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61010ms problems are : Problem set: 2 solved, 603 unsolved
Search for dead transitions found 2 dead transitions in 61027ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 251/289 places, 604/644 transitions.
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 0 rules in 6 ms. Remains 251 /251 variables (removed 0) and now considering 604/604 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61614 ms. Remains : 251/289 places, 604/644 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Support contains 93 out of 250 places after structural reductions.
[2025-05-31 00:15:02] [INFO ] Flatten gal took : 112 ms
[2025-05-31 00:15:02] [INFO ] Flatten gal took : 65 ms
[2025-05-31 00:15:02] [INFO ] Input system was already deterministic with 604 transitions.
Support contains 91 out of 250 places (down from 93) after GAL structural reductions.
RANDOM walk for 40000 steps (215 resets) in 2149 ms. (18 steps per ms) remains 45/99 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (9 resets) in 32 ms. (121 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (9 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 44/44 properties
// Phase 1: matrix 604 rows 250 cols
[2025-05-31 00:15:03] [INFO ] Computed 11 invariants in 5 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp91 is UNSAT
At refinement iteration 1 (OVERLAPS) 196/250 variables, 11/11 constraints. Problems are: Problem set: 6 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:04] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 17 ms to minimize.
Problem AtomicPropp40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:04] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 14 ms to minimize.
Problem AtomicPropp61 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 2/13 constraints. Problems are: Problem set: 8 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/13 constraints. Problems are: Problem set: 8 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 604/854 variables, 250/263 constraints. Problems are: Problem set: 8 solved, 36 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:05] [INFO ] Deduced a trap along path composed of 3 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:05] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:05] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:05] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:06] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/854 variables, 5/268 constraints. Problems are: Problem set: 8 solved, 36 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:06] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/854 variables, 1/269 constraints. Problems are: Problem set: 8 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/854 variables, 0/269 constraints. Problems are: Problem set: 8 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/854 variables, 0/269 constraints. Problems are: Problem set: 8 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 854/854 variables, and 269 constraints, problems are : Problem set: 8 solved, 36 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 44/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 6/6 constraints]
Escalating to Integer solving :Problem set: 8 solved, 36 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 204/250 variables, 11/11 constraints. Problems are: Problem set: 8 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 2/13 constraints. Problems are: Problem set: 8 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/13 constraints. Problems are: Problem set: 8 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 604/854 variables, 250/263 constraints. Problems are: Problem set: 8 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/854 variables, 5/268 constraints. Problems are: Problem set: 8 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/854 variables, 6/274 constraints. Problems are: Problem set: 8 solved, 36 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:10] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/854 variables, 1/275 constraints. Problems are: Problem set: 8 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/854 variables, 0/275 constraints. Problems are: Problem set: 8 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/854 variables, 0/275 constraints. Problems are: Problem set: 8 solved, 36 unsolved
No progress, stopping.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
After SMT solving in domain Int declared 854/854 variables, and 275 constraints, problems are : Problem set: 8 solved, 36 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 36/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 10162ms problems are : Problem set: 8 solved, 36 unsolved
Fused 36 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 863 ms.
Support contains 46 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 604/604 transitions.
Graph (trivial) has 174 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 914 edges and 248 vertex of which 245 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 245 transition count 516
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 109 rules applied. Total rules applied 194 place count 164 transition count 488
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 17 rules applied. Total rules applied 211 place count 149 transition count 486
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 213 place count 147 transition count 486
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 213 place count 147 transition count 476
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 233 place count 137 transition count 476
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 238 place count 132 transition count 471
Iterating global reduction 4 with 5 rules applied. Total rules applied 243 place count 132 transition count 471
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 387 place count 132 transition count 327
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 388 place count 131 transition count 326
Iterating global reduction 5 with 1 rules applied. Total rules applied 389 place count 131 transition count 326
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 447 place count 102 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 448 place count 102 transition count 296
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 6 with 2 rules applied. Total rules applied 450 place count 101 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 452 place count 101 transition count 293
Free-agglomeration rule applied 14 times.
Iterating global reduction 6 with 14 rules applied. Total rules applied 466 place count 101 transition count 279
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 480 place count 87 transition count 279
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 484 place count 87 transition count 279
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 485 place count 86 transition count 272
Iterating global reduction 7 with 1 rules applied. Total rules applied 486 place count 86 transition count 272
Applied a total of 486 rules in 114 ms. Remains 86 /250 variables (removed 164) and now considering 272/604 (removed 332) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 86/250 places, 272/604 transitions.
RANDOM walk for 40000 steps (1347 resets) in 598 ms. (66 steps per ms) remains 20/36 properties
BEST_FIRST walk for 4004 steps (19 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (19 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (20 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (15 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (18 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (19 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (19 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (20 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (13 resets) in 10 ms. (363 steps per ms) remains 14/20 properties
BEST_FIRST walk for 4003 steps (15 resets) in 10 ms. (363 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (16 resets) in 9 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (19 resets) in 8 ms. (444 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (14 resets) in 9 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (17 resets) in 9 ms. (400 steps per ms) remains 14/14 properties
// Phase 1: matrix 272 rows 86 cols
[2025-05-31 00:15:15] [INFO ] Computed 11 invariants in 1 ms
[2025-05-31 00:15:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 62/86 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 272/358 variables, 86/97 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:15] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:15] [INFO ] Deduced a trap along path composed of 3 places in 81 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:15] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:15] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:15] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/358 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 103 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1072 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 86/86 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 62/86 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 272/358 variables, 86/98 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/358 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 115 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1800 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 86/86 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 2904ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 3259 ms.
Support contains 24 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 272/272 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 86 transition count 266
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 80 transition count 264
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 78 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 78 transition count 263
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 18 place count 77 transition count 263
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 26 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 42 place count 65 transition count 251
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 64 transition count 244
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 64 transition count 244
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 48 place count 64 transition count 240
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 58 place count 60 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 59 place count 60 transition count 233
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 60 transition count 233
Applied a total of 60 rules in 81 ms. Remains 60 /86 variables (removed 26) and now considering 233/272 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 60/86 places, 233/272 transitions.
RANDOM walk for 40000 steps (1727 resets) in 344 ms. (115 steps per ms) remains 7/14 properties
BEST_FIRST walk for 40003 steps (230 resets) in 85 ms. (465 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (205 resets) in 35 ms. (1111 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (229 resets) in 43 ms. (909 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (231 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
// Phase 1: matrix 233 rows 60 cols
[2025-05-31 00:15:21] [INFO ] Computed 11 invariants in 2 ms
[2025-05-31 00:15:21] [INFO ] State equation strengthened by 1 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/60 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 233/293 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:21] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/293 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 73 constraints, problems are : Problem set: 0 solved, 2 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/60 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 233/293 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:22] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:22] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:22] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:22] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/293 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 79 constraints, problems are : Problem set: 0 solved, 2 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 879ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 82 ms.
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 233/233 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 0 with 2 rules applied. Total rules applied 2 place count 60 transition count 231
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 58 transition count 231
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 10 place count 52 transition count 192
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 52 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 52 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 21 place count 51 transition count 188
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 25 place count 49 transition count 186
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 31 place count 49 transition count 180
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 43 place count 43 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 44 place count 42 transition count 173
Applied a total of 44 rules in 25 ms. Remains 42 /60 variables (removed 18) and now considering 173/233 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 42/60 places, 173/233 transitions.
RANDOM walk for 40000 steps (420 resets) in 204 ms. (195 steps per ms) remains 1/2 properties
BEST_FIRST walk for 1677 steps (0 resets) in 7 ms. (209 steps per ms) remains 0/1 properties
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2025-05-31 00:15:22] [INFO ] Flatten gal took : 69 ms
[2025-05-31 00:15:22] [INFO ] Flatten gal took : 36 ms
[2025-05-31 00:15:22] [INFO ] Input system was already deterministic with 604 transitions.
Computed a total of 44 stabilizing places and 44 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 604/604 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 240 transition count 594
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 240 transition count 594
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 164 place count 240 transition count 450
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 166 place count 238 transition count 448
Iterating global reduction 1 with 2 rules applied. Total rules applied 168 place count 238 transition count 448
Applied a total of 168 rules in 13 ms. Remains 238 /250 variables (removed 12) and now considering 448/604 (removed 156) transitions.
// Phase 1: matrix 448 rows 238 cols
[2025-05-31 00:15:22] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:15:23] [INFO ] Implicit Places using invariants in 286 ms returned []
[2025-05-31 00:15:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:15:23] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Running 447 sub problems to find dead transitions.
[2025-05-31 00:15:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:28] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:29] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:29] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:29] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:29] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:29] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:29] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:29] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:30] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:30] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:30] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:30] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:30] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:30] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:31] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:31] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:31] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:31] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:31] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:31] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:31] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:32] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:32] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:32] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:32] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:32] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:32] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:33] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:33] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:33] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:33] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:33] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:34] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:34] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:34] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:34] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:35] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:35] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:35] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:35] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:37] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:38] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:38] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:38] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:38] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:38] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:38] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:38] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:38] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:39] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:39] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:39] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:39] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:39] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:39] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:39] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:39] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:40] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:40] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:40] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:40] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:44] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:44] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:45] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 447 unsolved
SMT process timed out in 30394ms, After SMT, problems are : Problem set: 0 solved, 447 unsolved
Search for dead transitions found 0 dead transitions in 30396ms
Starting structural reductions in LTL mode, iteration 1 : 238/250 places, 448/604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30878 ms. Remains : 238/250 places, 448/604 transitions.
[2025-05-31 00:15:53] [INFO ] Flatten gal took : 21 ms
[2025-05-31 00:15:53] [INFO ] Flatten gal took : 21 ms
[2025-05-31 00:15:53] [INFO ] Input system was already deterministic with 448 transitions.
[2025-05-31 00:15:53] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:15:53] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:15:53] [INFO ] Time to serialize gal into /tmp/CTLFireability17403444103455399010.gal : 15 ms
[2025-05-31 00:15:53] [INFO ] Time to serialize properties into /tmp/CTLFireability9109119771496227700.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17403444103455399010.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9109119771496227700.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-05-31 00:16:24] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:16:24] [INFO ] Applying decomposition
[2025-05-31 00:16:24] [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/graph3906900911248302110.txt' '-o' '/tmp/graph3906900911248302110.bin' '-w' '/tmp/graph3906900911248302110.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3906900911248302110.bin' '-l' '-1' '-v' '-w' '/tmp/graph3906900911248302110.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:16:24] [INFO ] Decomposing Gal with order
[2025-05-31 00:16:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:16:24] [INFO ] Removed a total of 845 redundant transitions.
[2025-05-31 00:16:24] [INFO ] Flatten gal took : 120 ms
[2025-05-31 00:16:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 20 ms.
[2025-05-31 00:16:24] [INFO ] Time to serialize gal into /tmp/CTLFireability8976711949138293154.gal : 7 ms
[2025-05-31 00:16:24] [INFO ] Time to serialize properties into /tmp/CTLFireability14378258851438829368.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/CTLFireability8976711949138293154.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14378258851438829368.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.11878e+12,0.086866,7020,645,113,5058,800,609,6989,83,2447,0


Converting to forward existential form...Done !
original formula: AG((AF(EX((A((((i9.u1.p6==1)&&(i9.u1.p15==1))&&((i1.i0.u53.p175==1)&&(i9.u1.p246==1))) U (((i9.u1.p6==1)&&(i9.u1.p15==1))&&((i1.i0.u17.p5...560
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(EX((!((E(!((((i9.u1.p6==1)&&(i9.u1.p15==1))&&((i1.i0.u17.p55==1)&&(i9.u1.p246==1)))) U ...1274
Reverse transition relation is NOT exact ! Due to transitions t86, t223, t225, t227, t251, t281, t305, t335, t365, t445, i1.i0.t112, i1.i0.u17.t200, i1.i0....809
(forward)formula 0,0,0.619972,27500,1,0,52339,1488,4609,73577,438,4462,121044
FORMULA AutonomousCar-PT-06b-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 604/604 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 239 transition count 593
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 239 transition count 593
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 166 place count 239 transition count 449
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 168 place count 237 transition count 447
Iterating global reduction 1 with 2 rules applied. Total rules applied 170 place count 237 transition count 447
Applied a total of 170 rules in 13 ms. Remains 237 /250 variables (removed 13) and now considering 447/604 (removed 157) transitions.
// Phase 1: matrix 447 rows 237 cols
[2025-05-31 00:16:25] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:16:25] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-05-31 00:16:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:16:25] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 446 sub problems to find dead transitions.
[2025-05-31 00:16: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/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:31] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:31] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:31] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:31] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:31] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:31] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:31] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:32] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:32] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:32] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:32] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:32] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:32] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:32] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:32] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:33] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:33] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:33] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:33] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:33] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:34] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:34] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:34] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:34] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:34] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:35] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:35] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:35] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:35] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:35] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:35] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:36] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:36] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:40] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:40] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:40] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:41] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:41] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:41] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:41] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:41] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:41] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:41] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:42] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:44] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:45] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:45] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:47] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:48] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 446 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 237/684 variables, and 60 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/237 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:58] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:58] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:58] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:58] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:58] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:58] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:59] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:59] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:59] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:59] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:59] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:59] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:59] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:00] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:00] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:00] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:00] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:00] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (OVERLAPS) 447/684 variables, 237/315 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/684 variables, 446/761 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:13] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/684 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 684/684 variables, and 762 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60425ms problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 60428ms
Starting structural reductions in LTL mode, iteration 1 : 237/250 places, 447/604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60715 ms. Remains : 237/250 places, 447/604 transitions.
[2025-05-31 00:17:25] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:17:25] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:17:26] [INFO ] Input system was already deterministic with 447 transitions.
[2025-05-31 00:17:26] [INFO ] Flatten gal took : 32 ms
[2025-05-31 00:17:26] [INFO ] Flatten gal took : 32 ms
[2025-05-31 00:17:26] [INFO ] Time to serialize gal into /tmp/CTLFireability5946206204800410230.gal : 3 ms
[2025-05-31 00:17:26] [INFO ] Time to serialize properties into /tmp/CTLFireability4149910802539736181.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/CTLFireability5946206204800410230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4149910802539736181.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-05-31 00:17:56] [INFO ] Flatten gal took : 22 ms
[2025-05-31 00:17:56] [INFO ] Applying decomposition
[2025-05-31 00:17:56] [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/graph777233059139434739.txt' '-o' '/tmp/graph777233059139434739.bin' '-w' '/tmp/graph777233059139434739.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph777233059139434739.bin' '-l' '-1' '-v' '-w' '/tmp/graph777233059139434739.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:17:56] [INFO ] Decomposing Gal with order
[2025-05-31 00:17:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:17:56] [INFO ] Removed a total of 847 redundant transitions.
[2025-05-31 00:17:56] [INFO ] Flatten gal took : 34 ms
[2025-05-31 00:17:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 7 ms.
[2025-05-31 00:17:56] [INFO ] Time to serialize gal into /tmp/CTLFireability3614197668380444641.gal : 3 ms
[2025-05-31 00:17:56] [INFO ] Time to serialize properties into /tmp/CTLFireability14953527433467061222.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/CTLFireability3614197668380444641.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14953527433467061222.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.07623e+12,7.27585,211708,2972,114,116963,777,581,2.44242e+06,89,2655,0


Converting to forward existential form...Done !
original formula: E((EX(((((i1.i1.u18.p62==1)&&(i2.i1.u27.p93==1))&&((i5.u38.p124==1)&&(i5.u46.p149==1)))&&(((i8.i1.u56.p186==1)&&(i5.u63.p211==1))&&(i5.u6...705
=> equivalent forward existential formula: ([((FwdU((FwdU(FwdU(Init,(EX(((((i1.i1.u18.p62==1)&&(i2.i1.u27.p93==1))&&((i5.u38.p124==1)&&(i5.u46.p149==1)))&&...1559
Reverse transition relation is NOT exact ! Due to transitions t137, t164, t222, t224, t254, t308, t344, t368, t444, i1.i1.t215, i1.i1.u12.t195, i1.i1.u18.t...767
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 604/604 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 237 transition count 591
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 237 transition count 591
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 170 place count 237 transition count 447
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 173 place count 234 transition count 444
Iterating global reduction 1 with 3 rules applied. Total rules applied 176 place count 234 transition count 444
Applied a total of 176 rules in 10 ms. Remains 234 /250 variables (removed 16) and now considering 444/604 (removed 160) transitions.
// Phase 1: matrix 444 rows 234 cols
[2025-05-31 00:18:26] [INFO ] Computed 11 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:18:26] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-05-31 00:18:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:18:26] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 443 sub problems to find dead transitions.
[2025-05-31 00:18:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:32] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:32] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:32] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:32] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:32] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:32] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:33] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:33] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:33] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:33] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:33] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:33] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:33] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:33] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:34] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:34] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:34] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:34] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:34] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:34] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:35] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:35] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:35] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:35] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:35] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:35] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:36] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:36] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:36] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:36] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:36] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:37] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:37] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:37] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:37] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:37] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:37] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:38] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:38] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:38] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:41] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:41] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:41] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:42] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:42] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:43] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:44] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:44] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:45] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:45] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:45] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 7 (OVERLAPS) 444/678 variables, 234/296 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:54] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:54] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:54] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:54] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:54] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:55] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:55] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:55] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:55] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:55] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:56] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:56] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:56] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:56] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:56] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:57] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 678/678 variables, and 312 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 443 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (OVERLAPS) 444/678 variables, 234/312 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/678 variables, 443/755 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:13] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 678/678 variables, and 756 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60410ms problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 60412ms
Starting structural reductions in LTL mode, iteration 1 : 234/250 places, 444/604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60763 ms. Remains : 234/250 places, 444/604 transitions.
[2025-05-31 00:19:27] [INFO ] Flatten gal took : 14 ms
[2025-05-31 00:19:27] [INFO ] Flatten gal took : 14 ms
[2025-05-31 00:19:27] [INFO ] Input system was already deterministic with 444 transitions.
[2025-05-31 00:19:27] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:19:27] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:19:27] [INFO ] Time to serialize gal into /tmp/CTLFireability16909866854979346375.gal : 4 ms
[2025-05-31 00:19:27] [INFO ] Time to serialize properties into /tmp/CTLFireability15099612183712062376.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/CTLFireability16909866854979346375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15099612183712062376.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-05-31 00:19:57] [INFO ] Flatten gal took : 14 ms
[2025-05-31 00:19:57] [INFO ] Applying decomposition
[2025-05-31 00:19:57] [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/graph11700165095548556505.txt' '-o' '/tmp/graph11700165095548556505.bin' '-w' '/tmp/graph11700165095548556505.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11700165095548556505.bin' '-l' '-1' '-v' '-w' '/tmp/graph11700165095548556505.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:19:57] [INFO ] Decomposing Gal with order
[2025-05-31 00:19:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:19:57] [INFO ] Removed a total of 839 redundant transitions.
[2025-05-31 00:19:57] [INFO ] Flatten gal took : 30 ms
[2025-05-31 00:19:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 6 ms.
[2025-05-31 00:19:57] [INFO ] Time to serialize gal into /tmp/CTLFireability1338995704959303895.gal : 3 ms
[2025-05-31 00:19:57] [INFO ] Time to serialize properties into /tmp/CTLFireability729671322971105587.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/CTLFireability1338995704959303895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability729671322971105587.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 604/604 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 237 transition count 591
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 237 transition count 591
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 170 place count 237 transition count 447
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 173 place count 234 transition count 444
Iterating global reduction 1 with 3 rules applied. Total rules applied 176 place count 234 transition count 444
Applied a total of 176 rules in 11 ms. Remains 234 /250 variables (removed 16) and now considering 444/604 (removed 160) transitions.
[2025-05-31 00:20:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:20:27] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-05-31 00:20:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:20:28] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 443 sub problems to find dead transitions.
[2025-05-31 00:20:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:33] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:33] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:33] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:33] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:34] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:34] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:34] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:34] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:34] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:34] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:34] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:35] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:35] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:35] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:35] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:35] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:35] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:35] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:36] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:36] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:36] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:36] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:36] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:37] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:37] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:37] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:37] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:37] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:38] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:38] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:38] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:38] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:38] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:38] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:39] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:39] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:39] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:39] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:39] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:39] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:42] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:42] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:43] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:43] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:43] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:45] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:45] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:46] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:46] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:46] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:47] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 7 (OVERLAPS) 444/678 variables, 234/296 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:55] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:56] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:56] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:56] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:56] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:56] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:56] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:56] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:57] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:57] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:57] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:57] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:57] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:58] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 9 ms to minimize.
SMT process timed out in 30389ms, After SMT, problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 30390ms
Starting structural reductions in LTL mode, iteration 1 : 234/250 places, 444/604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30778 ms. Remains : 234/250 places, 444/604 transitions.
[2025-05-31 00:20:58] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:20:58] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:20:58] [INFO ] Input system was already deterministic with 444 transitions.
[2025-05-31 00:20:58] [INFO ] Flatten gal took : 22 ms
[2025-05-31 00:20:58] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:20:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13534903997296482813.gal : 3 ms
[2025-05-31 00:20:58] [INFO ] Time to serialize properties into /tmp/CTLFireability17292044143668201010.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/CTLFireability13534903997296482813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17292044143668201010.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-05-31 00:21:28] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:21:28] [INFO ] Applying decomposition
[2025-05-31 00:21:28] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16767555587107310100.txt' '-o' '/tmp/graph16767555587107310100.bin' '-w' '/tmp/graph16767555587107310100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16767555587107310100.bin' '-l' '-1' '-v' '-w' '/tmp/graph16767555587107310100.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:21:28] [INFO ] Decomposing Gal with order
[2025-05-31 00:21:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:21:28] [INFO ] Removed a total of 859 redundant transitions.
[2025-05-31 00:21:28] [INFO ] Flatten gal took : 35 ms
[2025-05-31 00:21:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 6 ms.
[2025-05-31 00:21:28] [INFO ] Time to serialize gal into /tmp/CTLFireability2932486593984128572.gal : 8 ms
[2025-05-31 00:21:28] [INFO ] Time to serialize properties into /tmp/CTLFireability7962424195240815721.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/CTLFireability2932486593984128572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7962424195240815721.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,1.03205e+12,0.456178,18792,3197,121,31408,2163,524,28407,83,7101,0


Converting to forward existential form...Done !
original formula: EX(!(E(!(EF((i8.i0.u44.p135==1))) U (((u1.p6==1)&&(u1.p18==1))&&((i1.i0.u13.p39==1)&&(u1.p246==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(E(TRUE U (i8.i0.u44.p135==1))) U (((u1.p6==1)&&(u1.p18==1))&&((i1.i0.u13.p39==1)&&(u1.p246==1...171
Reverse transition relation is NOT exact ! Due to transitions t219, t221, t226, t250, t274, t298, t340, t364, t441, i1.i1.t212, i1.i1.u11.t192, i1.i1.u20.t...811
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 604/604 transitions.
Graph (trivial) has 229 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 247 transition count 502
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 132 rules applied. Total rules applied 232 place count 148 transition count 469
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 252 place count 129 transition count 468
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 255 place count 128 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 256 place count 127 transition count 466
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 256 place count 127 transition count 459
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 270 place count 120 transition count 459
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 277 place count 113 transition count 452
Iterating global reduction 5 with 7 rules applied. Total rules applied 284 place count 113 transition count 452
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 5 with 144 rules applied. Total rules applied 428 place count 113 transition count 308
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 431 place count 110 transition count 295
Iterating global reduction 6 with 3 rules applied. Total rules applied 434 place count 110 transition count 295
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 6 with 4 rules applied. Total rules applied 438 place count 110 transition count 291
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 440 place count 108 transition count 291
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 8 with 78 rules applied. Total rules applied 518 place count 69 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 519 place count 69 transition count 251
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 527 place count 61 transition count 198
Iterating global reduction 9 with 8 rules applied. Total rules applied 535 place count 61 transition count 198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 9 with 5 rules applied. Total rules applied 540 place count 61 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 542 place count 59 transition count 193
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 11 with 2 rules applied. Total rules applied 544 place count 58 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 545 place count 58 transition count 191
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 547 place count 56 transition count 189
Applied a total of 547 rules in 125 ms. Remains 56 /250 variables (removed 194) and now considering 189/604 (removed 415) transitions.
// Phase 1: matrix 189 rows 56 cols
[2025-05-31 00:21:59] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:21:59] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-05-31 00:21:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:21:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:21:59] [INFO ] Implicit Places using invariants and state equation in 86 ms returned [50, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 176 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 54/250 places, 189/604 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 54 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 53 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 53 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 52 transition count 187
Applied a total of 4 rules in 9 ms. Remains 52 /54 variables (removed 2) and now considering 187/189 (removed 2) transitions.
// Phase 1: matrix 187 rows 52 cols
[2025-05-31 00:21:59] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:21:59] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-31 00:21:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:21:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:21:59] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 52/250 places, 187/604 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 463 ms. Remains : 52/250 places, 187/604 transitions.
[2025-05-31 00:21:59] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:21:59] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:21:59] [INFO ] Input system was already deterministic with 187 transitions.
[2025-05-31 00:21:59] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:21:59] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:21:59] [INFO ] Time to serialize gal into /tmp/CTLFireability2968410252697643860.gal : 1 ms
[2025-05-31 00:21:59] [INFO ] Time to serialize properties into /tmp/CTLFireability10420530102467605201.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/CTLFireability2968410252697643860.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10420530102467605201.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.
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.8536e+06,6.52879,152632,2,6759,5,409358,6,0,394,355737,0


Converting to forward existential form...Done !
original formula: AF((AG((((p6==1)&&(p17==1))&&((p39==1)&&(p246==1)))) + (AF((p176==1)) * (((p6==0)||(p18==0))||((p213==0)||(p246==0))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((((p6==1)&&(p17==1))&&((p39==1)&&(p246==1)))))) + (!(EG(!((p176==1)))) * (((p6==0)||(...201
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t26, t99, t185, Intersection...242
Detected timeout of ITS tools.
[2025-05-31 00:22:29] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:22:29] [INFO ] Applying decomposition
[2025-05-31 00:22:29] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2934505309370746278.txt' '-o' '/tmp/graph2934505309370746278.bin' '-w' '/tmp/graph2934505309370746278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2934505309370746278.bin' '-l' '-1' '-v' '-w' '/tmp/graph2934505309370746278.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:22:29] [INFO ] Decomposing Gal with order
[2025-05-31 00:22:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:22:29] [INFO ] Removed a total of 684 redundant transitions.
[2025-05-31 00:22:29] [INFO ] Flatten gal took : 14 ms
[2025-05-31 00:22:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 2 ms.
[2025-05-31 00:22:29] [INFO ] Time to serialize gal into /tmp/CTLFireability14030607148819012615.gal : 1 ms
[2025-05-31 00:22:29] [INFO ] Time to serialize properties into /tmp/CTLFireability10292349558034586965.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/CTLFireability14030607148819012615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10292349558034586965.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,5.8536e+06,0.033272,5420,68,42,3262,442,158,5344,68,1975,0


Converting to forward existential form...Done !
original formula: AF((AG((((i0.u0.p6==1)&&(i0.u0.p17==1))&&((i1.u1.p39==1)&&(i0.u16.p246==1)))) + (AF((i6.u11.p176==1)) * (((i0.u0.p6==0)||(i0.u0.p18==0))|...193
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((((i0.u0.p6==1)&&(i0.u0.p17==1))&&((i1.u1.p39==1)&&(i0.u16.p246==1)))))) + (!(EG(!((i...256
Reverse transition relation is NOT exact ! Due to transitions t3, u3.t26, u14.t6, u14.t99, u15.t4, i1.u4.t24, i3.u5.t22, i3.u6.t20, i4.u7.t18, i4.u8.t16, i...329
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
(forward)formula 0,0,0.868267,46764,1,0,94919,1427,886,138068,324,13176,93434
FORMULA AutonomousCar-PT-06b-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 604/604 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 238 transition count 592
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 238 transition count 592
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 168 place count 238 transition count 448
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 171 place count 235 transition count 445
Iterating global reduction 1 with 3 rules applied. Total rules applied 174 place count 235 transition count 445
Applied a total of 174 rules in 12 ms. Remains 235 /250 variables (removed 15) and now considering 445/604 (removed 159) transitions.
// Phase 1: matrix 445 rows 235 cols
[2025-05-31 00:22:30] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:22:30] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-05-31 00:22:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:22:30] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 444 sub problems to find dead transitions.
[2025-05-31 00:22:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:36] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:36] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:36] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:36] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:36] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:36] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:36] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:36] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:37] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:37] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:37] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:37] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:37] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:37] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:37] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:37] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:38] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:38] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:38] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:38] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:38] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:39] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:39] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:39] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:39] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:40] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:40] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:40] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:40] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:40] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:41] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:41] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:41] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:41] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:41] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:41] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:42] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:45] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:46] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:46] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:49] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:49] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:49] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:49] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:49] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:49] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:49] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:49] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:49] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:50] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:50] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:50] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:50] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:50] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:50] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:50] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:50] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:51] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:51] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:51] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:52] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:52] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:57] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:57] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:57] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/680 variables, and 76 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:03] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:07] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:07] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:07] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 6 (OVERLAPS) 445/680 variables, 235/315 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/680 variables, 444/759 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:21] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:22] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/680 variables, and 761 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60395ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 60397ms
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 445/604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60679 ms. Remains : 235/250 places, 445/604 transitions.
[2025-05-31 00:23:31] [INFO ] Flatten gal took : 16 ms
[2025-05-31 00:23:31] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:23:31] [INFO ] Input system was already deterministic with 445 transitions.
[2025-05-31 00:23:31] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:23:31] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:23:31] [INFO ] Time to serialize gal into /tmp/CTLFireability17158966340339003354.gal : 3 ms
[2025-05-31 00:23:31] [INFO ] Time to serialize properties into /tmp/CTLFireability12824614716832924596.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/CTLFireability17158966340339003354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12824614716832924596.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-05-31 00:24:01] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:24:01] [INFO ] Applying decomposition
[2025-05-31 00:24:01] [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/graph6590941009180548612.txt' '-o' '/tmp/graph6590941009180548612.bin' '-w' '/tmp/graph6590941009180548612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6590941009180548612.bin' '-l' '-1' '-v' '-w' '/tmp/graph6590941009180548612.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:24:01] [INFO ] Decomposing Gal with order
[2025-05-31 00:24:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:24:01] [INFO ] Removed a total of 841 redundant transitions.
[2025-05-31 00:24:01] [INFO ] Flatten gal took : 28 ms
[2025-05-31 00:24:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2025-05-31 00:24:01] [INFO ] Time to serialize gal into /tmp/CTLFireability9471292133522014681.gal : 2 ms
[2025-05-31 00:24:01] [INFO ] Time to serialize properties into /tmp/CTLFireability460731053664905314.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/CTLFireability9471292133522014681.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability460731053664905314.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 -...261
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.07623e+12,2.13133,75400,4338,133,169075,2465,538,162629,90,11824,0


Converting to forward existential form...Done !
original formula: (AG((EX(A(EG((i1.i0.u0.p0==1)) U A((i14.i0.u60.p197==1) U (((u1.p6==1)&&(u1.p9==1))&&((i5.i0.u23.p70==1)&&(u1.p246==1)))))) * (i8.i0.u34....936
=> equivalent forward existential formula: ([(FwdU((Init * !(E(TRUE U ((((EG((i2.i1.u12.p34==0)) * (!(EX(!((((u1.p6==0)||(u1.p17==0))||((i12.i0.u50.p163==0...4033
Reverse transition relation is NOT exact ! Due to transitions t220, t222, t226, t250, t280, t298, t340, t358, t442, i0.u67.t32, i0.u67.t35, i0.u67.t36, i0....813
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 604/604 transitions.
Graph (trivial) has 221 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 248 transition count 508
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 127 rules applied. Total rules applied 222 place count 154 transition count 475
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 242 place count 135 transition count 474
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 243 place count 134 transition count 474
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 243 place count 134 transition count 465
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 261 place count 125 transition count 465
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 268 place count 118 transition count 458
Iterating global reduction 4 with 7 rules applied. Total rules applied 275 place count 118 transition count 458
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 419 place count 118 transition count 314
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 421 place count 116 transition count 307
Iterating global reduction 5 with 2 rules applied. Total rules applied 423 place count 116 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 425 place count 116 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 426 place count 115 transition count 305
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 504 place count 76 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 505 place count 76 transition count 265
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 510 place count 71 transition count 232
Iterating global reduction 8 with 5 rules applied. Total rules applied 515 place count 71 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 517 place count 71 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 518 place count 70 transition count 230
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 520 place count 69 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 522 place count 69 transition count 227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 523 place count 69 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 524 place count 68 transition count 226
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 527 place count 68 transition count 226
Applied a total of 527 rules in 74 ms. Remains 68 /250 variables (removed 182) and now considering 226/604 (removed 378) transitions.
// Phase 1: matrix 226 rows 68 cols
[2025-05-31 00:24:31] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:24:31] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-05-31 00:24:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:24:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:24:31] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [62, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 201 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 66/250 places, 226/604 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 65 transition count 225
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 65 transition count 224
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 64 transition count 224
Applied a total of 4 rules in 11 ms. Remains 64 /66 variables (removed 2) and now considering 224/226 (removed 2) transitions.
// Phase 1: matrix 224 rows 64 cols
[2025-05-31 00:24:31] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:24:31] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-05-31 00:24:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:24:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:24:32] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 64/250 places, 224/604 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 492 ms. Remains : 64/250 places, 224/604 transitions.
[2025-05-31 00:24:32] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:24:32] [INFO ] Flatten gal took : 11 ms
[2025-05-31 00:24:32] [INFO ] Input system was already deterministic with 224 transitions.
[2025-05-31 00:24:32] [INFO ] Flatten gal took : 11 ms
[2025-05-31 00:24:32] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:24:32] [INFO ] Time to serialize gal into /tmp/CTLFireability1141105202303546090.gal : 2 ms
[2025-05-31 00:24:32] [INFO ] Time to serialize properties into /tmp/CTLFireability4371797274701822283.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/CTLFireability1141105202303546090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4371797274701822283.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.
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.58418e+07,12.4894,320568,2,10894,5,924283,6,0,478,804462,0


Converting to forward existential form...Done !
original formula: EF((((!(E(AG((((p6==1)&&(p17==1))&&((p163==1)&&(p246==1)))) U (E((((p6==1)&&(p18==1))&&((p206==1)&&(p246==1))) U (((p6==1)&&(p16==1))&&((...387
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * ((p246==1)&&((((p61==1)||(p6==0))||((p15==0)||(p89==0)))||((p246==0)||(((p9==1)&&(p82==1)...457
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t9, t11, t15, t17, t19, t21, t23, t25, t28, t29, t44, t45, t52, t53, ...300
Detected timeout of ITS tools.
[2025-05-31 00:25:02] [INFO ] Flatten gal took : 15 ms
[2025-05-31 00:25:02] [INFO ] Applying decomposition
[2025-05-31 00:25:02] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6314991505329371046.txt' '-o' '/tmp/graph6314991505329371046.bin' '-w' '/tmp/graph6314991505329371046.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6314991505329371046.bin' '-l' '-1' '-v' '-w' '/tmp/graph6314991505329371046.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:25:02] [INFO ] Decomposing Gal with order
[2025-05-31 00:25:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:25:02] [INFO ] Removed a total of 786 redundant transitions.
[2025-05-31 00:25:02] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:25:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 2 ms.
[2025-05-31 00:25:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9411432834619711418.gal : 0 ms
[2025-05-31 00:25:02] [INFO ] Time to serialize properties into /tmp/CTLFireability513657500247791243.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/CTLFireability9411432834619711418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability513657500247791243.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 -...261
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.58418e+07,0.074048,6916,276,41,7198,363,251,9035,65,1061,0


Converting to forward existential form...Done !
original formula: EF((((!(E(AG((((i0.u0.p6==1)&&(i0.u0.p17==1))&&((i6.u13.p163==1)&&(i0.u20.p246==1)))) U (E((((i0.u0.p6==1)&&(i0.u0.p18==1))&&((i7.u17.p20...566
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * ((i0.u20.p246==1)&&((((i1.u5.p61==1)||(i0.u0.p6==0))||((i0.u0.p15==0)||(u7.p89==0)))||((i...636
Reverse transition relation is NOT exact ! Due to transitions t3, t40, t41, t56, t57, u7.t25, u7.t105, u18.t6, u18.t107, i0.t104, i1.u5.t28, i3.u8.t23, i4....396
Using 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 a local 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,3.40893,136068,1,0,259747,857,1712,366487,322,5483,279545
FORMULA AutonomousCar-PT-06b-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 604/604 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 238 transition count 592
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 238 transition count 592
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 168 place count 238 transition count 448
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 171 place count 235 transition count 445
Iterating global reduction 1 with 3 rules applied. Total rules applied 174 place count 235 transition count 445
Applied a total of 174 rules in 10 ms. Remains 235 /250 variables (removed 15) and now considering 445/604 (removed 159) transitions.
// Phase 1: matrix 445 rows 235 cols
[2025-05-31 00:25:05] [INFO ] Computed 11 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:25:05] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-05-31 00:25:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:25:06] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 444 sub problems to find dead transitions.
[2025-05-31 00:25:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:11] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:11] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:11] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:11] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:11] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:12] [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-05-31 00:25:12] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:12] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:12] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:12] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:12] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:12] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:13] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:13] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:13] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:13] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:13] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:13] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:13] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:13] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:14] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:14] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:14] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:14] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:14] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:15] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:15] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:15] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:15] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:15] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:15] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:15] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:15] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:16] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:16] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:16] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:16] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:16] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:16] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:16] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:18] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:19] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:19] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:19] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:19] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:19] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:19] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:19] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:20] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:20] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:20] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:20] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:20] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:20] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:20] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:20] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:20] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:20] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:21] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:21] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:22] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:22] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:22] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:22] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:23] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:25] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:25] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:25] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:25] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:26] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 8 (OVERLAPS) 445/680 variables, 235/316 constraints. Problems are: Problem set: 0 solved, 444 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 680/680 variables, and 316 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (OVERLAPS) 445/680 variables, 235/316 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/680 variables, 444/760 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:49] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/680 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/680 variables, and 761 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60401ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 60403ms
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 445/604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60716 ms. Remains : 235/250 places, 445/604 transitions.
[2025-05-31 00:26:06] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:26:06] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:26:06] [INFO ] Input system was already deterministic with 445 transitions.
[2025-05-31 00:26:06] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:26:06] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:26:06] [INFO ] Time to serialize gal into /tmp/CTLFireability8731549915346412950.gal : 3 ms
[2025-05-31 00:26:06] [INFO ] Time to serialize properties into /tmp/CTLFireability2412703312397569704.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/CTLFireability8731549915346412950.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2412703312397569704.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-05-31 00:26:36] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:26:36] [INFO ] Applying decomposition
[2025-05-31 00:26:36] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16354891250052560644.txt' '-o' '/tmp/graph16354891250052560644.bin' '-w' '/tmp/graph16354891250052560644.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16354891250052560644.bin' '-l' '-1' '-v' '-w' '/tmp/graph16354891250052560644.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:26:36] [INFO ] Decomposing Gal with order
[2025-05-31 00:26:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:26:36] [INFO ] Removed a total of 840 redundant transitions.
[2025-05-31 00:26:36] [INFO ] Flatten gal took : 44 ms
[2025-05-31 00:26:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 3 ms.
[2025-05-31 00:26:36] [INFO ] Time to serialize gal into /tmp/CTLFireability4286647699211592005.gal : 2 ms
[2025-05-31 00:26:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12248412394095938637.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/CTLFireability4286647699211592005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12248412394095938637.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.04989e+12,0.171204,8132,662,114,7941,809,500,9671,86,3867,0


Converting to forward existential form...Done !
original formula: E(AG(AX(AX(!((((u2.p6==1)&&(u2.p15==1))&&((i2.u27.p89==1)&&(u2.p246==1))))))) U (EG(!(((i17.u77.p264==1) * EX((((u2.p6==1)&&(u2.p18==1))&...480
=> equivalent forward existential formula: ([FwdG(FwdU(Init,!(E(TRUE U !(!(EX(!(!(EX(!(!((((u2.p6==1)&&(u2.p15==1))&&((i2.u27.p89==1)&&(u2.p246==1)))))))))...686
Reverse transition relation is NOT exact ! Due to transitions t220, t222, t224, t248, t278, t296, t338, t362, t369, t442, i0.u73.t33, i0.u73.t36, i0.u73.t3...799
Using 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 a local SCC at level 1
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,1,18.1038,582288,1,0,1.46514e+06,4874,3483,1.15828e+06,486,44461,1692275
FORMULA AutonomousCar-PT-06b-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 604/604 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 239 transition count 593
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 239 transition count 593
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 236 transition count 590
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 236 transition count 590
Applied a total of 28 rules in 9 ms. Remains 236 /250 variables (removed 14) and now considering 590/604 (removed 14) transitions.
// Phase 1: matrix 590 rows 236 cols
[2025-05-31 00:26:54] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:26:55] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-05-31 00:26:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:26:55] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2025-05-31 00:26:55] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:02] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:02] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:02] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:03] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:03] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:03] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:03] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:03] [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-05-31 00:27:03] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:03] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:04] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:04] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:04] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:04] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:04] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:05] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:05] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:05] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:05] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:05] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:06] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:06] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:06] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:06] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:07] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:07] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:07] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:07] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:07] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:08] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:08] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:08] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:08] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:08] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:09] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:09] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:09] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:09] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:09] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:10] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:12] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:13] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:13] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:13] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:13] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:14] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:14] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:14] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:14] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:15] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:15] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:15] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:15] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:15] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:15] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:19] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:19] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:19] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:19] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:19] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:20] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:20] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:20] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:20] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:20] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:20] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:20] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:21] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:21] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:21] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 15/81 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/826 variables, and 81 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/236 constraints, PredecessorRefiner: 589/299 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:29] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:29] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (OVERLAPS) 590/826 variables, 236/319 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/826 variables, 299/618 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/826 variables, and 618 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 589/299 constraints, Known Traps: 72/72 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60717ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 60719ms
Starting structural reductions in LTL mode, iteration 1 : 236/250 places, 590/604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61093 ms. Remains : 236/250 places, 590/604 transitions.
[2025-05-31 00:27:56] [INFO ] Flatten gal took : 16 ms
[2025-05-31 00:27:56] [INFO ] Flatten gal took : 20 ms
[2025-05-31 00:27:56] [INFO ] Input system was already deterministic with 590 transitions.
[2025-05-31 00:27:56] [INFO ] Flatten gal took : 16 ms
[2025-05-31 00:27:56] [INFO ] Flatten gal took : 20 ms
[2025-05-31 00:27:56] [INFO ] Time to serialize gal into /tmp/CTLFireability11727742177759657672.gal : 4 ms
[2025-05-31 00:27:56] [INFO ] Time to serialize properties into /tmp/CTLFireability6287579716545117251.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/CTLFireability11727742177759657672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6287579716545117251.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-05-31 00:28:26] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:28:26] [INFO ] Applying decomposition
[2025-05-31 00:28:26] [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/graph231121785917312318.txt' '-o' '/tmp/graph231121785917312318.bin' '-w' '/tmp/graph231121785917312318.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph231121785917312318.bin' '-l' '-1' '-v' '-w' '/tmp/graph231121785917312318.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:28:26] [INFO ] Decomposing Gal with order
[2025-05-31 00:28:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:28:26] [INFO ] Removed a total of 1211 redundant transitions.
[2025-05-31 00:28:26] [INFO ] Flatten gal took : 35 ms
[2025-05-31 00:28:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 6 ms.
[2025-05-31 00:28:26] [INFO ] Time to serialize gal into /tmp/CTLFireability5594328117600628093.gal : 3 ms
[2025-05-31 00:28:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17520766412825219743.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/CTLFireability5594328117600628093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17520766412825219743.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.50023e+12,0.112585,8836,926,126,8154,2129,590,10468,99,9629,0


Converting to forward existential form...Done !
original formula: EF((E(E((u71.p4==1) U (i7.i0.u37.p142==1)) U (i15.i0.u82.p272==1)) * (((AF(EX(((((i1.u16.p56==1)&&(i3.u25.p87==1))&&((i5.i1.u36.p124==1)&...363
=> equivalent forward existential formula: ((([((FwdU(Init,TRUE) * E(E((u71.p4==1) U (i7.i0.u37.p142==1)) U (i15.i0.u82.p272==1))) * !(EG(!(EX(((((i1.u16.p...713
Reverse transition relation is NOT exact ! Due to transitions t220, t222, t243, t291, t327, t375, t459, t507, t587, u71.t223, i1.u15.t197, i1.u15.t200, i1....842
Using 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 a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 604/604 transitions.
Graph (trivial) has 233 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 247 transition count 501
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 134 rules applied. Total rules applied 235 place count 147 transition count 467
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 255 place count 127 transition count 467
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 255 place count 127 transition count 459
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 271 place count 119 transition count 459
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 278 place count 112 transition count 452
Iterating global reduction 3 with 7 rules applied. Total rules applied 285 place count 112 transition count 452
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 429 place count 112 transition count 308
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 432 place count 109 transition count 295
Iterating global reduction 4 with 3 rules applied. Total rules applied 435 place count 109 transition count 295
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 4 with 4 rules applied. Total rules applied 439 place count 109 transition count 291
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 441 place count 107 transition count 291
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 519 place count 68 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 520 place count 68 transition count 251
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 529 place count 59 transition count 191
Iterating global reduction 7 with 9 rules applied. Total rules applied 538 place count 59 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 7 with 5 rules applied. Total rules applied 543 place count 59 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 545 place count 57 transition count 186
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 9 with 2 rules applied. Total rules applied 547 place count 56 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 548 place count 56 transition count 184
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 550 place count 56 transition count 184
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 552 place count 54 transition count 182
Applied a total of 552 rules in 45 ms. Remains 54 /250 variables (removed 196) and now considering 182/604 (removed 422) transitions.
// Phase 1: matrix 182 rows 54 cols
[2025-05-31 00:28:56] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:28:56] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-05-31 00:28:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:28:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:28:56] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [48, 53]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 212 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 52/250 places, 182/604 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 181
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 51 transition count 180
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 50 transition count 180
Applied a total of 4 rules in 6 ms. Remains 50 /52 variables (removed 2) and now considering 180/182 (removed 2) transitions.
// Phase 1: matrix 180 rows 50 cols
[2025-05-31 00:28:56] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:28:56] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-31 00:28:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:28:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:28:56] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 50/250 places, 180/604 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 413 ms. Remains : 50/250 places, 180/604 transitions.
[2025-05-31 00:28:56] [INFO ] Flatten gal took : 10 ms
[2025-05-31 00:28:56] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:28:56] [INFO ] Input system was already deterministic with 180 transitions.
[2025-05-31 00:28:56] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:28:56] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:28:56] [INFO ] Time to serialize gal into /tmp/CTLFireability5650097294695901283.gal : 2 ms
[2025-05-31 00:28:56] [INFO ] Time to serialize properties into /tmp/CTLFireability10734609691888875330.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/CTLFireability5650097294695901283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10734609691888875330.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.2885e+06,6.68595,180200,2,6466,5,514081,6,0,379,420169,0


Converting to forward existential form...Done !
original formula: EG(!(A((p173==1) U EF((((p6==1)&&(p18==1))&&((p51==1)&&(p246==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!(E(TRUE U (((p6==1)&&(p18==1))&&((p51==1)&&(p246==1))))) U (!((p173==1)) * !(E(TRUE U (((p6==...274
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t8, t10, t14, t16, t18, t20, t22, t24, t26, t28, t178, Intersection with...237
Detected timeout of ITS tools.
[2025-05-31 00:29:27] [INFO ] Flatten gal took : 15 ms
[2025-05-31 00:29:27] [INFO ] Applying decomposition
[2025-05-31 00:29: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/graph3377312319307285699.txt' '-o' '/tmp/graph3377312319307285699.bin' '-w' '/tmp/graph3377312319307285699.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3377312319307285699.bin' '-l' '-1' '-v' '-w' '/tmp/graph3377312319307285699.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:29:27] [INFO ] Decomposing Gal with order
[2025-05-31 00:29:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:29:27] [INFO ] Removed a total of 656 redundant transitions.
[2025-05-31 00:29:27] [INFO ] Flatten gal took : 15 ms
[2025-05-31 00:29:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 2 ms.
[2025-05-31 00:29:27] [INFO ] Time to serialize gal into /tmp/CTLFireability4077782873625781057.gal : 1 ms
[2025-05-31 00:29:27] [INFO ] Time to serialize properties into /tmp/CTLFireability7014281715575326925.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/CTLFireability4077782873625781057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7014281715575326925.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,4.2885e+06,0.034381,5100,76,44,2695,338,138,3938,60,1153,0


Converting to forward existential form...Done !
original formula: EG(!(A((i6.u10.p173==1) U EF((((i0.u0.p6==1)&&(i0.u0.p18==1))&&((i1.u1.p51==1)&&(i0.u15.p246==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!(E(TRUE U (((i0.u0.p6==1)&&(i0.u0.p18==1))&&((i1.u1.p51==1)&&(i0.u15.p246==1))))) U (!((i6.u1...356
Reverse transition relation is NOT exact ! Due to transitions t3, u2.t28, i1.u3.t26, i2.u4.t24, i2.u5.t22, i3.u6.t20, i3.u7.t18, i4.u8.t16, i4.u9.t14, i6.u...325
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 8
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 8
(forward)formula 0,0,0.888941,46572,1,0,90764,1894,833,145708,307,15840,84658
FORMULA AutonomousCar-PT-06b-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 604/604 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 237 transition count 591
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 237 transition count 591
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 170 place count 237 transition count 447
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 172 place count 235 transition count 445
Iterating global reduction 1 with 2 rules applied. Total rules applied 174 place count 235 transition count 445
Applied a total of 174 rules in 16 ms. Remains 235 /250 variables (removed 15) and now considering 445/604 (removed 159) transitions.
// Phase 1: matrix 445 rows 235 cols
[2025-05-31 00:29:28] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:29:28] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-05-31 00:29:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:29:28] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 444 sub problems to find dead transitions.
[2025-05-31 00:29:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:33] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:33] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:33] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:33] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:34] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:34] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:34] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:34] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:34] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:34] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:34] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:34] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:35] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:35] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:35] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:35] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:35] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:35] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:35] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:35] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:36] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:36] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:36] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:36] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:36] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:37] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:37] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:37] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:37] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:37] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:38] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:38] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:38] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:38] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:38] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:39] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:39] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:39] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:43] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:43] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:43] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:43] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:44] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:44] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:44] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:44] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:44] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:44] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:46] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:46] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:47] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:47] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:47] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:47] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:48] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:48] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:48] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:48] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:48] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:49] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 7 (OVERLAPS) 445/680 variables, 235/306 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:58] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 18 ms to minimize.
SMT process timed out in 30389ms, After SMT, problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 30391ms
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 445/604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30645 ms. Remains : 235/250 places, 445/604 transitions.
[2025-05-31 00:29:58] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:29:58] [INFO ] Flatten gal took : 11 ms
[2025-05-31 00:29:58] [INFO ] Input system was already deterministic with 445 transitions.
[2025-05-31 00:29:58] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:29:58] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:29:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13533083572965641317.gal : 3 ms
[2025-05-31 00:29:58] [INFO ] Time to serialize properties into /tmp/CTLFireability9201427465500755646.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/CTLFireability13533083572965641317.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9201427465500755646.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-05-31 00:30:28] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:30:28] [INFO ] Applying decomposition
[2025-05-31 00:30:28] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13775716776522406444.txt' '-o' '/tmp/graph13775716776522406444.bin' '-w' '/tmp/graph13775716776522406444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13775716776522406444.bin' '-l' '-1' '-v' '-w' '/tmp/graph13775716776522406444.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:30:28] [INFO ] Decomposing Gal with order
[2025-05-31 00:30:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:30:28] [INFO ] Removed a total of 847 redundant transitions.
[2025-05-31 00:30:28] [INFO ] Flatten gal took : 24 ms
[2025-05-31 00:30:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 4 ms.
[2025-05-31 00:30:28] [INFO ] Time to serialize gal into /tmp/CTLFireability13397952565519541626.gal : 3 ms
[2025-05-31 00:30:28] [INFO ] Time to serialize properties into /tmp/CTLFireability6894512283146341046.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/CTLFireability13397952565519541626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6894512283146341046.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.03205e+12,0.18744,11628,941,116,17052,874,559,16970,86,3371,0


Converting to forward existential form...Done !
original formula: E((EX(!(AG((i7.i2.u48.p131==1)))) * (EG(AF((((u1.p6==1)&&(u1.p17==1))&&((i2.u17.p58==1)&&(u1.p246==1))))) + (AF(EG((((u1.p6==1)&&(u1.p16=...639
=> equivalent forward existential formula: [(FwdU(Init,(EX(!(!(E(TRUE U !((i7.i2.u48.p131==1)))))) * (EG(!(EG(!((((u1.p6==1)&&(u1.p17==1))&&((i2.u17.p58==1...709
Reverse transition relation is NOT exact ! Due to transitions t220, t222, t226, t256, t274, t298, t334, t364, t442, i2.t213, i2.u11.t193, i2.u17.t197, i2.u...811
Using 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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 604/604 transitions.
Graph (trivial) has 221 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 247 transition count 501
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 136 rules applied. Total rules applied 237 place count 147 transition count 465
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 258 place count 126 transition count 465
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 258 place count 126 transition count 458
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 272 place count 119 transition count 458
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 279 place count 112 transition count 451
Iterating global reduction 3 with 7 rules applied. Total rules applied 286 place count 112 transition count 451
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 430 place count 112 transition count 307
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 433 place count 109 transition count 294
Iterating global reduction 4 with 3 rules applied. Total rules applied 436 place count 109 transition count 294
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 4 with 4 rules applied. Total rules applied 440 place count 109 transition count 290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 442 place count 107 transition count 290
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 508 place count 74 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 509 place count 74 transition count 256
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 514 place count 69 transition count 224
Iterating global reduction 7 with 5 rules applied. Total rules applied 519 place count 69 transition count 224
Ensure Unique test 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 7 with 6 rules applied. Total rules applied 525 place count 69 transition count 218
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 528 place count 66 transition count 218
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 9 with 2 rules applied. Total rules applied 530 place count 65 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 531 place count 65 transition count 216
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 532 place count 65 transition count 216
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 534 place count 63 transition count 214
Applied a total of 534 rules in 57 ms. Remains 63 /250 variables (removed 187) and now considering 214/604 (removed 390) transitions.
// Phase 1: matrix 214 rows 63 cols
[2025-05-31 00:30:59] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:30:59] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-05-31 00:30:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:30:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:30:59] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [57, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 150 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/250 places, 214/604 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 60 transition count 213
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 60 transition count 212
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 59 transition count 212
Applied a total of 4 rules in 8 ms. Remains 59 /61 variables (removed 2) and now considering 212/214 (removed 2) transitions.
// Phase 1: matrix 212 rows 59 cols
[2025-05-31 00:30:59] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:30:59] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-05-31 00:30:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:30:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:30:59] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 59/250 places, 212/604 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 352 ms. Remains : 59/250 places, 212/604 transitions.
[2025-05-31 00:30:59] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:30:59] [INFO ] Flatten gal took : 10 ms
[2025-05-31 00:30:59] [INFO ] Input system was already deterministic with 212 transitions.
[2025-05-31 00:30:59] [INFO ] Flatten gal took : 10 ms
[2025-05-31 00:30:59] [INFO ] Flatten gal took : 10 ms
[2025-05-31 00:30:59] [INFO ] Time to serialize gal into /tmp/CTLFireability6134533085694377173.gal : 1 ms
[2025-05-31 00:30:59] [INFO ] Time to serialize properties into /tmp/CTLFireability17742371884676076130.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/CTLFireability6134533085694377173.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17742371884676076130.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.
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.98051e+07,23.9021,613372,2,11408,5,2.54596e+06,6,0,447,2.05937e+06,0


Converting to forward existential form...Done !
original formula: (EF((((p6==1)&&(p16==1))&&((p113==1)&&(p246==1)))) * EF(AG(EF(((((p62==0)||(p93==0))||((p118==0)||(p149==0)))||(((p180==0)||(p211==0))||(...169
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U (((p6==1)&&(p16==1))&&((p113==1)&&(p246==1))))),TRUE) * !(E(TRUE U !(E(TRUE U ((((p62==0...245
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t5, t7, t8, t11, t13, t14, t17, t19, t20, t23, t25, t26, t30, t32, t34, t36, ...812
Detected timeout of ITS tools.
[2025-05-31 00:31:29] [INFO ] Flatten gal took : 14 ms
[2025-05-31 00:31:29] [INFO ] Applying decomposition
[2025-05-31 00:31:29] [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/graph15542318101039187358.txt' '-o' '/tmp/graph15542318101039187358.bin' '-w' '/tmp/graph15542318101039187358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15542318101039187358.bin' '-l' '-1' '-v' '-w' '/tmp/graph15542318101039187358.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:31:29] [INFO ] Decomposing Gal with order
[2025-05-31 00:31:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:31:29] [INFO ] Removed a total of 673 redundant transitions.
[2025-05-31 00:31:29] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:31:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 1 ms.
[2025-05-31 00:31:29] [INFO ] Time to serialize gal into /tmp/CTLFireability12050262591898303682.gal : 1 ms
[2025-05-31 00:31:29] [INFO ] Time to serialize properties into /tmp/CTLFireability8802877207290099002.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/CTLFireability12050262591898303682.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8802877207290099002.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.98051e+07,0.068671,6888,115,87,6428,867,177,7641,74,4048,0


Converting to forward existential form...Done !
original formula: (EF((((u0.p6==1)&&(u0.p16==1))&&((i4.u5.p113==1)&&(u0.p246==1)))) * EF(AG(EF(((((i1.u2.p62==0)||(i2.u4.p93==0))||((i3.u7.p118==0)||(i5.u1...229
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U (((u0.p6==1)&&(u0.p16==1))&&((i4.u5.p113==1)&&(u0.p246==1))))),TRUE) * !(E(TRUE U !(E(TR...305
Reverse transition relation is NOT exact ! Due to transitions t3, t110, t116, t122, t128, t134, t146, t158, t164, t170, t176, t188, t200, i1.u1.t36, i1.u2....482
(forward)formula 0,1,0.227516,13288,1,0,19983,2210,1117,28326,411,10291,30392
FORMULA AutonomousCar-PT-06b-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 604/604 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 238 transition count 592
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 238 transition count 592
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 168 place count 238 transition count 448
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 171 place count 235 transition count 445
Iterating global reduction 1 with 3 rules applied. Total rules applied 174 place count 235 transition count 445
Applied a total of 174 rules in 14 ms. Remains 235 /250 variables (removed 15) and now considering 445/604 (removed 159) transitions.
// Phase 1: matrix 445 rows 235 cols
[2025-05-31 00:31:29] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:31:29] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-05-31 00:31:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:31:30] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 444 sub problems to find dead transitions.
[2025-05-31 00:31:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:35] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:35] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:35] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:35] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:36] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:36] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:36] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:36] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:36] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:36] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:36] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:36] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:37] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:37] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:37] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:37] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:37] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:37] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:37] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:38] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:38] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:38] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:38] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:38] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:39] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:39] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:40] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:43] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:43] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:43] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:43] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:44] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:44] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:44] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:44] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:44] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:44] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:44] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:45] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:45] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:45] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:45] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:45] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:46] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:46] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:46] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:46] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:47] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:47] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:50] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:50] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:50] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:50] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:51] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:51] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:51] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:55] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:55] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:55] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:55] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:55] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:56] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:56] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:56] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:58] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:59] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/680 variables, and 77 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:03] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:03] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:03] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:03] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:06] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:06] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:32:10] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 7 (OVERLAPS) 445/680 variables, 235/319 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/680 variables, 444/763 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/680 variables, and 763 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 73/73 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60424ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 60426ms
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 445/604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60720 ms. Remains : 235/250 places, 445/604 transitions.
[2025-05-31 00:32:30] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:32:30] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:32:30] [INFO ] Input system was already deterministic with 445 transitions.
[2025-05-31 00:32:30] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:32:30] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:32:30] [INFO ] Time to serialize gal into /tmp/CTLFireability7129382602876975820.gal : 3 ms
[2025-05-31 00:32:30] [INFO ] Time to serialize properties into /tmp/CTLFireability4202703714169207529.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/CTLFireability7129382602876975820.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4202703714169207529.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-05-31 00:33:00] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:33:00] [INFO ] Applying decomposition
[2025-05-31 00:33:00] [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/graph2325192894869491376.txt' '-o' '/tmp/graph2325192894869491376.bin' '-w' '/tmp/graph2325192894869491376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2325192894869491376.bin' '-l' '-1' '-v' '-w' '/tmp/graph2325192894869491376.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:33:00] [INFO ] Decomposing Gal with order
[2025-05-31 00:33:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:33:00] [INFO ] Removed a total of 835 redundant transitions.
[2025-05-31 00:33:00] [INFO ] Flatten gal took : 24 ms
[2025-05-31 00:33:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 3 ms.
[2025-05-31 00:33:00] [INFO ] Time to serialize gal into /tmp/CTLFireability14041663525257567125.gal : 2 ms
[2025-05-31 00:33:00] [INFO ] Time to serialize properties into /tmp/CTLFireability4121847544122820460.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/CTLFireability14041663525257567125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4121847544122820460.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.11325e+12,0.161966,10980,987,116,15167,1270,533,15388,91,3753,0


Converting to forward existential form...Done !
original formula: (AF((EG((((u1.p6==1)&&(u1.p9==1))&&((i9.i1.u47.p175==1)&&(u1.p246==1)))) + ((((((u1.p6==0)||(u1.p14==0))||((i2.u16.p58==0)||(u1.p246==0))...993
=> equivalent forward existential formula: ([FwdG(Init,!((EG((((u1.p6==1)&&(u1.p9==1))&&((i9.i1.u47.p175==1)&&(u1.p246==1)))) + ((((((u1.p6==0)||(u1.p14==0...1075
Reverse transition relation is NOT exact ! Due to transitions t220, t222, t232, t256, t274, t304, t340, t364, t442, i2.t213, i2.u10.t193, i2.u16.t197, i2.u...793
Using 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 a local SCC at level 1
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 604/604 transitions.
Graph (trivial) has 235 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 247 transition count 500
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 137 rules applied. Total rules applied 239 place count 146 transition count 464
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 260 place count 125 transition count 464
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 260 place count 125 transition count 457
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 274 place count 118 transition count 457
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 281 place count 111 transition count 450
Iterating global reduction 3 with 7 rules applied. Total rules applied 288 place count 111 transition count 450
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 432 place count 111 transition count 306
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 435 place count 108 transition count 293
Iterating global reduction 4 with 3 rules applied. Total rules applied 438 place count 108 transition count 293
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 4 with 4 rules applied. Total rules applied 442 place count 108 transition count 289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 444 place count 106 transition count 289
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 522 place count 67 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 523 place count 67 transition count 249
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 532 place count 58 transition count 189
Iterating global reduction 7 with 9 rules applied. Total rules applied 541 place count 58 transition count 189
Ensure Unique test 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 7 with 6 rules applied. Total rules applied 547 place count 58 transition count 183
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 550 place count 55 transition count 183
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 9 with 2 rules applied. Total rules applied 552 place count 54 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 553 place count 54 transition count 181
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 554 place count 54 transition count 181
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 556 place count 52 transition count 179
Applied a total of 556 rules in 69 ms. Remains 52 /250 variables (removed 198) and now considering 179/604 (removed 425) transitions.
// Phase 1: matrix 179 rows 52 cols
[2025-05-31 00:33:30] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:33:30] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-05-31 00:33:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:33:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:33:31] [INFO ] Implicit Places using invariants and state equation in 151 ms returned [46, 51]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 263 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 50/250 places, 179/604 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 50 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 49 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 49 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 48 transition count 177
Applied a total of 4 rules in 5 ms. Remains 48 /50 variables (removed 2) and now considering 177/179 (removed 2) transitions.
// Phase 1: matrix 177 rows 48 cols
[2025-05-31 00:33:31] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:33:31] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-05-31 00:33:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:33:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:33:31] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 48/250 places, 177/604 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 694 ms. Remains : 48/250 places, 177/604 transitions.
[2025-05-31 00:33:31] [INFO ] Flatten gal took : 8 ms
[2025-05-31 00:33:31] [INFO ] Flatten gal took : 15 ms
[2025-05-31 00:33:31] [INFO ] Input system was already deterministic with 177 transitions.
[2025-05-31 00:33:31] [INFO ] Flatten gal took : 29 ms
[2025-05-31 00:33:31] [INFO ] Flatten gal took : 33 ms
[2025-05-31 00:33:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality649938129237567378.gal : 2 ms
[2025-05-31 00:33:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18308683812704968199.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality649938129237567378.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18308683812704968199.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality18308683812704968199.prop.
RANDOM walk for 12817 steps (761 resets) in 293 ms. (43 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-06b-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 604/604 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 238 transition count 592
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 238 transition count 592
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 168 place count 238 transition count 448
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 171 place count 235 transition count 445
Iterating global reduction 1 with 3 rules applied. Total rules applied 174 place count 235 transition count 445
Applied a total of 174 rules in 12 ms. Remains 235 /250 variables (removed 15) and now considering 445/604 (removed 159) transitions.
// Phase 1: matrix 445 rows 235 cols
[2025-05-31 00:33:31] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:33:31] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-05-31 00:33:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:33:32] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 444 sub problems to find dead transitions.
[2025-05-31 00:33:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:37] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:37] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:37] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:38] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:38] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:38] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:38] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:38] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:38] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:38] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:39] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:39] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:39] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:39] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:39] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:39] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:39] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:40] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:40] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:40] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:40] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:41] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:41] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:41] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:41] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:41] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:41] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:41] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:42] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:42] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:42] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:42] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:42] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:42] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:42] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:42] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:43] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:43] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:43] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:43] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:45] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:45] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:46] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:46] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:46] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:46] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:47] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:47] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:47] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:47] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:47] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:47] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:47] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:47] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:48] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:48] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:48] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:50] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:51] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:51] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:54] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:54] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:54] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:54] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:54] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:55] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:55] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 444 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 235/680 variables, and 78 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:04] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:04] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:08] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:10] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 7 (OVERLAPS) 445/680 variables, 235/317 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/680 variables, 444/761 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:23] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:24] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:24] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/680 variables, and 764 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60344ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 60345ms
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 445/604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60703 ms. Remains : 235/250 places, 445/604 transitions.
[2025-05-31 00:34:32] [INFO ] Flatten gal took : 11 ms
[2025-05-31 00:34:32] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:34:32] [INFO ] Input system was already deterministic with 445 transitions.
[2025-05-31 00:34:32] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:34:32] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:34:32] [INFO ] Time to serialize gal into /tmp/CTLFireability7986739892433529865.gal : 2 ms
[2025-05-31 00:34:32] [INFO ] Time to serialize properties into /tmp/CTLFireability15835394654107241314.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/CTLFireability7986739892433529865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15835394654107241314.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-05-31 00:35:02] [INFO ] Flatten gal took : 15 ms
[2025-05-31 00:35:02] [INFO ] Applying decomposition
[2025-05-31 00:35:02] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17864436768002098443.txt' '-o' '/tmp/graph17864436768002098443.bin' '-w' '/tmp/graph17864436768002098443.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17864436768002098443.bin' '-l' '-1' '-v' '-w' '/tmp/graph17864436768002098443.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:35:02] [INFO ] Decomposing Gal with order
[2025-05-31 00:35:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:35:02] [INFO ] Removed a total of 844 redundant transitions.
[2025-05-31 00:35:02] [INFO ] Flatten gal took : 22 ms
[2025-05-31 00:35:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 4 ms.
[2025-05-31 00:35:02] [INFO ] Time to serialize gal into /tmp/CTLFireability14910839146710877667.gal : 3 ms
[2025-05-31 00:35:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14161872983787712977.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/CTLFireability14910839146710877667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14161872983787712977.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,1.07288e+12,0.201557,11868,954,116,17074,1413,567,17408,85,4362,0


Converting to forward existential form...Done !
original formula: (AX(!(A(EX((((u2.p6==1)&&(u2.p17==1))&&((i4.u25.p89==1)&&(u2.p246==1)))) U ((EX((i12.i0.u63.p200==1)) + (i0.i1.u6.p22!=1)) + (i0.i0.u0.p0...344
=> equivalent forward existential formula: ([FwdG((Init * !(!(EX(!(!(!((E(!(((EX((i12.i0.u63.p200==1)) + (i0.i1.u6.p22!=1)) + (i0.i0.u0.p0==1))) U (!(EX(((...926
Reverse transition relation is NOT exact ! Due to transitions t220, t222, t230, t248, t272, t296, t338, t362, t442, i1.u16.t197, i1.u16.t198, i1.u16.t200, ...800
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Using 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
(forward)formula 0,0,11.8712,425692,1,0,1.15966e+06,3358,5364,784052,522,17315,1544900
FORMULA AutonomousCar-PT-06b-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 604/604 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 238 transition count 592
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 238 transition count 592
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 168 place count 238 transition count 448
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 171 place count 235 transition count 445
Iterating global reduction 1 with 3 rules applied. Total rules applied 174 place count 235 transition count 445
Applied a total of 174 rules in 10 ms. Remains 235 /250 variables (removed 15) and now considering 445/604 (removed 159) transitions.
// Phase 1: matrix 445 rows 235 cols
[2025-05-31 00:35:14] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:35:14] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-05-31 00:35:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:35:15] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 444 sub problems to find dead transitions.
[2025-05-31 00:35: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/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:20] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:20] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:20] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:20] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:20] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:21] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:21] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:21] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:21] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:21] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:21] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:21] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:22] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:22] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:22] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:22] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:22] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:22] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:22] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:23] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:23] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:23] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:23] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:23] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:24] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:24] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:24] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:24] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:24] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:24] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:24] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:25] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:25] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:25] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:25] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:25] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:25] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:25] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:25] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:25] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:28] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:28] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:29] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:29] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:29] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:29] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:31] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:31] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:32] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:32] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:32] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:32] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:32] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:33] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:33] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:33] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:33] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:33] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:36] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:36] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:36] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:36] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:36] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:37] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:37] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:37] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:37] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:37] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/680 variables, and 79 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 68/79 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:47] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:47] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:48] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:48] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (OVERLAPS) 445/680 variables, 235/318 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/680 variables, 444/762 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:02] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:02] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:03] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/680 variables, 3/765 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/680 variables, and 765 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60401ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 60403ms
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 445/604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60692 ms. Remains : 235/250 places, 445/604 transitions.
[2025-05-31 00:36:15] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:36:15] [INFO ] Flatten gal took : 11 ms
[2025-05-31 00:36:15] [INFO ] Input system was already deterministic with 445 transitions.
[2025-05-31 00:36:15] [INFO ] Flatten gal took : 11 ms
[2025-05-31 00:36:15] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:36:15] [INFO ] Time to serialize gal into /tmp/CTLFireability120588884224935549.gal : 2 ms
[2025-05-31 00:36:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5318448774832038902.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/CTLFireability120588884224935549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5318448774832038902.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 00:36:45] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:36:45] [INFO ] Applying decomposition
[2025-05-31 00:36:45] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5076086327344310568.txt' '-o' '/tmp/graph5076086327344310568.bin' '-w' '/tmp/graph5076086327344310568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5076086327344310568.bin' '-l' '-1' '-v' '-w' '/tmp/graph5076086327344310568.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:36:45] [INFO ] Decomposing Gal with order
[2025-05-31 00:36:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:36:45] [INFO ] Removed a total of 840 redundant transitions.
[2025-05-31 00:36:45] [INFO ] Flatten gal took : 23 ms
[2025-05-31 00:36:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 3 ms.
[2025-05-31 00:36:45] [INFO ] Time to serialize gal into /tmp/CTLFireability5777630367776222013.gal : 3 ms
[2025-05-31 00:36:45] [INFO ] Time to serialize properties into /tmp/CTLFireability6677134585412169468.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/CTLFireability5777630367776222013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6677134585412169468.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,1.07288e+12,0.11516,8356,641,113,7906,949,513,10164,86,4472,0


Converting to forward existential form...Done !
original formula: AX(E(A(AX(EX(((((i2.u17.p56==1)&&(i4.i0.u28.p93==1))&&((i7.i1.u37.p124==1)&&(i8.u45.p149==1)))&&(((i11.u54.p180==1)&&(i13.u65.p217==1))&&...404
=> equivalent forward existential formula: [(EY(Init) * !(E(!((E(!(!((!((E(!((((u2.p6==1)&&(u2.p17==1))&&((i12.i1.u62.p206==1)&&(u2.p246==1)))) U (!((i14.i...1370
Reverse transition relation is NOT exact ! Due to transitions t220, t222, t224, t248, t272, t296, t338, t362, t442, i0.u72.t33, i0.u72.t36, i0.u72.t37, i0....798
Using 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 a local SCC at level 1
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-05-31 00:37:15] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:37:15] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:37:15] [INFO ] Applying decomposition
[2025-05-31 00:37:15] [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/graph11419936755661159966.txt' '-o' '/tmp/graph11419936755661159966.bin' '-w' '/tmp/graph11419936755661159966.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11419936755661159966.bin' '-l' '-1' '-v' '-w' '/tmp/graph11419936755661159966.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:37:15] [INFO ] Decomposing Gal with order
[2025-05-31 00:37:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:37:15] [INFO ] Removed a total of 1512 redundant transitions.
[2025-05-31 00:37:15] [INFO ] Flatten gal took : 31 ms
[2025-05-31 00:37:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 4 ms.
[2025-05-31 00:37:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15510541932317475686.gal : 2 ms
[2025-05-31 00:37:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5752428930238554764.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/CTLFireability15510541932317475686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5752428930238554764.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 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.16836e+12,0.314261,17860,1854,61,29822,658,622,61330,80,1499,0


Converting to forward existential form...Done !
original formula: E((EX(((((i1.u19.p62==1)&&(i3.u30.p93==1))&&((i9.u41.p124==1)&&(i5.u49.p149==1)))&&(((i8.u61.p186==1)&&(i9.u69.p211==1))&&(i9.u79.p247==1...683
=> equivalent forward existential formula: ([((FwdU((FwdU(FwdU(Init,(EX(((((i1.u19.p62==1)&&(i3.u30.p93==1))&&((i9.u41.p124==1)&&(i5.u49.p149==1)))&&(((i8....1514
Reverse transition relation is NOT exact ! Due to transitions t91, t172, t234, t236, t253, t255, t261, t289, t291, t297, t337, t339, t345, t517, t519, t525...826
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2025-05-31 00:41:46] [INFO ] Applying decomposition
[2025-05-31 00:41:46] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:41:46] [INFO ] Decomposing Gal with order
[2025-05-31 00:41:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:41:46] [INFO ] Removed a total of 1558 redundant transitions.
[2025-05-31 00:41:46] [INFO ] Flatten gal took : 32 ms
[2025-05-31 00:41:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 222 labels/synchronizations in 4 ms.
[2025-05-31 00:41:46] [INFO ] Time to serialize gal into /tmp/CTLFireability5495856032361997522.gal : 2 ms
[2025-05-31 00:41:46] [INFO ] Time to serialize properties into /tmp/CTLFireability13767640028969606305.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/CTLFireability5495856032361997522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13767640028969606305.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 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.16836e+12,0.073194,6832,501,987,2933,2763,240,8166,296,13771,0


Converting to forward existential form...Done !
original formula: E((EX(((((i1.i0.i0.i0.i0.i0.i0.u11.p62==1)&&(i1.i0.i0.i0.i0.i0.i0.u12.p93==1))&&((i1.i0.i0.i0.i0.i0.u13.p124==1)&&(i1.i0.i0.i0.i0.u14.p14...911
=> equivalent forward existential formula: ([((FwdU((FwdU(FwdU(Init,(EX(((((i1.i0.i0.i0.i0.i0.i0.u11.p62==1)&&(i1.i0.i0.i0.i0.i0.i0.u12.p93==1))&&((i1.i0.i...1971
Reverse transition relation is NOT exact ! Due to transitions t329, t330, i0.u2.t236, i0.u2.t237, i0.u3.t234, i1.t601, i1.i0.u17.t37, i1.i0.u17.t40, i1.i0....1338
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Using 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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Detected timeout of ITS tools.
[2025-05-31 01:09:32] [INFO ] Flatten gal took : 17 ms
[2025-05-31 01:09:32] [INFO ] Input system was already deterministic with 604 transitions.
[2025-05-31 01:09:32] [INFO ] Transformed 250 places.
[2025-05-31 01:09:32] [INFO ] Transformed 604 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-31 01:09:32] [INFO ] Time to serialize gal into /tmp/CTLFireability14909317977282866827.gal : 4 ms
[2025-05-31 01:09:32] [INFO ] Time to serialize properties into /tmp/CTLFireability9440973374941241317.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/CTLFireability14909317977282866827.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9440973374941241317.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.16836e+12,10.6472,316644,2,129668,5,1.67611e+06,6,0,1606,830133,0


Converting to forward existential form...Done !
original formula: E((EX(((((p62==1)&&(p93==1))&&((p124==1)&&(p149==1)))&&(((p186==1)&&(p211==1))&&(p247==1)))) + (((E((AX((((p6==1)&&(p14==1))&&((p117==1)&...454
=> equivalent forward existential formula: ([((FwdU((FwdU(FwdU(Init,(EX(((((p62==1)&&(p93==1))&&((p124==1)&&(p149==1)))&&(((p186==1)&&(p211==1))&&(p247==1)...1057
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t19, t28, t33, t37, t40, t41, t42, t70, t71, t74, t75, t77, t91, t97, t98, t101, t1...884

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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="AutonomousCar-PT-06b"
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 AutonomousCar-PT-06b, 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 r002-tall-174853729800690"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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