Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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 334K 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-07b-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2023-15
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2025-00
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2025-01
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2025-02
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2025-03
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2025-04
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2025-05
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2025-06
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2025-07
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2025-08
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2025-09
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2025-10
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748651617684

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-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-31 00:33:38] [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:33:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:33:39] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2025-05-31 00:33:39] [INFO ] Transformed 323 places.
[2025-05-31 00:33:39] [INFO ] Transformed 846 transitions.
[2025-05-31 00:33:39] [INFO ] Found NUPN structural information;
[2025-05-31 00:33:39] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 73 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 846/846 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 280 transition count 803
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 280 transition count 803
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 282 place count 280 transition count 607
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 289 place count 273 transition count 600
Iterating global reduction 1 with 7 rules applied. Total rules applied 296 place count 273 transition count 600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 297 place count 272 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 298 place count 272 transition count 599
Applied a total of 298 rules in 99 ms. Remains 272 /323 variables (removed 51) and now considering 599/846 (removed 247) transitions.
// Phase 1: matrix 599 rows 272 cols
[2025-05-31 00:33:39] [INFO ] Computed 12 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:33:39] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-05-31 00:33:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:33:39] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 598 sub problems to find dead transitions.
[2025-05-31 00:33:39] [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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 598 unsolved
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 17 places in 217 ms of which 25 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 19 places in 168 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:49] [INFO ] Deduced a trap composed of 20 places in 165 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:49] [INFO ] Deduced a trap composed of 18 places in 154 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:49] [INFO ] Deduced a trap composed of 31 places in 164 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:49] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:49] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:49] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 20 ms to minimize.
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 35 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:33:50] [INFO ] Deduced a trap composed of 36 places in 151 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:50] [INFO ] Deduced a trap composed of 36 places in 151 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:50] [INFO ] Deduced a trap composed of 22 places in 157 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:50] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 20 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 21 places in 149 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:51] [INFO ] Deduced a trap composed of 24 places in 149 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:51] [INFO ] Deduced a trap composed of 37 places in 165 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:51] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 20 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 14 places in 162 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:51] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:52] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:52] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:53] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:53] [INFO ] Deduced a trap composed of 42 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:33:53] [INFO ] Deduced a trap composed of 43 places in 116 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:53] [INFO ] Deduced a trap composed of 44 places in 111 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:53] [INFO ] Deduced a trap composed of 45 places in 111 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:53] [INFO ] Deduced a trap composed of 46 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:33:53] [INFO ] Deduced a trap composed of 46 places in 104 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:53] [INFO ] Deduced a trap composed of 31 places in 150 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 31 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:33:54] [INFO ] Deduced a trap composed of 31 places in 131 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:54] [INFO ] Deduced a trap composed of 32 places in 132 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 31 places in 128 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:54] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 19 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 42 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:33:55] [INFO ] Deduced a trap composed of 44 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:33:55] [INFO ] Deduced a trap composed of 45 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:55] [INFO ] Deduced a trap composed of 46 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:33:55] [INFO ] Deduced a trap composed of 47 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:33:55] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:58] [INFO ] Deduced a trap composed of 31 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:33:59] [INFO ] Deduced a trap composed of 66 places in 155 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:59] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:59] [INFO ] Deduced a trap composed of 38 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:33:59] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:33:59] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:00] [INFO ] Deduced a trap composed of 32 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:34:00] [INFO ] Deduced a trap composed of 39 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:34:00] [INFO ] Deduced a trap composed of 42 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:34:00] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:00] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:00] [INFO ] Deduced a trap composed of 42 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:34:00] [INFO ] Deduced a trap composed of 43 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:34:01] [INFO ] Deduced a trap composed of 45 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:34:01] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:01] [INFO ] Deduced a trap composed of 47 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:34:01] [INFO ] Deduced a trap composed of 47 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:34:01] [INFO ] Deduced a trap composed of 43 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:34:01] [INFO ] Deduced a trap composed of 41 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:34:01] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:02] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:03] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:03] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:03] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 14 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 32 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:34:04] [INFO ] Deduced a trap composed of 45 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:34:04] [INFO ] Deduced a trap composed of 46 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:34:04] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 18 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 33 places in 140 ms of which 11 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 46 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:05] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:05] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:05] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 13/85 constraints. Problems are: Problem set: 0 solved, 598 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 43 places in 110 ms of which 11 ms to minimize.
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 45 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:34:10] [INFO ] Deduced a trap composed of 46 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:34:10] [INFO ] Deduced a trap composed of 46 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:34:10] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 9 ms to minimize.
SMT process timed out in 30933ms, After SMT, problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 30949ms
Starting structural reductions in LTL mode, iteration 1 : 272/323 places, 599/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31572 ms. Remains : 272/323 places, 599/846 transitions.
Support contains 73 out of 272 places after structural reductions.
[2025-05-31 00:34:11] [INFO ] Flatten gal took : 98 ms
[2025-05-31 00:34:11] [INFO ] Flatten gal took : 57 ms
[2025-05-31 00:34:11] [INFO ] Input system was already deterministic with 599 transitions.
RANDOM walk for 40000 steps (254 resets) in 1707 ms. (23 steps per ms) remains 22/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (10 resets) in 49 ms. (80 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
[2025-05-31 00:34:11] [INFO ] Invariant cache hit.
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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 223/272 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:12] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 9 ms to minimize.
Problem AtomicPropp25 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 599/871 variables, 272/285 constraints. Problems are: Problem set: 2 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:12] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:13] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/871 variables, 2/287 constraints. Problems are: Problem set: 2 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:13] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:13] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/871 variables, 2/289 constraints. Problems are: Problem set: 2 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:13] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/871 variables, 1/290 constraints. Problems are: Problem set: 2 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:14] [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:34:14] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/871 variables, 2/292 constraints. Problems are: Problem set: 2 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:14] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/871 variables, 1/293 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/871 variables, 0/293 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/871 variables, 0/293 constraints. Problems are: Problem set: 2 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 871/871 variables, and 293 constraints, problems are : Problem set: 2 solved, 20 unsolved in 3924 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 22/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 7/7 constraints]
Escalating to Integer solving :Problem set: 2 solved, 20 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 198/240 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/12 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 32/272 variables, 2/14 constraints. Problems are: Problem set: 2 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:16] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 599/871 variables, 272/287 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/871 variables, 5/292 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/871 variables, 7/299 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/871 variables, 0/299 constraints. Problems are: Problem set: 2 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:19] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 13 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/871 variables, 1/300 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/871 variables, 0/300 constraints. Problems are: Problem set: 2 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/871 variables, and 300 constraints, problems are : Problem set: 2 solved, 20 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 20/5 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 9012ms problems are : Problem set: 2 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 599/599 transitions.
Graph (trivial) has 200 edges and 272 vertex of which 4 / 272 are part of one of the 2 SCC in 3 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 1091 edges and 270 vertex of which 268 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 268 transition count 505
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 129 rules applied. Total rules applied 221 place count 180 transition count 464
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 247 place count 156 transition count 462
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 249 place count 154 transition count 462
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 249 place count 154 transition count 453
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 267 place count 145 transition count 453
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 272 place count 140 transition count 448
Iterating global reduction 4 with 5 rules applied. Total rules applied 277 place count 140 transition count 448
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 351 place count 103 transition count 411
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 352 place count 103 transition count 410
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 354 place count 101 transition count 402
Iterating global reduction 5 with 2 rules applied. Total rules applied 356 place count 101 transition count 402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 357 place count 101 transition count 401
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 6 with 2 rules applied. Total rules applied 359 place count 100 transition count 400
Free-agglomeration rule applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 374 place count 100 transition count 385
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 389 place count 85 transition count 385
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 390 place count 85 transition count 384
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 394 place count 85 transition count 384
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 395 place count 84 transition count 376
Iterating global reduction 7 with 1 rules applied. Total rules applied 396 place count 84 transition count 376
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 397 place count 83 transition count 375
Applied a total of 397 rules in 156 ms. Remains 83 /272 variables (removed 189) and now considering 375/599 (removed 224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 83/272 places, 375/599 transitions.
RANDOM walk for 40000 steps (1257 resets) in 492 ms. (81 steps per ms) remains 11/20 properties
BEST_FIRST walk for 40004 steps (148 resets) in 102 ms. (388 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (142 resets) in 129 ms. (307 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (128 resets) in 74 ms. (533 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (148 resets) in 78 ms. (506 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40003 steps (153 resets) in 83 ms. (476 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (134 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (134 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
// Phase 1: matrix 375 rows 83 cols
[2025-05-31 00:34:21] [INFO ] Computed 12 invariants in 5 ms
[2025-05-31 00:34:21] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 53/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 366/437 variables, 71/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 21/458 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/458 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 96 constraints, problems are : Problem set: 0 solved, 5 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 53/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 366/437 variables, 71/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 21/458 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/458 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 96 constraints, problems are : Problem set: 0 solved, 5 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 578ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 591 ms.
Support contains 18 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 375/375 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 83 transition count 374
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 82 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 81 transition count 373
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 81 transition count 372
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 80 transition count 372
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 79 transition count 371
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 79 transition count 371
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
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 22 place count 72 transition count 364
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 71 transition count 356
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 71 transition count 356
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
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 38 place count 64 transition count 349
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 43 place count 64 transition count 344
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 62 place count 59 transition count 330
Applied a total of 62 rules in 58 ms. Remains 59 /83 variables (removed 24) and now considering 330/375 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 59/83 places, 330/375 transitions.
RANDOM walk for 40000 steps (1219 resets) in 328 ms. (121 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (178 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (183 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (186 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (197 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
// Phase 1: matrix 330 rows 59 cols
[2025-05-31 00:34:22] [INFO ] Computed 12 invariants in 2 ms
[2025-05-31 00:34:22] [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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 320/365 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 24/389 variables, 14/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/389 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 72 constraints, problems are : Problem set: 0 solved, 4 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 320/365 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:23] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:23] [INFO ] Deduced a trap along path composed of 2 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:34:23] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 24/389 variables, 14/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:23] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:23] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 77 constraints, problems are : Problem set: 0 solved, 4 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 717ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 276 ms.
Support contains 16 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 330/330 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 322
Applied a total of 2 rules in 13 ms. Remains 58 /59 variables (removed 1) and now considering 322/330 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 58/59 places, 322/330 transitions.
RANDOM walk for 40000 steps (1267 resets) in 293 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (179 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (177 resets) in 38 ms. (1025 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (171 resets) in 39 ms. (1000 steps per ms) remains 2/3 properties
// Phase 1: matrix 322 rows 58 cols
[2025-05-31 00:34:24] [INFO ] Computed 12 invariants in 2 ms
[2025-05-31 00:34:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 313/358 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/380 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 71 constraints, problems are : Problem set: 0 solved, 2 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 313/358 variables, 45/53 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:34:24] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 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 along path composed of 2 places in 30 ms of which 0 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 along path composed of 2 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:34:24] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 22/380 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 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:34:24] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/380 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 76 constraints, problems are : Problem set: 0 solved, 2 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 550ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 12 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 322/322 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 58 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 57 transition count 321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 56 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 56 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 56 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7 place count 55 transition count 312
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8 place count 55 transition count 311
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 16 place count 54 transition count 304
Applied a total of 16 rules in 22 ms. Remains 54 /58 variables (removed 4) and now considering 304/322 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 54/58 places, 304/322 transitions.
RANDOM walk for 40000 steps (1189 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (170 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (186 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1521497 steps, run timeout after 3001 ms. (steps per millisecond=506 ) properties seen :0 out of 2
Probabilistic random walk after 1521497 steps, saw 221660 distinct states, run finished after 3005 ms. (steps per millisecond=506 ) properties seen :0
// Phase 1: matrix 304 rows 54 cols
[2025-05-31 00:34:27] [INFO ] Computed 12 invariants in 3 ms
[2025-05-31 00:34:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/41 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 295/336 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/358 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/358 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 67 constraints, problems are : Problem set: 0 solved, 2 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/41 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 295/336 variables, 41/49 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:34:28] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:28] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:28] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 22/358 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 1/70 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:34:28] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/358 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 71 constraints, problems are : Problem set: 0 solved, 2 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 503ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 12 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 304/304 transitions.
Applied a total of 0 rules in 9 ms. Remains 54 /54 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 54/54 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 304/304 transitions.
Applied a total of 0 rules in 7 ms. Remains 54 /54 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2025-05-31 00:34:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:34:28] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-05-31 00:34:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:34:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:34:28] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [49, 53]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 215 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 52/54 places, 303/304 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 302
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 51 transition count 301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 50 transition count 301
Applied a total of 4 rules in 22 ms. Remains 50 /52 variables (removed 2) and now considering 301/303 (removed 2) transitions.
// Phase 1: matrix 301 rows 50 cols
[2025-05-31 00:34:28] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:34:28] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-05-31 00:34:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:34:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:34:28] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 50/54 places, 301/304 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 453 ms. Remains : 50/54 places, 301/304 transitions.
RANDOM walk for 40000 steps (929 resets) in 839 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (184 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (178 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1645502 steps, run timeout after 3001 ms. (steps per millisecond=548 ) properties seen :0 out of 2
Probabilistic random walk after 1645502 steps, saw 239875 distinct states, run finished after 3001 ms. (steps per millisecond=548 ) properties seen :0
[2025-05-31 00:34:32] [INFO ] Invariant cache hit.
[2025-05-31 00:34:32] [INFO ] State equation strengthened by 2 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 295/335 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 16/351 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/351 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 62 constraints, problems are : Problem set: 0 solved, 2 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 295/335 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 2/50 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:34:32] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:32] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:32] [INFO ] Deduced a trap along path composed of 2 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:34:32] [INFO ] Deduced a trap along path composed of 2 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:34:32] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 16/351 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/351 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 67 constraints, problems are : Problem set: 0 solved, 2 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 530ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 12 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 301/301 transitions.
Applied a total of 0 rules in 7 ms. Remains 50 /50 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 50/50 places, 301/301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 301/301 transitions.
Applied a total of 0 rules in 7 ms. Remains 50 /50 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2025-05-31 00:34:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:34:32] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-05-31 00:34:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:34:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:34:33] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:34:33] [INFO ] Redundant transitions in 30 ms returned []
Running 299 sub problems to find dead transitions.
[2025-05-31 00:34:33] [INFO ] Invariant cache hit.
[2025-05-31 00:34:33] [INFO ] State equation strengthened by 2 read => feed constraints.
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/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Problem TDEAD300 is UNSAT
At refinement iteration 4 (OVERLAPS) 301/351 variables, 50/60 constraints. Problems are: Problem set: 1 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:37] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 1/63 constraints. Problems are: Problem set: 1 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:41] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:41] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:43] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 3/66 constraints. Problems are: Problem set: 1 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:34:45] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 1/67 constraints. Problems are: Problem set: 1 solved, 298 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 298 unsolved
At refinement iteration 10 (OVERLAPS) 0/351 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 67 constraints, problems are : Problem set: 1 solved, 298 unsolved in 20792 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 299/171 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 301/351 variables, 50/60 constraints. Problems are: Problem set: 1 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 171/233 constraints. Problems are: Problem set: 1 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 5/238 constraints. Problems are: Problem set: 1 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 351/351 variables, and 238 constraints, problems are : Problem set: 1 solved, 298 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 298/171 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 51392ms problems are : Problem set: 1 solved, 298 unsolved
Search for dead transitions found 1 dead transitions in 51393ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 50/50 places, 300/301 transitions.
Applied a total of 0 rules in 7 ms. Remains 50 /50 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:35:24] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51664 ms. Remains : 50/50 places, 300/301 transitions.
RANDOM walk for 40000 steps (1127 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (173 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (180 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1679999 steps, run timeout after 3001 ms. (steps per millisecond=559 ) properties seen :0 out of 2
Probabilistic random walk after 1679999 steps, saw 244136 distinct states, run finished after 3001 ms. (steps per millisecond=559 ) properties seen :0
// Phase 1: matrix 300 rows 50 cols
[2025-05-31 00:35:27] [INFO ] Computed 11 invariants in 2 ms
[2025-05-31 00:35:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 294/334 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 16/350 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/350 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 62 constraints, problems are : Problem set: 0 solved, 2 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 294/334 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 1/49 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:35:27] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:27] [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:35:27] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:27] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 16/350 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 3/66 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:35:27] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/350 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 67 constraints, problems are : Problem set: 0 solved, 2 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 540ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 98 ms.
Support contains 12 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 300/300 transitions.
Applied a total of 0 rules in 7 ms. Remains 50 /50 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 50/50 places, 300/300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 300/300 transitions.
Applied a total of 0 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2025-05-31 00:35:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:35:28] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-05-31 00:35:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:35:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:35:28] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:35:28] [INFO ] Redundant transitions in 4 ms returned []
Running 298 sub problems to find dead transitions.
[2025-05-31 00:35:28] [INFO ] Invariant cache hit.
[2025-05-31 00:35:28] [INFO ] State equation strengthened by 1 read => feed constraints.
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/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 300/350 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:33] [INFO ] Deduced a trap along path composed of 2 places in 46 ms of which 1 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 along path composed of 2 places in 40 ms of which 0 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 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:35:33] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 0 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 along path composed of 2 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:35:34] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (OVERLAPS) 0/350 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 68 constraints, problems are : Problem set: 0 solved, 298 unsolved in 13848 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 298/171 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 300/350 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 171/233 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 6/239 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/350 variables, and 239 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 298/171 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 44442ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 44444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44668 ms. Remains : 50/50 places, 300/300 transitions.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2025-05-31 00:36:12] [INFO ] Flatten gal took : 40 ms
[2025-05-31 00:36:12] [INFO ] Flatten gal took : 37 ms
[2025-05-31 00:36:13] [INFO ] Input system was already deterministic with 599 transitions.
Computed a total of 46 stabilizing places and 47 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 599/599 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 266 transition count 593
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 266 transition count 593
Applied a total of 12 rules in 7 ms. Remains 266 /272 variables (removed 6) and now considering 593/599 (removed 6) transitions.
// Phase 1: matrix 593 rows 266 cols
[2025-05-31 00:36:13] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:36:13] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-05-31 00:36:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:36:13] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 592 sub problems to find dead transitions.
[2025-05-31 00:36:13] [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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:21] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:21] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:21] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:22] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:22] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:22] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:22] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:22] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:23] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:23] [INFO ] Deduced a trap composed of 35 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:36:23] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:23] [INFO ] Deduced a trap composed of 36 places in 158 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:23] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:23] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:24] [INFO ] Deduced a trap composed of 31 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:36:24] [INFO ] Deduced a trap composed of 31 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:36:24] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:24] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:24] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:24] [INFO ] Deduced a trap composed of 63 places in 148 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:25] [INFO ] Deduced a trap composed of 14 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:36:25] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:26] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:26] [INFO ] Deduced a trap composed of 41 places in 147 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:26] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:26] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:26] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:27] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:27] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:27] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:27] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:27] [INFO ] Deduced a trap composed of 42 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:36:28] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:28] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:28] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:29] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:29] [INFO ] Deduced a trap composed of 43 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:36:29] [INFO ] Deduced a trap composed of 44 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:29] [INFO ] Deduced a trap composed of 45 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:36:29] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:32] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:32] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:32] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:33] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:33] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:33] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:33] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:33] [INFO ] Deduced a trap composed of 42 places in 140 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:34] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:34] [INFO ] Deduced a trap composed of 33 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:36:34] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:34] [INFO ] Deduced a trap composed of 45 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:36:34] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:35] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:35] [INFO ] Deduced a trap composed of 42 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:36:35] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:35] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:35] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:35] [INFO ] Deduced a trap composed of 47 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:36:36] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:36] [INFO ] Deduced a trap composed of 21 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:36:37] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:37] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:37] [INFO ] Deduced a trap composed of 36 places in 155 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:37] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:37] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:37] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:38] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:38] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:38] [INFO ] Deduced a trap composed of 39 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:36:38] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:38] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:38] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:39] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:39] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:39] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:40] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:40] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:40] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:40] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:41] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:41] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:41] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:42] [INFO ] Deduced a trap composed of 43 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:36:42] [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:36:42] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:43] [INFO ] Deduced a trap composed of 46 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:36:43] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:43] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:43] [INFO ] Deduced a trap composed of 46 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:36:43] [INFO ] Deduced a trap composed of 46 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:36:43] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/859 variables, and 104 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 592/394 constraints, Known Traps: 92/92 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 92/104 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:47] [INFO ] Deduced a trap composed of 34 places in 152 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:48] [INFO ] Deduced a trap composed of 42 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:36:49] [INFO ] Deduced a trap composed of 31 places in 145 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:49] [INFO ] Deduced a trap composed of 45 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:36:49] [INFO ] Deduced a trap composed of 46 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:36:49] [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:36:49] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:50] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 8/112 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:36:55] [INFO ] Deduced a trap composed of 44 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:36:55] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:37:00] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:37:05] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:37:05] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:37:06] [INFO ] Deduced a trap composed of 38 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:37:06] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:37:11] [INFO ] Deduced a trap composed of 43 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:37:11] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:37:12] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 19 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 266/859 variables, and 122 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 198/394 constraints, Known Traps: 110/110 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60664ms problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 60666ms
Starting structural reductions in LTL mode, iteration 1 : 266/272 places, 593/599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61038 ms. Remains : 266/272 places, 593/599 transitions.
[2025-05-31 00:37:14] [INFO ] Flatten gal took : 29 ms
[2025-05-31 00:37:14] [INFO ] Flatten gal took : 28 ms
[2025-05-31 00:37:14] [INFO ] Input system was already deterministic with 593 transitions.
[2025-05-31 00:37:14] [INFO ] Flatten gal took : 27 ms
[2025-05-31 00:37:14] [INFO ] Flatten gal took : 28 ms
[2025-05-31 00:37:14] [INFO ] Time to serialize gal into /tmp/CTLFireability13156534073617919158.gal : 20 ms
[2025-05-31 00:37:14] [INFO ] Time to serialize properties into /tmp/CTLFireability18072796029595036922.ctl : 3 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/CTLFireability13156534073617919158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18072796029595036922.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:37:44] [INFO ] Flatten gal took : 26 ms
[2025-05-31 00:37:44] [INFO ] Applying decomposition
[2025-05-31 00:37:44] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6984374968942752232.txt' '-o' '/tmp/graph6984374968942752232.bin' '-w' '/tmp/graph6984374968942752232.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6984374968942752232.bin' '-l' '-1' '-v' '-w' '/tmp/graph6984374968942752232.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:37:44] [INFO ] Decomposing Gal with order
[2025-05-31 00:37:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:37:44] [INFO ] Removed a total of 1611 redundant transitions.
[2025-05-31 00:37:44] [INFO ] Flatten gal took : 109 ms
[2025-05-31 00:37:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 18 ms.
[2025-05-31 00:37:44] [INFO ] Time to serialize gal into /tmp/CTLFireability3764861883604043972.gal : 6 ms
[2025-05-31 00:37:44] [INFO ] Time to serialize properties into /tmp/CTLFireability8701500734798268351.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/CTLFireability3764861883604043972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8701500734798268351.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,2.81998e+13,16.9194,610268,9385,122,486408,2643,732,6.58861e+06,93,19074,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 599/599 transitions.
Graph (trivial) has 256 edges and 272 vertex of which 4 / 272 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 269 transition count 496
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 142 rules applied. Total rules applied 243 place count 169 transition count 454
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 268 place count 144 transition count 454
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 268 place count 144 transition count 446
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 284 place count 136 transition count 446
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 291 place count 129 transition count 439
Iterating global reduction 3 with 7 rules applied. Total rules applied 298 place count 129 transition count 439
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 299 place count 128 transition count 432
Iterating global reduction 3 with 1 rules applied. Total rules applied 300 place count 128 transition count 432
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 3 with 2 rules applied. Total rules applied 302 place count 128 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 303 place count 127 transition count 430
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 395 place count 81 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 396 place count 81 transition count 383
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 409 place count 68 transition count 292
Iterating global reduction 6 with 13 rules applied. Total rules applied 422 place count 68 transition count 292
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 6 with 12 rules applied. Total rules applied 434 place count 68 transition count 280
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 440 place count 62 transition count 280
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 8 with 2 rules applied. Total rules applied 442 place count 61 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 443 place count 61 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 444 place count 60 transition count 277
Applied a total of 444 rules in 85 ms. Remains 60 /272 variables (removed 212) and now considering 277/599 (removed 322) transitions.
// Phase 1: matrix 277 rows 60 cols
[2025-05-31 00:38: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:38:15] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-05-31 00:38:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:38:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:38:15] [INFO ] Implicit Places using invariants and state equation in 130 ms returned [53, 59]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 206 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 58/272 places, 277/599 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 58 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 57 transition count 276
Applied a total of 2 rules in 15 ms. Remains 57 /58 variables (removed 1) and now considering 276/277 (removed 1) transitions.
// Phase 1: matrix 276 rows 57 cols
[2025-05-31 00:38:15] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:38:15] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-31 00:38:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:38:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:38:15] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 57/272 places, 276/599 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 505 ms. Remains : 57/272 places, 276/599 transitions.
[2025-05-31 00:38:15] [INFO ] Flatten gal took : 27 ms
[2025-05-31 00:38:15] [INFO ] Flatten gal took : 26 ms
[2025-05-31 00:38:15] [INFO ] Input system was already deterministic with 276 transitions.
[2025-05-31 00:38:15] [INFO ] Flatten gal took : 49 ms
RANDOM walk for 7390 steps (380 resets) in 231 ms. (31 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-07b-CTLFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-31 00:38:15] [INFO ] Flatten gal took : 30 ms
[2025-05-31 00:38:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11086167818533100666.gal : 4 ms
[2025-05-31 00:38:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9558179379004327975.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/ReachabilityCardinality11086167818533100666.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9558179379004327975.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 599/599 transitions.
Graph (trivial) has 233 edges and 272 vertex of which 4 / 272 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 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 269 transition count 500
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 138 rules applied. Total rules applied 235 place count 173 transition count 458
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 26 rules applied. Total rules applied 261 place count 148 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 262 place count 147 transition count 457
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 262 place count 147 transition count 449
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 278 place count 139 transition count 449
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 285 place count 132 transition count 442
Iterating global reduction 4 with 7 rules applied. Total rules applied 292 place count 132 transition count 442
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 293 place count 131 transition count 435
Iterating global reduction 4 with 1 rules applied. Total rules applied 294 place count 131 transition count 435
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 4 with 2 rules applied. Total rules applied 296 place count 131 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 297 place count 130 transition count 433
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 375 place count 91 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 376 place count 91 transition count 393
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 383 place count 84 transition count 348
Iterating global reduction 7 with 7 rules applied. Total rules applied 390 place count 84 transition count 348
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 7 with 8 rules applied. Total rules applied 398 place count 84 transition count 340
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 402 place count 80 transition count 340
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 404 place count 79 transition count 339
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 405 place count 79 transition count 338
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 406 place count 79 transition count 338
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 407 place count 78 transition count 337
Applied a total of 407 rules in 59 ms. Remains 78 /272 variables (removed 194) and now considering 337/599 (removed 262) transitions.
// Phase 1: matrix 337 rows 78 cols
[2025-05-31 00:38:15] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:38:15] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-05-31 00:38:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:38:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:38:15] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [71, 77]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 175 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 76/272 places, 337/599 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 76 transition count 336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 75 transition count 336
Applied a total of 2 rules in 14 ms. Remains 75 /76 variables (removed 1) and now considering 336/337 (removed 1) transitions.
// Phase 1: matrix 336 rows 75 cols
[2025-05-31 00:38:15] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:38:15] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-05-31 00:38:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:38:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:38:16] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 75/272 places, 336/599 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 413 ms. Remains : 75/272 places, 336/599 transitions.
[2025-05-31 00:38:16] [INFO ] Flatten gal took : 26 ms
[2025-05-31 00:38:16] [INFO ] Flatten gal took : 25 ms
[2025-05-31 00:38:16] [INFO ] Input system was already deterministic with 336 transitions.
[2025-05-31 00:38:16] [INFO ] Flatten gal took : 24 ms
[2025-05-31 00:38:16] [INFO ] Flatten gal took : 25 ms
[2025-05-31 00:38:16] [INFO ] Time to serialize gal into /tmp/CTLFireability6956823698044561928.gal : 5 ms
[2025-05-31 00:38:16] [INFO ] Time to serialize properties into /tmp/CTLFireability10274088928337985114.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/CTLFireability6956823698044561928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10274088928337985114.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:38:46] [INFO ] Flatten gal took : 25 ms
[2025-05-31 00:38:46] [INFO ] Applying decomposition
[2025-05-31 00:38:46] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17782081931428424235.txt' '-o' '/tmp/graph17782081931428424235.bin' '-w' '/tmp/graph17782081931428424235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17782081931428424235.bin' '-l' '-1' '-v' '-w' '/tmp/graph17782081931428424235.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:38:46] [INFO ] Decomposing Gal with order
[2025-05-31 00:38:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:38:46] [INFO ] Removed a total of 1541 redundant transitions.
[2025-05-31 00:38:46] [INFO ] Flatten gal took : 37 ms
[2025-05-31 00:38:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 8 ms.
[2025-05-31 00:38:46] [INFO ] Time to serialize gal into /tmp/CTLFireability15729457494686845178.gal : 2 ms
[2025-05-31 00:38:46] [INFO ] Time to serialize properties into /tmp/CTLFireability12854991212130218503.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/CTLFireability15729457494686845178.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12854991212130218503.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.34409e+08,13.6197,341752,1722,56,359669,541,382,3.18221e+06,62,2772,0


Converting to forward existential form...Done !
original formula: EF(AG(!(E((((((i0.u0.p6==1)&&(i0.u1.p9==1))&&((i2.u9.p135==1)&&(i0.u21.p280==1)))&&(((i0.u0.p6==1)&&(i0.u21.p19==1))&&((i4.u15.p209==1)&&...502
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(E((((((i0.u0.p6==1)&&(i0.u1.p9==1))&&((i2.u9.p135==1)&&(i0.u21.p280==1)))&&((...566
Reverse transition relation is NOT exact ! Due to transitions t5, t89, t188, t189, t191, t193, t195, t196, t198, t200, t202, t203, t205, t207, t272, t273, ...713
(forward)formula 0,0,15.6656,341752,1,0,359669,541,2551,3.18221e+06,293,2772,175630
FORMULA AutonomousCar-PT-07b-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 599/599 transitions.
Graph (trivial) has 239 edges and 272 vertex of which 4 / 272 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 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 269 transition count 497
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 141 rules applied. Total rules applied 241 place count 170 transition count 455
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 266 place count 145 transition count 455
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 266 place count 145 transition count 448
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 280 place count 138 transition count 448
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 287 place count 131 transition count 441
Iterating global reduction 3 with 7 rules applied. Total rules applied 294 place count 131 transition count 441
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 295 place count 130 transition count 434
Iterating global reduction 3 with 1 rules applied. Total rules applied 296 place count 130 transition count 434
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 3 with 2 rules applied. Total rules applied 298 place count 130 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 299 place count 129 transition count 432
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 379 place count 89 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 380 place count 89 transition count 391
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 390 place count 79 transition count 323
Iterating global reduction 6 with 10 rules applied. Total rules applied 400 place count 79 transition count 323
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 10 rules applied. Total rules applied 410 place count 79 transition count 313
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 415 place count 74 transition count 313
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 8 with 2 rules applied. Total rules applied 417 place count 73 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 418 place count 73 transition count 311
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 420 place count 71 transition count 309
Applied a total of 420 rules in 66 ms. Remains 71 /272 variables (removed 201) and now considering 309/599 (removed 290) transitions.
// Phase 1: matrix 309 rows 71 cols
[2025-05-31 00:39:02] [INFO ] Computed 11 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:39:02] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-05-31 00:39:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:39:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:39:02] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [64, 70]
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 : 69/272 places, 309/599 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 69 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 68 transition count 308
Applied a total of 2 rules in 12 ms. Remains 68 /69 variables (removed 1) and now considering 308/309 (removed 1) transitions.
// Phase 1: matrix 308 rows 68 cols
[2025-05-31 00:39:02] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:39:02] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-05-31 00:39:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:39:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:39:02] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 68/272 places, 308/599 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 416 ms. Remains : 68/272 places, 308/599 transitions.
[2025-05-31 00:39:02] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:39:02] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:39:02] [INFO ] Input system was already deterministic with 308 transitions.
[2025-05-31 00:39:02] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:39:02] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:39:02] [INFO ] Time to serialize gal into /tmp/CTLFireability370066186384262099.gal : 3 ms
[2025-05-31 00:39:02] [INFO ] Time to serialize properties into /tmp/CTLFireability2331960933907321495.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/CTLFireability370066186384262099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2331960933907321495.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:39:32] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:39:32] [INFO ] Applying decomposition
[2025-05-31 00:39:32] [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/graph341095121171802245.txt' '-o' '/tmp/graph341095121171802245.bin' '-w' '/tmp/graph341095121171802245.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph341095121171802245.bin' '-l' '-1' '-v' '-w' '/tmp/graph341095121171802245.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:39:32] [INFO ] Decomposing Gal with order
[2025-05-31 00:39:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:39:32] [INFO ] Removed a total of 1454 redundant transitions.
[2025-05-31 00:39:32] [INFO ] Flatten gal took : 29 ms
[2025-05-31 00:39:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 7 ms.
[2025-05-31 00:39:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11478156119507041326.gal : 2 ms
[2025-05-31 00:39:32] [INFO ] Time to serialize properties into /tmp/CTLFireability13802848956249977063.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/CTLFireability11478156119507041326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13802848956249977063.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.48206e+08,1.08706,45824,1149,55,59801,539,314,322877,61,2721,0


Converting to forward existential form...Done !
original formula: A((((i0.u0.p6==1)&&(i0.u0.p14==1))&&((i1.u5.p104==1)&&(i0.u21.p280==1))) U EF((!(EF((((i0.u0.p6==1)&&(i0.u21.p16==1))&&((i2.u8.p120==1)&&...331
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (!(E(TRUE U (((i0.u0.p6==1)&&(i0.u21.p16==1))&&((i2.u8.p120==1)&&(i0.u21.p280==1))))) ...918
Reverse transition relation is NOT exact ! Due to transitions t5, t89, t153, t184, t185, t187, t188, t198, t199, t201, t202, t205, t206, t208, t209, t212, ...696
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 599/599 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 266 transition count 593
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 266 transition count 593
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 265 transition count 592
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 265 transition count 592
Applied a total of 14 rules in 9 ms. Remains 265 /272 variables (removed 7) and now considering 592/599 (removed 7) transitions.
// Phase 1: matrix 592 rows 265 cols
[2025-05-31 00:40:03] [INFO ] Computed 12 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:40:03] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-05-31 00:40:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:40:03] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2025-05-31 00:40:03] [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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:11] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:11] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:11] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:12] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:12] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:12] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:12] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:12] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:13] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:13] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:13] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:13] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:13] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:13] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:14] [INFO ] Deduced a trap composed of 31 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:40:14] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:14] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:14] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:14] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:15] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:15] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:15] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:15] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:15] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:16] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:16] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:16] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:16] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:16] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:16] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:17] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:17] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:17] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:17] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:17] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:18] [INFO ] Deduced a trap composed of 21 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:40:18] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:18] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:18] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:19] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:22] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:23] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:23] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:23] [INFO ] Deduced a trap composed of 45 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:40:23] [INFO ] Deduced a trap composed of 45 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:40:23] [INFO ] Deduced a trap composed of 46 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:40:24] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:24] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:28] [INFO ] Deduced a trap composed of 44 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:40:28] [INFO ] Deduced a trap composed of 45 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:40:28] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:28] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:28] [INFO ] Deduced a trap composed of 47 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:40:28] [INFO ] Deduced a trap composed of 46 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:40:29] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:29] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:29] [INFO ] Deduced a trap composed of 42 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:40:29] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:29] [INFO ] Deduced a trap composed of 45 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:40:29] [INFO ] Deduced a trap composed of 46 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:40:30] [INFO ] Deduced a trap composed of 46 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:40:30] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:30] [INFO ] Deduced a trap composed of 46 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:40:30] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:30] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:31] [INFO ] Deduced a trap composed of 44 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:40:31] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:31] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:33] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:40:34] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 19 ms to minimize.
SMT process timed out in 30716ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 30719ms
Starting structural reductions in LTL mode, iteration 1 : 265/272 places, 592/599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31025 ms. Remains : 265/272 places, 592/599 transitions.
[2025-05-31 00:40:34] [INFO ] Flatten gal took : 21 ms
[2025-05-31 00:40:34] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:40:34] [INFO ] Input system was already deterministic with 592 transitions.
[2025-05-31 00:40:34] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:40:34] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:40:34] [INFO ] Time to serialize gal into /tmp/CTLFireability10379762295539717539.gal : 4 ms
[2025-05-31 00:40:34] [INFO ] Time to serialize properties into /tmp/CTLFireability89667995130336762.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/CTLFireability10379762295539717539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability89667995130336762.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:41:04] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:41:04] [INFO ] Applying decomposition
[2025-05-31 00:41:04] [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/graph2921381200731233825.txt' '-o' '/tmp/graph2921381200731233825.bin' '-w' '/tmp/graph2921381200731233825.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2921381200731233825.bin' '-l' '-1' '-v' '-w' '/tmp/graph2921381200731233825.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:41:04] [INFO ] Decomposing Gal with order
[2025-05-31 00:41:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:41:04] [INFO ] Removed a total of 1609 redundant transitions.
[2025-05-31 00:41:04] [INFO ] Flatten gal took : 40 ms
[2025-05-31 00:41:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 8 ms.
[2025-05-31 00:41:04] [INFO ] Time to serialize gal into /tmp/CTLFireability12785149958567652563.gal : 2 ms
[2025-05-31 00:41:04] [INFO ] Time to serialize properties into /tmp/CTLFireability14195750692791723458.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/CTLFireability12785149958567652563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14195750692791723458.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 599/599 transitions.
Graph (trivial) has 248 edges and 272 vertex of which 4 / 272 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 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 269 transition count 500
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 134 rules applied. Total rules applied 231 place count 173 transition count 462
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 24 rules applied. Total rules applied 255 place count 151 transition count 460
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 257 place count 149 transition count 460
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 257 place count 149 transition count 452
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 273 place count 141 transition count 452
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 280 place count 134 transition count 445
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 134 transition count 445
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 288 place count 133 transition count 438
Iterating global reduction 4 with 1 rules applied. Total rules applied 289 place count 133 transition count 438
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 381 place count 87 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 382 place count 87 transition count 391
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 393 place count 76 transition count 315
Iterating global reduction 5 with 11 rules applied. Total rules applied 404 place count 76 transition count 315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 8 rules applied. Total rules applied 412 place count 76 transition count 307
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 416 place count 72 transition count 307
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 7 with 2 rules applied. Total rules applied 418 place count 71 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 420 place count 71 transition count 304
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 7 with 1 rules applied. Total rules applied 421 place count 71 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 422 place count 70 transition count 303
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 423 place count 70 transition count 303
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 425 place count 68 transition count 301
Applied a total of 425 rules in 54 ms. Remains 68 /272 variables (removed 204) and now considering 301/599 (removed 298) transitions.
// Phase 1: matrix 301 rows 68 cols
[2025-05-31 00:41:34] [INFO ] Computed 11 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:41:34] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-05-31 00:41:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:41:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:41:34] [INFO ] Implicit Places using invariants and state equation in 141 ms returned [61, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 223 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 66/272 places, 301/599 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 300
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 300
Applied a total of 2 rules in 11 ms. Remains 65 /66 variables (removed 1) and now considering 300/301 (removed 1) transitions.
// Phase 1: matrix 300 rows 65 cols
[2025-05-31 00:41:34] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:41:34] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-05-31 00:41:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:41:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:41:35] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 65/272 places, 300/599 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 493 ms. Remains : 65/272 places, 300/599 transitions.
[2025-05-31 00:41:35] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:41:35] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:41:35] [INFO ] Input system was already deterministic with 300 transitions.
[2025-05-31 00:41:35] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:41:35] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:41:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17051817863536428854.gal : 3 ms
[2025-05-31 00:41:35] [INFO ] Time to serialize properties into /tmp/CTLFireability9464992095480797264.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/CTLFireability17051817863536428854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9464992095480797264.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:42:05] [INFO ] Flatten gal took : 21 ms
[2025-05-31 00:42:05] [INFO ] Applying decomposition
[2025-05-31 00:42:05] [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/graph17142676686426448922.txt' '-o' '/tmp/graph17142676686426448922.bin' '-w' '/tmp/graph17142676686426448922.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17142676686426448922.bin' '-l' '-1' '-v' '-w' '/tmp/graph17142676686426448922.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:42:05] [INFO ] Decomposing Gal with order
[2025-05-31 00:42:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:42:05] [INFO ] Removed a total of 1363 redundant transitions.
[2025-05-31 00:42:05] [INFO ] Flatten gal took : 26 ms
[2025-05-31 00:42:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 3 ms.
[2025-05-31 00:42:05] [INFO ] Time to serialize gal into /tmp/CTLFireability5417293682842696454.gal : 1 ms
[2025-05-31 00:42:05] [INFO ] Time to serialize properties into /tmp/CTLFireability15338192274421881177.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/CTLFireability5417293682842696454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15338192274421881177.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,9.46761e+07,0.084696,8744,809,59,8183,554,226,30564,72,2290,0


Converting to forward existential form...Done !
original formula: !(E((i4.u8.p111==1) U E(!(((((i2.u3.p75==1)&&(i0.u0.p6==1))&&((i0.u0.p17==1)&&(i6.u13.p178==1)))&&(i0.u20.p280==1))) U ((EF((i6.u15.p188=...249
=> equivalent forward existential formula: (([(FwdU(FwdU(FwdU(Init,(i4.u8.p111==1)),!(((((i2.u3.p75==1)&&(i0.u0.p6==1))&&((i0.u0.p17==1)&&(i6.u13.p178==1))...579
(forward)formula 0,0,0.360056,22184,1,0,33799,1033,502,89865,131,8426,62048
FORMULA AutonomousCar-PT-07b-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 599/599 transitions.
Graph (trivial) has 237 edges and 272 vertex of which 4 / 272 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 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 269 transition count 497
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 139 rules applied. Total rules applied 239 place count 170 transition count 457
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 263 place count 146 transition count 457
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 263 place count 146 transition count 450
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 277 place count 139 transition count 450
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 284 place count 132 transition count 443
Iterating global reduction 3 with 7 rules applied. Total rules applied 291 place count 132 transition count 443
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 292 place count 131 transition count 436
Iterating global reduction 3 with 1 rules applied. Total rules applied 293 place count 131 transition count 436
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 3 with 2 rules applied. Total rules applied 295 place count 131 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 296 place count 130 transition count 434
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 376 place count 90 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 377 place count 90 transition count 393
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 386 place count 81 transition count 334
Iterating global reduction 6 with 9 rules applied. Total rules applied 395 place count 81 transition count 334
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 11 rules applied. Total rules applied 406 place count 81 transition count 323
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 411 place count 76 transition count 323
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 8 with 2 rules applied. Total rules applied 413 place count 75 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 414 place count 75 transition count 321
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 415 place count 75 transition count 321
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 417 place count 73 transition count 319
Applied a total of 417 rules in 58 ms. Remains 73 /272 variables (removed 199) and now considering 319/599 (removed 280) transitions.
// Phase 1: matrix 319 rows 73 cols
[2025-05-31 00:42:05] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:42:05] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-31 00:42:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:42:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:42:05] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [66, 72]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 165 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 71/272 places, 319/599 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 71 transition count 318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 70 transition count 318
Applied a total of 2 rules in 9 ms. Remains 70 /71 variables (removed 1) and now considering 318/319 (removed 1) transitions.
// Phase 1: matrix 318 rows 70 cols
[2025-05-31 00:42:05] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:42:05] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-31 00:42:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:42:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:42:06] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 70/272 places, 318/599 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 404 ms. Remains : 70/272 places, 318/599 transitions.
[2025-05-31 00:42:06] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:42:06] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:42:06] [INFO ] Input system was already deterministic with 318 transitions.
[2025-05-31 00:42:06] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:42:06] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:42:06] [INFO ] Time to serialize gal into /tmp/CTLFireability9668518421840629363.gal : 3 ms
[2025-05-31 00:42:06] [INFO ] Time to serialize properties into /tmp/CTLFireability1593082313778168232.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/CTLFireability9668518421840629363.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1593082313778168232.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:42:36] [INFO ] Flatten gal took : 23 ms
[2025-05-31 00:42:36] [INFO ] Applying decomposition
[2025-05-31 00:42:36] [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/graph13256987019557914063.txt' '-o' '/tmp/graph13256987019557914063.bin' '-w' '/tmp/graph13256987019557914063.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13256987019557914063.bin' '-l' '-1' '-v' '-w' '/tmp/graph13256987019557914063.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:42:36] [INFO ] Decomposing Gal with order
[2025-05-31 00:42:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:42:36] [INFO ] Removed a total of 1337 redundant transitions.
[2025-05-31 00:42:36] [INFO ] Flatten gal took : 27 ms
[2025-05-31 00:42:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 3 ms.
[2025-05-31 00:42:36] [INFO ] Time to serialize gal into /tmp/CTLFireability8126986752985136863.gal : 0 ms
[2025-05-31 00:42:36] [INFO ] Time to serialize properties into /tmp/CTLFireability3872227982063702773.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/CTLFireability8126986752985136863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3872227982063702773.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 599/599 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 264 transition count 591
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 263 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 263 transition count 590
Applied a total of 18 rules in 9 ms. Remains 263 /272 variables (removed 9) and now considering 590/599 (removed 9) transitions.
// Phase 1: matrix 590 rows 263 cols
[2025-05-31 00:43:06] [INFO ] Computed 12 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:43:06] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-05-31 00:43:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:43:06] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2025-05-31 00:43:06] [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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 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:43:14] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:15] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:15] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:15] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:15] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:15] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:15] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:16] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:16] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:16] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:16] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:16] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:16] [INFO ] Deduced a trap composed of 40 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:43:17] [INFO ] Deduced a trap composed of 41 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:43:17] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:17] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:17] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:17] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:18] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:18] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 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:43:18] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:18] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:19] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:19] [INFO ] Deduced a trap composed of 28 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:43:19] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:19] [INFO ] Deduced a trap composed of 36 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:43:20] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:20] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:20] [INFO ] Deduced a trap composed of 31 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:43:20] [INFO ] Deduced a trap composed of 41 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:43:20] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:21] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:21] [INFO ] Deduced a trap composed of 41 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:43:21] [INFO ] Deduced a trap composed of 32 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:43:21] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:21] [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:43:22] [INFO ] Deduced a trap composed of 31 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:43:22] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:22] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:22] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/52 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:43:26] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:27] [INFO ] Deduced a trap composed of 44 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:43:27] [INFO ] Deduced a trap composed of 45 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:43:27] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:27] [INFO ] Deduced a trap composed of 44 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:43:27] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:28] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:28] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:30] [INFO ] Deduced a trap composed of 20 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:43:30] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 10/62 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:43:31] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:32] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:32] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:32] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:32] [INFO ] Deduced a trap composed of 45 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:43:32] [INFO ] Deduced a trap composed of 46 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:43:32] [INFO ] Deduced a trap composed of 46 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:43:33] [INFO ] Deduced a trap composed of 45 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:43:33] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:33] [INFO ] Deduced a trap composed of 46 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:43:33] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:33] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:33] [INFO ] Deduced a trap composed of 46 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:43:33] [INFO ] Deduced a trap composed of 46 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:43:34] [INFO ] Deduced a trap composed of 46 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:43:34] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/853 variables, and 78 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 589/391 constraints, Known Traps: 66/66 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/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 66/78 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:43:40] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:42] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 2/80 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:43:45] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:43:47] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD451 is UNSAT
At refinement iteration 6 (OVERLAPS) 590/853 variables, 263/345 constraints. Problems are: Problem set: 2 solved, 587 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/853 variables, 389/734 constraints. Problems are: Problem set: 2 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 853/853 variables, and 734 constraints, problems are : Problem set: 2 solved, 587 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 587/391 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60672ms problems are : Problem set: 2 solved, 587 unsolved
Search for dead transitions found 2 dead transitions in 60675ms
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 : 263/272 places, 588/599 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 262 transition count 588
Applied a total of 1 rules in 5 ms. Remains 262 /263 variables (removed 1) and now considering 588/588 (removed 0) transitions.
// Phase 1: matrix 588 rows 262 cols
[2025-05-31 00:44:07] [INFO ] Computed 12 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:44:07] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-05-31 00:44:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:44:08] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 262/272 places, 588/599 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61509 ms. Remains : 262/272 places, 588/599 transitions.
[2025-05-31 00:44:08] [INFO ] Flatten gal took : 20 ms
[2025-05-31 00:44:08] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:44:08] [INFO ] Input system was already deterministic with 588 transitions.
[2025-05-31 00:44:08] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:44:08] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:44:08] [INFO ] Time to serialize gal into /tmp/CTLFireability9095759748794145641.gal : 4 ms
[2025-05-31 00:44:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2213224752046760985.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/CTLFireability9095759748794145641.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2213224752046760985.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:44:38] [INFO ] Flatten gal took : 23 ms
[2025-05-31 00:44:38] [INFO ] Applying decomposition
[2025-05-31 00:44:38] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7396566748597434900.txt' '-o' '/tmp/graph7396566748597434900.bin' '-w' '/tmp/graph7396566748597434900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7396566748597434900.bin' '-l' '-1' '-v' '-w' '/tmp/graph7396566748597434900.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:44:38] [INFO ] Decomposing Gal with order
[2025-05-31 00:44:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:44:38] [INFO ] Removed a total of 1622 redundant transitions.
[2025-05-31 00:44:38] [INFO ] Flatten gal took : 38 ms
[2025-05-31 00:44:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 11 ms.
[2025-05-31 00:44:38] [INFO ] Time to serialize gal into /tmp/CTLFireability16570521955846811395.gal : 3 ms
[2025-05-31 00:44:38] [INFO ] Time to serialize properties into /tmp/CTLFireability3727129162530448322.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/CTLFireability16570521955846811395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3727129162530448322.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.70292e+13,9.30587,220400,3680,143,556474,4179,659,443031,93,23546,0


Converting to forward existential form...Done !
original formula: EX(AG(AX(((((u2.p6==0)||(u2.p14==0))||((i15.i1.u17.p61==0)||(u2.p280==0)))||((i9.i1.u59.p188==0)||(i8.u46.p154==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EX(!(((((u2.p6==0)||(u2.p14==0))||((i15.i1.u17.p61==0)||(u2.p280==0)))||((i9.i1.u59....200
Reverse transition relation is NOT exact ! Due to transitions t246, t248, t251, t279, t307, t349, t384, t412, t440, t585, i1.i1.t239, i1.i1.u11.t219, i1.i1...939
(forward)formula 0,0,21.206,337776,1,0,664916,4179,6406,934340,491,23546,1645943
FORMULA AutonomousCar-PT-07b-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 599/599 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 264 transition count 591
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 263 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 263 transition count 590
Applied a total of 18 rules in 9 ms. Remains 263 /272 variables (removed 9) and now considering 590/599 (removed 9) transitions.
// Phase 1: matrix 590 rows 263 cols
[2025-05-31 00:44:59] [INFO ] Computed 12 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:44:59] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-05-31 00:44:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:45:00] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2025-05-31 00:45: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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 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:45:08] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:08] [INFO ] Deduced a trap composed of 35 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:45:08] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:08] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:08] [INFO ] Deduced a trap composed of 38 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:45:08] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:08] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:09] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:09] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:09] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:09] [INFO ] Deduced a trap composed of 38 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:45:09] [INFO ] Deduced a trap composed of 39 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:45:09] [INFO ] Deduced a trap composed of 40 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:45:10] [INFO ] Deduced a trap composed of 41 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:45:10] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:10] [INFO ] Deduced a trap composed of 42 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:45:10] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:10] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:11] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:11] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 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:45:11] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:11] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:12] [INFO ] Deduced a trap composed of 34 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:45:12] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:12] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:12] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:13] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:13] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:13] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:13] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:13] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:14] [INFO ] Deduced a trap composed of 31 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:45:14] [INFO ] Deduced a trap composed of 41 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:45:14] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:14] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:14] [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:45:15] [INFO ] Deduced a trap composed of 31 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:45:15] [INFO ] Deduced a trap composed of 41 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:45:15] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:15] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/52 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:45:19] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:20] [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:45:20] [INFO ] Deduced a trap composed of 45 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:45:20] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:20] [INFO ] Deduced a trap composed of 44 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:45:20] [INFO ] Deduced a trap composed of 45 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:45:21] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:21] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:23] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:23] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 10/62 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:45:24] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:25] [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:45:25] [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:45:25] [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:45:25] [INFO ] Deduced a trap composed of 45 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:45:25] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:25] [INFO ] Deduced a trap composed of 46 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:45:26] [INFO ] Deduced a trap composed of 45 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:45:26] [INFO ] Deduced a trap composed of 46 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:45:26] [INFO ] Deduced a trap composed of 46 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:45:26] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:26] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:26] [INFO ] Deduced a trap composed of 46 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:45:27] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:27] [INFO ] Deduced a trap composed of 46 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:45:27] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/853 variables, and 78 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 589/391 constraints, Known Traps: 66/66 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/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 66/78 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:45:34] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:45:35] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 2/80 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:45:39] [INFO ] Deduced a trap composed of 31 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:45:40] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD451 is UNSAT
At refinement iteration 6 (OVERLAPS) 590/853 variables, 263/345 constraints. Problems are: Problem set: 2 solved, 587 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/853 variables, 389/734 constraints. Problems are: Problem set: 2 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 853/853 variables, and 734 constraints, problems are : Problem set: 2 solved, 587 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 587/391 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60699ms problems are : Problem set: 2 solved, 587 unsolved
Search for dead transitions found 2 dead transitions in 60701ms
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 : 263/272 places, 588/599 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 262 transition count 588
Applied a total of 1 rules in 4 ms. Remains 262 /263 variables (removed 1) and now considering 588/588 (removed 0) transitions.
// Phase 1: matrix 588 rows 262 cols
[2025-05-31 00:46:00] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:46:00] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-05-31 00:46:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:46:01] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 262/272 places, 588/599 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61569 ms. Remains : 262/272 places, 588/599 transitions.
[2025-05-31 00:46:01] [INFO ] Flatten gal took : 20 ms
[2025-05-31 00:46:01] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:46:01] [INFO ] Input system was already deterministic with 588 transitions.
[2025-05-31 00:46:01] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:46:01] [INFO ] Flatten gal took : 24 ms
[2025-05-31 00:46:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13595801444939614804.gal : 5 ms
[2025-05-31 00:46:01] [INFO ] Time to serialize properties into /tmp/CTLFireability10819237722841818694.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/CTLFireability13595801444939614804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10819237722841818694.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:46:31] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:46:31] [INFO ] Applying decomposition
[2025-05-31 00:46:31] [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/graph17718646889032670784.txt' '-o' '/tmp/graph17718646889032670784.bin' '-w' '/tmp/graph17718646889032670784.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17718646889032670784.bin' '-l' '-1' '-v' '-w' '/tmp/graph17718646889032670784.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:46:31] [INFO ] Decomposing Gal with order
[2025-05-31 00:46:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:46:31] [INFO ] Removed a total of 1610 redundant transitions.
[2025-05-31 00:46:31] [INFO ] Flatten gal took : 36 ms
[2025-05-31 00:46:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 5 ms.
[2025-05-31 00:46:31] [INFO ] Time to serialize gal into /tmp/CTLFireability17547643089252730046.gal : 3 ms
[2025-05-31 00:46:31] [INFO ] Time to serialize properties into /tmp/CTLFireability13720703273256581270.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/CTLFireability17547643089252730046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13720703273256581270.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 599/599 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 266 transition count 593
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 266 transition count 593
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 265 transition count 592
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 265 transition count 592
Applied a total of 14 rules in 15 ms. Remains 265 /272 variables (removed 7) and now considering 592/599 (removed 7) transitions.
// Phase 1: matrix 592 rows 265 cols
[2025-05-31 00:47:01] [INFO ] Computed 12 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:47:01] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-05-31 00:47:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:47:01] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2025-05-31 00:47:01] [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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:10] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:10] [INFO ] Deduced a trap composed of 19 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:47:10] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:10] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:10] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:11] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:11] [INFO ] Deduced a trap composed of 14 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:47:11] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:11] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:11] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:11] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:12] [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:47:12] [INFO ] Deduced a trap composed of 31 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:47:12] [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:47:12] [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:47:12] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:12] [INFO ] Deduced a trap composed of 64 places in 151 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:13] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:13] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:13] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:13] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:14] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:14] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:14] [INFO ] Deduced a trap composed of 24 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:47:14] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:14] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:14] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:15] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:15] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:15] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:15] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:15] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:16] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:16] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:16] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:16] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:16] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:17] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:17] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:17] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:20] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:21] [INFO ] Deduced a trap composed of 42 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:47:21] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:21] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:21] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:21] [INFO ] Deduced a trap composed of 46 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:47:21] [INFO ] Deduced a trap composed of 46 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:47:21] [INFO ] Deduced a trap composed of 46 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:47:21] [INFO ] Deduced a trap composed of 46 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:47:22] [INFO ] Deduced a trap composed of 42 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:47:22] [INFO ] Deduced a trap composed of 42 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:47:22] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:22] [INFO ] Deduced a trap composed of 45 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:47:22] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:22] [INFO ] Deduced a trap composed of 46 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:47:23] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:23] [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:47:23] [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:47:23] [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:47:23] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:24] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:24] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:25] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:25] [INFO ] Deduced a trap composed of 47 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:47:25] [INFO ] Deduced a trap composed of 46 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:47:25] [INFO ] Deduced a trap composed of 46 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:47:26] [INFO ] Deduced a trap composed of 43 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:47:26] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:26] [INFO ] Deduced a trap composed of 45 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:47:26] [INFO ] Deduced a trap composed of 45 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:47:26] [INFO ] Deduced a trap composed of 46 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:47:26] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:27] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 13/85 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:31] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:31] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 26 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 265/857 variables, and 87 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/265 constraints, PredecessorRefiner: 591/393 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 75/87 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD453 is UNSAT
At refinement iteration 4 (OVERLAPS) 592/857 variables, 265/352 constraints. Problems are: Problem set: 2 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/857 variables, 391/743 constraints. Problems are: Problem set: 2 solved, 589 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:56] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:58] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:00] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:00] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:00] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:01] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:01] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 857/857 variables, and 750 constraints, problems are : Problem set: 2 solved, 589 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 589/393 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60659ms problems are : Problem set: 2 solved, 589 unsolved
Search for dead transitions found 2 dead transitions in 60662ms
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 : 265/272 places, 590/599 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 264 transition count 590
Applied a total of 1 rules in 5 ms. Remains 264 /265 variables (removed 1) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 264 cols
[2025-05-31 00:48:02] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:48:02] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-05-31 00:48:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:48:02] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 264/272 places, 590/599 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61274 ms. Remains : 264/272 places, 590/599 transitions.
[2025-05-31 00:48:02] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:48:02] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:48:03] [INFO ] Input system was already deterministic with 590 transitions.
[2025-05-31 00:48:03] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:48:03] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:48:03] [INFO ] Time to serialize gal into /tmp/CTLFireability10152068190302392288.gal : 4 ms
[2025-05-31 00:48:03] [INFO ] Time to serialize properties into /tmp/CTLFireability13942757952092326530.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/CTLFireability10152068190302392288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13942757952092326530.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:48:33] [INFO ] Flatten gal took : 23 ms
[2025-05-31 00:48:33] [INFO ] Applying decomposition
[2025-05-31 00:48:33] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10091591587472883157.txt' '-o' '/tmp/graph10091591587472883157.bin' '-w' '/tmp/graph10091591587472883157.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10091591587472883157.bin' '-l' '-1' '-v' '-w' '/tmp/graph10091591587472883157.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:48:33] [INFO ] Decomposing Gal with order
[2025-05-31 00:48:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:48:33] [INFO ] Removed a total of 1604 redundant transitions.
[2025-05-31 00:48:33] [INFO ] Flatten gal took : 34 ms
[2025-05-31 00:48:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 5 ms.
[2025-05-31 00:48:33] [INFO ] Time to serialize gal into /tmp/CTLFireability9460754579421156227.gal : 2 ms
[2025-05-31 00:48:33] [INFO ] Time to serialize properties into /tmp/CTLFireability16237499516036798729.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/CTLFireability9460754579421156227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16237499516036798729.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 599/599 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 264 transition count 591
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 263 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 263 transition count 590
Applied a total of 18 rules in 16 ms. Remains 263 /272 variables (removed 9) and now considering 590/599 (removed 9) transitions.
// Phase 1: matrix 590 rows 263 cols
[2025-05-31 00:49:03] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:49:03] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-05-31 00:49:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:49:03] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2025-05-31 00:49:03] [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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 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:49:11] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:11] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:11] [INFO ] Deduced a trap composed of 36 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:49:12] [INFO ] Deduced a trap composed of 37 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:49:12] [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:49:12] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:12] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:12] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:12] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:12] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:13] [INFO ] Deduced a trap composed of 38 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:49:13] [INFO ] Deduced a trap composed of 39 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:49:13] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:13] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:13] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:13] [INFO ] Deduced a trap composed of 42 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:49:14] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:14] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:14] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:14] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 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:49:15] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:15] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:15] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:15] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:16] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:16] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:16] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:16] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:17] [INFO ] Deduced a trap composed of 31 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:49:17] [INFO ] Deduced a trap composed of 41 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:49:17] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:17] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:17] [INFO ] Deduced a trap composed of 41 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:49:18] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:18] [INFO ] Deduced a trap composed of 41 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:49:18] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:18] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:18] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:19] [INFO ] Deduced a trap composed of 32 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:49:19] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/52 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:49:23] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:24] [INFO ] Deduced a trap composed of 44 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:49:24] [INFO ] Deduced a trap composed of 45 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:49:24] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:24] [INFO ] Deduced a trap composed of 44 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:49:24] [INFO ] Deduced a trap composed of 45 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:49:25] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:25] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:27] [INFO ] Deduced a trap composed of 20 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:49:27] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 10/62 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:49:28] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:28] [INFO ] Deduced a trap composed of 42 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:49:29] [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:49:29] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:29] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:29] [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:49:29] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:30] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:30] [INFO ] Deduced a trap composed of 46 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:49:30] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:30] [INFO ] Deduced a trap composed of 46 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:49:30] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:30] [INFO ] Deduced a trap composed of 46 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:49:30] [INFO ] Deduced a trap composed of 46 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:49:30] [INFO ] Deduced a trap composed of 46 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:49:31] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/853 variables, and 78 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 589/391 constraints, Known Traps: 66/66 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/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 66/78 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:49: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:49:39] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 2/80 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:49:42] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:44] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD451 is UNSAT
At refinement iteration 6 (OVERLAPS) 590/853 variables, 263/345 constraints. Problems are: Problem set: 2 solved, 587 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/853 variables, 389/734 constraints. Problems are: Problem set: 2 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 853/853 variables, and 734 constraints, problems are : Problem set: 2 solved, 587 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 587/391 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60705ms problems are : Problem set: 2 solved, 587 unsolved
Search for dead transitions found 2 dead transitions in 60707ms
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 : 263/272 places, 588/599 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 262 transition count 588
Applied a total of 1 rules in 5 ms. Remains 262 /263 variables (removed 1) and now considering 588/588 (removed 0) transitions.
// Phase 1: matrix 588 rows 262 cols
[2025-05-31 00:50:04] [INFO ] Computed 12 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:50:04] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-05-31 00:50:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:50:04] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 262/272 places, 588/599 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61523 ms. Remains : 262/272 places, 588/599 transitions.
[2025-05-31 00:50:04] [INFO ] Flatten gal took : 20 ms
[2025-05-31 00:50:04] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:50:04] [INFO ] Input system was already deterministic with 588 transitions.
[2025-05-31 00:50:05] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:50:05] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:50:05] [INFO ] Time to serialize gal into /tmp/CTLFireability7688733516016948807.gal : 4 ms
[2025-05-31 00:50:05] [INFO ] Time to serialize properties into /tmp/CTLFireability13066293266273243214.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/CTLFireability7688733516016948807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13066293266273243214.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:50:35] [INFO ] Flatten gal took : 26 ms
[2025-05-31 00:50:35] [INFO ] Applying decomposition
[2025-05-31 00:50:35] [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/graph4765025969845273625.txt' '-o' '/tmp/graph4765025969845273625.bin' '-w' '/tmp/graph4765025969845273625.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4765025969845273625.bin' '-l' '-1' '-v' '-w' '/tmp/graph4765025969845273625.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:50:35] [INFO ] Decomposing Gal with order
[2025-05-31 00:50:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:50:35] [INFO ] Removed a total of 1598 redundant transitions.
[2025-05-31 00:50:35] [INFO ] Flatten gal took : 33 ms
[2025-05-31 00:50:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 5 ms.
[2025-05-31 00:50:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17144835076530265763.gal : 2 ms
[2025-05-31 00:50:35] [INFO ] Time to serialize properties into /tmp/CTLFireability3452602745479137948.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/CTLFireability17144835076530265763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3452602745479137948.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 599/599 transitions.
Graph (trivial) has 254 edges and 272 vertex of which 4 / 272 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 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 269 transition count 497
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 141 rules applied. Total rules applied 241 place count 170 transition count 455
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 26 rules applied. Total rules applied 267 place count 145 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 268 place count 144 transition count 454
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 268 place count 144 transition count 447
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 282 place count 137 transition count 447
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 289 place count 130 transition count 440
Iterating global reduction 4 with 7 rules applied. Total rules applied 296 place count 130 transition count 440
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 297 place count 129 transition count 433
Iterating global reduction 4 with 1 rules applied. Total rules applied 298 place count 129 transition count 433
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 4 with 2 rules applied. Total rules applied 300 place count 129 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 301 place count 128 transition count 431
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 94 rules applied. Total rules applied 395 place count 81 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 396 place count 81 transition count 383
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 408 place count 69 transition count 299
Iterating global reduction 7 with 12 rules applied. Total rules applied 420 place count 69 transition count 299
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 10 rules applied. Total rules applied 430 place count 69 transition count 289
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 435 place count 64 transition count 289
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 437 place count 63 transition count 288
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 438 place count 63 transition count 287
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 439 place count 63 transition count 287
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 441 place count 61 transition count 285
Applied a total of 441 rules in 58 ms. Remains 61 /272 variables (removed 211) and now considering 285/599 (removed 314) transitions.
// Phase 1: matrix 285 rows 61 cols
[2025-05-31 00:51:05] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:51:05] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-05-31 00:51:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:51:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:51:05] [INFO ] Implicit Places using invariants and state equation in 135 ms returned [54, 60]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 215 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 59/272 places, 285/599 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 59 transition count 284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 58 transition count 284
Applied a total of 2 rules in 10 ms. Remains 58 /59 variables (removed 1) and now considering 284/285 (removed 1) transitions.
// Phase 1: matrix 284 rows 58 cols
[2025-05-31 00:51:05] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:51:05] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-05-31 00:51:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:51:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:51:05] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 58/272 places, 284/599 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 480 ms. Remains : 58/272 places, 284/599 transitions.
[2025-05-31 00:51:05] [INFO ] Flatten gal took : 20 ms
[2025-05-31 00:51:05] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:51:05] [INFO ] Input system was already deterministic with 284 transitions.
[2025-05-31 00:51:05] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:51:05] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:51:05] [INFO ] Time to serialize gal into /tmp/CTLFireability15061240734845279382.gal : 3 ms
[2025-05-31 00:51:05] [INFO ] Time to serialize properties into /tmp/CTLFireability9482789097810373350.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/CTLFireability15061240734845279382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9482789097810373350.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:51:36] [INFO ] Flatten gal took : 26 ms
[2025-05-31 00:51:36] [INFO ] Applying decomposition
[2025-05-31 00:51:36] [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/graph15718466505366932608.txt' '-o' '/tmp/graph15718466505366932608.bin' '-w' '/tmp/graph15718466505366932608.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15718466505366932608.bin' '-l' '-1' '-v' '-w' '/tmp/graph15718466505366932608.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:51:36] [INFO ] Decomposing Gal with order
[2025-05-31 00:51:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:51:36] [INFO ] Removed a total of 1329 redundant transitions.
[2025-05-31 00:51:36] [INFO ] Flatten gal took : 21 ms
[2025-05-31 00:51:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 4 ms.
[2025-05-31 00:51:36] [INFO ] Time to serialize gal into /tmp/CTLFireability16602594895630272025.gal : 1 ms
[2025-05-31 00:51:36] [INFO ] Time to serialize properties into /tmp/CTLFireability16467789552772741139.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/CTLFireability16602594895630272025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16467789552772741139.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48582e+07,0.461057,24016,411,53,56139,676,302,45568,69,3913,0


Converting to forward existential form...Done !
original formula: EG(AF((((EF((((i0.u0.p6==1)&&(i0.u0.p14==1))&&((u3.p89==1)&&(i0.u17.p280==1)))) + (i0.u0.p6==0)) + ((i0.u0.p17==0)||(i6.u11.p209==0))) + ...190
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((((E(TRUE U (((i0.u0.p6==1)&&(i0.u0.p14==1))&&((u3.p89==1)&&(i0.u17.p280==1)))) + (i0.u0.p6==0...245
Reverse transition relation is NOT exact ! Due to transitions t5, t40, t44, t48, t52, t56, t60, t64, t68, t72, t76, t80, t84, t88, t92, t96, t100, t104, t1...538
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,25.1265,659476,1,0,1.58259e+06,2636,2766,1.69954e+06,329,27611,1998368
FORMULA AutonomousCar-PT-07b-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 599/599 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 265 transition count 592
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 265 transition count 592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 264 transition count 591
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 264 transition count 591
Applied a total of 16 rules in 10 ms. Remains 264 /272 variables (removed 8) and now considering 591/599 (removed 8) transitions.
// Phase 1: matrix 591 rows 264 cols
[2025-05-31 00:52:01] [INFO ] Computed 12 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:52:01] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-05-31 00:52:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:52:01] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2025-05-31 00:52:01] [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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:09] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:09] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:10] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:10] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:10] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:10] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:10] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:11] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:11] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:11] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:11] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:11] [INFO ] Deduced a trap composed of 32 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:52:11] [INFO ] Deduced a trap composed of 32 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:52:12] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:12] [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:52:12] [INFO ] Deduced a trap composed of 43 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:52:12] [INFO ] Deduced a trap composed of 46 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:52:12] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:12] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:13] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:13] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:13] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:13] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:14] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:14] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:14] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:14] [INFO ] Deduced a trap composed of 33 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:52:14] [INFO ] Deduced a trap composed of 35 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:52:15] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:15] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:15] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:15] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:15] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:16] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:16] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:16] [INFO ] Deduced a trap composed of 41 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:52:17] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:17] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:17] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:17] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:20] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:21] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:21] [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:52:22] [INFO ] Deduced a trap composed of 41 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:52:22] [INFO ] Deduced a trap composed of 41 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:52:22] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:22] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:23] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:23] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:23] [INFO ] Deduced a trap composed of 41 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:52:23] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:23] [INFO ] Deduced a trap composed of 44 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:52:23] [INFO ] Deduced a trap composed of 45 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:52:24] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:27] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:28] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:29] [INFO ] Deduced a trap composed of 42 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:52:29] [INFO ] Deduced a trap composed of 32 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:52:29] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:29] [INFO ] Deduced a trap composed of 35 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:52:29] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/855 variables, and 73 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 590/392 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:35] [INFO ] Deduced a trap composed of 40 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:52:36] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:37] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:37] [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:52:37] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:40] [INFO ] Deduced a trap composed of 44 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:52:41] [INFO ] Deduced a trap composed of 45 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:52:41] [INFO ] Deduced a trap composed of 46 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:52:41] [INFO ] Deduced a trap composed of 42 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:52:41] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:41] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:41] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:42] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:42] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:42] [INFO ] Deduced a trap composed of 45 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:52:42] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:42] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:42] [INFO ] Deduced a trap composed of 43 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:52:42] [INFO ] Deduced a trap composed of 44 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:52:43] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD452 is UNSAT
At refinement iteration 6 (OVERLAPS) 591/855 variables, 264/357 constraints. Problems are: Problem set: 2 solved, 588 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/855 variables, 390/747 constraints. Problems are: Problem set: 2 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 855/855 variables, and 747 constraints, problems are : Problem set: 2 solved, 588 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 588/392 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60654ms problems are : Problem set: 2 solved, 588 unsolved
Search for dead transitions found 2 dead transitions in 60656ms
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 : 264/272 places, 589/599 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 263 transition count 589
Applied a total of 1 rules in 4 ms. Remains 263 /264 variables (removed 1) and now considering 589/589 (removed 0) transitions.
// Phase 1: matrix 589 rows 263 cols
[2025-05-31 00:53:02] [INFO ] Computed 12 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:53:02] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-05-31 00:53:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:53:02] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/272 places, 589/599 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61467 ms. Remains : 263/272 places, 589/599 transitions.
[2025-05-31 00:53:02] [INFO ] Flatten gal took : 20 ms
[2025-05-31 00:53:02] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:53:02] [INFO ] Input system was already deterministic with 589 transitions.
[2025-05-31 00:53:02] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:53:02] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:53:02] [INFO ] Time to serialize gal into /tmp/CTLFireability5742628564196212215.gal : 6 ms
[2025-05-31 00:53:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14175051213168216402.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/CTLFireability5742628564196212215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14175051213168216402.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:53:33] [INFO ] Flatten gal took : 25 ms
[2025-05-31 00:53:33] [INFO ] Applying decomposition
[2025-05-31 00:53:33] [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/graph11163079976005300275.txt' '-o' '/tmp/graph11163079976005300275.bin' '-w' '/tmp/graph11163079976005300275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11163079976005300275.bin' '-l' '-1' '-v' '-w' '/tmp/graph11163079976005300275.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:53:33] [INFO ] Decomposing Gal with order
[2025-05-31 00:53:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:53:33] [INFO ] Removed a total of 1600 redundant transitions.
[2025-05-31 00:53:33] [INFO ] Flatten gal took : 32 ms
[2025-05-31 00:53:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 9 ms.
[2025-05-31 00:53:33] [INFO ] Time to serialize gal into /tmp/CTLFireability3072212079182051005.gal : 2 ms
[2025-05-31 00:53:33] [INFO ] Time to serialize properties into /tmp/CTLFireability6980197631421879133.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/CTLFireability3072212079182051005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6980197631421879133.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,2.70292e+13,19.0953,641956,9078,121,493185,1775,653,6.95012e+06,91,12105,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 599/599 transitions.
Graph (trivial) has 255 edges and 272 vertex of which 4 / 272 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 269 transition count 496
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 142 rules applied. Total rules applied 243 place count 169 transition count 454
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 268 place count 144 transition count 454
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 268 place count 144 transition count 447
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 282 place count 137 transition count 447
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 289 place count 130 transition count 440
Iterating global reduction 3 with 7 rules applied. Total rules applied 296 place count 130 transition count 440
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 297 place count 129 transition count 433
Iterating global reduction 3 with 1 rules applied. Total rules applied 298 place count 129 transition count 433
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 3 with 2 rules applied. Total rules applied 300 place count 129 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 301 place count 128 transition count 431
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 395 place count 81 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 396 place count 81 transition count 383
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 409 place count 68 transition count 291
Iterating global reduction 6 with 13 rules applied. Total rules applied 422 place count 68 transition count 291
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 10 rules applied. Total rules applied 432 place count 68 transition count 281
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 437 place count 63 transition count 281
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 8 with 2 rules applied. Total rules applied 439 place count 62 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 440 place count 62 transition count 279
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 441 place count 62 transition count 279
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 443 place count 60 transition count 277
Applied a total of 443 rules in 59 ms. Remains 60 /272 variables (removed 212) and now considering 277/599 (removed 322) transitions.
// Phase 1: matrix 277 rows 60 cols
[2025-05-31 00:54:03] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:54:03] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-05-31 00:54:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:54:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:54:03] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [52, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 203 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 58/272 places, 277/599 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 58 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 57 transition count 276
Applied a total of 2 rules in 8 ms. Remains 57 /58 variables (removed 1) and now considering 276/277 (removed 1) transitions.
// Phase 1: matrix 276 rows 57 cols
[2025-05-31 00:54:03] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:54:03] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-31 00:54:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:54:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:54:03] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 57/272 places, 276/599 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 465 ms. Remains : 57/272 places, 276/599 transitions.
[2025-05-31 00:54:03] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:54:03] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:54:03] [INFO ] Input system was already deterministic with 276 transitions.
[2025-05-31 00:54:03] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:54:03] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:54:03] [INFO ] Time to serialize gal into /tmp/CTLFireability11067394111846867931.gal : 3 ms
[2025-05-31 00:54:03] [INFO ] Time to serialize properties into /tmp/CTLFireability17170806161142229482.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/CTLFireability11067394111846867931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17170806161142229482.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75918e+07,29.0151,688160,2,21176,5,1.6302e+06,6,0,502,1.40606e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-31 00:54:33] [INFO ] Flatten gal took : 21 ms
[2025-05-31 00:54:33] [INFO ] Applying decomposition
[2025-05-31 00:54:33] [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/graph2332131813936043515.txt' '-o' '/tmp/graph2332131813936043515.bin' '-w' '/tmp/graph2332131813936043515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2332131813936043515.bin' '-l' '-1' '-v' '-w' '/tmp/graph2332131813936043515.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:54:33] [INFO ] Decomposing Gal with order
[2025-05-31 00:54:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:54:34] [INFO ] Removed a total of 1309 redundant transitions.
[2025-05-31 00:54:34] [INFO ] Flatten gal took : 20 ms
[2025-05-31 00:54:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 4 ms.
[2025-05-31 00:54:34] [INFO ] Time to serialize gal into /tmp/CTLFireability13605405279258593864.gal : 1 ms
[2025-05-31 00:54:34] [INFO ] Time to serialize properties into /tmp/CTLFireability5697566396759300915.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/CTLFireability13605405279258593864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5697566396759300915.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75918e+07,1.22452,45088,907,44,97966,651,549,142739,67,3010,0


Converting to forward existential form...Done !
original formula: EF(AG(AF(((i9.u19.p320==1)||(((i0.u0.p6==1)&&(i0.u0.p14==1))&&((i8.u13.p240==1)&&(i0.u17.p280==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((i9.u19.p320==1)||(((i0.u0.p6==1)&&(i0.u0.p14==1))&&((i8.u13.p240==1)&&...191
Reverse transition relation is NOT exact ! Due to transitions t6, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55,...1046
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,15.1874,374172,1,0,619006,2114,4054,569682,314,19285,1116300
FORMULA AutonomousCar-PT-07b-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 599/599 transitions.
Graph (trivial) has 257 edges and 272 vertex of which 4 / 272 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 269 transition count 495
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 143 rules applied. Total rules applied 245 place count 168 transition count 453
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 270 place count 143 transition count 453
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 270 place count 143 transition count 446
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 284 place count 136 transition count 446
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 291 place count 129 transition count 439
Iterating global reduction 3 with 7 rules applied. Total rules applied 298 place count 129 transition count 439
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 299 place count 128 transition count 432
Iterating global reduction 3 with 1 rules applied. Total rules applied 300 place count 128 transition count 432
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 3 with 2 rules applied. Total rules applied 302 place count 128 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 303 place count 127 transition count 430
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 397 place count 80 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 398 place count 80 transition count 382
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 411 place count 67 transition count 290
Iterating global reduction 6 with 13 rules applied. Total rules applied 424 place count 67 transition count 290
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 10 rules applied. Total rules applied 434 place count 67 transition count 280
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 439 place count 62 transition count 280
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 8 with 2 rules applied. Total rules applied 441 place count 61 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 442 place count 61 transition count 278
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 443 place count 61 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 445 place count 59 transition count 276
Applied a total of 445 rules in 57 ms. Remains 59 /272 variables (removed 213) and now considering 276/599 (removed 323) transitions.
// Phase 1: matrix 276 rows 59 cols
[2025-05-31 00:54:49] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:54:49] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-05-31 00:54:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:54:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:54:49] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [52, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 199 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 57/272 places, 276/599 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 57 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 275
Applied a total of 2 rules in 11 ms. Remains 56 /57 variables (removed 1) and now considering 275/276 (removed 1) transitions.
// Phase 1: matrix 275 rows 56 cols
[2025-05-31 00:54:49] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:54:49] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-05-31 00:54:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:54:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:54:49] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 56/272 places, 275/599 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 463 ms. Remains : 56/272 places, 275/599 transitions.
[2025-05-31 00:54:49] [INFO ] Flatten gal took : 20 ms
[2025-05-31 00:54:49] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:54:49] [INFO ] Input system was already deterministic with 275 transitions.
[2025-05-31 00:54:49] [INFO ] Flatten gal took : 34 ms
[2025-05-31 00:54:49] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:54:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality525389294005026785.gal : 3 ms
[2025-05-31 00:54:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15692765709235348776.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality525389294005026785.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15692765709235348776.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
RANDOM walk for 40000 steps (2270 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (191 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality15692765709235348776.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 78
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :78 after 348
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :348 after 1858
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1858 after 2318
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2318 after 11686
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :11686 after 58866
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :58866 after 309996
Finished probabilistic random walk after 545589 steps, run visited all 1 properties in 636 ms. (steps per millisecond=857 )
Probabilistic random walk after 545589 steps, saw 83530 distinct states, run finished after 640 ms. (steps per millisecond=852 ) properties seen :1
FORMULA AutonomousCar-PT-07b-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 599/599 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 265 transition count 592
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 265 transition count 592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 264 transition count 591
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 264 transition count 591
Applied a total of 16 rules in 11 ms. Remains 264 /272 variables (removed 8) and now considering 591/599 (removed 8) transitions.
// Phase 1: matrix 591 rows 264 cols
[2025-05-31 00:54:50] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:54:50] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-05-31 00:54:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:54:50] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2025-05-31 00:54:50] [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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:58] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:59] [INFO ] Deduced a trap composed of 20 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:54:59] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:59] [INFO ] Deduced a trap composed of 21 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:54:59] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:59] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:00] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:00] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:00] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:00] [INFO ] Deduced a trap composed of 39 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:55:00] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:00] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:01] [INFO ] Deduced a trap composed of 31 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:55:01] [INFO ] Deduced a trap composed of 31 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:55:01] [INFO ] Deduced a trap composed of 31 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:55:01] [INFO ] Deduced a trap composed of 31 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:55:01] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:01] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:01] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:02] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:02] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:02] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:03] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:03] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:03] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:03] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:03] [INFO ] Deduced a trap composed of 41 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:55:04] [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:55:04] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:04] [INFO ] Deduced a trap composed of 45 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:55:04] [INFO ] Deduced a trap composed of 46 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:55:04] [INFO ] Deduced a trap composed of 46 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:55:04] [INFO ] Deduced a trap composed of 42 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:55:05] [INFO ] Deduced a trap composed of 43 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:55:05] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:05] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:05] [INFO ] Deduced a trap composed of 45 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:55:05] [INFO ] Deduced a trap composed of 42 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:55:05] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:06] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:09] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:09] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:09] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:09] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:10] [INFO ] Deduced a trap composed of 41 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:55:11] [INFO ] Deduced a trap composed of 42 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:55:11] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:11] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:11] [INFO ] Deduced a trap composed of 30 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:55:12] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:12] [INFO ] Deduced a trap composed of 15 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:55:12] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:12] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:16] [INFO ] Deduced a trap composed of 32 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:55:16] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:16] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:16] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:16] [INFO ] Deduced a trap composed of 42 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:55:17] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:17] [INFO ] Deduced a trap composed of 43 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:55:17] [INFO ] Deduced a trap composed of 32 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:55:17] [INFO ] Deduced a trap composed of 44 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:55:17] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:18] [INFO ] Deduced a trap composed of 31 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:55:18] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:18] [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:55:18] [INFO ] Deduced a trap composed of 21 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:55:19] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/855 variables, and 80 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 590/392 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 68/80 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:25] [INFO ] Deduced a trap composed of 25 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:55:25] [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:55:25] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:25] [INFO ] Deduced a trap composed of 46 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:55:25] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:26] [INFO ] Deduced a trap composed of 31 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:55:26] [INFO ] Deduced a trap composed of 46 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:55:26] [INFO ] Deduced a trap composed of 31 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:55:26] [INFO ] Deduced a trap composed of 46 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:55:26] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:27] [INFO ] Deduced a trap composed of 41 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:55:27] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:27] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 13/93 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD452 is UNSAT
At refinement iteration 5 (OVERLAPS) 591/855 variables, 264/357 constraints. Problems are: Problem set: 2 solved, 588 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 390/747 constraints. Problems are: Problem set: 2 solved, 588 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 Int declared 855/855 variables, and 747 constraints, problems are : Problem set: 2 solved, 588 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 588/392 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60758ms problems are : Problem set: 2 solved, 588 unsolved
Search for dead transitions found 2 dead transitions in 60761ms
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 : 264/272 places, 589/599 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 263 transition count 589
Applied a total of 1 rules in 5 ms. Remains 263 /264 variables (removed 1) and now considering 589/589 (removed 0) transitions.
// Phase 1: matrix 589 rows 263 cols
[2025-05-31 00:55:51] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:55:51] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-05-31 00:55:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:55:52] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/272 places, 589/599 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61506 ms. Remains : 263/272 places, 589/599 transitions.
[2025-05-31 00:55:52] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:55:52] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:55:52] [INFO ] Input system was already deterministic with 589 transitions.
[2025-05-31 00:55:52] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:55:52] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:55:52] [INFO ] Time to serialize gal into /tmp/CTLFireability2205312588165136842.gal : 4 ms
[2025-05-31 00:55:52] [INFO ] Time to serialize properties into /tmp/CTLFireability12072886152066274000.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/CTLFireability2205312588165136842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12072886152066274000.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:56:22] [INFO ] Flatten gal took : 21 ms
[2025-05-31 00:56:22] [INFO ] Applying decomposition
[2025-05-31 00:56:22] [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/graph13121405094012588663.txt' '-o' '/tmp/graph13121405094012588663.bin' '-w' '/tmp/graph13121405094012588663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13121405094012588663.bin' '-l' '-1' '-v' '-w' '/tmp/graph13121405094012588663.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:56:22] [INFO ] Decomposing Gal with order
[2025-05-31 00:56:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:56:22] [INFO ] Removed a total of 1606 redundant transitions.
[2025-05-31 00:56:22] [INFO ] Flatten gal took : 34 ms
[2025-05-31 00:56:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 4 ms.
[2025-05-31 00:56:22] [INFO ] Time to serialize gal into /tmp/CTLFireability18128190399665268460.gal : 2 ms
[2025-05-31 00:56:22] [INFO ] Time to serialize properties into /tmp/CTLFireability12313635313004067368.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/CTLFireability18128190399665268460.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12313635313004067368.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75983e+13,4.5135,178464,8731,121,323437,1526,624,1.20554e+06,96,6475,0


Converting to forward existential form...Done !
original formula: EF(EX((EG(((((i4.u20.p65==1)&&(i4.u29.p96==1))&&((i4.u37.p121==1)&&(i4.u46.p152==1)))&&(((i4.u57.p189==1)&&(i4.u63.p214==1))&&((i4.u73.p2...212
=> equivalent forward existential formula: [(EY(FwdU((EY(FwdU(Init,TRUE)) * EG(((((i4.u20.p65==1)&&(i4.u29.p96==1))&&((i4.u37.p121==1)&&(i4.u46.p152==1)))&...271
Reverse transition relation is NOT exact ! Due to transitions t84, t110, t136, t162, t188, t214, t240, t247, t249, t251, t307, t440, t586, i1.u11.t219, i2....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
Detected timeout of ITS tools.
[2025-05-31 00:56:52] [INFO ] Flatten gal took : 22 ms
[2025-05-31 00:56:52] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:56:52] [INFO ] Applying decomposition
[2025-05-31 00:56:52] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7880629193002955960.txt' '-o' '/tmp/graph7880629193002955960.bin' '-w' '/tmp/graph7880629193002955960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7880629193002955960.bin' '-l' '-1' '-v' '-w' '/tmp/graph7880629193002955960.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:56:52] [INFO ] Decomposing Gal with order
[2025-05-31 00:56:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:56:52] [INFO ] Removed a total of 1623 redundant transitions.
[2025-05-31 00:56:52] [INFO ] Flatten gal took : 34 ms
[2025-05-31 00:56:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 4 ms.
[2025-05-31 00:56:52] [INFO ] Time to serialize gal into /tmp/CTLFireability6209756598671935507.gal : 2 ms
[2025-05-31 00:56:52] [INFO ] Time to serialize properties into /tmp/CTLFireability6662406953180695903.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/CTLFireability6209756598671935507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6662406953180695903.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 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.12942e+13,6.05827,238580,9490,120,434355,1424,682,1.65129e+06,98,6561,0


Converting to forward existential form...Done !
original formula: (AX(((AX(FALSE) * AG(EX(((((i5.u22.p65==0)||(i5.u33.p96==0))||((i5.u43.p127==0)||(i5.u51.p152==0)))||(((i5.u63.p189==0)||(i5.u73.p220==0)...259
=> equivalent forward existential formula: [FwdG((Init * !(!(EX(!(((!(EX(!(FALSE))) * !(E(TRUE U !(EX(((((i5.u22.p65==0)||(i5.u33.p96==0))||((i5.u43.p127==...343
Reverse transition relation is NOT exact ! Due to transitions t86, t113, t140, t166, t192, t221, t228, t249, t256, t258, t266, t301, t322, t399, t427, t596...876
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2025-05-31 01:01:25] [INFO ] Applying decomposition
[2025-05-31 01:01:25] [INFO ] Flatten gal took : 20 ms
[2025-05-31 01:01:25] [INFO ] Decomposing Gal with order
[2025-05-31 01:01:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:01:25] [INFO ] Removed a total of 1761 redundant transitions.
[2025-05-31 01:01:25] [INFO ] Flatten gal took : 34 ms
[2025-05-31 01:01:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 5 ms.
[2025-05-31 01:01:25] [INFO ] Time to serialize gal into /tmp/CTLFireability3051792234538353296.gal : 2 ms
[2025-05-31 01:01:25] [INFO ] Time to serialize properties into /tmp/CTLFireability14807497875901968740.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/CTLFireability3051792234538353296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14807497875901968740.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 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.12942e+13,0.083245,7172,574,963,3300,2796,245,9493,288,15504,0


Converting to forward existential form...Done !
original formula: (AX(((AX(FALSE) * AG(EX(((((i1.i0.i0.i0.i0.i0.i0.i0.u12.p65==0)||(i1.i0.i0.i0.i0.i0.i0.i0.u13.p96==0))||((i1.i0.i0.i0.i0.i0.i0.u14.p127==...389
=> equivalent forward existential formula: [FwdG((Init * !(!(EX(!(((!(EX(!(FALSE))) * !(E(TRUE U !(EX(((((i1.i0.i0.i0.i0.i0.i0.i0.u12.p65==0)||(i1.i0.i0.i0...473
Reverse transition relation is NOT exact ! Due to transitions t323, i0.u2.t258, i0.u3.t256, i1.t596, i1.i0.u19.t33, i1.i0.u19.t36, i1.i0.u19.t37, i1.i0.u19...1610
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
(forward)formula 0,1,27.1838,906972,1,0,1.44718e+06,103959,6175,6.7463e+06,2318,648541,447846
FORMULA AutonomousCar-PT-07b-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A((((i0.u2.p6==1)&&(i0.u3.p14==1))&&((i1.i0.i0.i0.i0.i0.i0.u14.p104==1)&&(i1.i0.u19.p280==1))) U EF((!(EF((((i0.u2.p6==1)&&(i0.u3.p16==1)...483
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (!(E(TRUE U (((i0.u2.p6==1)&&(i0.u3.p16==1))&&((i1.i0.i0.i0.i0.i0.i0.u14.p120==1)&&(i1...1330
(forward)formula 1,1,103.426,2240212,1,0,3.41407e+06,109770,788,1.89162e+07,1007,739293,279481
FORMULA AutonomousCar-PT-07b-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF(((i1.i0.i0.i0.i0.i0.i0.i0.u13.p75==1) + (!(A((((i0.u2.p6==1)&&(i0.u3.p18==1))&&((i1.i0.i0.i0.i0.i0.i0.i0.u13.p89==1)&&(i1.i0.u19.p280...1346
Detected timeout of ITS tools.
=> equivalent forward existential formula: ((([((FwdU((Init * !(E(TRUE U ((i1.i0.i0.i0.i0.i0.i0.i0.u13.p75==1) + (!(!((E(!((((i0.u2.p6==1)&&(i0.u3.p9==1))&...2705
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 01:29:09] [INFO ] Flatten gal took : 20 ms
[2025-05-31 01:29:09] [INFO ] Input system was already deterministic with 599 transitions.
[2025-05-31 01:29:09] [INFO ] Transformed 272 places.
[2025-05-31 01:29:09] [INFO ] Transformed 599 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:29:09] [INFO ] Time to serialize gal into /tmp/CTLFireability9722181800849441626.gal : 8 ms
[2025-05-31 01:29:09] [INFO ] Time to serialize properties into /tmp/CTLFireability17983607475093664833.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/CTLFireability9722181800849441626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17983607475093664833.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 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.12942e+13,29.0646,737112,2,297132,5,3.98333e+06,6,0,1689,1.92005e+06,0


Converting to forward existential form...Done !

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

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