Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 107K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748855927813

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 09:18:50] [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-02 09:18:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 09:18:50] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2025-06-02 09:18:50] [INFO ] Transformed 149 places.
[2025-06-02 09:18:50] [INFO ] Transformed 340 transitions.
[2025-06-02 09:18:50] [INFO ] Found NUPN structural information;
[2025-06-02 09:18:50] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 541 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 39 ms.
FORMULA MedleyA-PT-10-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 90 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 340/340 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 340
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 133 transition count 323
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 133 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 133 transition count 322
Applied a total of 31 rules in 83 ms. Remains 133 /149 variables (removed 16) and now considering 322/340 (removed 18) transitions.
// Phase 1: matrix 322 rows 133 cols
[2025-06-02 09:18:51] [INFO ] Computed 11 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:18:51] [INFO ] Implicit Places using invariants in 553 ms returned []
[2025-06-02 09:18:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:18:52] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 1352 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2025-06-02 09:18:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
At refinement iteration 2 (OVERLAPS) 2/133 variables, 6/11 constraints. Problems are: Problem set: 64 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:59] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:59] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:59] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:59] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:59] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:00] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:00] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:00] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:00] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:01] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:01] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:01] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:01] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:01] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:01] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:02] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:02] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:02] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:02] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:03] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 20/31 constraints. Problems are: Problem set: 64 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:05] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:05] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:05] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/34 constraints. Problems are: Problem set: 64 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:07] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 1/35 constraints. Problems are: Problem set: 64 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:09] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 1/36 constraints. Problems are: Problem set: 64 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/36 constraints. Problems are: Problem set: 64 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 322/455 variables, 133/169 constraints. Problems are: Problem set: 64 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:18] [INFO ] Deduced a trap along path composed of 3 places in 76 ms of which 21 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 1.0)
(s17 0.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 0.0)
(s34 1.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 1.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 0.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 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.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 0.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)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 1/170 constraints. Problems are: Problem set: 64 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/455 variables, and 170 constraints, problems are : Problem set: 64 solved, 257 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 64 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 5/5 constraints. Problems are: Problem set: 64 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/5 constraints. Problems are: Problem set: 64 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 2/133 variables, 6/11 constraints. Problems are: Problem set: 64 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 25/36 constraints. Problems are: Problem set: 64 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:25] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:25] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:25] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/39 constraints. Problems are: Problem set: 64 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:27] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 1/40 constraints. Problems are: Problem set: 64 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:28] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:29] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 2/42 constraints. Problems are: Problem set: 64 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/42 constraints. Problems are: Problem set: 64 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 322/455 variables, 133/175 constraints. Problems are: Problem set: 64 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 257/432 constraints. Problems are: Problem set: 64 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:39] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:39] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:39] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:41] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:41] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:41] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 17 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 6/438 constraints. Problems are: Problem set: 64 solved, 257 unsolved
SMT process timed out in 61063ms, After SMT, problems are : Problem set: 64 solved, 257 unsolved
Search for dead transitions found 64 dead transitions in 61099ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 133/149 places, 258/340 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62585 ms. Remains : 133/149 places, 258/340 transitions.
Support contains 90 out of 133 places after structural reductions.
[2025-06-02 09:19:53] [INFO ] Flatten gal took : 76 ms
[2025-06-02 09:19:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-10-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 09:19:54] [INFO ] Flatten gal took : 40 ms
[2025-06-02 09:19:54] [INFO ] Input system was already deterministic with 258 transitions.
Support contains 86 out of 133 places (down from 90) after GAL structural reductions.
RANDOM walk for 40000 steps (1744 resets) in 2381 ms. (16 steps per ms) remains 21/59 properties
BEST_FIRST walk for 4002 steps (42 resets) in 52 ms. (75 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4004 steps (41 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (43 resets) in 44 ms. (88 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (37 resets) in 66 ms. (59 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (44 resets) in 46 ms. (85 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (41 resets) in 48 ms. (81 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (43 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (41 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (44 resets) in 53 ms. (74 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (40 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (39 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (41 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (41 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (37 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (44 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (38 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (42 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (40 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (53 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
// Phase 1: matrix 258 rows 133 cols
[2025-06-02 09:19:55] [INFO ] Computed 11 invariants in 5 ms
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/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 60/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 31/129 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 255/384 variables, 129/140 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 7/391 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 144 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1120 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 60/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 31/129 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:56] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:57] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:57] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:57] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:57] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:57] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:58] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:58] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:58] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 23 ms to minimize.
Problem AtomicPropp58 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 9/20 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:58] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:58] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:59] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 26 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 3/23 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:59] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 27 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:59] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:59] [INFO ] Deduced a trap composed of 51 places in 148 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 2/26 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 255/384 variables, 129/155 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 13/168 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:01] [INFO ] Deduced a trap along path composed of 4 places in 30 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 0)
(t4 3)
(t5 3)
(t6 3)
(t7 3)
(t8 2)
(t9 2)
(t10 2)
(t11 1)
(t13 1)
(t14 1)
(t15 1)
(t16 0)
(t17 0)
(t18 0)
(t19 1)
(t20 1)
(t21 0)
(t22 0)
(t23 0)
(t24 2)
(t25 0)
(t26 0)
(t27 0)
(t28 1)
(t29 1)
(t30 1)
(t31 0)
(t32 1)
(t33 0)
(t34 0)
(t35 0)
(t36 1)
(t37 0)
(t38 0)
(t39 1)
(t40 0)
(t41 4)
(t42 4)
(t43 0)
(t44 0)
(t45 0)
(t46 0)
(t47 1)
(t48 0)
(t49 0)
(t50 2)
(t51 2)
(t52 0)
(t53 1)
(t54 0)
(t55 0)
(t56 0)
(t57 0)
(t58 1)
(t59 0)
(t60 0)
(t61 1)
(t62 1)
(t63 4)
(t64 3)
(t65 8)
(t66 0)
(t67 0)
(t68 0)
(t69 0)
(t70 0)
(t71 1)
(t72 1)
(t73 0)
(t74 0)
(t75 0)
(t76 1)
(t77 4)
(t78 0)
(t79 0)
(t80 0)
(t81 0)
(t82 0)
(t83 0)
(t84 0)
(t85 0)
(t86 1)
(t87 0)
(t88 0)
(t89 0)
(t90 2)
(t91 0)
(t92 0)
(t93 0)
(t94 0)
(t95 1)
(t96 1)
(t97 2)
(t98 0)
(t99 2)
(t100 0)
(t101 0)
(t102 3)
(t103 3)
(t104 1)
(t105 0)
(t106 1)
(t107 0)
(t108 1)
(t109 0)
(t110 2)
(t111 0)
(t112 0)
(t113 1)
(t114 2)
(t115 15)
(t116 0)
(t117 0)
(t118 0)
(t119 0)
(t120 0)
(t121 0)
(t122 0)
(t123 0)
(t124 0)
(t125 0)
(t126 2)
(t127 0)
(t128 1)
(t129 0)
(t130 0)
(t131 0)
(t132 0)
(t133 0)
(t134 0)
(t135 0)
(t136 0)
(t137 2)
(t138 1)
(t139 0)
(t140 0)
(t141 0)
(t142 0)
(t143 0)
(t144 0)
(t145 1)
(t146 0)
(t147 0)
(t148 0)
(t149 0)
(t150 0)
(t151 0)
(t152 0)
(t153 2)
(t154 0)
(t155 0)
(t156 0)
(t157 0)
(t158 3)
(t159 0)
(t160 0)
(t161 0)
(t162 0)
(t163 0)
(t164 0)
(t165 0)
(t166 0)
(t167 0)
(t168 0)
(t169 0)
(t170 2)
(t171 0)
(t172 0)
(t173 1)
(t174 0)
(t175 0)
(t176 0)
(t177 0)
(t180 2)
(t181 3)
(t182 0)
(t183 0)
(t184 0)
(t185 0)
(t186 0)
(t187 0)
(t188 0)
(t189 0)
(t190 0)
(t191 1)
(t192 0)
(t193 1)
(t194 0)
(t195 0)
(t196 0)
(t197 0)
(t198 0)
(t199 2)
(t200 0)
(t201 0)
(t202 0)
(t203 0)
(t204 1)
(t205 0)
(t206 0)
(t207 0)
(t208 0)
(t209 0)
(t210 0)
(t211 1)
(t212 0)
(t213 0)
(t214 0)
(t215 0)
(t216 0)
(t217 0)
(t218 0)
(t219 0)
(t220 0)
(t221 0)
(t222 0)
(t223 0)
(t224 0)
(t225 0)
(t226 1)
(t227 0)
(t228 0)
(t229 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/391 variables, and 169 constraints, problems are : Problem set: 1 solved, 18 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 129/133 constraints, PredecessorRefiner: 13/19 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6152ms problems are : Problem set: 1 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 258/258 transitions.
Graph (complete) has 485 edges and 133 vertex of which 130 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 130 transition count 245
Reduce places removed 10 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 120 transition count 242
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 28 place count 117 transition count 242
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 28 place count 117 transition count 240
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 32 place count 115 transition count 240
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 46 place count 101 transition count 222
Iterating global reduction 3 with 14 rules applied. Total rules applied 60 place count 101 transition count 222
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 101 transition count 221
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 100 transition count 221
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 97 transition count 215
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 97 transition count 215
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 97 place count 82 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 99 place count 82 transition count 199
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 100 place count 81 transition count 198
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 81 transition count 198
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 109 place count 77 transition count 241
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 125 place count 77 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 132 place count 77 transition count 218
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 132 place count 77 transition count 217
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 134 place count 76 transition count 217
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 135 place count 76 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 136 place count 75 transition count 216
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 137 place count 75 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 138 place count 74 transition count 216
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 140 place count 74 transition count 216
Applied a total of 140 rules in 197 ms. Remains 74 /133 variables (removed 59) and now considering 216/258 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 74/133 places, 216/258 transitions.
RANDOM walk for 40000 steps (6436 resets) in 684 ms. (58 steps per ms) remains 5/18 properties
BEST_FIRST walk for 40004 steps (1333 resets) in 135 ms. (294 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1336 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1331 resets) in 89 ms. (444 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (1208 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
// Phase 1: matrix 216 rows 74 cols
[2025-06-02 09:20:01] [INFO ] Computed 10 invariants in 2 ms
[2025-06-02 09:20:01] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 41/55 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/58 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 14/72 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 215/287 variables, 72/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 80/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3/290 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 18/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/290 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 182 constraints, problems are : Problem set: 0 solved, 4 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 41/55 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/58 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:02] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 14/72 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:02] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:02] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:03] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:03] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 215/287 variables, 72/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 80/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/287 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:03] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:04] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 16 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/287 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:04] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 12 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/287 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/287 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/290 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/290 variables, 18/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/290 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/290 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/290 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 194 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5265 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5744ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 2 properties in 1756 ms.
Support contains 10 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 216/216 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 74 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 71 transition count 213
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 71 transition count 212
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 70 transition count 212
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 66 transition count 200
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 66 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 65 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 65 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 64 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 64 transition count 195
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 32 place count 58 transition count 189
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 55 transition count 225
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 54 place count 55 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 55 transition count 208
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 58 place count 55 transition count 205
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 61 place count 52 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 52 transition count 204
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 52 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 51 transition count 211
Applied a total of 64 rules in 61 ms. Remains 51 /74 variables (removed 23) and now considering 211/216 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 51/74 places, 211/216 transitions.
RANDOM walk for 40000 steps (7634 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1503 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1436 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 136427 steps, run visited all 2 properties in 483 ms. (steps per millisecond=282 )
Probabilistic random walk after 136427 steps, saw 36577 distinct states, run finished after 493 ms. (steps per millisecond=276 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2025-06-02 09:20:10] [INFO ] Flatten gal took : 41 ms
[2025-06-02 09:20:10] [INFO ] Flatten gal took : 28 ms
[2025-06-02 09:20:10] [INFO ] Input system was already deterministic with 258 transitions.
Computed a total of 13 stabilizing places and 14 stable transitions
Graph (complete) has 485 edges and 133 vertex of which 130 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 258
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 101 transition count 222
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 101 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 66 place count 101 transition count 219
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 95 transition count 202
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 95 transition count 202
Applied a total of 78 rules in 13 ms. Remains 95 /133 variables (removed 38) and now considering 202/258 (removed 56) transitions.
// Phase 1: matrix 202 rows 95 cols
[2025-06-02 09:20:10] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:20:10] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-02 09:20:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:20:10] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-06-02 09:20:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:13] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:13] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/297 variables, 95/107 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:17] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:21] [INFO ] Deduced a trap along path composed of 2 places in 49 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:22] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/297 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 110 constraints, problems are : Problem set: 0 solved, 201 unsolved in 19719 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/297 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 201/309 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:41] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:41] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:41] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/297 variables, and 314 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 50006ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 50011ms
Starting structural reductions in LTL mode, iteration 1 : 95/133 places, 202/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50352 ms. Remains : 95/133 places, 202/258 transitions.
[2025-06-02 09:21:00] [INFO ] Flatten gal took : 50 ms
[2025-06-02 09:21:00] [INFO ] Flatten gal took : 31 ms
[2025-06-02 09:21:00] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-02 09:21:00] [INFO ] Flatten gal took : 29 ms
[2025-06-02 09:21:00] [INFO ] Flatten gal took : 28 ms
[2025-06-02 09:21:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality4718478854099948032.gal : 14 ms
[2025-06-02 09:21:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality18365481106482159276.ctl : 9 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/CTLCardinality4718478854099948032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18365481106482159276.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.69404e+07,2.90079,60840,2,7542,5,170845,6,0,582,240123,0


Converting to forward existential form...Done !
original formula: (EG(EF((((p113==0)||(p135==0))||((p14==0)||(p141==1))))) * AX((EF((p58==1)) * ((AX((p66==1)) + (p55==0)) + (p109==1)))))
=> equivalent forward existential formula: ([(Init * !(EG(E(TRUE U (((p113==0)||(p135==0))||((p14==0)||(p141==1)))))))] = FALSE * ([(EY(Init) * !(E(TRUE U ...251
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t22, t23, t25, t26, t28, t29, t30, t31, t33, t34, ...525
Detected timeout of ITS tools.
[2025-06-02 09:21:31] [INFO ] Flatten gal took : 28 ms
[2025-06-02 09:21:31] [INFO ] Applying decomposition
[2025-06-02 09:21:31] [INFO ] Flatten gal took : 28 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/graph18420701174065544105.txt' '-o' '/tmp/graph18420701174065544105.bin' '-w' '/tmp/graph18420701174065544105.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18420701174065544105.bin' '-l' '-1' '-v' '-w' '/tmp/graph18420701174065544105.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:21:31] [INFO ] Decomposing Gal with order
[2025-06-02 09:21:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:21:31] [INFO ] Removed a total of 369 redundant transitions.
[2025-06-02 09:21:31] [INFO ] Flatten gal took : 127 ms
[2025-06-02 09:21:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 25 ms.
[2025-06-02 09:21:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality8585023969074542269.gal : 10 ms
[2025-06-02 09:21:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality8274247233356152102.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/CTLCardinality8585023969074542269.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8274247233356152102.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.69404e+07,0.371782,11592,523,340,11812,2448,364,36474,154,12691,0


Converting to forward existential form...Done !
original formula: (EG(EF((((i5.u18.p113==0)||(i1.i1.u20.p135==0))||((i1.i0.u2.p14==0)||(i1.i1.u19.p141==1))))) * AX((EF((i0.u1.p58==1)) * ((AX((i5.u10.p66=...200
=> equivalent forward existential formula: ([(Init * !(EG(E(TRUE U (((i5.u18.p113==0)||(i1.i1.u20.p135==0))||((i1.i0.u2.p14==0)||(i1.i1.u19.p141==1)))))))]...313
Reverse transition relation is NOT exact ! Due to transitions t17, t52, t84, t178, t179, t180, t181, i0.t63, i0.u1.t91, i0.u1.t92, i0.u1.t93, i0.u1.t94, i0...813
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 6
(forward)formula 0,1,22.8846,445776,1,0,451242,49109,2127,3.263e+06,867,660211,413568
FORMULA MedleyA-PT-10-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 258
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 106 transition count 229
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 106 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 56 place count 106 transition count 226
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 100 transition count 213
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 100 transition count 213
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 98 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 98 transition count 208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 97 transition count 205
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 97 transition count 205
Applied a total of 74 rules in 41 ms. Remains 97 /133 variables (removed 36) and now considering 205/258 (removed 53) transitions.
// Phase 1: matrix 205 rows 97 cols
[2025-06-02 09:21:54] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:21:54] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-02 09:21:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:21:54] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2025-06-02 09:21:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:21:58] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:21:58] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/302 variables, 97/109 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:02] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:02] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:06] [INFO ] Deduced a trap along path composed of 2 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-02 09:22:08] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (OVERLAPS) 0/302 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 113 constraints, problems are : Problem set: 0 solved, 204 unsolved in 21521 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:17] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 205/302 variables, 97/112 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 204/316 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:22] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:29] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:29] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:29] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 322 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 51687ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 51688ms
Starting structural reductions in LTL mode, iteration 1 : 97/133 places, 205/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52084 ms. Remains : 97/133 places, 205/258 transitions.
[2025-06-02 09:22:46] [INFO ] Flatten gal took : 20 ms
[2025-06-02 09:22:46] [INFO ] Flatten gal took : 19 ms
[2025-06-02 09:22:46] [INFO ] Input system was already deterministic with 205 transitions.
[2025-06-02 09:22:46] [INFO ] Flatten gal took : 18 ms
[2025-06-02 09:22:46] [INFO ] Flatten gal took : 17 ms
[2025-06-02 09:22:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality4385104872065398897.gal : 6 ms
[2025-06-02 09:22:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality308305606215694789.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/CTLCardinality4385104872065398897.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality308305606215694789.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.80377e+07,2.04642,45696,2,6693,5,124130,6,0,593,181064,0


Converting to forward existential form...Done !
original formula: AX(AG((E(((p112==0)||(p23==1)) U ((p107==0)||(p17==1))) + AX(((p120==0)&&(p1==1))))))
=> equivalent forward existential formula: [(EY((FwdU(EY(Init),TRUE) * !(E(((p112==0)||(p23==1)) U ((p107==0)||(p17==1)))))) * !(((p120==0)&&(p1==1))))] = ...160
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t21, t23, t24, t25, t27, t28, t29, t30, t32, t33, t34, ...485
(forward)formula 0,1,6.45956,120304,1,0,379,558919,432,131,5798,564647,427
FORMULA MedleyA-PT-10-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 258
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 104 transition count 225
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 104 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 104 transition count 222
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 96 transition count 200
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 96 transition count 200
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 94 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 94 transition count 195
Applied a total of 80 rules in 12 ms. Remains 94 /133 variables (removed 39) and now considering 195/258 (removed 63) transitions.
// Phase 1: matrix 195 rows 94 cols
[2025-06-02 09:22:53] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:22:53] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-02 09:22:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:22:53] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2025-06-02 09:22:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:56] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:56] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:56] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/289 variables, 94/107 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:59] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:05] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:05] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:08] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:09] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 7 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/289 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 0/289 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 112 constraints, problems are : Problem set: 0 solved, 194 unsolved in 23093 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/289 variables, 94/110 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 194/304 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:25] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:26] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:26] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:26] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 4/310 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:44] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:44] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/289 variables, and 312 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 53240ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 53242ms
Starting structural reductions in LTL mode, iteration 1 : 94/133 places, 195/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53632 ms. Remains : 94/133 places, 195/258 transitions.
[2025-06-02 09:23:47] [INFO ] Flatten gal took : 31 ms
[2025-06-02 09:23:47] [INFO ] Flatten gal took : 20 ms
[2025-06-02 09:23:47] [INFO ] Input system was already deterministic with 195 transitions.
[2025-06-02 09:23:47] [INFO ] Flatten gal took : 16 ms
[2025-06-02 09:23:47] [INFO ] Flatten gal took : 22 ms
[2025-06-02 09:23:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality10884222763595959592.gal : 8 ms
[2025-06-02 09:23:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality7793364968393485499.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/CTLCardinality10884222763595959592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7793364968393485499.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.57804e+07,3.05004,64504,2,7142,5,179856,6,0,571,260292,0


Converting to forward existential form...Done !
original formula: AG(((AF(((p23==0)||(p29==1))) + (p68==0)) + (((EG((p49!=1)) * EX(((p119==0)&&(p75==1)))) * (AF(((p34==0)||(p116==1))) * ((p92==0)||(p26==...186
=> equivalent forward existential formula: ((([((FwdU(Init,TRUE) * !((!(EG(!(((p23==0)||(p29==1))))) + (p68==0)))) * !(EG((p49!=1))))] = FALSE * [((FwdU(In...583
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t22, t23, t24, t25, t26, t28, t29, t30, t31, t32, ...457
Detected timeout of ITS tools.
[2025-06-02 09:24:17] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:24:17] [INFO ] Applying decomposition
[2025-06-02 09:24:17] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14006782138523373793.txt' '-o' '/tmp/graph14006782138523373793.bin' '-w' '/tmp/graph14006782138523373793.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14006782138523373793.bin' '-l' '-1' '-v' '-w' '/tmp/graph14006782138523373793.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:24:17] [INFO ] Decomposing Gal with order
[2025-06-02 09:24:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:24:17] [INFO ] Removed a total of 381 redundant transitions.
[2025-06-02 09:24:17] [INFO ] Flatten gal took : 27 ms
[2025-06-02 09:24:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 8 ms.
[2025-06-02 09:24:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality257874275409720395.gal : 5 ms
[2025-06-02 09:24:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality3413332587504960771.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/CTLCardinality257874275409720395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3413332587504960771.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.57804e+07,0.271169,12124,517,193,15270,1612,402,31045,113,7380,0


Converting to forward existential form...Done !
original formula: AG(((AF(((i1.u4.p23==0)||(i2.u5.p29==1))) + (i4.u12.p68==0)) + (((EG((i3.u9.p49!=1)) * EX(((i4.u12.p119==0)&&(i5.u13.p75==1)))) * (AF(((i...265
=> equivalent forward existential formula: ((([((FwdU(Init,TRUE) * !((!(EG(!(((i1.u4.p23==0)||(i2.u5.p29==1))))) + (i4.u12.p68==0)))) * !(EG((i3.u9.p49!=1)...738
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t52, t83, t89, i1.u4.t77, i1.u4.t78, i2.t70, i2.t67, i2.t66, i2.u5.t50, i2.u5.t75, i...755
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,8.49774,213168,1,0,307928,8684,2268,1.07346e+06,623,58758,320363
FORMULA MedleyA-PT-10-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 258/258 transitions.
Graph (complete) has 485 edges and 133 vertex of which 130 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 129 transition count 240
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 114 transition count 236
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 112 transition count 236
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 37 place count 112 transition count 234
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 41 place count 110 transition count 234
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 62 place count 89 transition count 208
Iterating global reduction 3 with 21 rules applied. Total rules applied 83 place count 89 transition count 208
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 83 place count 89 transition count 206
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 87 transition count 206
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 93 place count 81 transition count 189
Iterating global reduction 3 with 6 rules applied. Total rules applied 99 place count 81 transition count 189
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 79 transition count 185
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 79 transition count 185
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 78 transition count 182
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 78 transition count 182
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 134 place count 63 transition count 168
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 137 place count 63 transition count 165
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 61 transition count 161
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 61 transition count 161
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 145 place count 61 transition count 157
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 145 place count 61 transition count 155
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 149 place count 59 transition count 155
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 153 place count 57 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 155 place count 55 transition count 151
Applied a total of 155 rules in 63 ms. Remains 55 /133 variables (removed 78) and now considering 151/258 (removed 107) transitions.
// Phase 1: matrix 151 rows 55 cols
[2025-06-02 09:24:26] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:24:26] [INFO ] Implicit Places using invariants in 100 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 54/133 places, 151/258 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 171 ms. Remains : 54/133 places, 151/258 transitions.
[2025-06-02 09:24:26] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:24:26] [INFO ] Flatten gal took : 11 ms
[2025-06-02 09:24:26] [INFO ] Input system was already deterministic with 151 transitions.
[2025-06-02 09:24:26] [INFO ] Flatten gal took : 11 ms
[2025-06-02 09:24:26] [INFO ] Flatten gal took : 11 ms
[2025-06-02 09:24:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality4344741801968783261.gal : 4 ms
[2025-06-02 09:24:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality9402779778827532862.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/CTLCardinality4344741801968783261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9402779778827532862.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,682286,0.851703,25624,2,3365,5,72279,6,0,362,78815,0


Converting to forward existential form...Done !
original formula: (EF(EG((p72==0))) + EG(((E(AF(((p138==0)||(p69==1))) U ((p15==0)||(p113==1))) * (p93==0)) * (p45==1))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),(p72==0))] != FALSE + [FwdG(Init,((E(!(EG(!(((p138==0)||(p69==1))))) U ((p15==0)||(p113==...195
Hit Full ! (commute/partial/dont) 140/0/11
(forward)formula 0,1,1.55917,29676,1,0,9,140062,19,3,2545,78815,8
FORMULA MedleyA-PT-10-CTLCardinality-2025-03 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 : 133/133 places, 258/258 transitions.
Graph (complete) has 485 edges and 133 vertex of which 131 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 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 0 with 17 rules applied. Total rules applied 18 place count 130 transition count 238
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 113 transition count 236
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 37 place count 113 transition count 234
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 111 transition count 234
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 64 place count 88 transition count 206
Iterating global reduction 2 with 23 rules applied. Total rules applied 87 place count 88 transition count 206
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 87 place count 88 transition count 204
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 86 transition count 204
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 98 place count 79 transition count 183
Iterating global reduction 2 with 7 rules applied. Total rules applied 105 place count 79 transition count 183
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 76 transition count 175
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 76 transition count 175
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 76 transition count 174
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 114 place count 75 transition count 173
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 74 transition count 170
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 74 transition count 170
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 142 place count 60 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 143 place count 60 transition count 157
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 147 place count 56 transition count 149
Iterating global reduction 5 with 4 rules applied. Total rules applied 151 place count 56 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 155 place count 56 transition count 145
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 155 place count 56 transition count 143
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 159 place count 54 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 163 place count 52 transition count 141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 165 place count 50 transition count 139
Applied a total of 165 rules in 40 ms. Remains 50 /133 variables (removed 83) and now considering 139/258 (removed 119) transitions.
// Phase 1: matrix 139 rows 50 cols
[2025-06-02 09:24:27] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:24:27] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-02 09:24:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:24:28] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 09:24:28] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:24:28] [INFO ] Redundant transitions in 9 ms returned []
Running 133 sub problems to find dead transitions.
[2025-06-02 09:24:28] [INFO ] Invariant cache hit.
[2025-06-02 09:24:28] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 4/50 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 139/189 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:31] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 76 constraints, problems are : Problem set: 0 solved, 133 unsolved in 6801 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 4/50 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 139/189 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 133/209 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:39] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 210 constraints, problems are : Problem set: 0 solved, 133 unsolved in 21581 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28489ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 28493ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/133 places, 139/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28813 ms. Remains : 50/133 places, 139/258 transitions.
[2025-06-02 09:24:56] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:24:56] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:24:56] [INFO ] Input system was already deterministic with 139 transitions.
[2025-06-02 09:24:56] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:24:56] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:24:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality12427869749111400296.gal : 3 ms
[2025-06-02 09:24:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality7706244365423575501.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12427869749111400296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7706244365423575501.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,282252,0.176511,6736,2,979,5,11969,6,0,331,8868,0


Converting to forward existential form...Done !
original formula: A(AF(AG(!(((p88==0)||(p66==1))))) U (p139==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p139==1))))) * !(E(!((p139==1)) U (!(!(EG(!(!(E(TRUE U !(!(((p88==0)||(p66==1)))))))))) * !((p...177
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t10, t11, t12, t15, t17, t18, t19, t20, t21, t23, t24, t26, t29, t77,...291
(forward)formula 0,0,11.433,250744,1,0,509,1.47321e+06,308,220,3245,1.17508e+06,676
FORMULA MedleyA-PT-10-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 258
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 107 transition count 230
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 107 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 107 transition count 229
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 101 transition count 215
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 101 transition count 215
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 99 transition count 211
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 99 transition count 211
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 97 transition count 205
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 97 transition count 205
Applied a total of 72 rules in 13 ms. Remains 97 /133 variables (removed 36) and now considering 205/258 (removed 53) transitions.
// Phase 1: matrix 205 rows 97 cols
[2025-06-02 09:25:08] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:25:08] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-02 09:25:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:25:08] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2025-06-02 09:25:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:11] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:11] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:11] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:11] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:12] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/302 variables, 97/112 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:17] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:19] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:23] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 11 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/302 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 0/302 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 115 constraints, problems are : Problem set: 0 solved, 204 unsolved in 24144 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/302 variables, 97/113 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 204/317 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:39] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:39] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:00] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:00] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 323 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 54324ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 54325ms
Starting structural reductions in LTL mode, iteration 1 : 97/133 places, 205/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54651 ms. Remains : 97/133 places, 205/258 transitions.
[2025-06-02 09:26:02] [INFO ] Flatten gal took : 39 ms
[2025-06-02 09:26:02] [INFO ] Flatten gal took : 13 ms
[2025-06-02 09:26:02] [INFO ] Input system was already deterministic with 205 transitions.
[2025-06-02 09:26:02] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:26:02] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:26:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality5312826246317124079.gal : 2 ms
[2025-06-02 09:26:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality10839079870449620064.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/CTLCardinality5312826246317124079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10839079870449620064.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.0063e+07,3.53292,69532,2,7506,5,186647,6,0,593,290042,0


Converting to forward existential form...Done !
original formula: A((EX(TRUE) + (!(((((p90!=1)||(p38==0))||(p37==1)) * EF((p78==1)))) * (p83!=1))) U AG((!(((((p41==0)||(p29==1)) * A((p104==1) U (p0==1)))...235
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((!(((((p41==0)||(p29==1)) * !((E(!((p0==1)) U (!((p104==1)) * !((p0==1)))) + EG(!(...785
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t22, t23, t24, t27, t28, t29, t30, t32, t34, t35, ...485
Detected timeout of ITS tools.
[2025-06-02 09:26:33] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:26:33] [INFO ] Applying decomposition
[2025-06-02 09:26:33] [INFO ] Flatten gal took : 8 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/graph14773848572154193711.txt' '-o' '/tmp/graph14773848572154193711.bin' '-w' '/tmp/graph14773848572154193711.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14773848572154193711.bin' '-l' '-1' '-v' '-w' '/tmp/graph14773848572154193711.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:26:33] [INFO ] Decomposing Gal with order
[2025-06-02 09:26:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:26:33] [INFO ] Removed a total of 391 redundant transitions.
[2025-06-02 09:26:33] [INFO ] Flatten gal took : 38 ms
[2025-06-02 09:26:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 15 ms.
[2025-06-02 09:26:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality9721176952730453813.gal : 6 ms
[2025-06-02 09:26:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality2134835914887982690.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/CTLCardinality9721176952730453813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2134835914887982690.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.0063e+07,0.500801,12988,503,308,13758,2174,406,37819,142,19079,0


Converting to forward existential form...Done !
original formula: A((EX(TRUE) + (!(((((i3.u15.p90!=1)||(i2.u8.p38==0))||(i2.u6.p37==1)) * EF((i4.u12.p78==1)))) * (i5.u13.p83!=1))) U AG((!(((((i0.u10.p41=...337
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((!(((((i0.u10.p41==0)||(i2.u9.p29==1)) * !((E(!((i6.i1.u0.p0==1)) U (!((i4.u19.p10...1079
Reverse transition relation is NOT exact ! Due to transitions t17, t54, t91, t177, t178, t199, t200, t201, t202, i0.u10.t53, i0.u10.t55, i0.u10.t56, i0.u10...774
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,16.6889,285444,1,0,337334,31522,2359,1.78885e+06,789,357071,349000
FORMULA MedleyA-PT-10-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 258
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 107 transition count 229
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 107 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 54 place count 107 transition count 226
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 102 transition count 211
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 102 transition count 211
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 100 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 100 transition count 206
Applied a total of 68 rules in 6 ms. Remains 100 /133 variables (removed 33) and now considering 206/258 (removed 52) transitions.
// Phase 1: matrix 206 rows 100 cols
[2025-06-02 09:26:50] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:26:50] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-02 09:26:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:26:50] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2025-06-02 09:26:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:53] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:53] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:53] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:53] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:54] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:54] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:54] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:54] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/306 variables, 100/118 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:58] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:04] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:05] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:09] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:09] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 6 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/306 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:17] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/306 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/306 variables, and 124 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/306 variables, 100/121 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 205/326 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:26] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:37] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:40] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:48] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 330 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Starting structural reductions in LTL mode, iteration 1 : 100/133 places, 206/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60557 ms. Remains : 100/133 places, 206/258 transitions.
[2025-06-02 09:27:50] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:27:50] [INFO ] Flatten gal took : 7 ms
[2025-06-02 09:27:50] [INFO ] Input system was already deterministic with 206 transitions.
[2025-06-02 09:27:50] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:27:50] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:27:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality15880436037596837724.gal : 2 ms
[2025-06-02 09:27:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality5655104548500145490.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/CTLCardinality15880436037596837724.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5655104548500145490.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.99026e+07,3.84377,80664,2,7481,5,202722,6,0,606,372661,0


Converting to forward existential form...Done !
original formula: (AG(EX(TRUE)) * (AX((((p142==1)&&((p79==0)||(p60==1)))&&((p101==0)||(p100==1)))) + EX(A(E(EX(TRUE) U (p5!=1)) U (((((p8==0)&&((p17==0)||(...228
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE * [(EY((Init * !(EX(!((E(!((((((p8==0)&&((p17==0)||(p4==1)))||(p106==...665
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, ...525
Detected timeout of ITS tools.
[2025-06-02 09:28:20] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:28:20] [INFO ] Applying decomposition
[2025-06-02 09:28:20] [INFO ] Flatten gal took : 8 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/graph17576028923855852421.txt' '-o' '/tmp/graph17576028923855852421.bin' '-w' '/tmp/graph17576028923855852421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17576028923855852421.bin' '-l' '-1' '-v' '-w' '/tmp/graph17576028923855852421.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:28:20] [INFO ] Decomposing Gal with order
[2025-06-02 09:28:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:28:20] [INFO ] Removed a total of 378 redundant transitions.
[2025-06-02 09:28:20] [INFO ] Flatten gal took : 21 ms
[2025-06-02 09:28:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 9 ms.
[2025-06-02 09:28:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality14897652750584393253.gal : 2 ms
[2025-06-02 09:28:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality8543963137552110626.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/CTLCardinality14897652750584393253.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8543963137552110626.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.99026e+07,0.946148,23072,729,295,27207,2239,437,106501,151,12354,0


Converting to forward existential form...Done !
original formula: (AG(EX(TRUE)) * (AX((((i4.i1.u25.p142==1)&&((i5.u13.p79==0)||(i2.u10.p60==1)))&&((u20.p101==0)||(i5.u16.p100==1)))) + EX(A(E(EX(TRUE) U (...316
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE * [(EY((Init * !(EX(!((E(!((((((i0.u2.p8==0)&&((i2.u3.p17==0)||(i0.u2...871
Reverse transition relation is NOT exact ! Due to transitions t55, t93, t94, t200, t201, t202, t203, u20.t16, u20.t18, u20.t19, u20.t20, u20.t21, u20.t22, ...776
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 258/258 transitions.
Graph (complete) has 485 edges and 133 vertex of which 130 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 129 transition count 243
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 117 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 116 transition count 240
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 29 place count 116 transition count 238
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 33 place count 114 transition count 238
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 52 place count 95 transition count 214
Iterating global reduction 3 with 19 rules applied. Total rules applied 71 place count 95 transition count 214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 71 place count 95 transition count 213
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 94 transition count 213
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 79 place count 88 transition count 193
Iterating global reduction 3 with 6 rules applied. Total rules applied 85 place count 88 transition count 193
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 88 place count 85 transition count 185
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 85 transition count 185
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 85 transition count 184
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 94 place count 84 transition count 183
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 118 place count 72 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 119 place count 72 transition count 170
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 122 place count 69 transition count 165
Iterating global reduction 6 with 3 rules applied. Total rules applied 125 place count 69 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 129 place count 69 transition count 161
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 129 place count 69 transition count 159
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 133 place count 67 transition count 159
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 137 place count 65 transition count 157
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 139 place count 63 transition count 155
Applied a total of 139 rules in 36 ms. Remains 63 /133 variables (removed 70) and now considering 155/258 (removed 103) transitions.
// Phase 1: matrix 155 rows 63 cols
[2025-06-02 09:28:50] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:28:50] [INFO ] Implicit Places using invariants in 88 ms returned [10, 32]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 89 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/133 places, 155/258 transitions.
Applied a total of 0 rules in 14 ms. Remains 61 /61 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 139 ms. Remains : 61/133 places, 155/258 transitions.
[2025-06-02 09:28:51] [INFO ] Flatten gal took : 6 ms
[2025-06-02 09:28:51] [INFO ] Flatten gal took : 6 ms
[2025-06-02 09:28:51] [INFO ] Input system was already deterministic with 155 transitions.
[2025-06-02 09:28:51] [INFO ] Flatten gal took : 6 ms
[2025-06-02 09:28:51] [INFO ] Flatten gal took : 6 ms
[2025-06-02 09:28:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality13952117492929291610.gal : 1 ms
[2025-06-02 09:28:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality3213198506952128675.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/CTLCardinality13952117492929291610.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3213198506952128675.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,621784,0.608772,16124,2,2422,5,39265,6,0,396,51244,0


Converting to forward existential form...Done !
original formula: AG((AF((p3==1)) + ((AF(((p74==0)||(p27==1))) * ((p8==0)||(p110==1))) * (((p60==0)&&(p4==1))||((p133==0)&&(p137==1))))))
=> equivalent forward existential formula: (([FwdG((FwdU(Init,TRUE) * !(!(EG(!((p3==1)))))),!(((p74==0)||(p27==1))))] = FALSE * [((FwdU(Init,TRUE) * !(!(EG...314
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t6, t7, t8, t9, t10, t12, t13, t14, t15, t16, t18, t19, t21, t24, t25, t26, t...350
(forward)formula 0,0,22.3377,477420,1,0,517,2.75669e+06,335,188,3704,2.48326e+06,604
FORMULA MedleyA-PT-10-CTLCardinality-2025-07 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 : 133/133 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 258
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 102 transition count 223
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 102 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 102 transition count 220
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 94 transition count 198
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 94 transition count 198
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 84 place count 90 transition count 188
Iterating global reduction 2 with 4 rules applied. Total rules applied 88 place count 90 transition count 188
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 88 transition count 182
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 88 transition count 182
Applied a total of 92 rules in 5 ms. Remains 88 /133 variables (removed 45) and now considering 182/258 (removed 76) transitions.
// Phase 1: matrix 182 rows 88 cols
[2025-06-02 09:29:13] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:29:13] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-02 09:29:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:29:13] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2025-06-02 09:29:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:16] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:16] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:20] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:20] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:20] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:23] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:27] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 0/270 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 105 constraints, problems are : Problem set: 0 solved, 181 unsolved in 20105 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 181/284 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:42] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 3)
(t3 0)
(t4 3)
(t5 3)
(t6 3)
(t7 3)
(t8 2)
(t9 2)
(t10 8)
(t11 1)
(t12 1)
(t13 1)
(t14 0)
(t15 0)
(t16 0)
(t17 1)
(t18 53)
(t19 0)
(t20 0)
(t21 49)
(t22 0)
(t23 0)
(t24 0)
(t25 0)
(t26 3)
(t27 0)
(t28 0)
(t29 26)
(t30 26)
(t31 0)
(t32 4)
(t33 22)
(t34 18)
(t35 4)
(t36 0)
(t37 25)
(t38 0)
(t39 202)
(t40 0)
(t41 0)
(t42 0)
(t43 0)
(t44 0)
(t45 0)
(t46 0)
(t47 52)
(t48 0)
(t49 0)
(t50 26)
(t51 0)
(t52 0)
(t53 0)
(t54 0)
(t55 26)
(t56 0)
(t57 0)
(t58 26)
(t59 26)
(t60 4)
(t61 0)
(t62 22)
(t63 21)
(t64 1)
(t65 0)
(t66 26)
(t67 0)
(t68 178)
(t69 0)
(t70 0)
(t71 0)
(t72 0)
(t73 0)
(t74 49)
(t75 0)
(t76 0)
(t77 0)
(t78 26)
(t79 0)
(t80 0)
(t81 0)
(t82 0)
(t83 0)
(t84 0)
(t85 0)
(t86 2)
(t87 0)
(t88 0)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 0)
(t94 0)
(t95 0)
(t96 2)
(t97 0)
(t98 0)
(t99 0)
(t100 0)
(t101 0)
(t102 0)
(t103 0)
(t104 2)
(t105 0)
(t106 1)
(t107 0)
(t108 0)
(t109 0)
(t110 0)
(t111 0)
(t112 0)
(t113 0)
(t114 0)
(t115 0)
(t116 2)
(t117 0)
(t118 0)
(t119 0)
(t120 2)
(t121 2)
(t122 0)
(t123 0)
(t124 0)
(t125 0)
(t126 0)
(t127 0)
(t128 0)
(t129 0)
(t130 0)
(t131 25)
(t132 0)
(t133 21)
(t134 0)
(t135 0)
(t136 0)
(t137 0)
(t138 0)
(t139 1)
(t140 0)
(t141 1)
(t142 0)
(t143 0)
(t144 0)
(t145 0)
(t146 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/270 variables, and 287 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 50250ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 50251ms
Starting structural reductions in LTL mode, iteration 1 : 88/133 places, 182/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50548 ms. Remains : 88/133 places, 182/258 transitions.
[2025-06-02 09:30:04] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:30:04] [INFO ] Flatten gal took : 7 ms
[2025-06-02 09:30:04] [INFO ] Input system was already deterministic with 182 transitions.
[2025-06-02 09:30:04] [INFO ] Flatten gal took : 7 ms
[2025-06-02 09:30:04] [INFO ] Flatten gal took : 7 ms
[2025-06-02 09:30:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality388422837519876555.gal : 3 ms
[2025-06-02 09:30:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality11302828160488260105.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/CTLCardinality388422837519876555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11302828160488260105.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.07824e+07,1.55863,37360,2,4633,5,106362,6,0,534,145056,0


Converting to forward existential form...Done !
original formula: AX(((AF((p86==1)) * EX(AX(((p134==0)||(p144==1))))) * !(A(!(((p94==0)||(p13==1))) U EG((p27==0))))))
=> equivalent forward existential formula: (([FwdG(EY(Init),!((p86==1)))] = FALSE * [(EY(Init) * !(EX(!(EX(!(((p134==0)||(p144==1))))))))] = FALSE) * [((EY...271
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t22, t23, t25, t27, t28, t31, t32, t34, t35, t36, t37, ...377
Detected timeout of ITS tools.
[2025-06-02 09:30:34] [INFO ] Flatten gal took : 7 ms
[2025-06-02 09:30:34] [INFO ] Applying decomposition
[2025-06-02 09:30:34] [INFO ] Flatten gal took : 6 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/graph6293648848163915727.txt' '-o' '/tmp/graph6293648848163915727.bin' '-w' '/tmp/graph6293648848163915727.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6293648848163915727.bin' '-l' '-1' '-v' '-w' '/tmp/graph6293648848163915727.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:30:34] [INFO ] Decomposing Gal with order
[2025-06-02 09:30:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:30:34] [INFO ] Removed a total of 382 redundant transitions.
[2025-06-02 09:30:34] [INFO ] Flatten gal took : 31 ms
[2025-06-02 09:30:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 15 ms.
[2025-06-02 09:30:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality17867357716833638552.gal : 2 ms
[2025-06-02 09:30:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality16510980202075495027.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/CTLCardinality17867357716833638552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16510980202075495027.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07824e+07,0.144589,8400,396,75,8227,522,383,16937,81,1238,0


Converting to forward existential form...Done !
original formula: AX(((AF((i3.u14.p86==1)) * EX(AX(((i7.i1.u22.p134==0)||(i7.i1.u25.p144==1))))) * !(A(!(((i4.u16.p94==0)||(i0.u1.p13==1))) U EG((i6.u3.p27...164
=> equivalent forward existential formula: (([FwdG(EY(Init),!((i3.u14.p86==1)))] = FALSE * [(EY(Init) * !(EX(!(EX(!(((i7.i1.u22.p134==0)||(i7.i1.u25.p144==...329
Reverse transition relation is NOT exact ! Due to transitions t17, t46, t72, t76, i0.u1.t69, i0.u1.t70, i0.u4.t67, i1.t61, i1.t57, i1.t56, i1.u5.t63, i1.u5...569
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,4.78752,130044,1,0,167961,3068,2356,870471,433,23994,253124
FORMULA MedleyA-PT-10-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 258
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 102 transition count 223
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 102 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 102 transition count 220
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 94 transition count 198
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 94 transition count 198
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 84 place count 90 transition count 188
Iterating global reduction 2 with 4 rules applied. Total rules applied 88 place count 90 transition count 188
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 88 transition count 182
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 88 transition count 182
Applied a total of 92 rules in 6 ms. Remains 88 /133 variables (removed 45) and now considering 182/258 (removed 76) transitions.
// Phase 1: matrix 182 rows 88 cols
[2025-06-02 09:30:39] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:30:39] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-02 09:30:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:30:39] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2025-06-02 09:30:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:41] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:41] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:43] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:46] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:47] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 103 constraints, problems are : Problem set: 0 solved, 181 unsolved in 14994 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/101 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 181/282 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 284 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45106ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 45107ms
Starting structural reductions in LTL mode, iteration 1 : 88/133 places, 182/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45321 ms. Remains : 88/133 places, 182/258 transitions.
[2025-06-02 09:31:24] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:31:24] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:31:24] [INFO ] Input system was already deterministic with 182 transitions.
[2025-06-02 09:31:24] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:31:24] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:31:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality2665151916530364627.gal : 2 ms
[2025-06-02 09:31:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality9522454679191023099.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/CTLCardinality2665151916530364627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9522454679191023099.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.07363e+07,1.50913,34160,2,4493,5,97679,6,0,534,126199,0


Converting to forward existential form...Done !
original formula: ((EF(((p96==0)||(p135==1))) * EX(EG(((p97==0)||(p76==1))))) * EX(AX(EX((p132==0)))))
=> equivalent forward existential formula: [(EY((Init * (E(TRUE U ((p96==0)||(p135==1))) * EX(EG(((p97==0)||(p76==1))))))) * !(EX(!(EX((p132==0))))))] != F...159
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t10, t11, t16, t17, t18, t19, t20, t23, t24, t26, t28, t29, t32, t33, t35, t36, t37, ...366
Detected timeout of ITS tools.
[2025-06-02 09:31:54] [INFO ] Flatten gal took : 6 ms
[2025-06-02 09:31:54] [INFO ] Applying decomposition
[2025-06-02 09:31:54] [INFO ] Flatten gal took : 6 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/graph1510477635138254791.txt' '-o' '/tmp/graph1510477635138254791.bin' '-w' '/tmp/graph1510477635138254791.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1510477635138254791.bin' '-l' '-1' '-v' '-w' '/tmp/graph1510477635138254791.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:31:54] [INFO ] Decomposing Gal with order
[2025-06-02 09:31:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:31:54] [INFO ] Removed a total of 389 redundant transitions.
[2025-06-02 09:31:54] [INFO ] Flatten gal took : 28 ms
[2025-06-02 09:31:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 10 ms.
[2025-06-02 09:31:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality4419228969486701679.gal : 4 ms
[2025-06-02 09:31:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality572638492282290088.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/CTLCardinality4419228969486701679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality572638492282290088.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07363e+07,0.559962,14204,668,81,18755,463,420,46849,82,1491,0


Converting to forward existential form...Done !
original formula: ((EF(((i3.u17.p96==0)||(i0.i1.u22.p135==1))) * EX(EG(((i3.u17.p97==0)||(i0.i1.u20.p76==1))))) * EX(AX(EX((i6.i1.u24.p132==0)))))
=> equivalent forward existential formula: [(EY((Init * (E(TRUE U ((i3.u17.p96==0)||(i0.i1.u22.p135==1))) * EX(EG(((i3.u17.p97==0)||(i0.i1.u20.p76==1))))))...203
Reverse transition relation is NOT exact ! Due to transitions t18, t47, t72, i0.t76, i0.i0.u4.t68, i0.i1.u20.t11, i0.i1.u20.t119, i1.t58, i1.t57, i1.u5.t61...562
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,12.3173,262148,1,0,410265,3609,2303,1.16632e+06,390,17859,419613
FORMULA MedleyA-PT-10-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 258/258 transitions.
Graph (complete) has 485 edges and 133 vertex of which 130 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 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 0 with 17 rules applied. Total rules applied 18 place count 129 transition count 238
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 112 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 111 transition count 235
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 39 place count 111 transition count 233
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 43 place count 109 transition count 233
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 63 place count 89 transition count 210
Iterating global reduction 3 with 20 rules applied. Total rules applied 83 place count 89 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 83 place count 89 transition count 208
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 87 transition count 208
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 93 place count 81 transition count 195
Iterating global reduction 3 with 6 rules applied. Total rules applied 99 place count 81 transition count 195
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 79 transition count 189
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 79 transition count 189
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 79 transition count 188
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 106 place count 78 transition count 187
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 107 place count 77 transition count 184
Iterating global reduction 5 with 1 rules applied. Total rules applied 108 place count 77 transition count 184
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 136 place count 62 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 137 place count 62 transition count 170
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 139 place count 60 transition count 168
Iterating global reduction 6 with 2 rules applied. Total rules applied 141 place count 60 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 145 place count 60 transition count 164
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 145 place count 60 transition count 162
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 149 place count 58 transition count 162
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 153 place count 56 transition count 160
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 155 place count 54 transition count 158
Applied a total of 155 rules in 37 ms. Remains 54 /133 variables (removed 79) and now considering 158/258 (removed 100) transitions.
// Phase 1: matrix 158 rows 54 cols
[2025-06-02 09:32:07] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:32:07] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-02 09:32:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:32:07] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 09:32:07] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:32:07] [INFO ] Redundant transitions in 6 ms returned []
Running 150 sub problems to find dead transitions.
[2025-06-02 09:32:07] [INFO ] Invariant cache hit.
[2025-06-02 09:32:07] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 157/210 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 2/212 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 0/212 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 78 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10676 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 157/210 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 149/226 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 2/212 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (OVERLAPS) 0/212 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 228 constraints, problems are : Problem set: 0 solved, 150 unsolved in 20934 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31711ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 31713ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/133 places, 158/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32053 ms. Remains : 54/133 places, 158/258 transitions.
[2025-06-02 09:32:39] [INFO ] Flatten gal took : 6 ms
[2025-06-02 09:32:39] [INFO ] Flatten gal took : 5 ms
[2025-06-02 09:32:39] [INFO ] Input system was already deterministic with 158 transitions.
[2025-06-02 09:32:39] [INFO ] Flatten gal took : 5 ms
[2025-06-02 09:32:39] [INFO ] Flatten gal took : 5 ms
[2025-06-02 09:32:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality12674566933928039346.gal : 1 ms
[2025-06-02 09:32:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality17286628081248820745.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/CTLCardinality12674566933928039346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17286628081248820745.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,642548,0.493392,13280,2,1130,5,32870,6,0,370,37809,0


Converting to forward existential form...Done !
original formula: AG((EG((((p148==1)||(p56==1))||(p131==0))) * (p41==0)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG((((p148==1)||(p56==1))||(p131==0)))))] = FALSE * [(FwdU(Init,TRUE) * !((p41==0)))] = F...160
(forward)formula 0,0,0.497526,13536,1,0,8,32870,9,2,375,37809,1
FORMULA MedleyA-PT-10-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 258/258 transitions.
Graph (complete) has 485 edges and 133 vertex of which 130 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 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 0 with 17 rules applied. Total rules applied 18 place count 129 transition count 238
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 112 transition count 237
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 36 place count 112 transition count 235
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 110 transition count 235
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 63 place count 87 transition count 207
Iterating global reduction 2 with 23 rules applied. Total rules applied 86 place count 87 transition count 207
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 86 place count 87 transition count 205
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 85 transition count 205
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 98 place count 77 transition count 183
Iterating global reduction 2 with 8 rules applied. Total rules applied 106 place count 77 transition count 183
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 74 transition count 175
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 74 transition count 175
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 74 transition count 174
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 73 transition count 173
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 116 place count 72 transition count 170
Iterating global reduction 4 with 1 rules applied. Total rules applied 117 place count 72 transition count 170
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 143 place count 58 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 144 place count 58 transition count 157
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 148 place count 54 transition count 149
Iterating global reduction 5 with 4 rules applied. Total rules applied 152 place count 54 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 156 place count 54 transition count 145
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 156 place count 54 transition count 143
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 160 place count 52 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 164 place count 50 transition count 141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 166 place count 48 transition count 139
Applied a total of 166 rules in 48 ms. Remains 48 /133 variables (removed 85) and now considering 139/258 (removed 119) transitions.
// Phase 1: matrix 139 rows 48 cols
[2025-06-02 09:32:39] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:32:40] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-02 09:32:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:32:40] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 09:32:40] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:32:40] [INFO ] Redundant transitions in 7 ms returned []
Running 131 sub problems to find dead transitions.
[2025-06-02 09:32:40] [INFO ] Invariant cache hit.
[2025-06-02 09:32:40] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 2/47 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 138/185 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 2/187 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/187 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 72 constraints, problems are : Problem set: 0 solved, 131 unsolved in 7555 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 2/47 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 138/185 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 130/201 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 2/187 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 0/187 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 203 constraints, problems are : Problem set: 0 solved, 131 unsolved in 13662 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21320ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 21321ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/133 places, 139/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21686 ms. Remains : 48/133 places, 139/258 transitions.
[2025-06-02 09:33:01] [INFO ] Flatten gal took : 4 ms
[2025-06-02 09:33:01] [INFO ] Flatten gal took : 4 ms
[2025-06-02 09:33:01] [INFO ] Input system was already deterministic with 139 transitions.
[2025-06-02 09:33:01] [INFO ] Flatten gal took : 4 ms
[2025-06-02 09:33:01] [INFO ] Flatten gal took : 5 ms
[2025-06-02 09:33:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality9774470140606531044.gal : 1 ms
[2025-06-02 09:33:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality561299536747122306.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/CTLCardinality9774470140606531044.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality561299536747122306.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,327060,0.15871,8248,2,381,5,17971,6,0,326,18067,0


Converting to forward existential form...Done !
original formula: EF(EG((p30==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p30==0))] != FALSE
Hit Full ! (commute/partial/dont) 137/0/2
(forward)formula 0,1,0.225999,8504,1,0,8,21561,19,3,2243,18067,8
FORMULA MedleyA-PT-10-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 258
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 106 transition count 228
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 106 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 56 place count 106 transition count 225
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 102 transition count 215
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 102 transition count 215
Applied a total of 64 rules in 15 ms. Remains 102 /133 variables (removed 31) and now considering 215/258 (removed 43) transitions.
// Phase 1: matrix 215 rows 102 cols
[2025-06-02 09:33:01] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:33:01] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-02 09:33:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:33:02] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-06-02 09:33:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:05] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:05] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:05] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:05] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:05] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/317 variables, 102/117 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:10] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:15] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:16] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 120 constraints, problems are : Problem set: 0 solved, 214 unsolved in 22580 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/317 variables, 102/118 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 214/332 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:30] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:34] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:36] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:36] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:36] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 4/337 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:43] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 22 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:48] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 214 unsolved
SMT process timed out in 52731ms, After SMT, problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 52732ms
Starting structural reductions in LTL mode, iteration 1 : 102/133 places, 215/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53017 ms. Remains : 102/133 places, 215/258 transitions.
[2025-06-02 09:33:54] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:33:54] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:33:54] [INFO ] Input system was already deterministic with 215 transitions.
[2025-06-02 09:33:54] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:33:54] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:33:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality14281138396767125583.gal : 2 ms
[2025-06-02 09:33:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality7147168161178034357.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/CTLCardinality14281138396767125583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7147168161178034357.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.74312e+07,5.15514,112340,2,16652,5,330780,6,0,622,446536,0


Converting to forward existential form...Done !
original formula: (A(AX(((p1==0)||(p83==1))) U ((AF(((EG((p55==1)) + (p47==0)) + ((p66==1)||(p9==1)))) * (((E((p37==0) U ((p116==0)||(p72==1))) * AX((p95==...260
=> equivalent forward existential formula: ((([FwdG(((FwdU(Init,!(((!(EG(!(((EG((p55==1)) + (p47==0)) + ((p66==1)||(p9==1)))))) * (((E((p37==0) U ((p116==0...1328
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t11, t16, t17, t19, t20, t21, t23, t24, t25, t26, t27, t28, t30, t31, t32, t33, ...589
Detected timeout of ITS tools.
[2025-06-02 09:34:25] [INFO ] Flatten gal took : 14 ms
[2025-06-02 09:34:25] [INFO ] Applying decomposition
[2025-06-02 09:34:25] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17417769194889689825.txt' '-o' '/tmp/graph17417769194889689825.bin' '-w' '/tmp/graph17417769194889689825.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17417769194889689825.bin' '-l' '-1' '-v' '-w' '/tmp/graph17417769194889689825.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:34:25] [INFO ] Decomposing Gal with order
[2025-06-02 09:34:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:34:25] [INFO ] Removed a total of 409 redundant transitions.
[2025-06-02 09:34:25] [INFO ] Flatten gal took : 30 ms
[2025-06-02 09:34:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 8 ms.
[2025-06-02 09:34:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality11779142207466053062.gal : 4 ms
[2025-06-02 09:34:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality12825334416002028219.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/CTLCardinality11779142207466053062.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12825334416002028219.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.74312e+07,0.799813,20524,801,457,26869,3682,414,74990,141,21967,0


Converting to forward existential form...Done !
original formula: (A(AX(((i0.u0.p1==0)||(i0.u13.p83==1))) U ((AF(((EG((i2.u9.p55==1)) + (i2.u9.p47==0)) + ((i6.u10.p66==1)||(i6.u10.p9==1)))) * (((E((i3.u5...381
=> equivalent forward existential formula: ((([FwdG(((FwdU(Init,!(((!(EG(!(((EG((i2.u9.p55==1)) + (i2.u9.p47==0)) + ((i6.u10.p66==1)||(i6.u10.p9==1)))))) *...1856
Reverse transition relation is NOT exact ! Due to transitions t1, t57, t90, t91, t97, t98, t191, t192, t193, t194, t205, t206, t207, t208, t210, t212, i1.u...855
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,9.35494,194980,1,0,328375,11902,2170,844676,732,87294,488451
FORMULA MedleyA-PT-10-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 258
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 104 transition count 225
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 104 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 104 transition count 223
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 66 place count 97 transition count 205
Iterating global reduction 2 with 7 rules applied. Total rules applied 73 place count 97 transition count 205
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 95 transition count 201
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 95 transition count 201
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 94 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 94 transition count 198
Applied a total of 79 rules in 6 ms. Remains 94 /133 variables (removed 39) and now considering 198/258 (removed 60) transitions.
// Phase 1: matrix 198 rows 94 cols
[2025-06-02 09:34:34] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:34:34] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-02 09:34:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:34:34] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2025-06-02 09:34:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:37] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:37] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:37] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:37] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:37] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:37] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:38] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/292 variables, 94/111 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:40] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:44] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:45] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:46] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:48] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (OVERLAPS) 0/292 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 116 constraints, problems are : Problem set: 0 solved, 197 unsolved in 21230 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/292 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 197/311 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:01] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:01] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 292/292 variables, and 315 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 51406ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 51409ms
Starting structural reductions in LTL mode, iteration 1 : 94/133 places, 198/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51741 ms. Remains : 94/133 places, 198/258 transitions.
[2025-06-02 09:35:26] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:35:26] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:35:26] [INFO ] Input system was already deterministic with 198 transitions.
[2025-06-02 09:35:26] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:35:26] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:35:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality16938991907564217806.gal : 3 ms
[2025-06-02 09:35:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality3705214909936995817.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/CTLCardinality16938991907564217806.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3705214909936995817.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.49412e+07,2.667,53488,2,6245,5,144361,6,0,574,220978,0


Converting to forward existential form...Done !
original formula: E((p50==0) U AG(((p114==0) + (EF((p97==1)) * (EX((p0==1)) + ((!((p42==0)||(p32==1)))&&((p84==0)||(p24==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,(p50==0)) * !(E(TRUE U !(((p114==0) + (E(TRUE U (p97==1)) * (EX((p0==1)) + ((!((p42==0)||(p32==1)))&...194
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t22, t23, t24, t27, t28, t29, t30, t31, t32, t33, ...495
Hit Full ! (commute/partial/dont) 187/0/11
(forward)formula 0,1,29.4375,597240,1,0,490,3.185e+06,427,188,5564,2.45859e+06,569
FORMULA MedleyA-PT-10-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 09:35:56] [INFO ] Flatten gal took : 15 ms
[2025-06-02 09:35:56] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:35:56] [INFO ] Applying decomposition
[2025-06-02 09:35:56] [INFO ] Flatten gal took : 8 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/graph1584804612086928658.txt' '-o' '/tmp/graph1584804612086928658.bin' '-w' '/tmp/graph1584804612086928658.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1584804612086928658.bin' '-l' '-1' '-v' '-w' '/tmp/graph1584804612086928658.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:35:56] [INFO ] Decomposing Gal with order
[2025-06-02 09:35:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:35:56] [INFO ] Removed a total of 468 redundant transitions.
[2025-06-02 09:35:56] [INFO ] Flatten gal took : 40 ms
[2025-06-02 09:35:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 7 ms.
[2025-06-02 09:35:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality14627869551167627655.gal : 5 ms
[2025-06-02 09:35:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality14030636774868872710.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/CTLCardinality14627869551167627655.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14030636774868872710.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.36428e+07,1.44472,36060,1264,604,42336,5957,500,184520,174,41904,0


Converting to forward existential form...Done !
original formula: (AG(EX(TRUE)) * (AX((((i7.i0.u26.p142==1)&&((i4.u13.p79==0)||(i2.u9.p60==1)))&&((i5.u24.p101==0)||(i4.u16.p100==1)))) + EX(A(E(EX(TRUE) U...323
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE * [(EY((Init * !(EX(!((E(!((((((i0.u1.p8==0)&&((i1.u2.p17==0)||(i0.u1...906
Reverse transition relation is NOT exact ! Due to transitions t76, t121, t124, t132, t133, t222, t223, t224, t225, t234, t235, t236, t237, t240, t241, t242...1149
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,78.2067,1454152,1,0,1.80358e+06,40679,3027,8.21361e+06,950,691260,1530804
FORMULA MedleyA-PT-10-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1104492 ms.

BK_STOP 1748857034867

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-10"
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 MedleyA-PT-10, 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 r128-smll-174876524100169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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