Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524000113.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-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524000113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 26K 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-03-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2024-15
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2025-00
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2025-01
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2025-02
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2025-03
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2025-04
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2025-05
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2025-06
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2025-07
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2025-08
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2025-09
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2025-10
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748842299013

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-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 05:31:41] [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 05:31:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:31:42] [INFO ] Load time of PNML (sax parser for PT used): 278 ms
[2025-06-02 05:31:42] [INFO ] Transformed 108 places.
[2025-06-02 05:31:42] [INFO ] Transformed 100 transitions.
[2025-06-02 05:31:42] [INFO ] Found NUPN structural information;
[2025-06-02 05:31:42] [INFO ] Parsed PT model containing 108 places and 100 transitions and 272 arcs in 504 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 37 ms.
Initial state reduction rules removed 3 formulas.
FORMULA MedleyA-PT-03-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Applied a total of 0 rules in 22 ms. Remains 108 /108 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 108 cols
[2025-06-02 05:31:42] [INFO ] Computed 9 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:31:43] [INFO ] Implicit Places using invariants in 460 ms returned []
[2025-06-02 05:31:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:31:43] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2025-06-02 05:31:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 9/115 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:46] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:46] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:46] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:46] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:46] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:46] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:46] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:47] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:47] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:47] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:47] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:47] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 100/208 variables, 108/237 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:50] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:53] [INFO ] Deduced a trap along path composed of 21 places in 85 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:54] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 240 constraints, problems are : Problem set: 0 solved, 99 unsolved in 22938 ms.
Refiners :[Domain max(s): 108/108 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 9/115 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 14/131 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:06] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:06] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:07] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:07] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:07] [INFO ] Deduced a trap composed of 22 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 05:32:07] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:07] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:07] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:07] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:07] [INFO ] Deduced a trap composed of 24 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 05:32:07] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:08] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 12/143 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:08] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:08] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:08] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:08] [INFO ] Deduced a trap composed of 24 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 05:32:08] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:09] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:09] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:09] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 8/151 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:09] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 100/208 variables, 108/260 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 99/359 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:14] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 18 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 99 unsolved
SMT process timed out in 53078ms, After SMT, problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 53098ms
Finished structural reductions in LTL mode , in 1 iterations and 54050 ms. Remains : 108/108 places, 100/100 transitions.
Support contains 69 out of 108 places after structural reductions.
[2025-06-02 05:32:36] [INFO ] Flatten gal took : 61 ms
[2025-06-02 05:32:36] [INFO ] Flatten gal took : 24 ms
[2025-06-02 05:32:36] [INFO ] Input system was already deterministic with 100 transitions.
Reduction of identical properties reduced properties to check from 63 to 61
RANDOM walk for 40000 steps (671 resets) in 2821 ms. (14 steps per ms) remains 9/61 properties
BEST_FIRST walk for 40003 steps (200 resets) in 408 ms. (97 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (196 resets) in 271 ms. (147 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (179 resets) in 262 ms. (152 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (175 resets) in 230 ms. (173 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (175 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (165 resets) in 130 ms. (305 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (184 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (174 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (166 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
[2025-06-02 05:32:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 2 (OVERLAPS) 89/108 variables, 9/28 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 89/117 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/117 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 100/208 variables, 108/225 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 225 constraints, problems are : Problem set: 2 solved, 7 unsolved in 1734 ms.
Refiners :[Domain max(s): 108/108 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 56/68 variables, 5/17 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 56/73 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:40] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/74 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/74 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 40/108 variables, 4/78 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 40/118 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:40] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:40] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 2/120 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/120 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 100/208 variables, 108/228 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 7/235 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/235 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/235 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 235 constraints, problems are : Problem set: 2 solved, 7 unsolved in 2968 ms.
Refiners :[Domain max(s): 108/108 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 7/9 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4716ms problems are : Problem set: 2 solved, 7 unsolved
Finished Parikh walk after 53075 steps, including 1000 resets, run visited all 6 properties in 641 ms. (steps per millisecond=82 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 3571 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2025-06-02 05:32:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 05:32:46] [INFO ] Flatten gal took : 11 ms
FORMULA MedleyA-PT-03-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 05:32:46] [INFO ] Flatten gal took : 11 ms
[2025-06-02 05:32:46] [INFO ] Input system was already deterministic with 100 transitions.
Computed a total of 108 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 100
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 100
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 97 transition count 90
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 97 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 96 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 96 transition count 89
Applied a total of 23 rules in 27 ms. Remains 96 /108 variables (removed 12) and now considering 89/100 (removed 11) transitions.
// Phase 1: matrix 89 rows 96 cols
[2025-06-02 05:32:46] [INFO ] Computed 8 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:32:46] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-02 05:32:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:32:47] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2025-06-02 05:32:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:48] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:48] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:48] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:48] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:48] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:48] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:48] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:48] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:48] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:49] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:49] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:49] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:49] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:49] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:50] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:50] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:50] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:50] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:51] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:51] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:51] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:51] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 89/185 variables, 96/126 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:53] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 127 constraints, problems are : Problem set: 0 solved, 88 unsolved in 9920 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:57] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:57] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:57] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:57] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:58] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:58] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:58] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:58] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 89/185 variables, 96/135 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 88/223 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:00] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:01] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:01] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:01] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:01] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 5/228 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:05] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/185 variables, and 229 constraints, problems are : Problem set: 0 solved, 88 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39973ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 39974ms
Starting structural reductions in LTL mode, iteration 1 : 96/108 places, 89/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40201 ms. Remains : 96/108 places, 89/100 transitions.
[2025-06-02 05:33:27] [INFO ] Flatten gal took : 13 ms
[2025-06-02 05:33:27] [INFO ] Flatten gal took : 12 ms
[2025-06-02 05:33:27] [INFO ] Input system was already deterministic with 89 transitions.
[2025-06-02 05:33:27] [INFO ] Flatten gal took : 11 ms
[2025-06-02 05:33:27] [INFO ] Flatten gal took : 12 ms
[2025-06-02 05:33:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality8431588799427514960.gal : 8 ms
[2025-06-02 05:33:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality12992436852357124578.ctl : 7 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/CTLCardinality8431588799427514960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12992436852357124578.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.34201e+08,0.718584,16888,2,5229,5,38759,6,0,475,85058,0


Converting to forward existential form...Done !
original formula: AX(EG((((AX((p79==0)) + (p70==1)) + ((p43==0)||(p53==1))) + (((p61==0)&&(p65==1))||((p99==0)&&(p43==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG((((!(EX(!((p79==0)))) + (p70==1)) + ((p43==0)||(p53==1))) + (((p61==0)&&(p65==1))||((p99==0)&&...178
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t10, t12, t14, t20, t22, t23, t27, t30, t33, t35, t38, t41, t43, t45, t51, t54, t55, ...258
Detected timeout of ITS tools.
[2025-06-02 05:33:57] [INFO ] Flatten gal took : 11 ms
[2025-06-02 05:33:57] [INFO ] Applying decomposition
[2025-06-02 05:33:57] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16138663229398355178.txt' '-o' '/tmp/graph16138663229398355178.bin' '-w' '/tmp/graph16138663229398355178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16138663229398355178.bin' '-l' '-1' '-v' '-w' '/tmp/graph16138663229398355178.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:33:57] [INFO ] Decomposing Gal with order
[2025-06-02 05:33:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:33:57] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-02 05:33:57] [INFO ] Flatten gal took : 90 ms
[2025-06-02 05:33:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-02 05:33:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality10729339179232815281.gal : 7 ms
[2025-06-02 05:33:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality4084438078430922340.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/CTLCardinality10729339179232815281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4084438078430922340.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.34201e+08,0.301895,9568,1920,166,12127,2915,222,10734,117,11788,0


Converting to forward existential form...Done !
original formula: AX(EG((((AX((i9.u29.p79==0)) + (i8.i1.u27.p70==1)) + ((i6.u15.p43==0)||(i7.u20.p53==1))) + (((i2.i1.u23.p61==0)&&(i8.i0.u22.p65==1))||((u...187
=> equivalent forward existential formula: [(EY(Init) * !(EG((((!(EX(!((i9.u29.p79==0)))) + (i8.i1.u27.p70==1)) + ((i6.u15.p43==0)||(i7.u20.p53==1))) + (((...240
Reverse transition relation is NOT exact ! Due to transitions u31.t75, i0.u1.t55, i1.u25.t12, i1.u28.t4, i2.i0.u19.t27, i2.i1.t20, i2.i1.u23.t23, i3.u11.t4...388
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Graph (complete) has 186 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output 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 106 transition count 84
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 91 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 90 transition count 83
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 33 place count 90 transition count 81
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 37 place count 88 transition count 81
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 40 place count 85 transition count 78
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 85 transition count 78
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 77 place count 68 transition count 61
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 68 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 67 transition count 60
Applied a total of 79 rules in 57 ms. Remains 67 /108 variables (removed 41) and now considering 60/100 (removed 40) transitions.
// Phase 1: matrix 60 rows 67 cols
[2025-06-02 05:34:27] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:34:27] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-02 05:34:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:34:27] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:34:28] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2025-06-02 05:34:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:28] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:28] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:28] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 60/127 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:29] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:30] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/127 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:30] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 81 constraints, problems are : Problem set: 0 solved, 59 unsolved in 3144 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/127 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 59/140 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:32] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:32] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:32] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:32] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:33] [INFO ] Deduced a trap along path composed of 4 places in 33 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:36] [INFO ] Deduced a trap along path composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 146 constraints, problems are : Problem set: 0 solved, 59 unsolved in 17420 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 20585ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 20587ms
Starting structural reductions in SI_CTL mode, iteration 1 : 67/108 places, 60/100 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20863 ms. Remains : 67/108 places, 60/100 transitions.
[2025-06-02 05:34:48] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:34:48] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:34:48] [INFO ] Input system was already deterministic with 60 transitions.
[2025-06-02 05:34:48] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:34:48] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:34:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality7871284269147083125.gal : 1 ms
[2025-06-02 05:34:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality8916856157212000889.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/CTLCardinality7871284269147083125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8916856157212000889.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A(A(EG(!(E((p61==1) U ((p54==0)||(p55==1))))) U (p53==0)) U ((!(((!(A(((p61==0)||(p107==1)) U ((p102==0)||(p77==1)))) * ((p7==0)||(p70==1...238
=> equivalent forward existential formula: [((Init * !(EG(!(((!(((!(!((E(!(((p102==0)||(p77==1))) U (!(((p61==0)||(p107==1))) * !(((p102==0)||(p77==1))))) ...963
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t7, t8, t11, t14, t17, t18, t20, t23, t43, t46, t48, t59, Intersection with reachabl...226
(forward)formula 0,0,25.4982,582656,1,0,1466,3.72736e+06,175,579,2097,4.76551e+06,1446
FORMULA MedleyA-PT-03-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 100
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 93 transition count 86
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 93 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 92 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 92 transition count 85
Applied a total of 31 rules in 18 ms. Remains 92 /108 variables (removed 16) and now considering 85/100 (removed 15) transitions.
// Phase 1: matrix 85 rows 92 cols
[2025-06-02 05:35:14] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:35:14] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-02 05:35:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:35:14] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2025-06-02 05:35:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:15] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:16] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 85/177 variables, 92/102 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:17] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 103 constraints, problems are : Problem set: 0 solved, 84 unsolved in 5939 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/177 variables, 92/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 84/187 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:22] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:22] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:22] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:22] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:22] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:23] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 6/193 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:24] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:24] [INFO ] Deduced a trap composed of 24 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 05:35:24] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:24] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:29] [INFO ] Deduced a trap along path composed of 7 places in 46 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:40] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/177 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:49] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 177/177 variables, and 200 constraints, problems are : Problem set: 0 solved, 84 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35964ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 35965ms
Starting structural reductions in LTL mode, iteration 1 : 92/108 places, 85/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36251 ms. Remains : 92/108 places, 85/100 transitions.
[2025-06-02 05:35:50] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:35:50] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:35:50] [INFO ] Input system was already deterministic with 85 transitions.
[2025-06-02 05:35:50] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:35:50] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:35:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality819188555216737968.gal : 2 ms
[2025-06-02 05:35:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality11817505548778917638.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/CTLCardinality819188555216737968.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11817505548778917638.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.10961e+08,0.445946,14084,2,1668,5,33021,6,0,455,63355,0


Converting to forward existential form...Done !
original formula: EF(EX(((p107==0)&&(p64==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * ((p107==0)&&(p64==1)))] != FALSE
(forward)formula 0,1,0.474053,14340,1,0,8,33021,8,1,765,63355,2
FORMULA MedleyA-PT-03-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Graph (complete) has 186 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 106 transition count 75
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 82 transition count 75
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 49 place count 82 transition count 69
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 61 place count 76 transition count 69
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 68 place count 69 transition count 62
Iterating global reduction 2 with 7 rules applied. Total rules applied 75 place count 69 transition count 62
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 75 place count 69 transition count 61
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 77 place count 68 transition count 61
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 103 place count 55 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 54 transition count 47
Applied a total of 104 rules in 32 ms. Remains 54 /108 variables (removed 54) and now considering 47/100 (removed 53) transitions.
// Phase 1: matrix 47 rows 54 cols
[2025-06-02 05:35:51] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:35:51] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-02 05:35:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:35:51] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:35:51] [INFO ] Redundant transitions in 2 ms returned []
Running 46 sub problems to find dead transitions.
[2025-06-02 05:35:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:51] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:51] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/100 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 1/101 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/101 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 64 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2043 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 47/100 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 46/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 1/101 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/101 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 110 constraints, problems are : Problem set: 0 solved, 46 unsolved in 3060 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5116ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 5117ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/108 places, 47/100 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5366 ms. Remains : 54/108 places, 47/100 transitions.
[2025-06-02 05:35:56] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:35:56] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:35:56] [INFO ] Input system was already deterministic with 47 transitions.
[2025-06-02 05:35:56] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:35:56] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:35:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality7050801796638957058.gal : 1 ms
[2025-06-02 05:35:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality11409433390574381440.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/CTLCardinality7050801796638957058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11409433390574381440.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.40015e+06,0.023067,4340,2,747,5,3123,6,0,265,2464,0


Converting to forward existential form...Done !
original formula: AG(AF((p49==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p49==0)))] = FALSE
dead was empty
(forward)formula 0,1,0.487979,17112,1,0,426,85603,13,2,1259,62813,423
FORMULA MedleyA-PT-03-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 100
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 93 transition count 86
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 93 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 92 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 92 transition count 85
Applied a total of 31 rules in 10 ms. Remains 92 /108 variables (removed 16) and now considering 85/100 (removed 15) transitions.
// Phase 1: matrix 85 rows 92 cols
[2025-06-02 05:35:57] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:35:57] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-02 05:35:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:35:57] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2025-06-02 05:35:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:58] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:58] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 85/177 variables, 92/102 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:59] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 103 constraints, problems are : Problem set: 0 solved, 84 unsolved in 4712 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/177 variables, 92/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 84/187 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:03] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:03] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:04] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:04] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:04] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:05] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 6/193 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:06] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:06] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:06] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:06] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:10] [INFO ] Deduced a trap along path composed of 7 places in 45 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:21] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 4 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/177 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:30] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 177/177 variables, and 200 constraints, problems are : Problem set: 0 solved, 84 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34738ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 34739ms
Starting structural reductions in LTL mode, iteration 1 : 92/108 places, 85/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35018 ms. Remains : 92/108 places, 85/100 transitions.
[2025-06-02 05:36:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 05:36:32] [INFO ] Flatten gal took : 6 ms
FORMULA MedleyA-PT-03-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 05:36:32] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:36:32] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 100
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 95 transition count 88
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 95 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 94 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 94 transition count 87
Applied a total of 27 rules in 8 ms. Remains 94 /108 variables (removed 14) and now considering 87/100 (removed 13) transitions.
// Phase 1: matrix 87 rows 94 cols
[2025-06-02 05:36:32] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:36:32] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-02 05:36:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:36:32] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2025-06-02 05:36:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:33] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:33] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:33] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:33] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:33] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:33] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:33] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:34] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:34] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:34] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:35] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 87/181 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:36] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:37] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:37] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:38] [INFO ] Deduced a trap along path composed of 17 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/181 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 117 constraints, problems are : Problem set: 0 solved, 86 unsolved in 9214 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:41] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:41] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:41] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:42] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:42] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:42] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 87/181 variables, 94/122 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 86/208 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:43] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:43] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:43] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:43] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:45] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:47] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:05] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:08] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:09] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 181/181 variables, and 218 constraints, problems are : Problem set: 0 solved, 86 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39242ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 39243ms
Starting structural reductions in LTL mode, iteration 1 : 94/108 places, 87/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39510 ms. Remains : 94/108 places, 87/100 transitions.
[2025-06-02 05:37:11] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:37:11] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:37:11] [INFO ] Input system was already deterministic with 87 transitions.
[2025-06-02 05:37:11] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:37:11] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:37:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality2805388060692974732.gal : 1 ms
[2025-06-02 05:37:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality16867204466948396962.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/CTLCardinality2805388060692974732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16867204466948396962.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.25413e+08,0.551109,15636,2,4271,5,36897,6,0,465,74180,0


Converting to forward existential form...Done !
original formula: (EF(EX(TRUE)) * AF(((E(!(((p10==0)||(p64==1))) U !(((p73==1)&&(p92==0)))) * AG((p20==0))) * ((p12==0) + AF((((p59==1)||(p66==0))||(p102==...163
=> equivalent forward existential formula: ([(Init * !(E(TRUE U EX(TRUE))))] = FALSE * [FwdG(Init,!(((E(!(((p10==0)||(p64==1))) U !(((p73==1)&&(p92==0)))) ...254
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t11, t14, t17, t19, t22, t25, t27, t29, t34, t36, t41, t43, t49, t52, t53, t73, Inte...248
Detected timeout of ITS tools.
[2025-06-02 05:37:41] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:37:41] [INFO ] Applying decomposition
[2025-06-02 05:37:41] [INFO ] Flatten gal took : 4 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/graph10300567111002171918.txt' '-o' '/tmp/graph10300567111002171918.bin' '-w' '/tmp/graph10300567111002171918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10300567111002171918.bin' '-l' '-1' '-v' '-w' '/tmp/graph10300567111002171918.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:37:41] [INFO ] Decomposing Gal with order
[2025-06-02 05:37:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:37:41] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-02 05:37:41] [INFO ] Flatten gal took : 19 ms
[2025-06-02 05:37:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-02 05:37:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality8911066851275502788.gal : 5 ms
[2025-06-02 05:37:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality10545060199381625775.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/CTLCardinality8911066851275502788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10545060199381625775.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.25413e+08,0.149969,6564,524,178,4138,2905,203,4459,117,9972,0


Converting to forward existential form...Done !
original formula: (EF(EX(TRUE)) * AF(((E(!(((i9.u5.p10==0)||(i7.u22.p64==1))) U !(((i9.u27.p73==1)&&(u30.p92==0)))) * AG((i3.u10.p20==0))) * ((i1.u6.p12==0...218
=> equivalent forward existential formula: ([(Init * !(E(TRUE U EX(TRUE))))] = FALSE * [FwdG(Init,!(((E(!(((i9.u5.p10==0)||(i7.u22.p64==1))) U !(((i9.u27.p...309
Reverse transition relation is NOT exact ! Due to transitions u29.t6, u30.t73, i0.u2.t53, i1.u20.t19, i1.u24.t11, i1.u28.t4, i2.u11.t41, i2.u14.t34, i2.u18...354
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,8.13665,218788,1,0,532347,8734,1310,447392,797,107721,765797
FORMULA MedleyA-PT-03-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Graph (complete) has 186 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 106 transition count 76
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 83 transition count 76
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 47 place count 83 transition count 69
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 61 place count 76 transition count 69
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 68 place count 69 transition count 62
Iterating global reduction 2 with 7 rules applied. Total rules applied 75 place count 69 transition count 62
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 75 place count 69 transition count 61
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 77 place count 68 transition count 61
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 103 place count 55 transition count 48
Applied a total of 103 rules in 20 ms. Remains 55 /108 variables (removed 53) and now considering 48/100 (removed 52) transitions.
// Phase 1: matrix 48 rows 55 cols
[2025-06-02 05:37:49] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:37:50] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-02 05:37:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:37:50] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:37:50] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2025-06-02 05:37: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/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 48/103 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:51] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 0/103 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 64 constraints, problems are : Problem set: 0 solved, 47 unsolved in 2105 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 48/103 variables, 55/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 47/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/103 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 111 constraints, problems are : Problem set: 0 solved, 47 unsolved in 5266 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7384ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 7384ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/108 places, 48/100 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7606 ms. Remains : 55/108 places, 48/100 transitions.
[2025-06-02 05:37:57] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:37:57] [INFO ] Flatten gal took : 10 ms
[2025-06-02 05:37:57] [INFO ] Input system was already deterministic with 48 transitions.
[2025-06-02 05:37:57] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:37:57] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:37:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality7181363483285432674.gal : 1 ms
[2025-06-02 05:37:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality10802975880764982374.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/CTLCardinality7181363483285432674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10802975880764982374.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.27181e+06,0.024345,4340,2,715,5,3066,6,0,269,2190,0


Converting to forward existential form...Done !
original formula: EF(AG((AG((p96==0)) + (EF((p102==0)) * (p12==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !((p96==0)))) + (E(TRUE U (p102==0)) * (p12==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t6, t8, t10, t12, t36, t40, t41, Intersection with reachable at each step enable...205
(forward)formula 0,1,0.971448,29168,1,0,206,156611,120,100,1709,143542,223
FORMULA MedleyA-PT-03-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 100
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 96 transition count 89
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 96 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 95 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 95 transition count 88
Applied a total of 25 rules in 6 ms. Remains 95 /108 variables (removed 13) and now considering 88/100 (removed 12) transitions.
// Phase 1: matrix 88 rows 95 cols
[2025-06-02 05:37:58] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:37:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-02 05:37:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:37:58] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2025-06-02 05:37:58] [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, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:59] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:59] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:00] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:00] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 88/183 variables, 95/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:01] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 108 constraints, problems are : Problem set: 0 solved, 87 unsolved in 6757 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/183 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 87/195 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:07] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:07] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:07] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:10] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:10] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:10] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:13] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:13] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:13] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:13] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:14] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:22] [INFO ] Deduced a trap along path composed of 8 places in 48 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:32] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/183 variables, and 208 constraints, problems are : Problem set: 0 solved, 87 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36785ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 36785ms
Starting structural reductions in LTL mode, iteration 1 : 95/108 places, 88/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37029 ms. Remains : 95/108 places, 88/100 transitions.
[2025-06-02 05:38:35] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:38:35] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:38:35] [INFO ] Input system was already deterministic with 88 transitions.
[2025-06-02 05:38:35] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:38:35] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:38:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality4955428256960834650.gal : 2 ms
[2025-06-02 05:38:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality14243337768285744972.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/CTLCardinality4955428256960834650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14243337768285744972.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.32751e+08,0.523662,18328,2,4556,5,41666,6,0,470,94797,0


Converting to forward existential form...Done !
original formula: (EF(((AG(((p23==0)&&(p80==1))) * !(A((p69==1) U (p92==1)))) * AX((p47==0)))) * AF(((p78==0) * AX(FALSE))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((!(E(TRUE U !(((p23==0)&&(p80==1))))) * !(!((E(!((p92==1)) U (!((p69==1)) * !((p92==1)))) ...266
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t11, t14, t17, t19, t21, t26, t28, t34, t36, t37, t41, t43, t50, t53, t54, t74, Inte...248
dead was empty
Detected timeout of ITS tools.
[2025-06-02 05:39:05] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:39:05] [INFO ] Applying decomposition
[2025-06-02 05:39:05] [INFO ] Flatten gal took : 4 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/graph17784619055360062863.txt' '-o' '/tmp/graph17784619055360062863.bin' '-w' '/tmp/graph17784619055360062863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17784619055360062863.bin' '-l' '-1' '-v' '-w' '/tmp/graph17784619055360062863.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:39:05] [INFO ] Decomposing Gal with order
[2025-06-02 05:39:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:39:05] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-02 05:39:05] [INFO ] Flatten gal took : 9 ms
[2025-06-02 05:39:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 05:39:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality14476235548245072314.gal : 2 ms
[2025-06-02 05:39:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality15959486113892239232.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/CTLCardinality14476235548245072314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15959486113892239232.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.32751e+08,0.163627,9552,1716,165,12481,2904,201,10883,117,11649,0


Converting to forward existential form...Done !
original formula: (EF(((AG(((i5.u12.p23==0)&&(u32.p80==1))) * !(A((i11.u27.p69==1) U (u32.p92==1)))) * AX((i7.u16.p47==0)))) * AF(((i3.u31.p78==0) * AX(FAL...161
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((!(E(TRUE U !(((i5.u12.p23==0)&&(u32.p80==1))))) * !(!((E(!((u32.p92==1)) U (!((i11.u27.p6...311
Reverse transition relation is NOT exact ! Due to transitions u32.t74, u30.t6, i1.u2.t54, i3.u26.t11, i3.u31.t4, i4.u22.t26, i4.u24.t19, i5.t50, i5.u9.t53,...357
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
dead was empty
(forward)formula 0,1,10.4316,313528,1,0,730016,12587,1304,715630,795,109154,1120620
FORMULA MedleyA-PT-03-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 99 transition count 92
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 99 transition count 92
Applied a total of 17 rules in 3 ms. Remains 99 /108 variables (removed 9) and now considering 92/100 (removed 8) transitions.
// Phase 1: matrix 92 rows 99 cols
[2025-06-02 05:39:16] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:39:16] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-06-02 05:39:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:39:16] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2025-06-02 05:39:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:17] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:17] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:17] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:17] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:18] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:18] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:18] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:18] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/115 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:19] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 116 constraints, problems are : Problem set: 0 solved, 91 unsolved in 5044 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:22] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:22] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/191 variables, 99/118 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 91/209 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:24] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:24] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:24] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:24] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:24] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 5/214 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:27] [INFO ] Deduced a trap composed of 17 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 05:39:28] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:28] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:28] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:29] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 5/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:30] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:30] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:33] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:36] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:36] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:36] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:40] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:40] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:40] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:41] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:41] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:41] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:41] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 191/191 variables, and 232 constraints, problems are : Problem set: 0 solved, 91 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35062ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 35063ms
Starting structural reductions in LTL mode, iteration 1 : 99/108 places, 92/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35324 ms. Remains : 99/108 places, 92/100 transitions.
[2025-06-02 05:39:51] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:39:51] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:39:51] [INFO ] Input system was already deterministic with 92 transitions.
[2025-06-02 05:39:51] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:39:51] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:39:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality1935211043044801986.gal : 2 ms
[2025-06-02 05:39:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality6995971505095836283.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/CTLCardinality1935211043044801986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6995971505095836283.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.32992e+08,0.553579,19256,2,3062,5,42775,6,0,490,101851,0


Converting to forward existential form...Done !
original formula: (A(EG((AX(AX((p98==1))) * ((p27==0)||(p86==1)))) U AF((((E((p19==1) U ((p40==0)||(p45==1))) + AF((p67==1))) + AG(((p77==0)||(p30==1)))) *...284
=> equivalent forward existential formula: (([FwdG((FwdU(Init,!(!(EG(!((((E((p19==1) U ((p40==0)||(p45==1))) + !(EG(!((p67==1))))) + !(E(TRUE U !(((p77==0)...699
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t12, t14, t15, t20, t22, t23, t28, t30, t31, t35, t37, t42, t45, t48, t50, t53, t54, ...268
Detected timeout of ITS tools.
[2025-06-02 05:40:21] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:40:21] [INFO ] Applying decomposition
[2025-06-02 05:40:21] [INFO ] Flatten gal took : 3 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/graph4359259812138415915.txt' '-o' '/tmp/graph4359259812138415915.bin' '-w' '/tmp/graph4359259812138415915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4359259812138415915.bin' '-l' '-1' '-v' '-w' '/tmp/graph4359259812138415915.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:40:21] [INFO ] Decomposing Gal with order
[2025-06-02 05:40:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:40:21] [INFO ] Flatten gal took : 12 ms
[2025-06-02 05:40:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-02 05:40:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality4631601468748108975.gal : 5 ms
[2025-06-02 05:40:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality14338163974140697140.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/CTLCardinality4631601468748108975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14338163974140697140.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.32992e+08,0.288599,9472,395,202,8714,4614,245,9736,122,19624,0


Converting to forward existential form...Done !
original formula: (A(EG((AX(AX((u33.p98==1))) * ((i2.u12.p27==0)||(u33.p86==1)))) U AF((((E((i2.u9.p19==1) U ((i4.u18.p40==0)||(i4.u18.p45==1))) + AF((i8.i...420
=> equivalent forward existential formula: (([FwdG((FwdU(Init,!(!(EG(!((((E((i2.u9.p19==1) U ((i4.u18.p40==0)||(i4.u18.p45==1))) + !(EG(!((i8.i1.u26.p67==1...943
Reverse transition relation is NOT exact ! Due to transitions u33.t77, i0.u2.t57, i1.u15.t42, i1.u19.t35, i2.t53, i2.t50, i2.u9.t56, i2.u11.t54, i3.t45, i3...417
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,11.8725,322176,1,0,713632,11671,1524,635949,808,125628,698862
FORMULA MedleyA-PT-03-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 98 transition count 90
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 98 transition count 90
Applied a total of 20 rules in 2 ms. Remains 98 /108 variables (removed 10) and now considering 90/100 (removed 10) transitions.
// Phase 1: matrix 90 rows 98 cols
[2025-06-02 05:40:33] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:40:33] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-02 05:40:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:40:34] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2025-06-02 05:40: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/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:35] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:35] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:35] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:35] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:35] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:35] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 90/188 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 113 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4094 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 90/188 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 89/202 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:39] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:39] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:39] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:39] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:39] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:41] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:43] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:43] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:47] [INFO ] Deduced a trap along path composed of 7 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:51] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:00] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/188 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/188 variables, and 213 constraints, problems are : Problem set: 0 solved, 89 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34117ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 34118ms
Starting structural reductions in LTL mode, iteration 1 : 98/108 places, 90/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34330 ms. Remains : 98/108 places, 90/100 transitions.
[2025-06-02 05:41:08] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:41:08] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:41:08] [INFO ] Input system was already deterministic with 90 transitions.
[2025-06-02 05:41:08] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:41:08] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:41:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality14802290510066066525.gal : 1 ms
[2025-06-02 05:41:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality17376105267992159130.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/CTLCardinality14802290510066066525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17376105267992159130.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19424e+08,0.13909,6452,2,2201,5,12044,6,0,481,11031,0


Converting to forward existential form...Done !
original formula: AF(((EX(AX(EX((p36==0)))) * (p95==1)) * ((AF((p89==1)) + EG(!(E((p82==0) U ((p33==0)||(p84==1)))))) * ((!(E(((p37==0)||(p80==1)) U ((p27=...247
=> equivalent forward existential formula: [FwdG(Init,!(((EX(!(EX(!(EX((p36==0)))))) * (p95==1)) * ((!(EG(!((p89==1)))) + EG(!(E((p82==0) U ((p33==0)||(p84...310
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t12, t14, t15, t19, t21, t26, t28, t33, t35, t41, t44, t45, t47, t49, t51, t52, t55, ...253
Detected timeout of ITS tools.
[2025-06-02 05:41:38] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:41:38] [INFO ] Applying decomposition
[2025-06-02 05:41:38] [INFO ] Flatten gal took : 4 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/graph2866399575244158416.txt' '-o' '/tmp/graph2866399575244158416.bin' '-w' '/tmp/graph2866399575244158416.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2866399575244158416.bin' '-l' '-1' '-v' '-w' '/tmp/graph2866399575244158416.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:41:38] [INFO ] Decomposing Gal with order
[2025-06-02 05:41:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:41:38] [INFO ] Flatten gal took : 10 ms
[2025-06-02 05:41:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-02 05:41:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality10772519665394587163.gal : 4 ms
[2025-06-02 05:41:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality14978819183669629105.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/CTLCardinality10772519665394587163.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14978819183669629105.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.19424e+08,0.150961,6904,528,168,5189,3033,255,4786,121,10236,0


Converting to forward existential form...Done !
original formula: AF(((EX(AX(EX((i3.i0.u14.p36==0)))) * (u33.p95==1)) * ((AF((u33.p89==1)) + EG(!(E((u32.p82==0) U ((i4.u16.p33==0)||(u32.p84==1)))))) * ((...353
=> equivalent forward existential formula: [FwdG(Init,!(((EX(!(EX(!(EX((i3.i0.u14.p36==0)))))) * (u33.p95==1)) * ((!(EG(!((u33.p89==1)))) + EG(!(E((u32.p82...416
Reverse transition relation is NOT exact ! Due to transitions u32.t6, i0.u2.t55, i2.i0.t52, i2.i0.u12.t49, i2.i1.u9.t51, i3.i0.t41, i3.i0.u14.t45, i3.i1.u1...398
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,4.20447,150008,1,0,386024,8526,1860,311885,834,73329,472542
FORMULA MedleyA-PT-03-CTLCardinality-2025-10 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 : 108/108 places, 100/100 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 100
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 96 transition count 89
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 96 transition count 89
Applied a total of 23 rules in 2 ms. Remains 96 /108 variables (removed 12) and now considering 89/100 (removed 11) transitions.
// Phase 1: matrix 89 rows 96 cols
[2025-06-02 05:41:42] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:41:42] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-02 05:41:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:41:42] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2025-06-02 05:41:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:43] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:43] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:43] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:43] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:43] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:44] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 89/185 variables, 96/110 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:45] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:46] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:46] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:48] [INFO ] Deduced a trap along path composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/185 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:49] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:50] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:50] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:50] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:50] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:50] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:52] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 4 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/185 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:53] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 9 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/185 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:53] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:53] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 16 (OVERLAPS) 0/185 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 124 constraints, problems are : Problem set: 0 solved, 88 unsolved in 14724 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:57] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:58] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 89/185 variables, 96/125 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 88/213 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:59] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:00] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:00] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:00] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:00] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:02] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:03] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:03] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:03] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:03] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 5/223 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:07] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:07] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:12] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/185 variables, and 227 constraints, problems are : Problem set: 0 solved, 88 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44750ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 44752ms
Starting structural reductions in LTL mode, iteration 1 : 96/108 places, 89/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44944 ms. Remains : 96/108 places, 89/100 transitions.
[2025-06-02 05:42:27] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:42:27] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:42:27] [INFO ] Input system was already deterministic with 89 transitions.
[2025-06-02 05:42:27] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:42:27] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:42:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality1029695505402116132.gal : 1 ms
[2025-06-02 05:42:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality17697248581417775251.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/CTLCardinality1029695505402116132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17697248581417775251.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.34201e+08,0.454346,17568,2,5294,5,39549,6,0,475,88239,0


Converting to forward existential form...Done !
original formula: EG(((AF((p32==1)) * ((EF((p86==0)) + AF((p43==1))) + ((p18==1) + !(A(((p11==0)||(p16==1)) U ((p48==0)||(p3==1))))))) * (AF(AG(((p49!=0)&&...224
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!((p32==1)))) * ((E(TRUE U (p86==0)) + !(EG(!((p43==1))))) + ((p18==1) + !(!((E(!(((p48==0)||(...382
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t10, t12, t14, t19, t21, t26, t29, t32, t34, t37, t40, t42, t44, t48, t50, t54, t74, ...258
Detected timeout of ITS tools.
[2025-06-02 05:42:57] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:42:57] [INFO ] Applying decomposition
[2025-06-02 05:42:57] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8097835177639536883.txt' '-o' '/tmp/graph8097835177639536883.bin' '-w' '/tmp/graph8097835177639536883.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8097835177639536883.bin' '-l' '-1' '-v' '-w' '/tmp/graph8097835177639536883.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:42:57] [INFO ] Decomposing Gal with order
[2025-06-02 05:42:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:42:57] [INFO ] Flatten gal took : 10 ms
[2025-06-02 05:42:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 05:42:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality18442739169615636756.gal : 2 ms
[2025-06-02 05:42:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality8588482953150174149.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/CTLCardinality18442739169615636756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8588482953150174149.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.34201e+08,0.13835,6468,435,190,3751,2923,210,4363,129,9802,0


Converting to forward existential form...Done !
original formula: EG(((AF((i4.u10.p32==1)) * ((EF((u30.p86==0)) + AF((i5.u16.p43==1))) + ((i3.u9.p18==1) + !(A(((i9.u4.p11==0)||(i2.u7.p16==1)) U ((i6.u17....311
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!((i4.u10.p32==1)))) * ((E(TRUE U (u30.p86==0)) + !(EG(!((i5.u16.p43==1))))) + ((i3.u9.p18==1)...495
Reverse transition relation is NOT exact ! Due to transitions u30.t74, i0.u1.t54, i1.u26.t12, i1.u27.t4, i2.u11.t42, i2.u13.t34, i3.u8.t50, i3.u9.t48, i3.u...381
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
dead was empty
(forward)formula 0,0,4.97901,158020,1,0,389664,7217,1395,345648,852,67577,524710
FORMULA MedleyA-PT-03-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Graph (complete) has 186 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 106 transition count 76
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 83 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 82 transition count 75
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 49 place count 82 transition count 69
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 61 place count 76 transition count 69
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 68 place count 69 transition count 62
Iterating global reduction 3 with 7 rules applied. Total rules applied 75 place count 69 transition count 62
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 75 place count 69 transition count 61
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 77 place count 68 transition count 61
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 103 place count 55 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 54 transition count 47
Applied a total of 104 rules in 18 ms. Remains 54 /108 variables (removed 54) and now considering 47/100 (removed 53) transitions.
// Phase 1: matrix 47 rows 54 cols
[2025-06-02 05:43:02] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:43:02] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-02 05:43:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:43:02] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:43:02] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2025-06-02 05:43: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/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 47/100 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 62 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1650 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 47/100 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 108 constraints, problems are : Problem set: 0 solved, 46 unsolved in 3539 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5197ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 5197ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/108 places, 47/100 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5369 ms. Remains : 54/108 places, 47/100 transitions.
[2025-06-02 05:43:08] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:43:08] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:43:08] [INFO ] Input system was already deterministic with 47 transitions.
[2025-06-02 05:43:08] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:43:08] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:43:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality547327720870286616.gal : 0 ms
[2025-06-02 05:43:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality8938474858694032127.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/CTLCardinality547327720870286616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8938474858694032127.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.44179e+06,0.021337,4332,2,635,5,2803,6,0,265,2089,0


Converting to forward existential form...Done !
original formula: EG(EF((AF((p5==1)) + (p105==0))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (!(EG(!((p5==1)))) + (p105==0))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t6, t8, t10, t12, t14, t36, Intersection with reachable at each step enabled. (d...199
(forward)formula 0,1,2.20832,73116,1,0,1489,434778,125,679,1696,553504,1230
FORMULA MedleyA-PT-03-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-02 05:43:10] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:43:10] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:43:10] [INFO ] Applying decomposition
[2025-06-02 05:43:10] [INFO ] Flatten gal took : 4 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/graph4354883752664045783.txt' '-o' '/tmp/graph4354883752664045783.bin' '-w' '/tmp/graph4354883752664045783.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4354883752664045783.bin' '-l' '-1' '-v' '-w' '/tmp/graph4354883752664045783.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:43:10] [INFO ] Decomposing Gal with order
[2025-06-02 05:43:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:43:10] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:43:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 05:43:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality11332975419268161507.gal : 2 ms
[2025-06-02 05:43:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality6633365220460661308.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/CTLCardinality11332975419268161507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6633365220460661308.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.78827e+08,0.110623,7400,556,202,4827,4406,241,6799,123,11088,0


Converting to forward existential form...Done !
original formula: AX(EG((((AX((i9.u38.p79==0)) + (i8.i0.u34.p70==1)) + ((i5.i0.u20.p43==0)||(i6.u26.p53==1))) + (((i1.i2.u30.p61==0)&&(i7.u27.p65==1))||((u...190
=> equivalent forward existential formula: [(EY(Init) * !(EG((((!(EX(!((i9.u38.p79==0)))) + (i8.i0.u34.p70==1)) + ((i5.i0.u20.p43==0)||(i6.u26.p53==1))) + ...243
Reverse transition relation is NOT exact ! Due to transitions t5, u40.t9, i0.i0.u1.t65, i1.i1.t32, i1.i1.u25.t36, i1.i2.t23, i1.i2.u30.t27, i2.t61, i2.t58,...481
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,1,8.93226,232040,1,0,442312,8960,1262,528503,776,71004,526340
FORMULA MedleyA-PT-03-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 697612 ms.

BK_STOP 1748842999399

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

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