Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339200049.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 Champagne-PT-H06T0R, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339200049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.7K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 6 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 6 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 11:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Jun 6 11:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 11:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 6 11:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 83K Jun 5 20:08 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 Champagne-PT-H06T0R-CTLCardinality-2025-00
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2025-01
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2025-02
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2025-03
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2025-04
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2025-05
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2025-06
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2025-07
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2025-08
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2025-09
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2025-10
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2025-11
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2025-12
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2025-13
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2025-14
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749319574122

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H06T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-07 18:06:15] [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-06-07 18:06:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 18:06:15] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2025-06-07 18:06:15] [INFO ] Transformed 399 places.
[2025-06-07 18:06:15] [INFO ] Transformed 528 transitions.
[2025-06-07 18:06:15] [INFO ] Found NUPN structural information;
[2025-06-07 18:06:15] [INFO ] Parsed PT model containing 399 places and 528 transitions and 1345 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 124 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 528/528 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 340 transition count 469
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 340 transition count 469
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 139 place count 319 transition count 448
Iterating global reduction 0 with 21 rules applied. Total rules applied 160 place count 319 transition count 448
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 166 place count 313 transition count 433
Iterating global reduction 0 with 6 rules applied. Total rules applied 172 place count 313 transition count 433
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 175 place count 313 transition count 430
Applied a total of 175 rules in 76 ms. Remains 313 /399 variables (removed 86) and now considering 430/528 (removed 98) transitions.
// Phase 1: matrix 430 rows 313 cols
[2025-06-07 18:06:15] [INFO ] Computed 20 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:06:15] [INFO ] Implicit Places using invariants in 312 ms returned []
[2025-06-07 18:06:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:06:16] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 429 sub problems to find dead transitions.
[2025-06-07 18:06:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/313 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:22] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:23] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:23] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:23] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:23] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:23] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:23] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:23] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:24] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:24] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:24] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:24] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:24] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:24] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:24] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:24] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:24] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:24] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:24] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:24] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:25] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:25] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:25] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:25] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:25] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:26] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:26] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:26] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:26] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:26] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:27] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:27] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:27] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:27] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:27] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (OVERLAPS) 430/743 variables, 313/368 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:35] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/743 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:43] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 timeout
0.0)
(s181 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 743/743 variables, and 370 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/313 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 37/57 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 430/743 variables, 313/370 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/743 variables, 429/799 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:53] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:54] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:54] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:54] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:54] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:54] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:54] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:54] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:54] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:54] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:55] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:55] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:55] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:55] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:55] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:56] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:56] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:56] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:56] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:57] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/743 variables, 20/819 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:59] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:00] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:00] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:01] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:01] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:01] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/743 variables, 6/825 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:09] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:10] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:10] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:10] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/743 variables, 4/829 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:16] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 743/743 variables, and 830 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Starting structural reductions in LTL mode, iteration 1 : 313/399 places, 430/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60872 ms. Remains : 313/399 places, 430/528 transitions.
Support contains 124 out of 313 places after structural reductions.
[2025-06-07 18:07:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-07 18:07:16] [INFO ] Flatten gal took : 85 ms
FORMULA Champagne-PT-H06T0R-CTLCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-07 18:07:16] [INFO ] Flatten gal took : 44 ms
[2025-06-07 18:07:16] [INFO ] Input system was already deterministic with 430 transitions.
Support contains 109 out of 313 places (down from 124) after GAL structural reductions.
RANDOM walk for 40000 steps (167 resets) in 1289 ms. (31 steps per ms) remains 5/65 properties
BEST_FIRST walk for 40004 steps (13 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (13 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 72 ms. (548 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 3/4 properties
[2025-06-07 18:07:17] [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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 72/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 237/313 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 430/743 variables, 313/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/743 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/743 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 743/743 variables, and 333 constraints, problems are : Problem set: 0 solved, 3 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 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: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 72/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 237/313 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:17] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 430/743 variables, 313/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/743 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:18] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:18] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:18] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/743 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/743 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/743 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 743/743 variables, and 340 constraints, problems are : Problem set: 0 solved, 3 unsolved in 669 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 908ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 60 ms.
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 430/430 transitions.
Graph (trivial) has 304 edges and 313 vertex of which 50 / 313 are part of one of the 7 SCC in 2 ms
Free SCC test removed 43 places
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 270 transition count 288
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 120 rules applied. Total rules applied 206 place count 185 transition count 253
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 223 place count 168 transition count 253
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 223 place count 168 transition count 244
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 241 place count 159 transition count 244
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 283 place count 117 transition count 192
Iterating global reduction 3 with 42 rules applied. Total rules applied 325 place count 117 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 328 place count 117 transition count 189
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 328 place count 117 transition count 178
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 350 place count 106 transition count 178
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 357 place count 99 transition count 152
Iterating global reduction 4 with 7 rules applied. Total rules applied 364 place count 99 transition count 152
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 371 place count 99 transition count 145
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 449 place count 60 transition count 106
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 451 place count 58 transition count 99
Iterating global reduction 5 with 2 rules applied. Total rules applied 453 place count 58 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 455 place count 58 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 459 place count 56 transition count 103
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 463 place count 56 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 467 place count 56 transition count 95
Free-agglomeration rule applied 31 times.
Iterating global reduction 7 with 31 rules applied. Total rules applied 498 place count 56 transition count 64
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 7 with 85 rules applied. Total rules applied 583 place count 25 transition count 10
Ensure Unique test removed 14 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 597 place count 11 transition count 10
Applied a total of 597 rules in 50 ms. Remains 11 /313 variables (removed 302) and now considering 10/430 (removed 420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 11/313 places, 10/430 transitions.
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
[2025-06-07 18:07:18] [INFO ] Flatten gal took : 28 ms
[2025-06-07 18:07:18] [INFO ] Flatten gal took : 26 ms
[2025-06-07 18:07:18] [INFO ] Input system was already deterministic with 430 transitions.
Computed a total of 53 stabilizing places and 53 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 313/313 places, 430/430 transitions.
Graph (trivial) has 303 edges and 313 vertex of which 50 / 313 are part of one of the 7 SCC in 0 ms
Free SCC test removed 43 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 269 transition count 297
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 115 rules applied. Total rules applied 198 place count 187 transition count 264
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 215 place count 171 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 216 place count 170 transition count 263
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 216 place count 170 transition count 255
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 232 place count 162 transition count 255
Discarding 44 places :
Symmetric choice reduction at 4 with 44 rule applications. Total rules 276 place count 118 transition count 201
Iterating global reduction 4 with 44 rules applied. Total rules applied 320 place count 118 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 324 place count 118 transition count 197
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 324 place count 118 transition count 186
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 346 place count 107 transition count 186
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 353 place count 100 transition count 160
Iterating global reduction 5 with 7 rules applied. Total rules applied 360 place count 100 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 367 place count 100 transition count 153
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 445 place count 61 transition count 114
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 447 place count 59 transition count 107
Iterating global reduction 6 with 2 rules applied. Total rules applied 449 place count 59 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 451 place count 59 transition count 105
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 453 place count 57 transition count 103
Applied a total of 453 rules in 93 ms. Remains 57 /313 variables (removed 256) and now considering 103/430 (removed 327) transitions.
[2025-06-07 18:07:18] [INFO ] Flow matrix only has 57 transitions (discarded 46 similar events)
// Phase 1: matrix 57 rows 57 cols
[2025-06-07 18:07:18] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:07:18] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-07 18:07:18] [INFO ] Flow matrix only has 57 transitions (discarded 46 similar events)
[2025-06-07 18:07:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:07:19] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:07:19] [INFO ] Redundant transitions in 2 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-07 18:07:19] [INFO ] Flow matrix only has 57 transitions (discarded 46 similar events)
[2025-06-07 18:07: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/55 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 2/57 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 56/113 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 0/113 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/114 variables, and 77 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1069 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 2/57 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 56/113 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 61/138 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/114 variables, and 138 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1156 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2234ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 2234ms
Starting structural reductions in SI_CTL mode, iteration 1 : 57/313 places, 103/430 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2455 ms. Remains : 57/313 places, 103/430 transitions.
[2025-06-07 18:07:21] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:07:21] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:07:21] [INFO ] Input system was already deterministic with 103 transitions.
[2025-06-07 18:07:21] [INFO ] Flatten gal took : 14 ms
RANDOM walk for 255 steps (6 resets) in 22 ms. (11 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H06T0R-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 18:07:21] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:07:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9692243775238819374.gal : 4 ms
[2025-06-07 18:07:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6309116666445890527.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9692243775238819374.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6309116666445890527.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 430/430 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 257 transition count 367
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 257 transition count 367
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 114 place count 257 transition count 365
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 139 place count 232 transition count 329
Iterating global reduction 1 with 25 rules applied. Total rules applied 164 place count 232 transition count 329
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 168 place count 232 transition count 325
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 182 place count 218 transition count 300
Iterating global reduction 2 with 14 rules applied. Total rules applied 196 place count 218 transition count 300
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 203 place count 218 transition count 293
Applied a total of 203 rules in 15 ms. Remains 218 /313 variables (removed 95) and now considering 293/430 (removed 137) transitions.
// Phase 1: matrix 293 rows 218 cols
[2025-06-07 18:07:21] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:07:21] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-07 18:07:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:07:21] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2025-06-07 18:07: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/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 293/511 variables, 218/238 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 0/511 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 238 constraints, problems are : Problem set: 0 solved, 292 unsolved in 15473 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 293/511 variables, 218/238 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 292/530 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:43] [INFO ] Deduced a trap along path composed of 9 places in 51 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:46] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:46] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:46] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:47] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:47] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:47] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:47] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:47] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:47] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:48] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:48] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 11/542 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:50] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:52] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:52] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:52] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:53] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 4/547 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/511 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/511 variables, and 547 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45509ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 45511ms
Starting structural reductions in LTL mode, iteration 1 : 218/313 places, 293/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45783 ms. Remains : 218/313 places, 293/430 transitions.
[2025-06-07 18:08:07] [INFO ] Flatten gal took : 15 ms
[2025-06-07 18:08:07] [INFO ] Flatten gal took : 10 ms
[2025-06-07 18:08:07] [INFO ] Input system was already deterministic with 293 transitions.
[2025-06-07 18:08:07] [INFO ] Flatten gal took : 15 ms
[2025-06-07 18:08:07] [INFO ] Flatten gal took : 11 ms
[2025-06-07 18:08:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality3824726608971265276.gal : 8 ms
[2025-06-07 18:08:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality16834174011873928098.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3824726608971265276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16834174011873928098.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,7.86932e+19,0.138164,9128,2,1594,5,24353,6,0,1167,22650,0


Converting to forward existential form...Done !
original formula: EF((EG((((((p96!=0)&&(p67!=0))&&(p160!=1))||(((p227!=0)&&(p322!=0))&&(p380!=1)))||(((p315!=0)||((p151!=0)&&(p314!=1)))&&(p28==0)))) * ((E...320
=> equivalent forward existential formula: (([(EY((FwdU(Init,TRUE) * EG((((((p96!=0)&&(p67!=0))&&(p160!=1))||(((p227!=0)&&(p322!=0))&&(p380!=1)))||(((p315!...1116
Reverse transition relation is NOT exact ! Due to transitions t5, t25, t26, t30, t34, t37, t40, t48, t53, t57, t60, t61, t65, t70, t74, t79, t80, t83, t85,...392
(forward)formula 0,1,10.9969,372468,1,0,744,2.0775e+06,609,345,6919,2.8013e+06,922
FORMULA Champagne-PT-H06T0R-CTLCardinality-2025-01 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 : 313/313 places, 430/430 transitions.
Graph (trivial) has 291 edges and 313 vertex of which 47 / 313 are part of one of the 7 SCC in 2 ms
Free SCC test removed 40 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 272 transition count 302
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 114 rules applied. Total rules applied 196 place count 191 transition count 269
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 213 place count 175 transition count 268
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 216 place count 174 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 217 place count 173 transition count 266
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 217 place count 173 transition count 257
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 235 place count 164 transition count 257
Discarding 41 places :
Symmetric choice reduction at 5 with 41 rule applications. Total rules 276 place count 123 transition count 206
Iterating global reduction 5 with 41 rules applied. Total rules applied 317 place count 123 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 320 place count 123 transition count 203
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 320 place count 123 transition count 195
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 336 place count 115 transition count 195
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 343 place count 108 transition count 169
Iterating global reduction 6 with 7 rules applied. Total rules applied 350 place count 108 transition count 169
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 357 place count 108 transition count 162
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 437 place count 68 transition count 122
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 439 place count 66 transition count 115
Iterating global reduction 7 with 2 rules applied. Total rules applied 441 place count 66 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 443 place count 66 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 445 place count 64 transition count 111
Applied a total of 445 rules in 41 ms. Remains 64 /313 variables (removed 249) and now considering 111/430 (removed 319) transitions.
[2025-06-07 18:08:18] [INFO ] Flow matrix only has 69 transitions (discarded 42 similar events)
// Phase 1: matrix 69 rows 64 cols
[2025-06-07 18:08:18] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:08:18] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-07 18:08:18] [INFO ] Flow matrix only has 69 transitions (discarded 42 similar events)
[2025-06-07 18:08:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:08:18] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:08:18] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2025-06-07 18:08:18] [INFO ] Flow matrix only has 69 transitions (discarded 42 similar events)
[2025-06-07 18:08: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/59 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 5/64 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:18] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 68/132 variables, 64/85 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/133 variables, and 85 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1518 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 5/64 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 68/132 variables, 64/85 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 71/156 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:20] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/133 variables, and 157 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1999 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3523ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 3524ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/313 places, 111/430 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3681 ms. Remains : 64/313 places, 111/430 transitions.
[2025-06-07 18:08:22] [INFO ] Flatten gal took : 10 ms
[2025-06-07 18:08:22] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:08:22] [INFO ] Input system was already deterministic with 111 transitions.
[2025-06-07 18:08:22] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:08:22] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:08:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality2887895450007938098.gal : 1 ms
[2025-06-07 18:08:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality8480666502923667899.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/CTLCardinality2887895450007938098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8480666502923667899.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,5.71405e+09,0.016685,4468,2,142,5,1926,6,0,361,1336,0


Converting to forward existential form...Done !
original formula: AF(((p185==1) + AG((EF(((p238==0)||(p220==1))) * ((p27==0) + A((p77==0) U (p80==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(((p185==1) + !(E(TRUE U !((E(TRUE U ((p238==0)||(p220==1))) * ((p27==0) + !((E(!((p80==0)) U (!((p7...214
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t58, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...175
(forward)formula 0,0,0.16451,10996,1,0,309,39629,254,174,2326,45605,357
FORMULA Champagne-PT-H06T0R-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 430/430 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 248 transition count 355
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 248 transition count 355
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 133 place count 248 transition count 352
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 166 place count 215 transition count 306
Iterating global reduction 1 with 33 rules applied. Total rules applied 199 place count 215 transition count 306
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 204 place count 215 transition count 301
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 222 place count 197 transition count 276
Iterating global reduction 2 with 18 rules applied. Total rules applied 240 place count 197 transition count 276
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 248 place count 197 transition count 268
Applied a total of 248 rules in 20 ms. Remains 197 /313 variables (removed 116) and now considering 268/430 (removed 162) transitions.
// Phase 1: matrix 268 rows 197 cols
[2025-06-07 18:08:22] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:08:22] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-07 18:08:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:08:22] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2025-06-07 18:08:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 268/465 variables, 197/217 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 0/465 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 217 constraints, problems are : Problem set: 0 solved, 267 unsolved in 12431 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 268/465 variables, 197/217 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 267/484 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:40] [INFO ] Deduced a trap along path composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:43] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:43] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:46] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:46] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:46] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 3/490 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:48] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:48] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:49] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:49] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:53] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:53] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/465 variables, and 496 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42461ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 42461ms
Starting structural reductions in LTL mode, iteration 1 : 197/313 places, 268/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42676 ms. Remains : 197/313 places, 268/430 transitions.
[2025-06-07 18:09:04] [INFO ] Flatten gal took : 12 ms
[2025-06-07 18:09:04] [INFO ] Flatten gal took : 13 ms
[2025-06-07 18:09:04] [INFO ] Input system was already deterministic with 268 transitions.
[2025-06-07 18:09:04] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:09:04] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:09:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality4951472306556986158.gal : 2 ms
[2025-06-07 18:09:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality6914060138431990629.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/CTLCardinality4951472306556986158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6914060138431990629.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,9.98793e+18,0.095902,7504,2,1207,5,17637,6,0,1058,13627,0


Converting to forward existential form...Done !
original formula: EG(AX(!(A(AF((p43==0)) U !(EX(((p123==0)||(p112==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(!((E(!(!(EX(((p123==0)||(p112==1))))) U (!(!(EG(!((p43==0))))) * !(!(EX(((p123==0)||(p112==1...218
Reverse transition relation is NOT exact ! Due to transitions t5, t24, t25, t29, t34, t38, t43, t44, t48, t54, t58, t63, t67, t72, t73, t77, t83, t87, t93,...357
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-07 18:09:35] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:09:35] [INFO ] Applying decomposition
[2025-06-07 18:09:35] [INFO ] Flatten gal took : 7 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/graph12721222752843961386.txt' '-o' '/tmp/graph12721222752843961386.bin' '-w' '/tmp/graph12721222752843961386.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12721222752843961386.bin' '-l' '-1' '-v' '-w' '/tmp/graph12721222752843961386.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:09:35] [INFO ] Decomposing Gal with order
[2025-06-07 18:09:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:09:35] [INFO ] Removed a total of 178 redundant transitions.
[2025-06-07 18:09:35] [INFO ] Flatten gal took : 46 ms
[2025-06-07 18:09:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2025-06-07 18:09:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality1346217273080067006.gal : 4 ms
[2025-06-07 18:09:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality8895841944269081415.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/CTLCardinality1346217273080067006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8895841944269081415.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,9.98793e+18,0.241743,14608,1845,19,17314,275,398,47830,52,511,0


Converting to forward existential form...Done !
original formula: EG(AX(!(A(AF((i3.u7.p43==0)) U !(EX(((i0.u18.p123==0)||(i6.u15.p112==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(!((E(!(!(EX(((i0.u18.p123==0)||(i6.u15.p112==1))))) U (!(!(EG(!((i3.u7.p43==0))))) * !(!(EX(...266
Reverse transition relation is NOT exact ! Due to transitions t5, t24, t43, t72, t111, i0.t135, i0.u18.t132, i1.t196, i2.t187, i3.t177, i4.t167, i5.t157, i...518
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an 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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an 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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 313/313 places, 430/430 transitions.
Graph (trivial) has 298 edges and 313 vertex of which 50 / 313 are part of one of the 7 SCC in 1 ms
Free SCC test removed 43 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 269 transition count 299
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 114 rules applied. Total rules applied 195 place count 189 transition count 265
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 212 place count 173 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 213 place count 172 transition count 264
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 213 place count 172 transition count 254
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 233 place count 162 transition count 254
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 272 place count 123 transition count 212
Iterating global reduction 4 with 39 rules applied. Total rules applied 311 place count 123 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 312 place count 123 transition count 211
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 312 place count 123 transition count 202
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 330 place count 114 transition count 202
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 336 place count 108 transition count 179
Iterating global reduction 5 with 6 rules applied. Total rules applied 342 place count 108 transition count 179
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 348 place count 108 transition count 173
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 428 place count 68 transition count 133
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 430 place count 66 transition count 126
Iterating global reduction 6 with 2 rules applied. Total rules applied 432 place count 66 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 434 place count 66 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 436 place count 64 transition count 122
Applied a total of 436 rules in 44 ms. Remains 64 /313 variables (removed 249) and now considering 122/430 (removed 308) transitions.
[2025-06-07 18:10:05] [INFO ] Flow matrix only has 68 transitions (discarded 54 similar events)
// Phase 1: matrix 68 rows 64 cols
[2025-06-07 18:10:05] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:10:05] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-07 18:10:05] [INFO ] Flow matrix only has 68 transitions (discarded 54 similar events)
[2025-06-07 18:10:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:10:05] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:10:05] [INFO ] Redundant transitions in 2 ms returned []
Running 78 sub problems to find dead transitions.
[2025-06-07 18:10:05] [INFO ] Flow matrix only has 68 transitions (discarded 54 similar events)
[2025-06-07 18:10:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 3/64 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 67/131 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/131 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/132 variables, and 84 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1547 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 3/64 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 67/131 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 78/162 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/132 variables, and 162 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1582 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3137ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3137ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/313 places, 122/430 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3325 ms. Remains : 64/313 places, 122/430 transitions.
[2025-06-07 18:10:08] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:10:08] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:10:08] [INFO ] Input system was already deterministic with 122 transitions.
[2025-06-07 18:10:08] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:10:08] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:10:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality10024615645810620163.gal : 1 ms
[2025-06-07 18:10:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality15564373442121069991.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/CTLCardinality10024615645810620163.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15564373442121069991.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,3.80937e+09,0.036222,4504,2,109,5,1319,6,0,373,755,0


Converting to forward existential form...Done !
original formula: EF(((EF((p128==1)) * AF((p220==1))) * (AG((p214==1)) * ((p268==0)||(p325==1)))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (E(TRUE U (p128==1)) * !(EG(!((p220==1)))))) * ((p268==0)||(p325==1))) * !(E(TRUE U !((p21...174
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.07013,4760,1,0,7,4780,15,1,1671,1364,5
FORMULA Champagne-PT-H06T0R-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 313/313 places, 430/430 transitions.
Graph (trivial) has 299 edges and 313 vertex of which 47 / 313 are part of one of the 7 SCC in 0 ms
Free SCC test removed 40 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 272 transition count 302
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 113 rules applied. Total rules applied 195 place count 191 transition count 270
Reduce places removed 16 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 19 rules applied. Total rules applied 214 place count 175 transition count 267
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 217 place count 172 transition count 267
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 217 place count 172 transition count 259
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 233 place count 164 transition count 259
Discarding 44 places :
Symmetric choice reduction at 4 with 44 rule applications. Total rules 277 place count 120 transition count 205
Iterating global reduction 4 with 44 rules applied. Total rules applied 321 place count 120 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 324 place count 120 transition count 202
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 324 place count 120 transition count 191
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 346 place count 109 transition count 191
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 352 place count 103 transition count 167
Iterating global reduction 5 with 6 rules applied. Total rules applied 358 place count 103 transition count 167
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 364 place count 103 transition count 161
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 6 with 70 rules applied. Total rules applied 434 place count 68 transition count 126
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 436 place count 66 transition count 119
Iterating global reduction 6 with 2 rules applied. Total rules applied 438 place count 66 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 440 place count 66 transition count 117
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 442 place count 64 transition count 115
Applied a total of 442 rules in 34 ms. Remains 64 /313 variables (removed 249) and now considering 115/430 (removed 315) transitions.
[2025-06-07 18:10:08] [INFO ] Flow matrix only has 73 transitions (discarded 42 similar events)
// Phase 1: matrix 73 rows 64 cols
[2025-06-07 18:10:08] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:10:08] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-07 18:10:08] [INFO ] Flow matrix only has 73 transitions (discarded 42 similar events)
[2025-06-07 18:10:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:10:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-07 18:10:08] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:10:08] [INFO ] Redundant transitions in 2 ms returned []
Running 81 sub problems to find dead transitions.
[2025-06-07 18:10:08] [INFO ] Flow matrix only has 73 transitions (discarded 42 similar events)
[2025-06-07 18:10:08] [INFO ] Invariant cache hit.
[2025-06-07 18:10:08] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 72/136 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/137 variables, and 87 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1559 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 64/64 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 72/136 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 81/168 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:11] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 0/136 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/137 variables, and 169 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2192 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 64/64 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3764ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3764ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/313 places, 115/430 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3916 ms. Remains : 64/313 places, 115/430 transitions.
[2025-06-07 18:10:12] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:10:12] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:10:12] [INFO ] Input system was already deterministic with 115 transitions.
[2025-06-07 18:10:12] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:10:12] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:10:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality17810707789983759707.gal : 1 ms
[2025-06-07 18:10:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality14303618431859791882.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/CTLCardinality17810707789983759707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14303618431859791882.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,4.57275e+09,0.016154,4548,2,122,5,1363,6,0,366,770,0


Converting to forward existential form...Done !
original formula: AG((EG((!(E((p95==1) U ((p69==0)||(p321==1)))) * (p118==0))) + (p385==0)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p385==0))) * !(EG((!(E((p95==1) U ((p69==0)||(p321==1)))) * (p118==0)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 113/0/2
Using saturation style SCC detection
(forward)formula 0,0,0.076,6852,1,0,19,14555,27,9,1922,12493,11
FORMULA Champagne-PT-H06T0R-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 430/430 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 262 transition count 369
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 262 transition count 369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 105 place count 262 transition count 366
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 129 place count 238 transition count 330
Iterating global reduction 1 with 24 rules applied. Total rules applied 153 place count 238 transition count 330
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 157 place count 238 transition count 326
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 170 place count 225 transition count 302
Iterating global reduction 2 with 13 rules applied. Total rules applied 183 place count 225 transition count 302
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 188 place count 225 transition count 297
Applied a total of 188 rules in 10 ms. Remains 225 /313 variables (removed 88) and now considering 297/430 (removed 133) transitions.
// Phase 1: matrix 297 rows 225 cols
[2025-06-07 18:10:12] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:10:12] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-07 18:10:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:10:12] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2025-06-07 18:10:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:16] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:16] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:16] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:16] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:16] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:16] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:16] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:17] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:17] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:17] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:17] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (OVERLAPS) 297/522 variables, 225/256 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 0/522 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 256 constraints, problems are : Problem set: 0 solved, 296 unsolved in 20497 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 297/522 variables, 225/256 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 296/552 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:37] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:37] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:37] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:37] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:37] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:38] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:38] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 7/559 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:42] [INFO ] Deduced a trap along path composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:46] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:47] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:47] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 3/563 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:50] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/522 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:55] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/522 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/522 variables, and 565 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50532ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 50533ms
Starting structural reductions in LTL mode, iteration 1 : 225/313 places, 297/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50746 ms. Remains : 225/313 places, 297/430 transitions.
[2025-06-07 18:11:03] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:11:03] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:11:03] [INFO ] Input system was already deterministic with 297 transitions.
[2025-06-07 18:11:03] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:11:03] [INFO ] Flatten gal took : 24 ms
[2025-06-07 18:11:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality4759379682044816917.gal : 2 ms
[2025-06-07 18:11:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality7067213292857889665.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/CTLCardinality4759379682044816917.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7067213292857889665.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.33585e+20,0.184924,11220,2,2203,5,35935,6,0,1199,32409,0


Converting to forward existential form...Done !
original formula: E(EF((EX(TRUE) + (p218==0))) U (A((((A(((p117==0)||(p384==1)) U ((p223==0)||(p342==1))) * (p88==1)) * (EX((p274==0)) * (((p90==0)||(p303=...293
=> equivalent forward existential formula: ([((FwdU(Init,E(TRUE U (EX(TRUE) + (p218==0)))) * !(EG(!(!(E(TRUE U !(((((p265==0)||(p68==0))||(p87==1)) * E(TRU...695
Reverse transition relation is NOT exact ! Due to transitions t5, t14, t26, t27, t31, t36, t37, t41, t46, t47, t51, t57, t62, t71, t75, t79, t81, t82, t83,...433
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,17.6492,524164,1,0,1059,2.71479e+06,640,508,7858,3.48442e+06,1290
FORMULA Champagne-PT-H06T0R-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 430/430 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 254 transition count 361
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 254 transition count 361
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 254 transition count 358
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 151 place count 224 transition count 316
Iterating global reduction 1 with 30 rules applied. Total rules applied 181 place count 224 transition count 316
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 185 place count 224 transition count 312
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 203 place count 206 transition count 283
Iterating global reduction 2 with 18 rules applied. Total rules applied 221 place count 206 transition count 283
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 229 place count 206 transition count 275
Applied a total of 229 rules in 18 ms. Remains 206 /313 variables (removed 107) and now considering 275/430 (removed 155) transitions.
// Phase 1: matrix 275 rows 206 cols
[2025-06-07 18:11:21] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:11:21] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-07 18:11:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:11:21] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2025-06-07 18:11: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/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:24] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:24] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:24] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:24] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:24] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:24] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/481 variables, 206/232 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (OVERLAPS) 0/481 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 232 constraints, problems are : Problem set: 0 solved, 274 unsolved in 15590 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/481 variables, 206/232 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 274/506 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:41] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:41] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:41] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 3/509 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:42] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:43] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 2/511 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:45] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:45] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:45] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 3/514 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:48] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:50] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:51] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:51] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:54] [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-06-07 18:11:54] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/481 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/481 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:12:05] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/481 variables, and 521 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45629ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 45630ms
Starting structural reductions in LTL mode, iteration 1 : 206/313 places, 275/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45869 ms. Remains : 206/313 places, 275/430 transitions.
[2025-06-07 18:12:07] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:12:07] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:12:07] [INFO ] Input system was already deterministic with 275 transitions.
[2025-06-07 18:12:07] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:12:07] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:12:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality11826344144625671838.gal : 1 ms
[2025-06-07 18:12:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality7646246748662988196.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/CTLCardinality11826344144625671838.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7646246748662988196.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,2.29718e+19,0.145294,9592,2,1617,5,28580,6,0,1101,24275,0


Converting to forward existential form...Done !
original formula: E((AF((EF(((p354==0)||(p101==1))) * EX(EF(((p376==0)||(p160==1)))))) * !(A(A((p351==1) U (((p374==0)||(p29==1))&&(p387==1))) U E(((p24==0...205
=> equivalent forward existential formula: [(EY(FwdU(Init,(!(EG(!((E(TRUE U ((p354==0)||(p101==1))) * EX(E(TRUE U ((p376==0)||(p160==1)))))))) * !(!((E(!(E...475
Reverse transition relation is NOT exact ! Due to transitions t5, t12, t27, t28, t34, t41, t45, t50, t51, t52, t56, t61, t62, t66, t71, t75, t80, t81, t85,...404
Detected timeout of ITS tools.
[2025-06-07 18:12:37] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:12:37] [INFO ] Applying decomposition
[2025-06-07 18:12:37] [INFO ] Flatten gal took : 5 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/graph17525808261837957589.txt' '-o' '/tmp/graph17525808261837957589.bin' '-w' '/tmp/graph17525808261837957589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17525808261837957589.bin' '-l' '-1' '-v' '-w' '/tmp/graph17525808261837957589.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:12:37] [INFO ] Decomposing Gal with order
[2025-06-07 18:12:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:12:37] [INFO ] Removed a total of 186 redundant transitions.
[2025-06-07 18:12:37] [INFO ] Flatten gal took : 19 ms
[2025-06-07 18:12:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-07 18:12:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality17212865681722499672.gal : 10 ms
[2025-06-07 18:12:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality8188896828167250442.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/CTLCardinality17212865681722499672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8188896828167250442.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.29718e+19,0.146586,10712,1756,21,13129,305,491,17638,62,604,0


Converting to forward existential form...Done !
original formula: E((AF((EF(((i18.i1.u59.p354==0)||(i0.i0.u17.p101==1))) * EX(EF(((i19.i1.u65.p376==0)||(i8.u24.p160==1)))))) * !(A(A((i18.i1.u58.p351==1) ...310
=> equivalent forward existential formula: [(EY(FwdU(Init,(!(EG(!((E(TRUE U ((i18.i1.u59.p354==0)||(i0.i0.u17.p101==1))) * EX(E(TRUE U ((i19.i1.u65.p376==0...674
Reverse transition relation is NOT exact ! Due to transitions t5, t27, t51, t61, t80, t100, t119, t141, t160, i1.t205, i2.t195, i2.u6.t191, i3.t185, i4.t17...599
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an 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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 430/430 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 249 transition count 356
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 249 transition count 356
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 131 place count 249 transition count 353
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 162 place count 218 transition count 312
Iterating global reduction 1 with 31 rules applied. Total rules applied 193 place count 218 transition count 312
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 197 place count 218 transition count 308
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 216 place count 199 transition count 278
Iterating global reduction 2 with 19 rules applied. Total rules applied 235 place count 199 transition count 278
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 243 place count 199 transition count 270
Applied a total of 243 rules in 17 ms. Remains 199 /313 variables (removed 114) and now considering 270/430 (removed 160) transitions.
// Phase 1: matrix 270 rows 199 cols
[2025-06-07 18:13:07] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:13:07] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-07 18:13:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:13:07] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2025-06-07 18:13:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (OVERLAPS) 270/469 variables, 199/219 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (OVERLAPS) 0/469 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 219 constraints, problems are : Problem set: 0 solved, 269 unsolved in 13163 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (OVERLAPS) 270/469 variables, 199/219 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 269/488 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:26] [INFO ] Deduced a trap along path composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:29] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:29] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:32] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:34] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:35] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:39] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:41] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:42] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 2/497 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:45] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/469 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/469 variables, and 498 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43195ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 43195ms
Starting structural reductions in LTL mode, iteration 1 : 199/313 places, 270/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43403 ms. Remains : 199/313 places, 270/430 transitions.
[2025-06-07 18:13:50] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:13:50] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:13:50] [INFO ] Input system was already deterministic with 270 transitions.
[2025-06-07 18:13:50] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:13:50] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:13:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality12030374829227512396.gal : 1 ms
[2025-06-07 18:13:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality5964854017680565295.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/CTLCardinality12030374829227512396.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5964854017680565295.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.22167e+19,0.117746,7508,2,1226,5,17655,6,0,1068,13742,0


Converting to forward existential form...Done !
original formula: EX(((EX(TRUE) * AG(((p49==0)||(p253==0)))) * ((EF((p95==0)) + AX((p158==0))) + EX(EX(((p208==0)&&(p265==1)))))))
=> equivalent forward existential formula: (([(FwdU((EY(Init) * (EX(TRUE) * !(E(TRUE U !(((p49==0)||(p253==0))))))),TRUE) * (p95==0))] != FALSE + [((EY(Ini...358
Reverse transition relation is NOT exact ! Due to transitions t5, t24, t25, t29, t34, t38, t43, t44, t48, t54, t58, t63, t67, t73, t76, t83, t84, t88, t94,...357
(forward)formula 0,0,6.5637,217052,1,0,579,1.19525e+06,566,304,6618,1.22786e+06,730
FORMULA Champagne-PT-H06T0R-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 430/430 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 254 transition count 361
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 254 transition count 361
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 254 transition count 358
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 146 place count 229 transition count 327
Iterating global reduction 1 with 25 rules applied. Total rules applied 171 place count 229 transition count 327
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 173 place count 229 transition count 325
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 189 place count 213 transition count 306
Iterating global reduction 2 with 16 rules applied. Total rules applied 205 place count 213 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 211 place count 213 transition count 300
Applied a total of 211 rules in 14 ms. Remains 213 /313 variables (removed 100) and now considering 300/430 (removed 130) transitions.
// Phase 1: matrix 300 rows 213 cols
[2025-06-07 18:13:57] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:13:57] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-07 18:13:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:13:57] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 299 sub problems to find dead transitions.
[2025-06-07 18:13:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:00] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 300/513 variables, 213/234 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/513 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 234 constraints, problems are : Problem set: 0 solved, 299 unsolved in 17351 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 300/513 variables, 213/234 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 299/533 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:18] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:19] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:19] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 3/536 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:21] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:22] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:22] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 3/539 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:31] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 5 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/513 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/513 variables, and 540 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47387ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 47387ms
Starting structural reductions in LTL mode, iteration 1 : 213/313 places, 300/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47601 ms. Remains : 213/313 places, 300/430 transitions.
[2025-06-07 18:14:45] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:14:45] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:14:45] [INFO ] Input system was already deterministic with 300 transitions.
[2025-06-07 18:14:45] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:14:45] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:14:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality13323455985264085560.gal : 1 ms
[2025-06-07 18:14:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality17984327659083347625.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/CTLCardinality13323455985264085560.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17984327659083347625.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,4.77971e+19,0.158181,9320,2,1570,5,24967,6,0,1154,23574,0


Converting to forward existential form...Done !
original formula: EG(E(EF(EG((p384!=0))) U ((EX(!((((p286==1)||(p30==0))||(p107==1)))) + A(((p186==0)||(p373==1)) U ((p239==0)||(p193==1)))) + AG(((p149==0...172
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U EG((p384!=0))) U ((EX(!((((p286==1)||(p30==0))||(p107==1)))) + !((E(!(((p239==0)||(p193==1...306
Reverse transition relation is NOT exact ! Due to transitions t5, t14, t27, t28, t32, t37, t41, t46, t47, t51, t57, t61, t65, t68, t72, t77, t78, t82, t90,...404
Detected timeout of ITS tools.
[2025-06-07 18:15:15] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:15:15] [INFO ] Applying decomposition
[2025-06-07 18:15:15] [INFO ] Flatten gal took : 5 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/graph11649145183854630754.txt' '-o' '/tmp/graph11649145183854630754.bin' '-w' '/tmp/graph11649145183854630754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11649145183854630754.bin' '-l' '-1' '-v' '-w' '/tmp/graph11649145183854630754.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:15:15] [INFO ] Decomposing Gal with order
[2025-06-07 18:15:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:15:15] [INFO ] Removed a total of 212 redundant transitions.
[2025-06-07 18:15:15] [INFO ] Flatten gal took : 14 ms
[2025-06-07 18:15:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-07 18:15:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality8733519606854544498.gal : 2 ms
[2025-06-07 18:15:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality2860100303303830330.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/CTLCardinality8733519606854544498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2860100303303830330.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.77971e+19,0.128585,9888,1816,26,12655,482,502,11028,68,1119,0


Converting to forward existential form...Done !
original formula: EG(E(EF(EG((i20.u63.p384!=0))) U ((EX(!((((i15.u47.p286==1)||(i2.u5.p30==0))||(i6.u15.p107==1)))) + A(((i10.i0.u30.p186==0)||(i19.u59.p37...254
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U EG((i20.u63.p384!=0))) U ((EX(!((((i15.u47.p286==1)||(i2.u5.p30==0))||(i6.u15.p107==1)))) ...426
Reverse transition relation is NOT exact ! Due to transitions t5, t27, t46, t77, t122, t166, i0.t191, i1.t213, i2.t201, i3.t181, i4.t171, i6.t163, i6.t158,...619
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an 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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 430/430 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 250 transition count 357
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 250 transition count 357
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 129 place count 250 transition count 354
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 159 place count 220 transition count 311
Iterating global reduction 1 with 30 rules applied. Total rules applied 189 place count 220 transition count 311
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 194 place count 220 transition count 306
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 212 place count 202 transition count 283
Iterating global reduction 2 with 18 rules applied. Total rules applied 230 place count 202 transition count 283
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 236 place count 202 transition count 277
Applied a total of 236 rules in 17 ms. Remains 202 /313 variables (removed 111) and now considering 277/430 (removed 153) transitions.
// Phase 1: matrix 277 rows 202 cols
[2025-06-07 18:15:45] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:15:45] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-07 18:15:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:15:45] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 18:15:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 277/479 variables, 202/222 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 0/479 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 222 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13528 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 277/479 variables, 202/222 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 276/498 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:04] [INFO ] Deduced a trap along path composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:08] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:08] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:09] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 3/502 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:11] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:14] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:17] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:19] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:20] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:20] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:20] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:20] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:21] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:21] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:21] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:21] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:21] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:21] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 11/516 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:24] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:25] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/479 variables, and 518 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43556ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 43557ms
Starting structural reductions in LTL mode, iteration 1 : 202/313 places, 277/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43760 ms. Remains : 202/313 places, 277/430 transitions.
[2025-06-07 18:16:29] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:16:29] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:16:29] [INFO ] Input system was already deterministic with 277 transitions.
[2025-06-07 18:16:29] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:16:29] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:16:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality11231217542907240056.gal : 1 ms
[2025-06-07 18:16:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality16257364444746034895.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/CTLCardinality11231217542907240056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16257364444746034895.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.59632e+19,0.10161,7848,2,1267,5,19083,6,0,1087,15600,0


Converting to forward existential form...Done !
original formula: EF((((p38==0)&&(p107==1)) * (AX((p174==1)) * ((p48==0)||(p325==1)))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((p38==0)&&(p107==1))) * ((p48==0)||(p325==1))) * !(EX(!((p174==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t24, t25, t29, t34, t38, t43, t46, t47, t51, t57, t61, t66, t70, t75, t76, t80, t86, t90,...381
(forward)formula 0,0,0.949926,39960,1,0,460,225934,573,239,6418,157533,563
FORMULA Champagne-PT-H06T0R-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 430/430 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 251 transition count 358
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 251 transition count 358
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 127 place count 251 transition count 355
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 158 place count 220 transition count 311
Iterating global reduction 1 with 31 rules applied. Total rules applied 189 place count 220 transition count 311
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 194 place count 220 transition count 306
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 211 place count 203 transition count 278
Iterating global reduction 2 with 17 rules applied. Total rules applied 228 place count 203 transition count 278
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 237 place count 203 transition count 269
Applied a total of 237 rules in 9 ms. Remains 203 /313 variables (removed 110) and now considering 269/430 (removed 161) transitions.
// Phase 1: matrix 269 rows 203 cols
[2025-06-07 18:16:30] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:16:30] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-07 18:16:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:16:30] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2025-06-07 18:16:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 269/472 variables, 203/223 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 0/472 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 223 constraints, problems are : Problem set: 0 solved, 268 unsolved in 12929 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 269/472 variables, 203/223 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 268/491 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:48] [INFO ] Deduced a trap along path composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:57] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 6 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/472 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:08] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 6 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/472 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:12] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/472 variables, and 495 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42969ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 42969ms
Starting structural reductions in LTL mode, iteration 1 : 203/313 places, 269/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43172 ms. Remains : 203/313 places, 269/430 transitions.
[2025-06-07 18:17:13] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:17:13] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:17:13] [INFO ] Input system was already deterministic with 269 transitions.
[2025-06-07 18:17:13] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:17:13] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:17:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality2969832466081476793.gal : 1 ms
[2025-06-07 18:17:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality4395061717477083549.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/CTLCardinality2969832466081476793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4395061717477083549.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.85853e+19,0.096664,7648,2,1248,5,18095,6,0,1083,14057,0


Converting to forward existential form...Done !
original formula: EF((((p395!=0)&&(p212!=0)) * ((p196!=1) * (AX(AF((p90==1))) + (AF(((p155==0)||(p293==1))) * AG((p60==1)))))))
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * ((p395!=0)&&(p212!=0))) * (p196!=1)) * !(EX(!(!(EG(!((p90==1))))))))] != FALSE + [((((Fwd...281
Reverse transition relation is NOT exact ! Due to transitions t5, t24, t25, t29, t34, t38, t43, t44, t48, t54, t58, t65, t69, t74, t75, t79, t85, t89, t95,...375
(forward)formula 0,0,10.2697,340024,1,0,1422,2.01318e+06,570,690,6656,2.47967e+06,1625
FORMULA Champagne-PT-H06T0R-CTLCardinality-2025-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 313/313 places, 430/430 transitions.
Graph (trivial) has 304 edges and 313 vertex of which 50 / 313 are part of one of the 7 SCC in 1 ms
Free SCC test removed 43 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 269 transition count 295
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 119 rules applied. Total rules applied 204 place count 185 transition count 260
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 221 place count 168 transition count 260
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 221 place count 168 transition count 252
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 237 place count 160 transition count 252
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 280 place count 117 transition count 199
Iterating global reduction 3 with 43 rules applied. Total rules applied 323 place count 117 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 326 place count 117 transition count 196
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 326 place count 117 transition count 186
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 346 place count 107 transition count 186
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 352 place count 101 transition count 165
Iterating global reduction 4 with 6 rules applied. Total rules applied 358 place count 101 transition count 165
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 364 place count 101 transition count 159
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 442 place count 62 transition count 120
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 444 place count 60 transition count 113
Iterating global reduction 5 with 2 rules applied. Total rules applied 446 place count 60 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 448 place count 60 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 450 place count 58 transition count 109
Applied a total of 450 rules in 31 ms. Remains 58 /313 variables (removed 255) and now considering 109/430 (removed 321) transitions.
[2025-06-07 18:17:23] [INFO ] Flow matrix only has 56 transitions (discarded 53 similar events)
// Phase 1: matrix 56 rows 58 cols
[2025-06-07 18:17:23] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:17:23] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-07 18:17:23] [INFO ] Flow matrix only has 56 transitions (discarded 53 similar events)
[2025-06-07 18:17:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:17:23] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:17:23] [INFO ] Redundant transitions in 3 ms returned []
Running 66 sub problems to find dead transitions.
[2025-06-07 18:17:23] [INFO ] Flow matrix only has 56 transitions (discarded 53 similar events)
[2025-06-07 18:17:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 55/113 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/113 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/114 variables, and 78 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1159 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 55/113 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 66/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/114 variables, and 144 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1239 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2406ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 2406ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/313 places, 109/430 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2549 ms. Remains : 58/313 places, 109/430 transitions.
[2025-06-07 18:17:26] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:17:26] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:17:26] [INFO ] Input system was already deterministic with 109 transitions.
[2025-06-07 18:17:26] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:17:26] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:17:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality18100003584492998333.gal : 1 ms
[2025-06-07 18:17:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality16650120880280839411.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/CTLCardinality18100003584492998333.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16650120880280839411.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,9.1833e+08,0.01916,4416,2,97,5,1011,6,0,337,550,0


Converting to forward existential form...Done !
original formula: AG(EF((p110==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p110==0))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.033759,4672,1,0,7,4000,14,1,1517,1217,5
FORMULA Champagne-PT-H06T0R-CTLCardinality-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 313/313 places, 430/430 transitions.
Graph (trivial) has 299 edges and 313 vertex of which 50 / 313 are part of one of the 7 SCC in 1 ms
Free SCC test removed 43 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 269 transition count 296
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 116 rules applied. Total rules applied 200 place count 186 transition count 263
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 216 place count 170 transition count 263
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 216 place count 170 transition count 255
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 232 place count 162 transition count 255
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 274 place count 120 transition count 203
Iterating global reduction 3 with 42 rules applied. Total rules applied 316 place count 120 transition count 203
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 320 place count 120 transition count 199
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 320 place count 120 transition count 187
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 344 place count 108 transition count 187
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 349 place count 103 transition count 168
Iterating global reduction 4 with 5 rules applied. Total rules applied 354 place count 103 transition count 168
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 359 place count 103 transition count 163
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 433 place count 66 transition count 126
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 435 place count 64 transition count 119
Iterating global reduction 5 with 2 rules applied. Total rules applied 437 place count 64 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 439 place count 64 transition count 117
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 441 place count 62 transition count 115
Applied a total of 441 rules in 22 ms. Remains 62 /313 variables (removed 251) and now considering 115/430 (removed 315) transitions.
[2025-06-07 18:17:26] [INFO ] Flow matrix only has 65 transitions (discarded 50 similar events)
// Phase 1: matrix 65 rows 62 cols
[2025-06-07 18:17:26] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:17:26] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-07 18:17:26] [INFO ] Flow matrix only has 65 transitions (discarded 50 similar events)
[2025-06-07 18:17:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:17:26] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:17:26] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2025-06-07 18:17:26] [INFO ] Flow matrix only has 65 transitions (discarded 50 similar events)
[2025-06-07 18:17:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 2/62 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 64/126 variables, 62/82 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 0/126 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/127 variables, and 82 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1302 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 2/62 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 64/126 variables, 62/82 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 71/153 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/127 variables, and 153 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1403 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2718ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2718ms
Starting structural reductions in SI_CTL mode, iteration 1 : 62/313 places, 115/430 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2843 ms. Remains : 62/313 places, 115/430 transitions.
[2025-06-07 18:17:29] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:17:29] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:17:29] [INFO ] Input system was already deterministic with 115 transitions.
[2025-06-07 18:17:29] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:17:29] [INFO ] Flatten gal took : 1 ms
[2025-06-07 18:17:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality17491840500950566675.gal : 0 ms
[2025-06-07 18:17:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality10350846592189850046.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/CTLCardinality17491840500950566675.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10350846592189850046.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,3.21416e+09,0.026086,4536,2,105,5,2120,6,0,359,1583,0


Converting to forward existential form...Done !
original formula: E(EF((!(AG(!(((p168==0)||(p388==1))))) + (p25==1))) U EF(((p173==1)||(p6==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,E(TRUE U (!(!(E(TRUE U !(!(((p168==0)||(p388==1))))))) + (p25==1)))),TRUE) * ((p173==1)||(p6==1...168
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.049227,5048,1,0,10,5904,17,3,1813,3079,13
FORMULA Champagne-PT-H06T0R-CTLCardinality-2025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 430/430 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 257 transition count 364
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 257 transition count 364
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 115 place count 257 transition count 361
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 141 place count 231 transition count 322
Iterating global reduction 1 with 26 rules applied. Total rules applied 167 place count 231 transition count 322
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 172 place count 231 transition count 317
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 189 place count 214 transition count 294
Iterating global reduction 2 with 17 rules applied. Total rules applied 206 place count 214 transition count 294
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 213 place count 214 transition count 287
Applied a total of 213 rules in 17 ms. Remains 214 /313 variables (removed 99) and now considering 287/430 (removed 143) transitions.
// Phase 1: matrix 287 rows 214 cols
[2025-06-07 18:17:29] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:17:29] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-07 18:17:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:17:29] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2025-06-07 18:17:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:32] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/501 variables, 214/235 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 0/501 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 235 constraints, problems are : Problem set: 0 solved, 286 unsolved in 16515 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/501 variables, 214/235 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 286/521 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:49] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:51] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:51] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:51] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:51] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 4/526 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:54] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:54] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:54] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:57] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:18:01] [INFO ] Deduced a trap along path composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:18:08] [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-06-07 18:18:08] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:18:10] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 534 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46552ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 46552ms
Starting structural reductions in LTL mode, iteration 1 : 214/313 places, 287/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46760 ms. Remains : 214/313 places, 287/430 transitions.
[2025-06-07 18:18:16] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:18:16] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:18:16] [INFO ] Input system was already deterministic with 287 transitions.
[2025-06-07 18:18:16] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:18:16] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:18:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality9935668060887607995.gal : 1 ms
[2025-06-07 18:18:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality5174245086437674919.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/CTLCardinality9935668060887607995.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5174245086437674919.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,4.73012e+19,0.128722,8888,2,1594,5,23229,6,0,1145,21679,0


Converting to forward existential form...Done !
original formula: EG(((AX((p97==0)) * AF(((AF(((p116==1)&&((p333==0)||(p153==1)))) + (p350==0)) + ((p150==1) + EX((p54==1)))))) * (((p367==1) + AX((p359==0...230
=> equivalent forward existential formula: [FwdG(Init,((!(EX(!((p97==0)))) * !(EG(!(((!(EG(!(((p116==1)&&((p333==0)||(p153==1)))))) + (p350==0)) + ((p150==...297
Reverse transition relation is NOT exact ! Due to transitions t5, t24, t31, t35, t39, t42, t46, t50, t55, t58, t62, t65, t66, t70, t75, t79, t84, t85, t89,...386
Detected timeout of ITS tools.
[2025-06-07 18:18:46] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:18:46] [INFO ] Applying decomposition
[2025-06-07 18:18:46] [INFO ] Flatten gal took : 7 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/graph14505198906124593922.txt' '-o' '/tmp/graph14505198906124593922.bin' '-w' '/tmp/graph14505198906124593922.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14505198906124593922.bin' '-l' '-1' '-v' '-w' '/tmp/graph14505198906124593922.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:18:46] [INFO ] Decomposing Gal with order
[2025-06-07 18:18:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:18:46] [INFO ] Removed a total of 185 redundant transitions.
[2025-06-07 18:18:46] [INFO ] Flatten gal took : 16 ms
[2025-06-07 18:18:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-07 18:18:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality13000117302060414485.gal : 2 ms
[2025-06-07 18:18:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality6570400239859109924.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/CTLCardinality13000117302060414485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6570400239859109924.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,4.73012e+19,0.146799,10740,1800,25,13496,407,500,17253,69,898,0


Converting to forward existential form...Done !
original formula: EG(((AX((i5.u11.p97==0)) * AF(((AF(((i6.u16.p116==1)&&((i17.u54.p333==0)||(i8.u21.p153==1)))) + (i18.i0.u56.p350==0)) + ((i8.u20.p150==1)...341
=> equivalent forward existential formula: [FwdG(Init,((!(EX(!((i5.u11.p97==0)))) * !(EG(!(((!(EG(!(((i6.u16.p116==1)&&((i17.u54.p333==0)||(i8.u21.p153==1)...408
Reverse transition relation is NOT exact ! Due to transitions t5, t65, t84, t123, t168, i1.t214, i2.t205, i3.u7.t193, i4.t183, i5.t173, i6.t161, i6.u15.t15...597
Using 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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an 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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
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 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an 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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,11.4857,358132,1,0,788194,536,3376,802545,383,1324,927285
FORMULA Champagne-PT-H06T0R-CTLCardinality-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2025-06-07 18:18:57] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:18:57] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:18:57] [INFO ] Applying decomposition
[2025-06-07 18:18:57] [INFO ] Flatten gal took : 7 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/graph14717268134715923906.txt' '-o' '/tmp/graph14717268134715923906.bin' '-w' '/tmp/graph14717268134715923906.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14717268134715923906.bin' '-l' '-1' '-v' '-w' '/tmp/graph14717268134715923906.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:18:57] [INFO ] Decomposing Gal with order
[2025-06-07 18:18:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:18:57] [INFO ] Removed a total of 274 redundant transitions.
[2025-06-07 18:18:57] [INFO ] Flatten gal took : 18 ms
[2025-06-07 18:18:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 6 ms.
[2025-06-07 18:18:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality17001797613655669267.gal : 6 ms
[2025-06-07 18:18:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality14913392649770258269.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/CTLCardinality17001797613655669267.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14913392649770258269.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 3 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.17155e+23,0.25684,14780,2454,42,22141,762,761,33352,76,1830,0


Converting to forward existential form...Done !
original formula: EG(AX(!(A(AF((i3.u11.p43==0)) U !(EX(((i6.u35.p123==0)||(i5.i1.u30.p112==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(!((E(!(!(EX(((i6.u35.p123==0)||(i5.i1.u30.p112==1))))) U (!(!(EG(!((i3.u11.p43==0))))) * !(!...276
Reverse transition relation is NOT exact ! Due to transitions t235, i0.t239, i0.u23.t241, i1.u3.t304, i1.u5.t314, i2.u9.t285, i2.u9.t288, i2.u10.t300, i3.t...1030
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an 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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an 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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,1,246.028,2202332,1,0,3.69554e+06,762,1607,5.01215e+06,152,1836,1583207
FORMULA Champagne-PT-H06T0R-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E((AF((EF(((i17.i0.u97.p354==0)||(i9.i1.u28.p101==1))) * EX(EF(((i18.i0.u105.p376==0)||(i7.i0.u38.p160==1)))))) * !(A(A((i17.i0.u98.p351=...322
=> equivalent forward existential formula: [(EY(FwdU(Init,(!(EG(!((E(TRUE U ((i17.i0.u97.p354==0)||(i9.i1.u28.p101==1))) * EX(E(TRUE U ((i18.i0.u105.p376==...696
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an 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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 1,0,424.505,2445204,1,0,3.82699e+06,762,3048,7.244e+06,245,1958,2530896
FORMULA Champagne-PT-H06T0R-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(E(EF(EG((i19.i1.u108.p384!=0))) U ((EX(!((((i14.i1.u80.p286==1)||(i2.u7.p30==0))||(i5.i1.u29.p107==1)))) + A(((i10.u56.p186==0)||(i18....268
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U EG((i19.i1.u108.p384!=0))) U ((EX(!((((i14.i1.u80.p286==1)||(i2.u7.p30==0))||(i5.i1.u29.p1...434
(forward)formula 2,1,604.492,2690836,1,0,4.23972e+06,806,1607,7.244e+06,152,2053,3010585
FORMULA Champagne-PT-H06T0R-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 1368064 ms.

BK_STOP 1749320943413

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="Champagne-PT-H06T0R"
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 Champagne-PT-H06T0R, 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 r254-tall-174931339200049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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