Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729800689.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is AutonomousCar-PT-06b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729800689
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 228K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748650434039

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-31 00:13:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 00:13:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:13:55] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2025-05-31 00:13:55] [INFO ] Transformed 289 places.
[2025-05-31 00:13:55] [INFO ] Transformed 644 transitions.
[2025-05-31 00:13:55] [INFO ] Found NUPN structural information;
[2025-05-31 00:13:55] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 116 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 269 transition count 624
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 269 transition count 624
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 184 place count 269 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 185 place count 268 transition count 479
Iterating global reduction 1 with 1 rules applied. Total rules applied 186 place count 268 transition count 479
Applied a total of 186 rules in 64 ms. Remains 268 /289 variables (removed 21) and now considering 479/644 (removed 165) transitions.
// Phase 1: matrix 479 rows 268 cols
[2025-05-31 00:13:55] [INFO ] Computed 11 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:13:55] [INFO ] Implicit Places using invariants in 293 ms returned []
[2025-05-31 00:13:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:13:56] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 478 sub problems to find dead transitions.
[2025-05-31 00:13:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:03] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:03] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:03] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:03] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:03] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:03] [INFO ] Deduced a trap composed of 25 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:14:04] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:04] [INFO ] Deduced a trap composed of 32 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:14:04] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:04] [INFO ] Deduced a trap composed of 34 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:14:04] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:04] [INFO ] Deduced a trap composed of 36 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:14:04] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:05] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:05] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:05] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:05] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:05] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:06] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:06] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:06] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:07] [INFO ] Deduced a trap composed of 35 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:14:07] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:07] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:07] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:07] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:07] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:08] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:08] [INFO ] Deduced a trap composed of 37 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:14:08] [INFO ] Deduced a trap composed of 37 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:14:08] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:08] [INFO ] Deduced a trap composed of 40 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:14:09] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:09] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:09] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:09] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:09] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:09] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:10] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:10] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:12] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:13] [INFO ] Deduced a trap composed of 20 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:14:14] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:14] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:14] [INFO ] Deduced a trap composed of 37 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:14:15] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:15] [INFO ] Deduced a trap composed of 11 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:14:16] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:17] [INFO ] Deduced a trap composed of 37 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:14:17] [INFO ] Deduced a trap composed of 38 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:14:17] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:18] [INFO ] Deduced a trap composed of 33 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:14:18] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:18] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:19] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:19] [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:14:19] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 268/747 variables, and 68 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/268 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 57/68 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD403 is UNSAT
At refinement iteration 4 (OVERLAPS) 479/747 variables, 268/336 constraints. Problems are: Problem set: 2 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 476/812 constraints. Problems are: Problem set: 2 solved, 476 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:43] [INFO ] Deduced a trap composed of 35 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:14:45] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:45] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:46] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:46] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:47] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:48] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:14:48] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 8/820 constraints. Problems are: Problem set: 2 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 747/747 variables, and 820 constraints, problems are : Problem set: 2 solved, 476 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 476/478 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60643ms problems are : Problem set: 2 solved, 476 unsolved
Search for dead transitions found 2 dead transitions in 60665ms
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 : 268/289 places, 477/644 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 267 transition count 477
Applied a total of 1 rules in 8 ms. Remains 267 /268 variables (removed 1) and now considering 477/477 (removed 0) transitions.
// Phase 1: matrix 477 rows 267 cols
[2025-05-31 00:14:56] [INFO ] Computed 11 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:14:56] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-05-31 00:14:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:14:57] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 267/289 places, 477/644 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61662 ms. Remains : 267/289 places, 477/644 transitions.
Support contains 116 out of 267 places after structural reductions.
[2025-05-31 00:14:57] [INFO ] Flatten gal took : 92 ms
[2025-05-31 00:14:57] [INFO ] Flatten gal took : 53 ms
[2025-05-31 00:14:57] [INFO ] Input system was already deterministic with 477 transitions.
Support contains 107 out of 267 places (down from 116) after GAL structural reductions.
RANDOM walk for 40000 steps (187 resets) in 1542 ms. (25 steps per ms) remains 7/80 properties
BEST_FIRST walk for 40004 steps (74 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (62 resets) in 120 ms. (330 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (58 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (76 resets) in 84 ms. (470 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (65 resets) in 94 ms. (421 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (72 resets) in 75 ms. (526 steps per ms) remains 2/4 properties
[2025-05-31 00:14:58] [INFO ] Invariant cache hit.
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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp78 is UNSAT
At refinement iteration 1 (OVERLAPS) 99/105 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 162/267 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 477/744 variables, 267/278 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/744 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 744/744 variables, and 278 constraints, problems are : Problem set: 1 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp30 is UNSAT
After SMT solving in domain Int declared 80/744 variables, and 3 constraints, problems are : Problem set: 2 solved, 0 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 3/11 constraints, State Equation: 0/267 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2025-05-31 00:14:58] [INFO ] Flatten gal took : 35 ms
[2025-05-31 00:14:58] [INFO ] Flatten gal took : 38 ms
[2025-05-31 00:14:58] [INFO ] Input system was already deterministic with 477 transitions.
Support contains 92 out of 267 places (down from 104) after GAL structural reductions.
Computed a total of 49 stabilizing places and 49 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 477/477 transitions.
Graph (trivial) has 248 edges and 267 vertex of which 4 / 267 are part of one of the 2 SCC in 2 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 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 113 place count 264 transition count 362
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 146 rules applied. Total rules applied 259 place count 152 transition count 328
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 22 rules applied. Total rules applied 281 place count 132 transition count 326
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 283 place count 130 transition count 326
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 283 place count 130 transition count 320
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 295 place count 124 transition count 320
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 308 place count 111 transition count 307
Iterating global reduction 4 with 13 rules applied. Total rules applied 321 place count 111 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 322 place count 111 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 322 place count 111 transition count 305
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 324 place count 110 transition count 305
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 327 place count 107 transition count 292
Iterating global reduction 5 with 3 rules applied. Total rules applied 330 place count 107 transition count 292
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 334 place count 107 transition count 288
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 336 place count 105 transition count 288
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 406 place count 70 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 407 place count 70 transition count 252
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 416 place count 61 transition count 193
Iterating global reduction 8 with 9 rules applied. Total rules applied 425 place count 61 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 6 rules applied. Total rules applied 431 place count 61 transition count 187
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 434 place count 58 transition count 187
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 10 with 2 rules applied. Total rules applied 436 place count 57 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 437 place count 57 transition count 185
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 438 place count 57 transition count 185
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 440 place count 55 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 441 place count 54 transition count 183
Applied a total of 441 rules in 164 ms. Remains 54 /267 variables (removed 213) and now considering 183/477 (removed 294) transitions.
// Phase 1: matrix 183 rows 54 cols
[2025-05-31 00:14:59] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:14:59] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-05-31 00:14:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:14:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:14:59] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [47, 53]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 256 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 52/267 places, 183/477 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 51 transition count 181
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 50 transition count 181
Applied a total of 4 rules in 10 ms. Remains 50 /52 variables (removed 2) and now considering 181/183 (removed 2) transitions.
// Phase 1: matrix 181 rows 50 cols
[2025-05-31 00:14:59] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:14:59] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-05-31 00:14:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:14:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:14:59] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 50/267 places, 181/477 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 594 ms. Remains : 50/267 places, 181/477 transitions.
[2025-05-31 00:14:59] [INFO ] Flatten gal took : 31 ms
[2025-05-31 00:14:59] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:14:59] [INFO ] Input system was already deterministic with 181 transitions.
[2025-05-31 00:14:59] [INFO ] Flatten gal took : 20 ms
[2025-05-31 00:14:59] [INFO ] Flatten gal took : 16 ms
[2025-05-31 00:14:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality6036278056913358631.gal : 14 ms
[2025-05-31 00:14:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality6936765052699722387.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/CTLCardinality6036278056913358631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6936765052699722387.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.94002e+06,0.786565,29576,2,1250,5,69708,6,0,380,93287,0


Converting to forward existential form...Done !
original formula: EF((AG((p118==1)) + ((p140==0)&&(p272==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((p118==1)))))] != FALSE + [(FwdU(Init,TRUE) * ((p140==0)&&(p272==1)))] != FALS...157
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t9, t11, t13, t18, t20, t21, t24, t26, t28, t30, t98, t178, Intersection...242
(forward)formula 0,1,1.57449,36872,1,0,394,125056,383,190,5871,114638,399
FORMULA AutonomousCar-PT-06b-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 477/477 transitions.
Graph (trivial) has 254 edges and 267 vertex of which 4 / 267 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 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 264 transition count 357
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 152 rules applied. Total rules applied 270 place count 147 transition count 322
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 290 place count 127 transition count 322
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 290 place count 127 transition count 316
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 302 place count 121 transition count 316
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 314 place count 109 transition count 304
Iterating global reduction 3 with 12 rules applied. Total rules applied 326 place count 109 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 326 place count 109 transition count 303
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 328 place count 108 transition count 303
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 331 place count 105 transition count 290
Iterating global reduction 3 with 3 rules applied. Total rules applied 334 place count 105 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 338 place count 105 transition count 286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 340 place count 103 transition count 286
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 412 place count 67 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 413 place count 67 transition count 249
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 422 place count 58 transition count 189
Iterating global reduction 6 with 9 rules applied. Total rules applied 431 place count 58 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 6 rules applied. Total rules applied 437 place count 58 transition count 183
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 440 place count 55 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 442 place count 54 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 443 place count 54 transition count 181
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 445 place count 52 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 446 place count 51 transition count 179
Applied a total of 446 rules in 54 ms. Remains 51 /267 variables (removed 216) and now considering 179/477 (removed 298) transitions.
// Phase 1: matrix 179 rows 51 cols
[2025-05-31 00:15:01] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:15:01] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-05-31 00:15:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:15:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:15:01] [INFO ] Implicit Places using invariants and state equation in 292 ms returned [45, 50]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 374 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 49/267 places, 179/477 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 49 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 48 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 48 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 47 transition count 177
Applied a total of 4 rules in 15 ms. Remains 47 /49 variables (removed 2) and now considering 177/179 (removed 2) transitions.
// Phase 1: matrix 177 rows 47 cols
[2025-05-31 00:15:01] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:15:01] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-05-31 00:15:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:15:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:15:02] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 47/267 places, 177/477 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 721 ms. Remains : 47/267 places, 177/477 transitions.
[2025-05-31 00:15:02] [INFO ] Flatten gal took : 16 ms
[2025-05-31 00:15:02] [INFO ] Flatten gal took : 14 ms
[2025-05-31 00:15:02] [INFO ] Input system was already deterministic with 177 transitions.
[2025-05-31 00:15:02] [INFO ] Flatten gal took : 14 ms
[2025-05-31 00:15:02] [INFO ] Flatten gal took : 14 ms
[2025-05-31 00:15:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality10644759017542041040.gal : 6 ms
[2025-05-31 00:15:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality12772448111159458665.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/CTLCardinality10644759017542041040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12772448111159458665.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(AG(EF((p132==0))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U (p132==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t8, t10, t12, t14, t19, t21, t23, t25, t27, t29, t175, Intersection with...237
(forward)formula 0,0,14.3564,281308,1,0,394,1.1032e+06,380,191,6947,735752,400
FORMULA AutonomousCar-PT-06b-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 477/477 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 248 transition count 458
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 248 transition count 458
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 243 transition count 453
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 243 transition count 453
Applied a total of 48 rules in 15 ms. Remains 243 /267 variables (removed 24) and now considering 453/477 (removed 24) transitions.
// Phase 1: matrix 453 rows 243 cols
[2025-05-31 00:15:16] [INFO ] Computed 11 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:15:16] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-05-31 00:15:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:15:17] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 452 sub problems to find dead transitions.
[2025-05-31 00:15:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:22] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:22] [INFO ] Deduced a trap composed of 15 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:15:22] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:23] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:23] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:23] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:23] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:23] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:23] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:23] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:23] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:24] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:24] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:24] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:24] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:24] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:24] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:24] [INFO ] Deduced a trap composed of 33 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:15:25] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:25] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:25] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:25] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:25] [INFO ] Deduced a trap composed of 27 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:15:26] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:26] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:26] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:26] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:26] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:26] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:26] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:26] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:27] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:27] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:27] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:27] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:27] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:27] [INFO ] Deduced a trap composed of 44 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:15:27] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:28] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:28] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:31] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:31] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:31] [INFO ] Deduced a trap composed of 43 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:15:32] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:32] [INFO ] Deduced a trap composed of 21 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:15:32] [INFO ] Deduced a trap composed of 23 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:15:32] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:32] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:33] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:33] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:34] [INFO ] Deduced a trap composed of 20 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:15:34] [INFO ] Deduced a trap composed of 35 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:15:34] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:35] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:35] [INFO ] Deduced a trap composed of 35 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:15:35] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:35] [INFO ] Deduced a trap composed of 37 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:15:35] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:38] [INFO ] Deduced a trap composed of 38 places in 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:15:38] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:39] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:39] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:39] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:40] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:40] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:40] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:44] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:45] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:45] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:45] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:45] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:45] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:45] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:45] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:46] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:46] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:46] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:46] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:46] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:46] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:46] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:47] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:47] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:15:47] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 243/696 variables, and 95 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/243 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 84/95 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 453/696 variables, 243/338 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 452/790 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:16:10] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 696/696 variables, and 791 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 85/85 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60480ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 60482ms
Starting structural reductions in LTL mode, iteration 1 : 243/267 places, 453/477 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60936 ms. Remains : 243/267 places, 453/477 transitions.
[2025-05-31 00:16:17] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:16:17] [INFO ] Flatten gal took : 20 ms
[2025-05-31 00:16:17] [INFO ] Input system was already deterministic with 453 transitions.
[2025-05-31 00:16:17] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:16:17] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:16:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality12974335112263163418.gal : 5 ms
[2025-05-31 00:16:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality13901409782248103955.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/CTLCardinality12974335112263163418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13901409782248103955.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:16:47] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:16:47] [INFO ] Applying decomposition
[2025-05-31 00:16:47] [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/graph6434354675798828943.txt' '-o' '/tmp/graph6434354675798828943.bin' '-w' '/tmp/graph6434354675798828943.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6434354675798828943.bin' '-l' '-1' '-v' '-w' '/tmp/graph6434354675798828943.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:16:48] [INFO ] Decomposing Gal with order
[2025-05-31 00:16:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:16:48] [INFO ] Removed a total of 846 redundant transitions.
[2025-05-31 00:16:48] [INFO ] Flatten gal took : 97 ms
[2025-05-31 00:16:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 17 ms.
[2025-05-31 00:16:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality10148661223306991730.gal : 5 ms
[2025-05-31 00:16:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality18149995959498312479.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/CTLCardinality10148661223306991730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18149995959498312479.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.45218e+12,0.154203,10096,871,123,12434,1398,625,14606,91,4545,0


Converting to forward existential form...Done !
original formula: (A((!(AX(((i2.i1.u10.p35==0)||(i11.u56.p182==1)))) * AG(((EG(((i16.i0.u82.p271==0)||(i17.i0.u77.p253==1))) * ((i4.i0.u22.p74==0)||(i4.i1....598
=> equivalent forward existential formula: ([((Init * !(EG(!((i7.u37.p118==1))))) * !(E(!((i7.u37.p118==1)) U (!((!(!(EX(!(((i2.i1.u10.p35==0)||(i11.u56.p1...1917
Reverse transition relation is NOT exact ! Due to transitions t227, t229, t231, t255, t279, t309, t345, t369, t450, i1.t220, i1.u11.t199, i1.u16.t203, i1.u...792
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 477/477 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 243 transition count 453
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 243 transition count 453
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 236 transition count 446
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 236 transition count 446
Applied a total of 62 rules in 22 ms. Remains 236 /267 variables (removed 31) and now considering 446/477 (removed 31) transitions.
// Phase 1: matrix 446 rows 236 cols
[2025-05-31 00:17:18] [INFO ] Computed 11 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:17:18] [INFO ] Implicit Places using invariants in 283 ms returned []
[2025-05-31 00:17:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:17:18] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2025-05-31 00:17:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:24] [INFO ] Deduced a trap composed of 18 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:17:24] [INFO ] Deduced a trap composed of 15 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:17:24] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:24] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:24] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:24] [INFO ] Deduced a trap composed of 32 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:17:25] [INFO ] Deduced a trap composed of 33 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:17:25] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:25] [INFO ] Deduced a trap composed of 35 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:17:25] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:25] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:25] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:25] [INFO ] Deduced a trap composed of 21 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:17:25] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:26] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:26] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:26] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:26] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:26] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:26] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:26] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:27] [INFO ] Deduced a trap composed of 19 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:17:27] [INFO ] Deduced a trap composed of 34 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:17:27] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:27] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:28] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:28] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:28] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:28] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:28] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:29] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:29] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:29] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:29] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:29] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:29] [INFO ] Deduced a trap composed of 14 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:17:30] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:33] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:33] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:33] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:34] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:34] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:34] [INFO ] Deduced a trap composed of 43 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:17:34] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:34] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:35] [INFO ] Deduced a trap composed of 23 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:17:35] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:35] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:38] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 7 (OVERLAPS) 446/682 variables, 236/296 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:47] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 682/682 variables, and 297 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:51] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:51] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:51] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:51] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:51] [INFO ] Deduced a trap composed of 39 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:17:51] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:52] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:52] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:52] [INFO ] Deduced a trap composed of 32 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:17:52] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:53] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:53] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:53] [INFO ] Deduced a trap composed of 32 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:17:53] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:53] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:53] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:56] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:56] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:56] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:56] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:56] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:56] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:57] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:59] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:59] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:17:59] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:02] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:05] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:05] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:05] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:05] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:18:06] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 9 (OVERLAPS) 446/682 variables, 236/329 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/682 variables, 445/774 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 682/682 variables, and 774 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60407ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 60410ms
Starting structural reductions in LTL mode, iteration 1 : 236/267 places, 446/477 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60953 ms. Remains : 236/267 places, 446/477 transitions.
[2025-05-31 00:18:19] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:18:19] [INFO ] Flatten gal took : 16 ms
[2025-05-31 00:18:19] [INFO ] Input system was already deterministic with 446 transitions.
[2025-05-31 00:18:19] [INFO ] Flatten gal took : 15 ms
[2025-05-31 00:18:19] [INFO ] Flatten gal took : 15 ms
[2025-05-31 00:18:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality17983172425483241574.gal : 4 ms
[2025-05-31 00:18:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality617954820729416950.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/CTLCardinality17983172425483241574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality617954820729416950.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:18:49] [INFO ] Flatten gal took : 15 ms
[2025-05-31 00:18:49] [INFO ] Applying decomposition
[2025-05-31 00:18:49] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15502792765134013501.txt' '-o' '/tmp/graph15502792765134013501.bin' '-w' '/tmp/graph15502792765134013501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15502792765134013501.bin' '-l' '-1' '-v' '-w' '/tmp/graph15502792765134013501.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:18:49] [INFO ] Decomposing Gal with order
[2025-05-31 00:18:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:18:49] [INFO ] Removed a total of 840 redundant transitions.
[2025-05-31 00:18:49] [INFO ] Flatten gal took : 32 ms
[2025-05-31 00:18:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 12 ms.
[2025-05-31 00:18:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality16686488980697132.gal : 4 ms
[2025-05-31 00:18:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality3986680184466606213.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/CTLCardinality16686488980697132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3986680184466606213.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 -...260
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.18715e+12,0.572356,29640,1797,135,60880,2248,559,62815,90,8973,0


Converting to forward existential form...Done !
original formula: EX(AF(!(A(((i17.u85.p282==0)||(i13.i1.u61.p196==1)) U EG(((i16.u75.p243==0)||(i17.u85.p282==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(!((E(!(EG(((i16.u75.p243==0)||(i17.u85.p282==1)))) U (!(((i17.u85.p282==0)||(i13.i1.u61.p1...282
Reverse transition relation is NOT exact ! Due to transitions t221, t223, t236, t254, t278, t302, t344, t368, t443, i1.i1.t24, i2.t111, i2.u50.t91, i2.u55....795
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 477/477 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 242 transition count 452
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 242 transition count 452
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 235 transition count 445
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 235 transition count 445
Applied a total of 64 rules in 10 ms. Remains 235 /267 variables (removed 32) and now considering 445/477 (removed 32) transitions.
// Phase 1: matrix 445 rows 235 cols
[2025-05-31 00:19:19] [INFO ] Computed 11 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:19:19] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-31 00:19:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:19:19] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 444 sub problems to find dead transitions.
[2025-05-31 00:19:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:25] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:25] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:25] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:25] [INFO ] Deduced a trap composed of 21 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:19:25] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:25] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:26] [INFO ] Deduced a trap composed of 34 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:19:26] [INFO ] Deduced a trap composed of 14 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:19:26] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:26] [INFO ] Deduced a trap composed of 32 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:19:26] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:26] [INFO ] Deduced a trap composed of 34 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:19:26] [INFO ] Deduced a trap composed of 34 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:19:27] [INFO ] Deduced a trap composed of 20 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:19:27] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:27] [INFO ] Deduced a trap composed of 32 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:19:27] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:27] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:27] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:27] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:28] [INFO ] Deduced a trap composed of 18 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:19:28] [INFO ] Deduced a trap composed of 21 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:19:28] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:28] [INFO ] Deduced a trap composed of 35 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:19:28] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:28] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:28] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:28] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:29] [INFO ] Deduced a trap composed of 39 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:19:29] [INFO ] Deduced a trap composed of 36 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:19:29] [INFO ] Deduced a trap composed of 39 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:19:29] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:29] [INFO ] Deduced a trap composed of 32 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:19:30] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:30] [INFO ] Deduced a trap composed of 31 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:19:30] [INFO ] Deduced a trap composed of 32 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:19:30] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:30] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:31] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 19/50 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:35] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:35] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:35] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:35] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:35] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:35] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:35] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:35] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:35] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:36] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:36] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:36] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:36] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:36] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:36] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:36] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:36] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:37] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:37] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:37] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:38] [INFO ] Deduced a trap composed of 30 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:19:38] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:39] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:42] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 8 (OVERLAPS) 445/680 variables, 235/309 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/680 variables, and 309 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:53] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:53] [INFO ] Deduced a trap composed of 32 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:19:53] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:53] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:53] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:19:54] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (OVERLAPS) 445/680 variables, 235/315 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/680 variables, 444/759 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:06] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:10] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:20:10] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/680 variables, 3/762 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/680 variables, and 762 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 72/72 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60381ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 60383ms
Starting structural reductions in LTL mode, iteration 1 : 235/267 places, 445/477 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60714 ms. Remains : 235/267 places, 445/477 transitions.
[2025-05-31 00:20:20] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:20:20] [INFO ] Flatten gal took : 14 ms
[2025-05-31 00:20:20] [INFO ] Input system was already deterministic with 445 transitions.
[2025-05-31 00:20:20] [INFO ] Flatten gal took : 21 ms
[2025-05-31 00:20:20] [INFO ] Flatten gal took : 15 ms
[2025-05-31 00:20:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality10463859788884754517.gal : 3 ms
[2025-05-31 00:20:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality11566859159779884568.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/CTLCardinality10463859788884754517.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11566859159779884568.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:20:50] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:20:50] [INFO ] Applying decomposition
[2025-05-31 00:20:50] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15500547531000954147.txt' '-o' '/tmp/graph15500547531000954147.bin' '-w' '/tmp/graph15500547531000954147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15500547531000954147.bin' '-l' '-1' '-v' '-w' '/tmp/graph15500547531000954147.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:20:50] [INFO ] Decomposing Gal with order
[2025-05-31 00:20:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:20:50] [INFO ] Removed a total of 847 redundant transitions.
[2025-05-31 00:20:50] [INFO ] Flatten gal took : 30 ms
[2025-05-31 00:20:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 7 ms.
[2025-05-31 00:20:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality8958346609557769111.gal : 3 ms
[2025-05-31 00:20:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality12364933339828815258.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/CTLCardinality8958346609557769111.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12364933339828815258.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05504e+12,0.30582,17636,3087,122,30247,1445,588,24457,93,4068,0


Converting to forward existential form...Done !
original formula: EX(EG(EF(!(E((i3.u17.p57==1) U (i14.i1.u72.p232==1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),E(TRUE U !(E((i3.u17.p57==1) U (i14.i1.u72.p232==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t220, t222, t226, t250, t274, t340, t358, t442, i2.i1.t213, i2.i1.u10.t192, i2.i1.u19.t193, i...812
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 477/477 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 248 transition count 458
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 248 transition count 458
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 244 transition count 454
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 244 transition count 454
Applied a total of 46 rules in 9 ms. Remains 244 /267 variables (removed 23) and now considering 454/477 (removed 23) transitions.
// Phase 1: matrix 454 rows 244 cols
[2025-05-31 00:21:20] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:21:20] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-05-31 00:21:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:21:21] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 453 sub problems to find dead transitions.
[2025-05-31 00:21:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:26] [INFO ] Deduced a trap composed of 17 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:21:26] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:26] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:27] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:27] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:27] [INFO ] Deduced a trap composed of 21 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:21:27] [INFO ] Deduced a trap composed of 14 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:21:27] [INFO ] Deduced a trap composed of 23 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:21:27] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:28] [INFO ] Deduced a trap composed of 36 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:21:28] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:28] [INFO ] Deduced a trap composed of 38 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:21:28] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:28] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:28] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:28] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:29] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:29] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:29] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:29] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:29] [INFO ] Deduced a trap composed of 27 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:21:29] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:30] [INFO ] Deduced a trap composed of 33 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:21:30] [INFO ] Deduced a trap composed of 33 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:21:30] [INFO ] Deduced a trap composed of 42 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:21:30] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:30] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:30] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:30] [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:21:31] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:31] [INFO ] Deduced a trap composed of 43 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:21:31] [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:21:31] [INFO ] Deduced a trap composed of 45 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:21:31] [INFO ] Deduced a trap composed of 45 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:21:31] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:31] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:31] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:31] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:31] [INFO ] Deduced a trap composed of 44 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:21:32] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:34] [INFO ] Deduced a trap composed of 20 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:21:34] [INFO ] Deduced a trap composed of 24 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:21:34] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:34] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:35] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:35] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:35] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:35] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:36] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:36] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:36] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:36] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:36] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:36] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:36] [INFO ] Deduced a trap composed of 32 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:21:37] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:37] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:37] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:37] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:37] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:37] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:39] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:39] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:41] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:46] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:21:47] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 244/698 variables, and 77 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/244 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (OVERLAPS) 454/698 variables, 244/321 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/698 variables, 453/774 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:06] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:22:11] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 2/776 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 698/698 variables, and 776 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60436ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 60438ms
Starting structural reductions in LTL mode, iteration 1 : 244/267 places, 454/477 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60780 ms. Remains : 244/267 places, 454/477 transitions.
[2025-05-31 00:22:21] [INFO ] Flatten gal took : 14 ms
[2025-05-31 00:22:21] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:22:21] [INFO ] Input system was already deterministic with 454 transitions.
[2025-05-31 00:22:21] [INFO ] Flatten gal took : 19 ms
[2025-05-31 00:22:21] [INFO ] Flatten gal took : 14 ms
[2025-05-31 00:22:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality11749946856518203773.gal : 4 ms
[2025-05-31 00:22:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality1031167697931925417.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/CTLCardinality11749946856518203773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1031167697931925417.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:22:51] [INFO ] Flatten gal took : 16 ms
[2025-05-31 00:22:51] [INFO ] Applying decomposition
[2025-05-31 00:22:51] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph526496094276783883.txt' '-o' '/tmp/graph526496094276783883.bin' '-w' '/tmp/graph526496094276783883.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph526496094276783883.bin' '-l' '-1' '-v' '-w' '/tmp/graph526496094276783883.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:22:51] [INFO ] Decomposing Gal with order
[2025-05-31 00:22:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:22:51] [INFO ] Removed a total of 862 redundant transitions.
[2025-05-31 00:22:51] [INFO ] Flatten gal took : 29 ms
[2025-05-31 00:22:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 4 ms.
[2025-05-31 00:22:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality7258119421871118951.gal : 3 ms
[2025-05-31 00:22:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality14491299547163786472.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/CTLCardinality7258119421871118951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14491299547163786472.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.2187e+12,0.226005,14532,2526,116,22412,1286,593,17375,88,3510,0


Converting to forward existential form...Done !
original formula: A(EF(((EX((i10.i2.u64.p187==0)) * (i14.i1.u82.p235==1)) * ((i6.i1.u41.p112!=1)||(!((i8.i1.u42.p156==0)||(i1.i2.u9.p31==1)))))) U (!(E(!((...411
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(!(((i14.i1.u80.p232==0)||(i3.u20.p59==1))) U (!((E(!(((i12.i0.u66.p190==0)||(i4.i0.u24.p73...1395
Reverse transition relation is NOT exact ! Due to transitions t228, t230, t233, t257, t281, t311, t347, t371, t451, i3.t221, i3.u12.t200, i3.u19.t204, i3.u...814
(forward)formula 0,0,9.54846,366680,1,0,770567,3013,4906,1.03212e+06,455,18603,1902553
FORMULA AutonomousCar-PT-06b-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 477/477 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 245 transition count 455
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 245 transition count 455
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 240 transition count 450
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 240 transition count 450
Applied a total of 54 rules in 7 ms. Remains 240 /267 variables (removed 27) and now considering 450/477 (removed 27) transitions.
// Phase 1: matrix 450 rows 240 cols
[2025-05-31 00:23:01] [INFO ] Computed 11 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:23:01] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-05-31 00:23:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:23:01] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2025-05-31 00:23:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:07] [INFO ] Deduced a trap composed of 17 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:23:07] [INFO ] Deduced a trap composed of 20 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:23:07] [INFO ] Deduced a trap composed of 29 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:23:07] [INFO ] Deduced a trap composed of 24 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:23:08] [INFO ] Deduced a trap composed of 23 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:23:08] [INFO ] Deduced a trap composed of 30 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:23:08] [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:23:08] [INFO ] Deduced a trap composed of 32 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:23:08] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:08] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:08] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:08] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:09] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:09] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:09] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:09] [INFO ] Deduced a trap composed of 34 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:23:09] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:09] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:09] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:09] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:10] [INFO ] Deduced a trap composed of 21 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:23:10] [INFO ] Deduced a trap composed of 35 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:23:10] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:10] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:10] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:10] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:11] [INFO ] Deduced a trap composed of 39 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:23:11] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:11] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:11] [INFO ] Deduced a trap composed of 38 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:23:11] [INFO ] Deduced a trap composed of 41 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:23:11] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:12] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:12] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:12] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:12] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:12] [INFO ] Deduced a trap composed of 42 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:23:12] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:12] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:12] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:15] [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:23:15] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:15] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:15] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:15] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:15] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:15] [INFO ] Deduced a trap composed of 31 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:23:15] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:15] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:16] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:16] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:16] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:16] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:16] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:16] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:16] [INFO ] Deduced a trap composed of 31 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:23:16] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:17] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:17] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:17] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:17] [INFO ] Deduced a trap composed of 32 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:23:18] [INFO ] Deduced a trap composed of 32 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:23:18] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:19] [INFO ] Deduced a trap composed of 45 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:23:19] [INFO ] Deduced a trap composed of 31 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:23:19] [INFO ] Deduced a trap composed of 32 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:23:19] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:22] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:26] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:27] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:27] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:27] [INFO ] Deduced a trap composed of 45 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:23:27] [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:23:27] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:28] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:28] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:28] [INFO ] Deduced a trap composed of 43 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:23:28] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:28] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 11/90 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/690 variables, and 90 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/240 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 79/79 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 79/90 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (OVERLAPS) 450/690 variables, 240/330 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 449/779 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:59] [INFO ] Deduced a trap along path composed of 3 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:23:59] [INFO ] Deduced a trap along path composed of 3 places in 109 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:24:00] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:24:00] [INFO ] Deduced a trap along path composed of 3 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:24:00] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:24:00] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:24:01] [INFO ] Deduced a trap along path composed of 7 places in 71 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 690/690 variables, and 786 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 79/79 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 60444ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 60446ms
Starting structural reductions in LTL mode, iteration 1 : 240/267 places, 450/477 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60768 ms. Remains : 240/267 places, 450/477 transitions.
[2025-05-31 00:24:02] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:24:02] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:24:02] [INFO ] Input system was already deterministic with 450 transitions.
[2025-05-31 00:24:02] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:24:02] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:24:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality215652404652190303.gal : 3 ms
[2025-05-31 00:24:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality3278775334470395882.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/CTLCardinality215652404652190303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3278775334470395882.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:24:32] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:24:32] [INFO ] Applying decomposition
[2025-05-31 00:24:32] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1929608593537696123.txt' '-o' '/tmp/graph1929608593537696123.bin' '-w' '/tmp/graph1929608593537696123.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1929608593537696123.bin' '-l' '-1' '-v' '-w' '/tmp/graph1929608593537696123.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:24:32] [INFO ] Decomposing Gal with order
[2025-05-31 00:24:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:24:32] [INFO ] Removed a total of 847 redundant transitions.
[2025-05-31 00:24:32] [INFO ] Flatten gal took : 27 ms
[2025-05-31 00:24:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 5 ms.
[2025-05-31 00:24:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality5131943370905266478.gal : 2 ms
[2025-05-31 00:24:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality1928617575119873931.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/CTLCardinality5131943370905266478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1928617575119873931.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16705e+12,0.255695,15240,2447,116,24882,1422,604,20807,92,4656,0


Converting to forward existential form...Done !
original formula: (EF(!(E(EX((((i5.i0.u31.p98==0)||(i5.i0.u32.p103==1))||(i2.i0.u16.p48==1))) U EX((i5.i0.u32.p101==1))))) * AG(!(A(EF((i2.i1.u12.p45==1)) ...229
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(E(EX((((i5.i0.u31.p98==0)||(i5.i0.u32.p103==1))||(i2.i0.u16.p48==1))) U EX((i5.i0.u32.p10...515
Reverse transition relation is NOT exact ! Due to transitions t224, t226, t231, t255, t303, t345, t369, t447, i1.t217, i1.u10.t196, i1.u17.t200, i1.u17.t20...830
(forward)formula 0,1,23.7147,865380,1,0,1.68403e+06,2294,5065,2.43387e+06,463,11593,2964651
FORMULA AutonomousCar-PT-06b-CTLCardinality-2025-06 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 : 267/267 places, 477/477 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 242 transition count 452
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 242 transition count 452
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 236 transition count 446
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 236 transition count 446
Applied a total of 62 rules in 16 ms. Remains 236 /267 variables (removed 31) and now considering 446/477 (removed 31) transitions.
// Phase 1: matrix 446 rows 236 cols
[2025-05-31 00:24:56] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:24:56] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-05-31 00:24:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:24:56] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2025-05-31 00:24:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:02] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:02] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:02] [INFO ] Deduced a trap composed of 19 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:25:02] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:02] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:02] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:02] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:03] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:03] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:03] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:03] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:03] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:03] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:03] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:03] [INFO ] Deduced a trap composed of 32 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:25:04] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:04] [INFO ] Deduced a trap composed of 32 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:25:04] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:04] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:04] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:04] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:04] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:05] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:05] [INFO ] Deduced a trap composed of 14 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:25:05] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:05] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:05] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:05] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:06] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:06] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:06] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:06] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:06] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:06] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:06] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:06] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:07] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:07] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:07] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:07] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:09] [INFO ] Deduced a trap composed of 40 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:25:10] [INFO ] Deduced a trap composed of 41 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:25:10] [INFO ] Deduced a trap composed of 43 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:25:10] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:11] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:11] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:11] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:11] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:11] [INFO ] Deduced a trap composed of 31 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:25:11] [INFO ] Deduced a trap composed of 5 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:25:11] [INFO ] Deduced a trap composed of 10 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:25:11] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:12] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:12] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:13] [INFO ] Deduced a trap composed of 27 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:25:14] [INFO ] Deduced a trap composed of 34 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:25:14] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:14] [INFO ] Deduced a trap composed of 24 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:25:15] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:15] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:15] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:15] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:15] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:15] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:15] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:16] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:16] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 13/78 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 7 (OVERLAPS) 446/682 variables, 236/314 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 682/682 variables, and 314 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:29] [INFO ] Deduced a trap composed of 32 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:25:29] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:29] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:30] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:30] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:30] [INFO ] Deduced a trap composed of 43 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:25:30] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:30] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:33] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:33] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:33] [INFO ] Deduced a trap composed of 42 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:25:33] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:33] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:33] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:34] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:34] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:34] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:25:34] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 10/96 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 6 (OVERLAPS) 446/682 variables, 236/332 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/682 variables, 445/777 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 682/682 variables, and 777 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 85/85 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Starting structural reductions in LTL mode, iteration 1 : 236/267 places, 446/477 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60766 ms. Remains : 236/267 places, 446/477 transitions.
[2025-05-31 00:25:57] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:25:57] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:25:57] [INFO ] Input system was already deterministic with 446 transitions.
[2025-05-31 00:25:57] [INFO ] Flatten gal took : 15 ms
[2025-05-31 00:25:57] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:25:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality11219156145581105472.gal : 3 ms
[2025-05-31 00:25:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality14114721364154305045.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/CTLCardinality11219156145581105472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14114721364154305045.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:26:27] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:26:27] [INFO ] Applying decomposition
[2025-05-31 00:26:27] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2625043362111126857.txt' '-o' '/tmp/graph2625043362111126857.bin' '-w' '/tmp/graph2625043362111126857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2625043362111126857.bin' '-l' '-1' '-v' '-w' '/tmp/graph2625043362111126857.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:26:27] [INFO ] Decomposing Gal with order
[2025-05-31 00:26:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:26:27] [INFO ] Removed a total of 849 redundant transitions.
[2025-05-31 00:26:27] [INFO ] Flatten gal took : 43 ms
[2025-05-31 00:26:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2025-05-31 00:26:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality15500084458555385820.gal : 2 ms
[2025-05-31 00:26:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality7076426816955015413.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/CTLCardinality15500084458555385820.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7076426816955015413.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07623e+12,0.145068,9828,796,114,11349,1524,539,12634,88,7110,0


Converting to forward existential form...Done !
original formula: !(E((AG(AX((i7.i1.u28.p79==0))) + (i12.i0.u54.p167==1)) U AF((i4.i0.u13.p38==1))))
=> equivalent forward existential formula: [(FwdU(Init,(!(E(TRUE U !(!(EX(!((i7.i1.u28.p79==0))))))) + (i12.i0.u54.p167==1))) * !(EG(!((i4.i0.u13.p38==1)))...166
Reverse transition relation is NOT exact ! Due to transitions t221, t223, t236, t260, t284, t302, t344, t368, t443, i0.u69.t32, i0.u69.t35, i0.u69.t36, i0....792
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 477/477 transitions.
Graph (trivial) has 253 edges and 267 vertex of which 4 / 267 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 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 264 transition count 359
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 149 rules applied. Total rules applied 265 place count 149 transition count 325
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 286 place count 129 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 287 place count 128 transition count 324
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 287 place count 128 transition count 317
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 301 place count 121 transition count 317
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 313 place count 109 transition count 305
Iterating global reduction 4 with 12 rules applied. Total rules applied 325 place count 109 transition count 305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 325 place count 109 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 327 place count 108 transition count 304
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 330 place count 105 transition count 291
Iterating global reduction 4 with 3 rules applied. Total rules applied 333 place count 105 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 336 place count 105 transition count 288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 337 place count 104 transition count 288
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 409 place count 68 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 410 place count 68 transition count 251
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 420 place count 58 transition count 185
Iterating global reduction 7 with 10 rules applied. Total rules applied 430 place count 58 transition count 185
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 438 place count 58 transition count 177
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 442 place count 54 transition count 177
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 444 place count 53 transition count 176
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 445 place count 53 transition count 175
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 446 place count 53 transition count 175
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 448 place count 51 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 449 place count 50 transition count 173
Applied a total of 449 rules in 57 ms. Remains 50 /267 variables (removed 217) and now considering 173/477 (removed 304) transitions.
// Phase 1: matrix 173 rows 50 cols
[2025-05-31 00:26:57] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:26:57] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-05-31 00:26:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:26:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:26:57] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [44, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 160 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 48/267 places, 173/477 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 48 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 47 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 47 transition count 171
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 46 transition count 171
Applied a total of 4 rules in 6 ms. Remains 46 /48 variables (removed 2) and now considering 171/173 (removed 2) transitions.
// Phase 1: matrix 171 rows 46 cols
[2025-05-31 00:26:57] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:26:57] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-05-31 00:26:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:26:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:26:58] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/267 places, 171/477 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 404 ms. Remains : 46/267 places, 171/477 transitions.
[2025-05-31 00:26:58] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:26:58] [INFO ] Flatten gal took : 8 ms
[2025-05-31 00:26:58] [INFO ] Input system was already deterministic with 171 transitions.
[2025-05-31 00:26:58] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:26:58] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:26:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality3041087561140259595.gal : 1 ms
[2025-05-31 00:26:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality14276576225289250001.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/CTLCardinality3041087561140259595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14276576225289250001.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.53855e+06,0.460259,21036,2,1072,5,42686,6,0,354,52998,0


Converting to forward existential form...Done !
original formula: EG((p49==0))
=> equivalent forward existential formula: [FwdG(Init,(p49==0))] != FALSE
Hit Full ! (commute/partial/dont) 169/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
(forward)formula 0,1,1.02451,28076,1,0,8,78280,19,4,3733,79243,8
FORMULA AutonomousCar-PT-06b-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 477/477 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 243 transition count 453
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 243 transition count 453
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 236 transition count 446
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 236 transition count 446
Applied a total of 62 rules in 15 ms. Remains 236 /267 variables (removed 31) and now considering 446/477 (removed 31) transitions.
// Phase 1: matrix 446 rows 236 cols
[2025-05-31 00:26:59] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:26:59] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-05-31 00:26:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:26:59] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2025-05-31 00:26:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:04] [INFO ] Deduced a trap composed of 17 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:27:04] [INFO ] Deduced a trap composed of 18 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:27:05] [INFO ] Deduced a trap composed of 43 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:27:05] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:05] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:05] [INFO ] Deduced a trap composed of 23 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:27:05] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:05] [INFO ] Deduced a trap composed of 30 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:27:05] [INFO ] Deduced a trap composed of 32 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:27:06] [INFO ] Deduced a trap composed of 31 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:27:06] [INFO ] Deduced a trap composed of 31 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:27:06] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:06] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:06] [INFO ] Deduced a trap composed of 21 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:27:06] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:07] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:07] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:07] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:07] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:07] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:07] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:07] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:07] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:08] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:08] [INFO ] Deduced a trap composed of 35 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:27:08] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:08] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:08] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:08] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:08] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:08] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:09] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:09] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:09] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:09] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:09] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:10] [INFO ] Deduced a trap composed of 38 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:27:10] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:10] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:10] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:12] [INFO ] Deduced a trap composed of 24 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:27:12] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:13] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:13] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:13] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:13] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:13] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:13] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:13] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:13] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:14] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:14] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:14] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:14] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:14] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:14] [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:27:14] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:14] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:15] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:15] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:16] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:16] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:16] [INFO ] Deduced a trap composed of 15 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:27:17] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:19] [INFO ] Deduced a trap composed of 41 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:27:19] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:19] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:19] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:20] [INFO ] Deduced a trap composed of 32 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:27:20] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 8 (OVERLAPS) 446/682 variables, 236/317 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 682/682 variables, and 317 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:32] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:32] [INFO ] Deduced a trap composed of 40 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:27:32] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:33] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:33] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 5 (OVERLAPS) 446/682 variables, 236/322 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/682 variables, 445/767 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:45] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:27:46] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/682 variables, 2/769 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 682/682 variables, and 769 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60415ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 60417ms
Starting structural reductions in LTL mode, iteration 1 : 236/267 places, 446/477 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60738 ms. Remains : 236/267 places, 446/477 transitions.
[2025-05-31 00:27:59] [INFO ] Flatten gal took : 14 ms
[2025-05-31 00:27:59] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:27:59] [INFO ] Input system was already deterministic with 446 transitions.
[2025-05-31 00:27:59] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:27:59] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:27:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality7724478063045118001.gal : 3 ms
[2025-05-31 00:27:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality9735450055134629044.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/CTLCardinality7724478063045118001.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9735450055134629044.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:28:30] [INFO ] Flatten gal took : 16 ms
[2025-05-31 00:28:30] [INFO ] Applying decomposition
[2025-05-31 00:28:30] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15486113134416748498.txt' '-o' '/tmp/graph15486113134416748498.bin' '-w' '/tmp/graph15486113134416748498.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15486113134416748498.bin' '-l' '-1' '-v' '-w' '/tmp/graph15486113134416748498.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:28:30] [INFO ] Decomposing Gal with order
[2025-05-31 00:28:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:28:30] [INFO ] Removed a total of 846 redundant transitions.
[2025-05-31 00:28:30] [INFO ] Flatten gal took : 26 ms
[2025-05-31 00:28:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 4 ms.
[2025-05-31 00:28:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality7485580444776293613.gal : 2 ms
[2025-05-31 00:28:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality3997087926266232423.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/CTLCardinality7485580444776293613.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3997087926266232423.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07623e+12,0.721576,29540,1702,136,56991,1303,559,65112,95,7247,0


Converting to forward existential form...Done !
original formula: EF((EX(AG((i7.i0.u42.p134==1))) * EF((((i7.i2.u39.p127==0)&&(i6.u37.p121==1))||((i4.u25.p82==0)&&((u1.p5==0)||(i13.i0.u70.p226==1)))))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * EX(!(E(TRUE U !((i7.i0.u42.p134==1)))))),TRUE) * (((i7.i2.u39.p127==0)&&(i6.u37.p121==...225
Reverse transition relation is NOT exact ! Due to transitions t220, t222, t226, t250, t274, t340, t364, t443, u1.t223, u1.t224, i0.u75.t32, i0.u75.t35, i0....813
(forward)formula 0,0,1.89496,65508,1,0,138974,1600,4435,137952,488,7247,473433
FORMULA AutonomousCar-PT-06b-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 477/477 transitions.
Graph (trivial) has 254 edges and 267 vertex of which 4 / 267 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 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 264 transition count 358
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 152 rules applied. Total rules applied 269 place count 148 transition count 322
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 22 rules applied. Total rules applied 291 place count 127 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 292 place count 126 transition count 321
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 292 place count 126 transition count 315
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 304 place count 120 transition count 315
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 316 place count 108 transition count 303
Iterating global reduction 4 with 12 rules applied. Total rules applied 328 place count 108 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 328 place count 108 transition count 302
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 330 place count 107 transition count 302
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 333 place count 104 transition count 289
Iterating global reduction 4 with 3 rules applied. Total rules applied 336 place count 104 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 340 place count 104 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 342 place count 102 transition count 285
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 410 place count 68 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 411 place count 68 transition count 250
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 421 place count 58 transition count 184
Iterating global reduction 7 with 10 rules applied. Total rules applied 431 place count 58 transition count 184
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 439 place count 58 transition count 176
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 443 place count 54 transition count 176
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 445 place count 53 transition count 175
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 446 place count 53 transition count 174
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 448 place count 51 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 449 place count 50 transition count 172
Applied a total of 449 rules in 53 ms. Remains 50 /267 variables (removed 217) and now considering 172/477 (removed 305) transitions.
// Phase 1: matrix 172 rows 50 cols
[2025-05-31 00:28:32] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:28:32] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-05-31 00:28:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:28:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:28:32] [INFO ] Implicit Places using invariants and state equation in 80 ms returned [44, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 143 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 48/267 places, 172/477 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 48 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 47 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 47 transition count 170
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 46 transition count 170
Applied a total of 4 rules in 5 ms. Remains 46 /48 variables (removed 2) and now considering 170/172 (removed 2) transitions.
// Phase 1: matrix 170 rows 46 cols
[2025-05-31 00:28:32] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:28:32] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-05-31 00:28:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:28:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:28:32] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/267 places, 170/477 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 340 ms. Remains : 46/267 places, 170/477 transitions.
[2025-05-31 00:28:32] [INFO ] Flatten gal took : 14 ms
[2025-05-31 00:28:32] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:28:32] [INFO ] Input system was already deterministic with 170 transitions.
[2025-05-31 00:28:32] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:28:32] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:28:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality11715896784357166635.gal : 1 ms
[2025-05-31 00:28:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality16845842660903031533.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/CTLCardinality11715896784357166635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16845842660903031533.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(EG((p220==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG((p220==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t26, t94, t168, Intersec...246
(forward)formula 0,1,4.60925,107588,1,0,837,447933,365,384,5851,463771,910
FORMULA AutonomousCar-PT-06b-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 477/477 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 245 transition count 455
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 245 transition count 455
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 239 transition count 449
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 239 transition count 449
Applied a total of 56 rules in 12 ms. Remains 239 /267 variables (removed 28) and now considering 449/477 (removed 28) transitions.
// Phase 1: matrix 449 rows 239 cols
[2025-05-31 00:28:37] [INFO ] Computed 11 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:28:37] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-05-31 00:28:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:28:37] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 448 sub problems to find dead transitions.
[2025-05-31 00:28:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:42] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:42] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:43] [INFO ] Deduced a trap composed of 44 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:28:43] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:43] [INFO ] Deduced a trap composed of 29 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:28:43] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:43] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:43] [INFO ] Deduced a trap composed of 23 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:28:44] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:44] [INFO ] Deduced a trap composed of 36 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:28:44] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:44] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:44] [INFO ] Deduced a trap composed of 39 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:28:44] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:44] [INFO ] Deduced a trap composed of 24 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:28:45] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:45] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:45] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:45] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:45] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:46] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:46] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:46] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:46] [INFO ] Deduced a trap composed of 33 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:28:46] [INFO ] Deduced a trap composed of 27 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:28:46] [INFO ] Deduced a trap composed of 42 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:28:46] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:47] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:47] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:47] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:47] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:47] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:47] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:47] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:47] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:47] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:48] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:48] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:48] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:48] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:50] [INFO ] Deduced a trap composed of 25 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:28:50] [INFO ] Deduced a trap composed of 36 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:28:51] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:51] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:51] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:51] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:51] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:52] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:52] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:52] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:52] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:52] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:54] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:55] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:55] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:55] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:28:56] [INFO ] Deduced a trap composed of 33 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:28:56] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 7 (OVERLAPS) 449/688 variables, 239/308 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/688 variables, and 308 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:09] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:10] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (OVERLAPS) 449/688 variables, 239/310 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/688 variables, 448/758 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:29:25] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/688 variables, 1/759 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/688 variables, and 759 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60437ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 60439ms
Starting structural reductions in LTL mode, iteration 1 : 239/267 places, 449/477 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60770 ms. Remains : 239/267 places, 449/477 transitions.
[2025-05-31 00:29:37] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:29:37] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:29:37] [INFO ] Input system was already deterministic with 449 transitions.
[2025-05-31 00:29:37] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:29:37] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:29:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality5739520800497889210.gal : 3 ms
[2025-05-31 00:29:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality14101899557588582461.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/CTLCardinality5739520800497889210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14101899557588582461.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 00:30:08] [INFO ] Flatten gal took : 18 ms
[2025-05-31 00:30:08] [INFO ] Applying decomposition
[2025-05-31 00:30:08] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14769231333686105670.txt' '-o' '/tmp/graph14769231333686105670.bin' '-w' '/tmp/graph14769231333686105670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14769231333686105670.bin' '-l' '-1' '-v' '-w' '/tmp/graph14769231333686105670.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:30:08] [INFO ] Decomposing Gal with order
[2025-05-31 00:30:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:30:08] [INFO ] Removed a total of 855 redundant transitions.
[2025-05-31 00:30:08] [INFO ] Flatten gal took : 34 ms
[2025-05-31 00:30:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 5 ms.
[2025-05-31 00:30:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality11388840151848891538.gal : 3 ms
[2025-05-31 00:30:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality365326040587299201.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/CTLCardinality11388840151848891538.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality365326040587299201.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14774e+12,1.93728,62620,1496,127,103023,2989,629,305821,90,15780,0


Converting to forward existential form...Done !
original formula: E(((AG(E(AG(((i3.i1.u11.p35==0)||(i8.u57.p179==1))) U !((((i9.i0.u54.p171==0)||(i0.i2.u3.p10==1))&&((i8.u58.p184==0)||(i2.i1.u30.p100==1)...405
=> equivalent forward existential formula: ([(((FwdU(Init,((!(E(TRUE U !(E(!(E(TRUE U !(((i3.i1.u11.p35==0)||(i8.u57.p179==1))))) U !((((i9.i0.u54.p171==0)...737
Reverse transition relation is NOT exact ! Due to transitions t163, t224, t226, t231, t255, t339, t345, t369, t446, i0.i1.t24, i2.i1.t143, i2.i1.u30.t162, ...846
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 477/477 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 243 transition count 453
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 243 transition count 453
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 238 transition count 448
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 238 transition count 448
Applied a total of 58 rules in 17 ms. Remains 238 /267 variables (removed 29) and now considering 448/477 (removed 29) transitions.
// Phase 1: matrix 448 rows 238 cols
[2025-05-31 00:30:38] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:30:38] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-05-31 00:30:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:30:38] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 447 sub problems to find dead transitions.
[2025-05-31 00:30:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:43] [INFO ] Deduced a trap composed of 18 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:30:43] [INFO ] Deduced a trap composed of 15 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:30:44] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:44] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:44] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:44] [INFO ] Deduced a trap composed of 21 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:30:44] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:44] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:44] [INFO ] Deduced a trap composed of 33 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:30:45] [INFO ] Deduced a trap composed of 34 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:30:45] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:45] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:45] [INFO ] Deduced a trap composed of 20 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:30:45] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:45] [INFO ] Deduced a trap composed of 27 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:30:46] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:46] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:46] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:46] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:46] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:47] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:47] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:47] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:47] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:47] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:47] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:48] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:48] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:48] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:48] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:48] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:48] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:48] [INFO ] Deduced a trap composed of 43 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:30:49] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:49] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:49] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:49] [INFO ] Deduced a trap composed of 31 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:30:49] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:49] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 19/50 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:53] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:53] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:53] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:53] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:54] [INFO ] Deduced a trap composed of 37 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:30:54] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:54] [INFO ] Deduced a trap composed of 35 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:30:54] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:54] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:55] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:55] [INFO ] Deduced a trap composed of 37 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:30:55] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:55] [INFO ] Deduced a trap composed of 39 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:30:56] [INFO ] Deduced a trap composed of 39 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:30:56] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:56] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:56] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:30:58] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:02] [INFO ] Deduced a trap composed of 44 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:31:02] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:07] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 238/686 variables, and 71 constraints, problems are : Problem set: 0 solved, 447 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/238 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 447 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:11] [INFO ] Deduced a trap composed of 26 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:31:11] [INFO ] Deduced a trap composed of 34 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:31:11] [INFO ] Deduced a trap composed of 35 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:31:12] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:12] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:12] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 5 (OVERLAPS) 448/686 variables, 238/315 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/686 variables, 447/762 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:27] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:31:27] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/686 variables, 2/764 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/686 variables, and 764 constraints, problems are : Problem set: 0 solved, 447 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60409ms problems are : Problem set: 0 solved, 447 unsolved
Search for dead transitions found 0 dead transitions in 60411ms
Starting structural reductions in LTL mode, iteration 1 : 238/267 places, 448/477 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60736 ms. Remains : 238/267 places, 448/477 transitions.
[2025-05-31 00:31:38] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:31:38] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:31:38] [INFO ] Input system was already deterministic with 448 transitions.
[2025-05-31 00:31:38] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:31:39] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:31:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality5364374058669884272.gal : 3 ms
[2025-05-31 00:31:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality6707719133760729892.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/CTLCardinality5364374058669884272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6707719133760729892.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:32:09] [INFO ] Flatten gal took : 16 ms
[2025-05-31 00:32:09] [INFO ] Applying decomposition
[2025-05-31 00:32:09] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph150134742279030608.txt' '-o' '/tmp/graph150134742279030608.bin' '-w' '/tmp/graph150134742279030608.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph150134742279030608.bin' '-l' '-1' '-v' '-w' '/tmp/graph150134742279030608.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:32:09] [INFO ] Decomposing Gal with order
[2025-05-31 00:32:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:32:09] [INFO ] Removed a total of 845 redundant transitions.
[2025-05-31 00:32:09] [INFO ] Flatten gal took : 26 ms
[2025-05-31 00:32:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2025-05-31 00:32:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality5792836848558858719.gal : 2 ms
[2025-05-31 00:32:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality13444869966152596686.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/CTLCardinality5792836848558858719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13444869966152596686.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18715e+12,0.159681,10860,1138,111,13325,1755,574,17550,85,11053,0


Converting to forward existential form...Done !
original formula: A(((!(EG(A((i5.i1.u22.p82==1) U ((i3.i1.u13.p42==0)||(i0.u68.p249==1))))) * (!((EX((i4.u55.p182==1)) * EF(((i15.i0.u77.p250==0)||(i3.i0.u...429
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((E(!(E(TRUE U !(((i11.i1.u67.p217==0)||(i0.u76.p243==1))))) U !(E(TRUE U !((i9.i1.u41.p1...917
Reverse transition relation is NOT exact ! Due to transitions t223, t225, t231, t255, t285, t345, t445, i0.t33, i0.u75.t38, i0.u75.t39, i2.t138, i2.u40.t11...782
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
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 SI_CTL mode, iteration 0 : 267/267 places, 477/477 transitions.
Graph (trivial) has 248 edges and 267 vertex of which 4 / 267 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 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 264 transition count 361
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 146 rules applied. Total rules applied 260 place count 151 transition count 328
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 21 rules applied. Total rules applied 281 place count 132 transition count 326
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 285 place count 130 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 286 place count 129 transition count 324
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 286 place count 129 transition count 318
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 298 place count 123 transition count 318
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 310 place count 111 transition count 306
Iterating global reduction 5 with 12 rules applied. Total rules applied 322 place count 111 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 322 place count 111 transition count 305
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 324 place count 110 transition count 305
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 327 place count 107 transition count 292
Iterating global reduction 5 with 3 rules applied. Total rules applied 330 place count 107 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 332 place count 107 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 333 place count 106 transition count 290
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 403 place count 71 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 404 place count 71 transition count 254
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 412 place count 63 transition count 202
Iterating global reduction 8 with 8 rules applied. Total rules applied 420 place count 63 transition count 202
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 8 with 8 rules applied. Total rules applied 428 place count 63 transition count 194
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 432 place count 59 transition count 194
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 10 with 2 rules applied. Total rules applied 434 place count 58 transition count 193
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 435 place count 58 transition count 192
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 437 place count 56 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 438 place count 55 transition count 190
Applied a total of 438 rules in 35 ms. Remains 55 /267 variables (removed 212) and now considering 190/477 (removed 287) transitions.
// Phase 1: matrix 190 rows 55 cols
[2025-05-31 00:32:39] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:32:39] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-05-31 00:32:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:32:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:32:39] [INFO ] Implicit Places using invariants and state equation in 84 ms returned [49, 54]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 157 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 53/267 places, 190/477 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 53 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 52 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 52 transition count 188
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 51 transition count 188
Applied a total of 4 rules in 6 ms. Remains 51 /53 variables (removed 2) and now considering 188/190 (removed 2) transitions.
// Phase 1: matrix 188 rows 51 cols
[2025-05-31 00:32:39] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:32:39] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-05-31 00:32:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:32:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:32:39] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 51/267 places, 188/477 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 367 ms. Remains : 51/267 places, 188/477 transitions.
[2025-05-31 00:32:39] [INFO ] Flatten gal took : 10 ms
[2025-05-31 00:32:39] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:32:39] [INFO ] Input system was already deterministic with 188 transitions.
[2025-05-31 00:32:39] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:32:39] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:32:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality5155198126066235508.gal : 2 ms
[2025-05-31 00:32:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality10238904453613328358.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/CTLCardinality5155198126066235508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10238904453613328358.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.07224e+06,0.933924,36308,2,1530,5,85686,6,0,391,107660,0


Converting to forward existential form...Done !
original formula: EG(AF(E(((p58==0)||(p45==1)) U !(AF(((p118==0)||(p45==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E(((p58==0)||(p45==1)) U !(!(EG(!(((p118==0)||(p45==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t8, t10, t12, t14, t16, t18, t19, t22, t24, t26, t28, t100, t186, Inters...248
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,29.3956,769660,1,0,1012,2.69047e+06,412,611,6620,4.08739e+06,976
FORMULA AutonomousCar-PT-06b-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 477/477 transitions.
Graph (trivial) has 250 edges and 267 vertex of which 4 / 267 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 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 113 place count 264 transition count 362
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 146 rules applied. Total rules applied 259 place count 152 transition count 328
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 22 rules applied. Total rules applied 281 place count 132 transition count 326
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 283 place count 130 transition count 326
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 283 place count 130 transition count 320
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 295 place count 124 transition count 320
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 307 place count 112 transition count 308
Iterating global reduction 4 with 12 rules applied. Total rules applied 319 place count 112 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 320 place count 112 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 320 place count 112 transition count 306
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 322 place count 111 transition count 306
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 325 place count 108 transition count 293
Iterating global reduction 5 with 3 rules applied. Total rules applied 328 place count 108 transition count 293
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 332 place count 108 transition count 289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 334 place count 106 transition count 289
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 406 place count 70 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 407 place count 70 transition count 252
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 417 place count 60 transition count 186
Iterating global reduction 8 with 10 rules applied. Total rules applied 427 place count 60 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 6 rules applied. Total rules applied 433 place count 60 transition count 180
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 436 place count 57 transition count 180
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 10 with 2 rules applied. Total rules applied 438 place count 56 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 439 place count 56 transition count 178
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 441 place count 54 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 442 place count 53 transition count 176
Applied a total of 442 rules in 55 ms. Remains 53 /267 variables (removed 214) and now considering 176/477 (removed 301) transitions.
// Phase 1: matrix 176 rows 53 cols
[2025-05-31 00:33:09] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:33:09] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-05-31 00:33:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:33:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:33:09] [INFO ] Implicit Places using invariants and state equation in 94 ms returned [47, 52]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 172 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 51/267 places, 176/477 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 51 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 50 transition count 175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 50 transition count 174
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 49 transition count 174
Applied a total of 4 rules in 4 ms. Remains 49 /51 variables (removed 2) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 49 cols
[2025-05-31 00:33:09] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:33:09] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-05-31 00:33:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:33:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:33:09] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 49/267 places, 174/477 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 385 ms. Remains : 49/267 places, 174/477 transitions.
[2025-05-31 00:33:09] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:33:09] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:33:09] [INFO ] Input system was already deterministic with 174 transitions.
[2025-05-31 00:33:09] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:33:09] [INFO ] Flatten gal took : 8 ms
[2025-05-31 00:33:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality660108348770161679.gal : 1 ms
[2025-05-31 00:33:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality2803147384734605338.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/CTLCardinality660108348770161679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2803147384734605338.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.
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.75626e+06,0.462733,20924,2,1092,5,41185,6,0,368,55452,0


Converting to forward existential form...Done !
original formula: EF(EG(((p157==1) + EF((p202==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p157==1) + E(TRUE U (p202==0))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t11, t13, t16, t18, t20, t22, t24, t26, t28, t30, t97, t172, Interse...247
(forward)formula 0,1,0.794687,21052,1,0,367,59247,373,174,6530,62483,365
FORMULA AutonomousCar-PT-06b-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 477/477 transitions.
Graph (trivial) has 231 edges and 267 vertex of which 4 / 267 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 265 transition count 373
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 128 rules applied. Total rules applied 231 place count 163 transition count 347
Reduce places removed 14 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 19 rules applied. Total rules applied 250 place count 149 transition count 342
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 255 place count 144 transition count 342
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 255 place count 144 transition count 334
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 271 place count 136 transition count 334
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 284 place count 123 transition count 321
Iterating global reduction 4 with 13 rules applied. Total rules applied 297 place count 123 transition count 321
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 297 place count 123 transition count 320
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 299 place count 122 transition count 320
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 302 place count 119 transition count 307
Iterating global reduction 4 with 3 rules applied. Total rules applied 305 place count 119 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 307 place count 119 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 308 place count 118 transition count 305
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 376 place count 84 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 377 place count 84 transition count 270
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 387 place count 74 transition count 204
Iterating global reduction 7 with 10 rules applied. Total rules applied 397 place count 74 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 7 with 3 rules applied. Total rules applied 400 place count 74 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 401 place count 73 transition count 201
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 403 place count 72 transition count 200
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 404 place count 72 transition count 199
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 407 place count 72 transition count 199
Applied a total of 407 rules in 46 ms. Remains 72 /267 variables (removed 195) and now considering 199/477 (removed 278) transitions.
// Phase 1: matrix 199 rows 72 cols
[2025-05-31 00:33:10] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:33:10] [INFO ] Implicit Places using invariants in 85 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 71/267 places, 199/477 transitions.
Applied a total of 0 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 138 ms. Remains : 71/267 places, 199/477 transitions.
[2025-05-31 00:33:10] [INFO ] Flatten gal took : 10 ms
[2025-05-31 00:33:10] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:33:10] [INFO ] Input system was already deterministic with 199 transitions.
[2025-05-31 00:33:10] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:33:10] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:33:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality446757200507011520.gal : 1 ms
[2025-05-31 00:33:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality16925767717599484018.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/CTLCardinality446757200507011520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16925767717599484018.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34122e+07,1.5525,52248,2,3518,5,182988,6,0,482,191352,0


Converting to forward existential form...Done !
original formula: E(E(((A((p171!=1) U ((p77!=0)&&(!((p108==0)||(p127==1))))) + E((p217==1) U ((p173==0)||(p286==1)))) + (p190!=1)) U EG(AF(((p155==0)||(p12...188
=> equivalent forward existential formula: [(FwdU(Init,E(((!((E(!(((p77!=0)&&(!((p108==0)||(p127==1))))) U (!((p171!=1)) * !(((p77!=0)&&(!((p108==0)||(p127...343
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t10, t12, t14, t17, t19, t24, t26, t28, t29, t31, t36, t38, t43, t45, t47...920
Detected timeout of ITS tools.
[2025-05-31 00:33:40] [INFO ] Flatten gal took : 17 ms
[2025-05-31 00:33:40] [INFO ] Applying decomposition
[2025-05-31 00:33:40] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1570851993157123926.txt' '-o' '/tmp/graph1570851993157123926.bin' '-w' '/tmp/graph1570851993157123926.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1570851993157123926.bin' '-l' '-1' '-v' '-w' '/tmp/graph1570851993157123926.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:33:40] [INFO ] Decomposing Gal with order
[2025-05-31 00:33:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:33:40] [INFO ] Removed a total of 577 redundant transitions.
[2025-05-31 00:33:40] [INFO ] Flatten gal took : 27 ms
[2025-05-31 00:33:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2 ms.
[2025-05-31 00:33:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality6492961256134514903.gal : 1 ms
[2025-05-31 00:33:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality1008884135081275394.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/CTLCardinality6492961256134514903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1008884135081275394.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34122e+07,0.026264,4776,200,72,1437,415,261,1673,73,1606,0


Converting to forward existential form...Done !
original formula: E(E(((A((i7.u12.p171!=1) U ((i1.u3.p77!=0)&&(!((i3.u6.p108==0)||(i5.u11.p127==1))))) + E((u16.p217==1) U ((i7.u13.p173==0)||(i11.i1.u24.p...275
=> equivalent forward existential formula: [(FwdU(Init,E(((!((E(!(((i1.u3.p77!=0)&&(!((i3.u6.p108==0)||(i5.u11.p127==1))))) U (!((i7.u12.p171!=1)) * !(((i1...468
Reverse transition relation is NOT exact ! Due to transitions t55, t56, t57, t58, t59, t60, t61, t62, t71, t72, t73, t74, t75, t76, t77, t78, t87, t88, t89...623
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 11
(forward)formula 0,1,2.16185,107048,1,0,227833,1187,1895,349100,394,4743,284465
FORMULA AutonomousCar-PT-06b-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2025-05-31 00:33:43] [INFO ] Flatten gal took : 14 ms
[2025-05-31 00:33:43] [INFO ] Flatten gal took : 14 ms
[2025-05-31 00:33:43] [INFO ] Applying decomposition
[2025-05-31 00:33:43] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8101196403848696929.txt' '-o' '/tmp/graph8101196403848696929.bin' '-w' '/tmp/graph8101196403848696929.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8101196403848696929.bin' '-l' '-1' '-v' '-w' '/tmp/graph8101196403848696929.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:33:43] [INFO ] Decomposing Gal with order
[2025-05-31 00:33:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:33:43] [INFO ] Removed a total of 849 redundant transitions.
[2025-05-31 00:33:43] [INFO ] Flatten gal took : 26 ms
[2025-05-31 00:33:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 4 ms.
[2025-05-31 00:33:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality12775866142860381195.gal : 2 ms
[2025-05-31 00:33:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality6114338105655225985.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/CTLCardinality12775866142860381195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6114338105655225985.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 6 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.49975e+12,0.199229,11624,985,132,15230,1046,654,19077,98,4645,0


Converting to forward existential form...Done !
original formula: (A((!(AX(((i1.i0.i1.u17.p35==0)||(i10.u63.p182==1)))) * AG(((EG(((i15.u96.p271==0)||(i16.u90.p253==1))) * ((i3.u27.p74==0)||(i3.u23.p94==...568
=> equivalent forward existential formula: ([((Init * !(EG(!((i7.u39.p118==1))))) * !(E(!((i7.u39.p118==1)) U (!((!(!(EX(!(((i1.i0.i1.u17.p35==0)||(i10.u63...1815
Reverse transition relation is NOT exact ! Due to transitions t151, t249, t251, t257, t281, t365, t395, t474, i0.t129, i0.u52.t133, i0.u52.t134, i0.u52.t13...834
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,63.5715,1680912,1,0,3.27384e+06,7068,6282,3.81947e+06,579,53312,3540072
FORMULA AutonomousCar-PT-06b-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(AF(!(A(((i15.u99.p282==0)||(i11.i0.i0.u69.p196==1)) U EG(((i12.u88.p243==0)||(i15.u99.p282==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(!((E(!(EG(((i12.u88.p243==0)||(i15.u99.p282==1)))) U (!(((i15.u99.p282==0)||(i11.i0.i0.u69...285
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 16
Using saturation style SCC detection
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 1,0,81.6568,2187292,1,0,4.2768e+06,7404,6337,5.03056e+06,579,56956,4538203
FORMULA AutonomousCar-PT-06b-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(EG(EF(!(E((i2.u20.p57==1) U (i13.u83.p232==1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),E(TRUE U !(E((i2.u20.p57==1) U (i13.u83.p232==1)))))] != FALSE
(forward)formula 2,1,82.7727,2221212,1,0,4.35364e+06,7581,6533,5.11099e+06,579,58749,4644680
FORMULA AutonomousCar-PT-06b-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(E((AG(AX((i3.u29.p79==0))) + (i9.u59.p167==1)) U AF((i1.i0.i0.u13.p38==1))))
=> equivalent forward existential formula: [(FwdU(Init,(!(E(TRUE U !(!(EX(!((i3.u29.p79==0))))))) + (i9.u59.p167==1))) * !(EG(!((i1.i0.i0.u13.p38==1)))))] ...162
(forward)formula 3,1,116.602,2291940,1,0,4.50365e+06,7693,2324,5.30226e+06,275,59830,1330257
FORMULA AutonomousCar-PT-06b-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(((AG(E(AG(((i1.i0.i1.u17.p35==0)||(i10.u63.p179==1))) U !((((i9.u56.p171==0)||(i16.u3.p10==1))&&((i10.u64.p184==0)||(i6.u42.p100==1))))...396
=> equivalent forward existential formula: ([(((FwdU(Init,((!(E(TRUE U !(E(!(E(TRUE U !(((i1.i0.i1.u17.p35==0)||(i10.u63.p179==1))))) U !((((i9.u56.p171==0...725
(forward)formula 4,1,133.779,2291940,1,0,4.50365e+06,7710,2920,5.30226e+06,300,59830,2511433
FORMULA AutonomousCar-PT-06b-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(((!(EG(A((i3.u24.p82==1) U ((i1.i1.i1.u15.p42==0)||(i12.u78.p249==1))))) * (!((EX((i10.u63.p182==1)) * EF(((i16.u90.p250==0)||(i1.i0.i0...423
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((E(!(E(TRUE U !(((i11.i1.i1.u77.p217==0)||(i12.u88.p243==1))))) U !(E(TRUE U !((i8.u44.p...927
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 a local SCC at level 16
ITS-tools command line returned an error code 139
[2025-05-31 00:37:02] [INFO ] Applying decomposition
[2025-05-31 00:37:02] [INFO ] Flatten gal took : 21 ms
[2025-05-31 00:37:02] [INFO ] Decomposing Gal with order
[2025-05-31 00:37:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:37:02] [INFO ] Removed a total of 982 redundant transitions.
[2025-05-31 00:37:02] [INFO ] Flatten gal took : 23 ms
[2025-05-31 00:37:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 222 labels/synchronizations in 4 ms.
[2025-05-31 00:37:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality17951803194467793939.gal : 2 ms
[2025-05-31 00:37:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality13832408595679341479.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/CTLCardinality17951803194467793939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13832408595679341479.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.49975e+12,0.072209,6768,492,900,2777,2817,231,7461,309,13650,0


Converting to forward existential form...Done !
original formula: A(((!(EG(A((i1.i0.i0.i0.i0.i0.i0.u12.p82==1) U ((i1.i0.i0.i0.i0.i0.i0.u11.p42==0)||(i1.i0.u17.p249==1))))) * (!((EX((i1.i0.i0.i0.u15.p182...526
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((E(!(E(TRUE U !(((i1.i0.i0.u16.p217==0)||(i1.i0.u17.p243==1))))) U !(E(TRUE U !((i1.i0.i...1082
Reverse transition relation is NOT exact ! Due to transitions t334, i0.u2.t251, i0.u2.t252, i0.u2.t253, i0.u3.t249, i1.t474, i1.i0.u17.t35, i1.i0.u17.t41, ...1408
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Detected timeout of ITS tools.
[2025-05-31 01:03:38] [INFO ] Flatten gal took : 14 ms
[2025-05-31 01:03:38] [INFO ] Input system was already deterministic with 477 transitions.
[2025-05-31 01:03:38] [INFO ] Transformed 267 places.
[2025-05-31 01:03:38] [INFO ] Transformed 477 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:03:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality11594694387997979479.gal : 4 ms
[2025-05-31 01:03:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality13501789479984949186.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/CTLCardinality11594694387997979479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13501789479984949186.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 -...330
Successfully loaded order from file /home/mcc/execution/model.ord
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.49975e+12,7.40695,218800,2,74402,5,989855,6,0,1547,511771,0


Converting to forward existential form...Done !
original formula: A(((!(EG(A((p82==1) U ((p42==0)||(p249==1))))) * (!((EX((p182==1)) * EF(((p250==0)||(p38==1))))) + EG(AX((p16==1))))) * (E(((p107==0)||(p...280
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((E(!(E(TRUE U !(((p217==0)||(p243==1))))) U !(E(TRUE U !((p128==0))))) * (p200!=1)))))))...656
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t18, t26, t35, t41, t42, t69, t70, t73, t74, t76, t91, t99, t100, t103, t104, t106,...610
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0

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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-06b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-06b, examination is CTLCardinality"
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-174853729800689"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06b.tgz
mv AutonomousCar-PT-06b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;