Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064500649.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 DiscoveryGPU-PT-08b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064500649
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 61K 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 DiscoveryGPU-PT-08b-CTLCardinality-2023-12
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-2023-13
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-2023-14
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-2023-15
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-2025-00
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-2025-01
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-2025-02
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-2025-03
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-2025-04
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-2025-05
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-2025-06
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-2025-07
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-2025-08
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-2025-09
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-2025-10
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748917978127

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-03 02:33:00] [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-03 02:33:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 02:33:01] [INFO ] Load time of PNML (sax parser for PT used): 277 ms
[2025-06-03 02:33:01] [INFO ] Transformed 240 places.
[2025-06-03 02:33:01] [INFO ] Transformed 254 transitions.
[2025-06-03 02:33:01] [INFO ] Found NUPN structural information;
[2025-06-03 02:33:01] [INFO ] Parsed PT model containing 240 places and 254 transitions and 661 arcs in 491 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 92 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 254/254 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 227 transition count 254
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 32 place count 208 transition count 235
Iterating global reduction 1 with 19 rules applied. Total rules applied 51 place count 208 transition count 235
Applied a total of 51 rules in 57 ms. Remains 208 /240 variables (removed 32) and now considering 235/254 (removed 19) transitions.
// Phase 1: matrix 235 rows 208 cols
[2025-06-03 02:33:01] [INFO ] Computed 2 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:33:01] [INFO ] Implicit Places using invariants in 507 ms returned []
[2025-06-03 02:33:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:33:02] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2025-06-03 02:33:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 235/440 variables, 205/207 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:13] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:13] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:13] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:13] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:13] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:14] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:14] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:14] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:14] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:14] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:14] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:15] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:15] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:15] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:15] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:15] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:15] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 17/224 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:19] [INFO ] Deduced a trap composed of 107 places in 169 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:19] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 3/443 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/443 variables, and 229 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (OVERLAPS) 235/440 variables, 205/226 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 231/457 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:33:39] [INFO ] Deduced a trap composed of 135 places in 103 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 3/443 variables, 3/461 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/443 variables, and 464 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60341ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 60376ms
Starting structural reductions in LTL mode, iteration 1 : 208/240 places, 235/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61587 ms. Remains : 208/240 places, 235/254 transitions.
Support contains 92 out of 208 places after structural reductions.
[2025-06-03 02:34:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-03 02:34:03] [INFO ] Flatten gal took : 127 ms
[2025-06-03 02:34:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 02:34:03] [INFO ] Flatten gal took : 63 ms
[2025-06-03 02:34:03] [INFO ] Input system was already deterministic with 235 transitions.
Support contains 74 out of 208 places (down from 92) after GAL structural reductions.
RANDOM walk for 40000 steps (154 resets) in 2361 ms. (16 steps per ms) remains 5/47 properties
BEST_FIRST walk for 40004 steps (30 resets) in 613 ms. (65 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (30 resets) in 291 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (31 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (23 resets) in 106 ms. (373 steps per ms) remains 3/4 properties
[2025-06-03 02:34:04] [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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 102/127 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 263/390 variables, 135/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 49/439 variables, 44/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/443 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/443 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 210 constraints, problems are : Problem set: 0 solved, 3 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 102/127 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 263/390 variables, 135/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:05] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 7 ms to minimize.
Problem AtomicPropp29 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 1/166 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:05] [INFO ] Deduced a trap along path composed of 4 places in 52 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:05] [INFO ] Deduced a trap along path composed of 7 places in 101 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 2/168 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 49/439 variables, 44/212 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 14 (OVERLAPS) 4/443 variables, 4/216 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/443 variables, 0/216 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/443 variables, 0/216 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 216 constraints, problems are : Problem set: 2 solved, 1 unsolved in 834 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1145ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 71 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 9 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 02:34:06] [INFO ] Flatten gal took : 31 ms
[2025-06-03 02:34:06] [INFO ] Flatten gal took : 32 ms
[2025-06-03 02:34:06] [INFO ] Input system was already deterministic with 235 transitions.
Computed a total of 34 stabilizing places and 34 stable transitions
Graph (complete) has 387 edges and 208 vertex of which 199 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.9 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 208/208 places, 235/235 transitions.
Graph (complete) has 387 edges and 208 vertex of which 199 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 198 transition count 186
Reduce places removed 42 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 156 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 154 transition count 184
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 89 place count 154 transition count 169
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 119 place count 139 transition count 169
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 130 place count 128 transition count 158
Iterating global reduction 3 with 11 rules applied. Total rules applied 141 place count 128 transition count 158
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 141 place count 128 transition count 156
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 145 place count 126 transition count 156
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 151 place count 120 transition count 150
Iterating global reduction 3 with 6 rules applied. Total rules applied 157 place count 120 transition count 150
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 163 place count 114 transition count 143
Iterating global reduction 3 with 6 rules applied. Total rules applied 169 place count 114 transition count 143
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 175 place count 108 transition count 132
Iterating global reduction 3 with 6 rules applied. Total rules applied 181 place count 108 transition count 132
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 186 place count 103 transition count 127
Iterating global reduction 3 with 5 rules applied. Total rules applied 191 place count 103 transition count 127
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 229 place count 84 transition count 108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 230 place count 83 transition count 107
Iterating global reduction 3 with 1 rules applied. Total rules applied 231 place count 83 transition count 107
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 232 place count 82 transition count 105
Iterating global reduction 3 with 1 rules applied. Total rules applied 233 place count 82 transition count 105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 234 place count 81 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 235 place count 81 transition count 104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 237 place count 79 transition count 102
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 93 edges and 77 vertex of which 73 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 77 edges and 73 vertex of which 28 / 73 are part of one of the 14 SCC in 4 ms
Free SCC test removed 14 places
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 3 with 28 rules applied. Total rules applied 265 place count 59 transition count 73
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 303 place count 35 transition count 59
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 309 place count 29 transition count 47
Iterating global reduction 5 with 6 rules applied. Total rules applied 315 place count 29 transition count 47
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 321 place count 23 transition count 35
Iterating global reduction 5 with 6 rules applied. Total rules applied 327 place count 23 transition count 35
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 332 place count 18 transition count 25
Iterating global reduction 5 with 5 rules applied. Total rules applied 337 place count 18 transition count 25
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 342 place count 13 transition count 20
Iterating global reduction 5 with 5 rules applied. Total rules applied 347 place count 13 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 348 place count 13 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 350 place count 12 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 353 place count 9 transition count 15
Applied a total of 353 rules in 174 ms. Remains 9 /208 variables (removed 199) and now considering 15/235 (removed 220) transitions.
[2025-06-03 02:34:06] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 9 cols
[2025-06-03 02:34:06] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:34:06] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-03 02:34:06] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2025-06-03 02:34:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:34:06] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:34:06] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2025-06-03 02:34:06] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2025-06-03 02:34:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 3/21 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/22 variables, and 9 constraints, problems are : Problem set: 0 solved, 10 unsolved in 210 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 3/21 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/22 variables, and 19 constraints, problems are : Problem set: 0 solved, 10 unsolved in 222 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 441ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 441ms
Starting structural reductions in SI_CTL mode, iteration 1 : 9/208 places, 15/235 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 692 ms. Remains : 9/208 places, 15/235 transitions.
[2025-06-03 02:34:06] [INFO ] Flatten gal took : 1 ms
[2025-06-03 02:34:06] [INFO ] Flatten gal took : 1 ms
[2025-06-03 02:34:06] [INFO ] Input system was already deterministic with 15 transitions.
RANDOM walk for 45 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 02:34:06] [INFO ] Flatten gal took : 2 ms
[2025-06-03 02:34:06] [INFO ] Flatten gal took : 1 ms
[2025-06-03 02:34:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1634282151051193448.gal : 1 ms
[2025-06-03 02:34:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16903737953675392658.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1634282151051193448.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16903737953675392658.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 208/208 places, 235/235 transitions.
Graph (complete) has 387 edges and 208 vertex of which 200 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 199 transition count 189
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 159 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 158 transition count 188
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 83 place count 158 transition count 173
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 113 place count 143 transition count 173
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 124 place count 132 transition count 162
Iterating global reduction 3 with 11 rules applied. Total rules applied 135 place count 132 transition count 162
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 135 place count 132 transition count 160
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 139 place count 130 transition count 160
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 144 place count 125 transition count 155
Iterating global reduction 3 with 5 rules applied. Total rules applied 149 place count 125 transition count 155
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 154 place count 120 transition count 150
Iterating global reduction 3 with 5 rules applied. Total rules applied 159 place count 120 transition count 150
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 164 place count 115 transition count 140
Iterating global reduction 3 with 5 rules applied. Total rules applied 169 place count 115 transition count 140
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 173 place count 111 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 177 place count 111 transition count 136
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 211 place count 94 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 212 place count 93 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 213 place count 93 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 214 place count 92 transition count 116
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 92 transition count 116
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 216 place count 91 transition count 115
Iterating global reduction 3 with 1 rules applied. Total rules applied 217 place count 91 transition count 115
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 219 place count 91 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 221 place count 89 transition count 113
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 105 edges and 87 vertex of which 83 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 79 edges and 83 vertex of which 28 / 83 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
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 3 with 27 rules applied. Total rules applied 248 place count 69 transition count 85
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 38 rules applied. Total rules applied 286 place count 46 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 287 place count 45 transition count 70
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 291 place count 41 transition count 62
Iterating global reduction 6 with 4 rules applied. Total rules applied 295 place count 41 transition count 62
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 298 place count 38 transition count 56
Iterating global reduction 6 with 3 rules applied. Total rules applied 301 place count 38 transition count 56
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 303 place count 36 transition count 52
Iterating global reduction 6 with 2 rules applied. Total rules applied 305 place count 36 transition count 52
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 307 place count 34 transition count 50
Iterating global reduction 6 with 2 rules applied. Total rules applied 309 place count 34 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 311 place count 33 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 312 place count 33 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 314 place count 32 transition count 47
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 317 place count 29 transition count 44
Applied a total of 317 rules in 74 ms. Remains 29 /208 variables (removed 179) and now considering 44/235 (removed 191) transitions.
[2025-06-03 02:34:07] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 29 cols
[2025-06-03 02:34:07] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:34:07] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-03 02:34:07] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
[2025-06-03 02:34:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:34:07] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:34:07] [INFO ] Redundant transitions in 1 ms returned []
Running 36 sub problems to find dead transitions.
[2025-06-03 02:34:07] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
[2025-06-03 02:34:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 36/60 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 5/65 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 0/65 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/66 variables, and 29 constraints, problems are : Problem set: 0 solved, 36 unsolved in 898 ms.
Refiners :[State Equation: 29/29 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 36/60 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 36/60 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 5/65 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/66 variables, and 65 constraints, problems are : Problem set: 0 solved, 36 unsolved in 846 ms.
Refiners :[State Equation: 29/29 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1749ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1750ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/208 places, 44/235 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1902 ms. Remains : 29/208 places, 44/235 transitions.
[2025-06-03 02:34:08] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:34:08] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:34:08] [INFO ] Input system was already deterministic with 44 transitions.
[2025-06-03 02:34:08] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:34:08] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:34:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality81288742937249021.gal : 1 ms
[2025-06-03 02:34:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality3613950795712780241.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality81288742937249021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3613950795712780241.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 -...281
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,103824,0.03017,3656,2,99,5,627,6,0,141,529,0


Converting to forward existential form...Done !
original formula: EG(((p37==0) * AF(((AF((((p151==0)||(p47==1))||((p221==0)||(p222==1)))) + EF((p26==0))) + EF(((p35==0)||(p99==1)))))))
=> equivalent forward existential formula: [FwdG(Init,((p37==0) * !(EG(!(((!(EG(!((((p151==0)||(p47==1))||((p221==0)||(p222==1)))))) + E(TRUE U (p26==0))) ...203
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t14, t20, t21, t22, t36, t37, t38, t39, t42, Intersection with reachable at each ste...213
(forward)formula 0,1,0.150403,6472,1,0,160,15015,120,120,799,22003,203
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 208/208 places, 235/235 transitions.
Graph (complete) has 387 edges and 208 vertex of which 199 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 198 transition count 188
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 158 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 157 transition count 187
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 83 place count 157 transition count 172
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 113 place count 142 transition count 172
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 124 place count 131 transition count 161
Iterating global reduction 3 with 11 rules applied. Total rules applied 135 place count 131 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 135 place count 131 transition count 160
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 130 transition count 160
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 143 place count 124 transition count 154
Iterating global reduction 3 with 6 rules applied. Total rules applied 149 place count 124 transition count 154
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 155 place count 118 transition count 147
Iterating global reduction 3 with 6 rules applied. Total rules applied 161 place count 118 transition count 147
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 166 place count 113 transition count 138
Iterating global reduction 3 with 5 rules applied. Total rules applied 171 place count 113 transition count 138
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 175 place count 109 transition count 134
Iterating global reduction 3 with 4 rules applied. Total rules applied 179 place count 109 transition count 134
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 217 place count 90 transition count 115
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 218 place count 89 transition count 114
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 89 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 220 place count 88 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 88 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 222 place count 87 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 223 place count 87 transition count 111
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 224 place count 87 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 226 place count 85 transition count 109
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 9 rules applied. Total rules applied 235 place count 84 transition count 101
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 243 place count 76 transition count 101
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 243 place count 76 transition count 100
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 245 place count 75 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 247 place count 74 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 249 place count 74 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 251 place count 73 transition count 96
Applied a total of 251 rules in 99 ms. Remains 73 /208 variables (removed 135) and now considering 96/235 (removed 139) transitions.
// Phase 1: matrix 96 rows 73 cols
[2025-06-03 02:34:09] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:34:09] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-03 02:34:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:34:09] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:34:09] [INFO ] Redundant transitions in 3 ms returned []
Running 88 sub problems to find dead transitions.
[2025-06-03 02:34:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 96/161 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 8/169 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 0/169 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 74 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3985 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 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/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 96/161 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 88/154 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 8/169 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 162 constraints, problems are : Problem set: 0 solved, 88 unsolved in 4847 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8854ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 8855ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/208 places, 96/235 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9224 ms. Remains : 73/208 places, 96/235 transitions.
[2025-06-03 02:34:18] [INFO ] Flatten gal took : 10 ms
[2025-06-03 02:34:18] [INFO ] Flatten gal took : 10 ms
[2025-06-03 02:34:18] [INFO ] Input system was already deterministic with 96 transitions.
[2025-06-03 02:34:18] [INFO ] Flatten gal took : 10 ms
[2025-06-03 02:34:18] [INFO ] Flatten gal took : 9 ms
[2025-06-03 02:34:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality5689381726869418261.gal : 4 ms
[2025-06-03 02:34:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality11857909103434792592.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/CTLCardinality5689381726869418261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11857909103434792592.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.72081e+08,0.412453,11496,2,2854,5,42653,6,0,376,35535,0


Converting to forward existential form...Done !
original formula: AG(!(E(((p88==0)||(p48==1)) U (A(((p44==0)||(p226==1)) U (p48==1)) + AG((p186==0))))))
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),((p88==0)||(p48==1))) * !(EG(!((p48==1))))) * !(E(!((p48==1)) U (!(((p44==0)||(p226==1)...270
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t13, t18, t23, t29, t34, t41, t50, t87, t88, t89, t90, t91, t92, t93, t94, t95, Inte...248
Hit Full ! (commute/partial/dont) 92/0/4
(forward)formula 0,0,2.60009,59868,1,0,199,321522,221,94,2284,284972,209
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 235/235 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 205 transition count 235
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 29 place count 179 transition count 209
Iterating global reduction 1 with 26 rules applied. Total rules applied 55 place count 179 transition count 209
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 62 place count 172 transition count 202
Iterating global reduction 1 with 7 rules applied. Total rules applied 69 place count 172 transition count 202
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 74 place count 167 transition count 197
Iterating global reduction 1 with 5 rules applied. Total rules applied 79 place count 167 transition count 197
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 84 place count 162 transition count 190
Iterating global reduction 1 with 5 rules applied. Total rules applied 89 place count 162 transition count 190
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 94 place count 157 transition count 182
Iterating global reduction 1 with 5 rules applied. Total rules applied 99 place count 157 transition count 182
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 103 place count 153 transition count 178
Iterating global reduction 1 with 4 rules applied. Total rules applied 107 place count 153 transition count 178
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 151 transition count 176
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 151 transition count 176
Applied a total of 111 rules in 34 ms. Remains 151 /208 variables (removed 57) and now considering 176/235 (removed 59) transitions.
// Phase 1: matrix 176 rows 151 cols
[2025-06-03 02:34:21] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:34:21] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-03 02:34:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:34:21] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2025-06-03 02:34:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 176/327 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:27] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:28] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:28] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:28] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:28] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:28] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:28] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:28] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:34:29] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 9/162 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 0/327 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 162 constraints, problems are : Problem set: 0 solved, 175 unsolved in 14736 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/327 variables, 151/162 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 175/337 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/327 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 337 constraints, problems are : Problem set: 0 solved, 175 unsolved in 12986 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27773ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 27776ms
Starting structural reductions in LTL mode, iteration 1 : 151/208 places, 176/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28087 ms. Remains : 151/208 places, 176/235 transitions.
[2025-06-03 02:34:49] [INFO ] Flatten gal took : 17 ms
[2025-06-03 02:34:49] [INFO ] Flatten gal took : 17 ms
[2025-06-03 02:34:49] [INFO ] Input system was already deterministic with 176 transitions.
[2025-06-03 02:34:49] [INFO ] Flatten gal took : 16 ms
[2025-06-03 02:34:49] [INFO ] Flatten gal took : 15 ms
[2025-06-03 02:34:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality9210223294050425346.gal : 6 ms
[2025-06-03 02:34:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality7726601733571704000.ctl : 11 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/CTLCardinality9210223294050425346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7726601733571704000.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 02:35:19] [INFO ] Flatten gal took : 9 ms
[2025-06-03 02:35:19] [INFO ] Applying decomposition
[2025-06-03 02:35:19] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11464165179082579328.txt' '-o' '/tmp/graph11464165179082579328.bin' '-w' '/tmp/graph11464165179082579328.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11464165179082579328.bin' '-l' '-1' '-v' '-w' '/tmp/graph11464165179082579328.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:35:19] [INFO ] Decomposing Gal with order
[2025-06-03 02:35:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:35:19] [INFO ] Removed a total of 65 redundant transitions.
[2025-06-03 02:35:19] [INFO ] Flatten gal took : 70 ms
[2025-06-03 02:35:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 9 ms.
[2025-06-03 02:35:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality12710362410512386929.gal : 6 ms
[2025-06-03 02:35:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality15219484914152220481.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/CTLCardinality12710362410512386929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15219484914152220481.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 235/235 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 205 transition count 235
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 29 place count 179 transition count 209
Iterating global reduction 1 with 26 rules applied. Total rules applied 55 place count 179 transition count 209
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 171 transition count 201
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 171 transition count 201
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 76 place count 166 transition count 196
Iterating global reduction 1 with 5 rules applied. Total rules applied 81 place count 166 transition count 196
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 86 place count 161 transition count 189
Iterating global reduction 1 with 5 rules applied. Total rules applied 91 place count 161 transition count 189
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 96 place count 156 transition count 181
Iterating global reduction 1 with 5 rules applied. Total rules applied 101 place count 156 transition count 181
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 105 place count 152 transition count 177
Iterating global reduction 1 with 4 rules applied. Total rules applied 109 place count 152 transition count 177
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 150 transition count 175
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 150 transition count 175
Applied a total of 113 rules in 19 ms. Remains 150 /208 variables (removed 58) and now considering 175/235 (removed 60) transitions.
// Phase 1: matrix 175 rows 150 cols
[2025-06-03 02:35:49] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:35:49] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-03 02:35:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:35:50] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2025-06-03 02:35: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/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 175/325 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:55] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:55] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:56] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:56] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:56] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:56] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:56] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:35:56] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 8/160 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 0/325 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 160 constraints, problems are : Problem set: 0 solved, 174 unsolved in 15269 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/325 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 174/334 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 334 constraints, problems are : Problem set: 0 solved, 174 unsolved in 14591 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29928ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 29933ms
Starting structural reductions in LTL mode, iteration 1 : 150/208 places, 175/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30318 ms. Remains : 150/208 places, 175/235 transitions.
[2025-06-03 02:36:20] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:36:20] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:36:20] [INFO ] Input system was already deterministic with 175 transitions.
[2025-06-03 02:36:20] [INFO ] Flatten gal took : 9 ms
[2025-06-03 02:36:20] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:36:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality9851479661437232204.gal : 2 ms
[2025-06-03 02:36:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality1225795454983106488.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/CTLCardinality9851479661437232204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1225795454983106488.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 02:36:50] [INFO ] Flatten gal took : 10 ms
[2025-06-03 02:36:50] [INFO ] Applying decomposition
[2025-06-03 02:36:50] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11342716594795183909.txt' '-o' '/tmp/graph11342716594795183909.bin' '-w' '/tmp/graph11342716594795183909.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11342716594795183909.bin' '-l' '-1' '-v' '-w' '/tmp/graph11342716594795183909.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:36:50] [INFO ] Decomposing Gal with order
[2025-06-03 02:36:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:36:50] [INFO ] Removed a total of 66 redundant transitions.
[2025-06-03 02:36:50] [INFO ] Flatten gal took : 42 ms
[2025-06-03 02:36:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 6 ms.
[2025-06-03 02:36:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality7338063633324327568.gal : 5 ms
[2025-06-03 02:36:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality11835369150393969063.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/CTLCardinality7338063633324327568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11835369150393969063.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 208/208 places, 235/235 transitions.
Graph (complete) has 387 edges and 208 vertex of which 200 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 199 transition count 187
Reduce places removed 42 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 157 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 155 transition count 185
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 89 place count 155 transition count 169
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 121 place count 139 transition count 169
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 132 place count 128 transition count 158
Iterating global reduction 3 with 11 rules applied. Total rules applied 143 place count 128 transition count 158
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 143 place count 128 transition count 156
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 126 transition count 156
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 153 place count 120 transition count 150
Iterating global reduction 3 with 6 rules applied. Total rules applied 159 place count 120 transition count 150
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 165 place count 114 transition count 143
Iterating global reduction 3 with 6 rules applied. Total rules applied 171 place count 114 transition count 143
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 177 place count 108 transition count 132
Iterating global reduction 3 with 6 rules applied. Total rules applied 183 place count 108 transition count 132
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 188 place count 103 transition count 127
Iterating global reduction 3 with 5 rules applied. Total rules applied 193 place count 103 transition count 127
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 231 place count 84 transition count 108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 232 place count 83 transition count 107
Iterating global reduction 3 with 1 rules applied. Total rules applied 233 place count 83 transition count 107
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 234 place count 82 transition count 105
Iterating global reduction 3 with 1 rules applied. Total rules applied 235 place count 82 transition count 105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 236 place count 81 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 237 place count 81 transition count 104
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 238 place count 81 transition count 104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 240 place count 79 transition count 102
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 93 edges and 77 vertex of which 73 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 78 edges and 73 vertex of which 30 / 73 are part of one of the 15 SCC in 1 ms
Free SCC test removed 15 places
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 3 with 27 rules applied. Total rules applied 267 place count 58 transition count 74
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 305 place count 35 transition count 59
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 311 place count 29 transition count 47
Iterating global reduction 5 with 6 rules applied. Total rules applied 317 place count 29 transition count 47
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 322 place count 24 transition count 37
Iterating global reduction 5 with 5 rules applied. Total rules applied 327 place count 24 transition count 37
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 332 place count 19 transition count 27
Iterating global reduction 5 with 5 rules applied. Total rules applied 337 place count 19 transition count 27
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 342 place count 14 transition count 22
Iterating global reduction 5 with 5 rules applied. Total rules applied 347 place count 14 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 348 place count 14 transition count 21
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 349 place count 14 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 350 place count 13 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 353 place count 10 transition count 17
Applied a total of 353 rules in 47 ms. Remains 10 /208 variables (removed 198) and now considering 17/235 (removed 218) transitions.
[2025-06-03 02:37:20] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
// Phase 1: matrix 14 rows 10 cols
[2025-06-03 02:37:20] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:37:20] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-03 02:37:20] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
[2025-06-03 02:37:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:37:20] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:37:20] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-03 02:37:20] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
[2025-06-03 02:37:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 3/23 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/24 variables, and 10 constraints, problems are : Problem set: 0 solved, 11 unsolved in 226 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 3/23 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/24 variables, and 21 constraints, problems are : Problem set: 0 solved, 11 unsolved in 210 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 440ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 440ms
Starting structural reductions in SI_CTL mode, iteration 1 : 10/208 places, 17/235 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 577 ms. Remains : 10/208 places, 17/235 transitions.
[2025-06-03 02:37:21] [INFO ] Flatten gal took : 1 ms
[2025-06-03 02:37:21] [INFO ] Flatten gal took : 0 ms
[2025-06-03 02:37:21] [INFO ] Input system was already deterministic with 17 transitions.
[2025-06-03 02:37:21] [INFO ] Flatten gal took : 1 ms
[2025-06-03 02:37:21] [INFO ] Flatten gal took : 1 ms
[2025-06-03 02:37:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality14075249442097279116.gal : 1 ms
[2025-06-03 02:37:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality9239348665193683232.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/CTLCardinality14075249442097279116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9239348665193683232.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,735,0.008962,3788,2,31,5,252,6,0,49,275,0


Converting to forward existential form...Done !
original formula: EG(AF(((p101==0)||(p26==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((p101==0)||(p26==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t7, t9, t16, Intersection with reachable at each step enabled. (destroyed/reverse/in...180
(forward)formula 0,1,0.030756,4172,1,0,76,2211,57,61,267,3598,88
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 208/208 places, 235/235 transitions.
Graph (complete) has 387 edges and 208 vertex of which 201 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 201 transition count 190
Reduce places removed 40 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 161 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 159 transition count 188
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 85 place count 159 transition count 172
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 117 place count 143 transition count 172
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 127 place count 133 transition count 162
Iterating global reduction 3 with 10 rules applied. Total rules applied 137 place count 133 transition count 162
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 137 place count 133 transition count 160
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 141 place count 131 transition count 160
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 146 place count 126 transition count 155
Iterating global reduction 3 with 5 rules applied. Total rules applied 151 place count 126 transition count 155
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 156 place count 121 transition count 150
Iterating global reduction 3 with 5 rules applied. Total rules applied 161 place count 121 transition count 150
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 166 place count 116 transition count 140
Iterating global reduction 3 with 5 rules applied. Total rules applied 171 place count 116 transition count 140
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 176 place count 111 transition count 135
Iterating global reduction 3 with 5 rules applied. Total rules applied 181 place count 111 transition count 135
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 221 place count 91 transition count 115
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 222 place count 90 transition count 114
Iterating global reduction 3 with 1 rules applied. Total rules applied 223 place count 90 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 224 place count 89 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 225 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 226 place count 88 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 227 place count 88 transition count 111
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 228 place count 88 transition count 111
Applied a total of 228 rules in 43 ms. Remains 88 /208 variables (removed 120) and now considering 111/235 (removed 124) transitions.
// Phase 1: matrix 111 rows 88 cols
[2025-06-03 02:37:21] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:37:21] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-03 02:37:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:37:21] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-03 02:37:21] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:37:21] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2025-06-03 02:37:21] [INFO ] Invariant cache hit.
[2025-06-03 02:37:21] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 111/198 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 55/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 1/199 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 145 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4240 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 111/198 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 55/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 109/253 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 1/199 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/199 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 255 constraints, problems are : Problem set: 0 solved, 110 unsolved in 8110 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12361ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 12362ms
Starting structural reductions in SI_CTL mode, iteration 1 : 88/208 places, 111/235 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12636 ms. Remains : 88/208 places, 111/235 transitions.
[2025-06-03 02:37:33] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:37:33] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:37:33] [INFO ] Input system was already deterministic with 111 transitions.
[2025-06-03 02:37:33] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:37:33] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:37:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality7778680688528177135.gal : 1 ms
[2025-06-03 02:37:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality923494183039796429.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/CTLCardinality7778680688528177135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality923494183039796429.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,9.78593e+08,1.05781,23040,2,3861,5,122868,6,0,450,70006,0


Converting to forward existential form...Done !
original formula: EF((!(E((p47==1) U !(AG(((p201==0)||(p23==1)))))) * ((p36==0)||(p224==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((p36==0)||(p224==1))) * !(E((p47==1) U !(!(E(TRUE U !(((p201==0)||(p23==1)))))))))] != FAL...157
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t10, t12, t16, t18, t22, t24, t28, t30, t34, t36, t39, t44, t47, t54, t67, Intersect...244
(forward)formula 0,1,4.45151,89748,1,0,155,485769,249,110,2645,447744,242
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 235/235 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 205 transition count 235
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 32 place count 176 transition count 206
Iterating global reduction 1 with 29 rules applied. Total rules applied 61 place count 176 transition count 206
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 167 transition count 197
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 167 transition count 197
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 86 place count 160 transition count 190
Iterating global reduction 1 with 7 rules applied. Total rules applied 93 place count 160 transition count 190
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 100 place count 153 transition count 180
Iterating global reduction 1 with 7 rules applied. Total rules applied 107 place count 153 transition count 180
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 114 place count 146 transition count 169
Iterating global reduction 1 with 7 rules applied. Total rules applied 121 place count 146 transition count 169
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 127 place count 140 transition count 163
Iterating global reduction 1 with 6 rules applied. Total rules applied 133 place count 140 transition count 163
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 137 place count 136 transition count 159
Iterating global reduction 1 with 4 rules applied. Total rules applied 141 place count 136 transition count 159
Applied a total of 141 rules in 17 ms. Remains 136 /208 variables (removed 72) and now considering 159/235 (removed 76) transitions.
// Phase 1: matrix 159 rows 136 cols
[2025-06-03 02:37:38] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:37:38] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-03 02:37:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:37:38] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2025-06-03 02:37:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 159/295 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:37:42] [INFO ] Deduced a trap composed of 7 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-03 02:37:42] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:37:43] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:37:43] [INFO ] Deduced a trap composed of 10 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-03 02:37:43] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:37:43] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:37:43] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:37:43] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 8/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 146 constraints, problems are : Problem set: 0 solved, 158 unsolved in 12084 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 159/295 variables, 136/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 158/304 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 304 constraints, problems are : Problem set: 0 solved, 158 unsolved in 12800 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24904ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 24905ms
Starting structural reductions in LTL mode, iteration 1 : 136/208 places, 159/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25293 ms. Remains : 136/208 places, 159/235 transitions.
[2025-06-03 02:38:03] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:38:03] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:38:03] [INFO ] Input system was already deterministic with 159 transitions.
[2025-06-03 02:38:03] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:38:03] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:38:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality7589955114802551266.gal : 2 ms
[2025-06-03 02:38:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality14942309399621984085.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/CTLCardinality7589955114802551266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14942309399621984085.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 02:38:33] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:38:33] [INFO ] Applying decomposition
[2025-06-03 02:38:33] [INFO ] Flatten gal took : 14 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/graph10299296902138623294.txt' '-o' '/tmp/graph10299296902138623294.bin' '-w' '/tmp/graph10299296902138623294.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10299296902138623294.bin' '-l' '-1' '-v' '-w' '/tmp/graph10299296902138623294.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:38:33] [INFO ] Decomposing Gal with order
[2025-06-03 02:38:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:38:33] [INFO ] Removed a total of 60 redundant transitions.
[2025-06-03 02:38:33] [INFO ] Flatten gal took : 13 ms
[2025-06-03 02:38:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 3 ms.
[2025-06-03 02:38:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality7994002438892449985.gal : 4 ms
[2025-06-03 02:38:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality8403275978685637939.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/CTLCardinality7994002438892449985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8403275978685637939.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 208/208 places, 235/235 transitions.
Graph (complete) has 387 edges and 208 vertex of which 199 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 198 transition count 184
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 154 transition count 184
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 89 place count 154 transition count 168
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 121 place count 138 transition count 168
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 132 place count 127 transition count 157
Iterating global reduction 2 with 11 rules applied. Total rules applied 143 place count 127 transition count 157
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 143 place count 127 transition count 155
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 147 place count 125 transition count 155
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 152 place count 120 transition count 150
Iterating global reduction 2 with 5 rules applied. Total rules applied 157 place count 120 transition count 150
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 162 place count 115 transition count 145
Iterating global reduction 2 with 5 rules applied. Total rules applied 167 place count 115 transition count 145
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 172 place count 110 transition count 135
Iterating global reduction 2 with 5 rules applied. Total rules applied 177 place count 110 transition count 135
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 182 place count 105 transition count 130
Iterating global reduction 2 with 5 rules applied. Total rules applied 187 place count 105 transition count 130
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 225 place count 86 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 226 place count 85 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 227 place count 85 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 228 place count 84 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 229 place count 84 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 230 place count 83 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 231 place count 83 transition count 107
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 232 place count 83 transition count 107
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 234 place count 81 transition count 105
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 96 edges and 79 vertex of which 75 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 82 edges and 75 vertex of which 32 / 75 are part of one of the 16 SCC in 0 ms
Free SCC test removed 16 places
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 2 with 28 rules applied. Total rules applied 262 place count 59 transition count 76
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 302 place count 35 transition count 60
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 308 place count 29 transition count 48
Iterating global reduction 4 with 6 rules applied. Total rules applied 314 place count 29 transition count 48
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 320 place count 23 transition count 36
Iterating global reduction 4 with 6 rules applied. Total rules applied 326 place count 23 transition count 36
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 332 place count 17 transition count 24
Iterating global reduction 4 with 6 rules applied. Total rules applied 338 place count 17 transition count 24
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 344 place count 11 transition count 18
Iterating global reduction 4 with 6 rules applied. Total rules applied 350 place count 11 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 351 place count 11 transition count 17
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 352 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 353 place count 10 transition count 16
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 355 place count 8 transition count 14
Applied a total of 355 rules in 36 ms. Remains 8 /208 variables (removed 200) and now considering 14/235 (removed 221) transitions.
[2025-06-03 02:39:03] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2025-06-03 02:39:03] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:39:03] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-03 02:39:03] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2025-06-03 02:39:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:39:03] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:39:03] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2025-06-03 02:39:03] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2025-06-03 02:39:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 8 constraints, problems are : Problem set: 0 solved, 10 unsolved in 143 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 18 constraints, problems are : Problem set: 0 solved, 10 unsolved in 188 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 334ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 334ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/208 places, 14/235 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 435 ms. Remains : 8/208 places, 14/235 transitions.
[2025-06-03 02:39:04] [INFO ] Flatten gal took : 1 ms
[2025-06-03 02:39:04] [INFO ] Flatten gal took : 0 ms
[2025-06-03 02:39:04] [INFO ] Input system was already deterministic with 14 transitions.
[2025-06-03 02:39:04] [INFO ] Flatten gal took : 0 ms
[2025-06-03 02:39:04] [INFO ] Flatten gal took : 1 ms
[2025-06-03 02:39:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality7863921382959559356.gal : 1 ms
[2025-06-03 02:39:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality14992266063969861904.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/CTLCardinality7863921382959559356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14992266063969861904.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,252,0.007306,3788,2,21,5,125,6,0,39,116,0


Converting to forward existential form...Done !
original formula: AF((p151==1))
=> equivalent forward existential formula: [FwdG(Init,!((p151==1)))] = FALSE
Hit Full ! (commute/partial/dont) 12/0/2
(forward)formula 0,0,0.010861,3916,1,0,8,269,20,4,194,279,8
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 235/235 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 205 transition count 235
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 182 transition count 212
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 182 transition count 212
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 174 transition count 204
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 174 transition count 204
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 71 place count 168 transition count 198
Iterating global reduction 1 with 6 rules applied. Total rules applied 77 place count 168 transition count 198
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 82 place count 163 transition count 191
Iterating global reduction 1 with 5 rules applied. Total rules applied 87 place count 163 transition count 191
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 91 place count 159 transition count 184
Iterating global reduction 1 with 4 rules applied. Total rules applied 95 place count 159 transition count 184
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 156 transition count 181
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 156 transition count 181
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 154 transition count 179
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 154 transition count 179
Applied a total of 105 rules in 12 ms. Remains 154 /208 variables (removed 54) and now considering 179/235 (removed 56) transitions.
// Phase 1: matrix 179 rows 154 cols
[2025-06-03 02:39:04] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:39:04] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-03 02:39:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:39:04] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2025-06-03 02:39:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (OVERLAPS) 179/333 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:10] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:10] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:10] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:10] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:11] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:11] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:11] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:39:11] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 8/164 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 0/333 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 164 constraints, problems are : Problem set: 0 solved, 178 unsolved in 14719 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/333 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 178/342 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/333 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 342 constraints, problems are : Problem set: 0 solved, 178 unsolved in 12957 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27708ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 27708ms
Starting structural reductions in LTL mode, iteration 1 : 154/208 places, 179/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28113 ms. Remains : 154/208 places, 179/235 transitions.
[2025-06-03 02:39:32] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:39:32] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:39:32] [INFO ] Input system was already deterministic with 179 transitions.
[2025-06-03 02:39:32] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:39:32] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:39:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality17846418587645831643.gal : 2 ms
[2025-06-03 02:39:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality2648246219769541610.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/CTLCardinality17846418587645831643.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2648246219769541610.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 02:40:02] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:40:02] [INFO ] Applying decomposition
[2025-06-03 02:40:02] [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/graph17375720116572443156.txt' '-o' '/tmp/graph17375720116572443156.bin' '-w' '/tmp/graph17375720116572443156.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17375720116572443156.bin' '-l' '-1' '-v' '-w' '/tmp/graph17375720116572443156.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:40:02] [INFO ] Decomposing Gal with order
[2025-06-03 02:40:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:40:02] [INFO ] Removed a total of 67 redundant transitions.
[2025-06-03 02:40:02] [INFO ] Flatten gal took : 12 ms
[2025-06-03 02:40:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2025-06-03 02:40:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality16788024136091494191.gal : 2 ms
[2025-06-03 02:40:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality8358377210611128300.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/CTLCardinality16788024136091494191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8358377210611128300.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 208/208 places, 235/235 transitions.
Graph (complete) has 387 edges and 208 vertex of which 202 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 201 transition count 199
Reduce places removed 31 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 66 place count 170 transition count 196
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 167 transition count 196
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 69 place count 167 transition count 183
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 95 place count 154 transition count 183
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 104 place count 145 transition count 174
Iterating global reduction 3 with 9 rules applied. Total rules applied 113 place count 145 transition count 174
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 113 place count 145 transition count 172
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 117 place count 143 transition count 172
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 121 place count 139 transition count 168
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 139 transition count 168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 135 transition count 164
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 135 transition count 164
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 133 transition count 160
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 133 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 131 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 131 transition count 158
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 171 place count 116 transition count 143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 172 place count 115 transition count 142
Iterating global reduction 3 with 1 rules applied. Total rules applied 173 place count 115 transition count 142
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 114 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 114 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 176 place count 113 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 177 place count 113 transition count 139
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 181 place count 113 transition count 139
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 183 place count 111 transition count 137
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 8 rules applied. Total rules applied 191 place count 110 transition count 130
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 11 rules applied. Total rules applied 202 place count 103 transition count 126
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 5 rules applied. Total rules applied 207 place count 101 transition count 123
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 210 place count 98 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 210 place count 98 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 212 place count 97 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 214 place count 96 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 216 place count 96 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 218 place count 95 transition count 118
Applied a total of 218 rules in 55 ms. Remains 95 /208 variables (removed 113) and now considering 118/235 (removed 117) transitions.
[2025-06-03 02:40:32] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
// Phase 1: matrix 117 rows 95 cols
[2025-06-03 02:40:32] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:40:32] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-03 02:40:32] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
[2025-06-03 02:40:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:40:32] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-06-03 02:40:33] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:40:33] [INFO ] Redundant transitions in 3 ms returned []
Running 116 sub problems to find dead transitions.
[2025-06-03 02:40:33] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
[2025-06-03 02:40:33] [INFO ] Invariant cache hit.
[2025-06-03 02:40:33] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 116/209 variables, 93/94 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 28/122 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 2/211 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:40:37] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 1/212 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:40:39] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:40:39] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:40:39] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:40:39] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:40:39] [INFO ] Deduced a trap composed of 5 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-03 02:40:39] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:40:39] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 12 (OVERLAPS) 0/212 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 133 constraints, problems are : Problem set: 0 solved, 116 unsolved in 10550 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 116/209 variables, 93/96 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 28/124 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 115/239 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:40:44] [INFO ] Deduced a trap along path composed of 17 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:40:44] [INFO ] Deduced a trap along path composed of 2 places in 47 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 2/211 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 6/250 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 13 (OVERLAPS) 1/212 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 15 (OVERLAPS) 0/212 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 251 constraints, problems are : Problem set: 0 solved, 116 unsolved in 10169 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 20740ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 20741ms
Starting structural reductions in SI_CTL mode, iteration 1 : 95/208 places, 118/235 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21081 ms. Remains : 95/208 places, 118/235 transitions.
[2025-06-03 02:40:53] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:40:53] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:40:53] [INFO ] Input system was already deterministic with 118 transitions.
[2025-06-03 02:40:53] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:40:53] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:40:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality10844753881321433048.gal : 10 ms
[2025-06-03 02:40:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality13948033503123643819.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/CTLCardinality10844753881321433048.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13948033503123643819.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: ((A(E((p62==1) U (p117==1)) U ((A((p154==1) U ((p3==0)||(p139==1))) + (p29==1)) + ((p31==0)||(p125==1)))) * AF(((!(A((p218==1) U (p26==0)...298
=> equivalent forward existential formula: (((([(FwdU((((FwdU(Init,!(((!((E(!(((p3==0)||(p139==1))) U (!((p154==1)) * !(((p3==0)||(p139==1))))) + EG(!(((p3...1079
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t7, t8, t11, t15, t19, t20, t21, t24, t26, t28, t30, t31, t35, t38, t39, t43, t47...327
Detected timeout of ITS tools.
[2025-06-03 02:41:23] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:41:23] [INFO ] Applying decomposition
[2025-06-03 02:41:23] [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/graph1696009088921129282.txt' '-o' '/tmp/graph1696009088921129282.bin' '-w' '/tmp/graph1696009088921129282.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1696009088921129282.bin' '-l' '-1' '-v' '-w' '/tmp/graph1696009088921129282.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:41:23] [INFO ] Decomposing Gal with order
[2025-06-03 02:41:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:41:23] [INFO ] Removed a total of 47 redundant transitions.
[2025-06-03 02:41:23] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:41:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 2 ms.
[2025-06-03 02:41:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality14919469681475449829.gal : 2 ms
[2025-06-03 02:41:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality4797085437947230882.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/CTLCardinality14919469681475449829.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4797085437947230882.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.33982e+08,8.41528,204628,2430,177,267805,1806,317,1.87772e+06,60,20377,0


Converting to forward existential form...Done !
original formula: ((A(E((i0.u14.p62==1) U (i8.u18.p117==1)) U ((A((i9.u23.p154==1) U ((i13.u27.p3==0)||(i8.u18.p139==1))) + (i1.u4.p29==1)) + ((i1.u1.p31==...438
=> equivalent forward existential formula: (((([(FwdU((((FwdU(Init,!(((!((E(!(((i13.u27.p3==0)||(i8.u18.p139==1))) U (!((i9.u23.p154==1)) * !(((i13.u27.p3=...1507
Reverse transition relation is NOT exact ! Due to transitions t66, t77, t112, i1.u1.t54, i1.u3.t56, i2.t117, i2.t116, i2.t115, i2.t114, i2.u2.t53, i2.u6.t4...516
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 235/235 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 205 transition count 235
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 30 place count 178 transition count 208
Iterating global reduction 1 with 27 rules applied. Total rules applied 57 place count 178 transition count 208
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 65 place count 170 transition count 200
Iterating global reduction 1 with 8 rules applied. Total rules applied 73 place count 170 transition count 200
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 79 place count 164 transition count 194
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 164 transition count 194
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 90 place count 159 transition count 187
Iterating global reduction 1 with 5 rules applied. Total rules applied 95 place count 159 transition count 187
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 100 place count 154 transition count 179
Iterating global reduction 1 with 5 rules applied. Total rules applied 105 place count 154 transition count 179
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 110 place count 149 transition count 174
Iterating global reduction 1 with 5 rules applied. Total rules applied 115 place count 149 transition count 174
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 118 place count 146 transition count 171
Iterating global reduction 1 with 3 rules applied. Total rules applied 121 place count 146 transition count 171
Applied a total of 121 rules in 16 ms. Remains 146 /208 variables (removed 62) and now considering 171/235 (removed 64) transitions.
// Phase 1: matrix 171 rows 146 cols
[2025-06-03 02:41:54] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:41:54] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-03 02:41:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:41:54] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2025-06-03 02:41:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (OVERLAPS) 171/317 variables, 146/148 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:41:58] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:41:58] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:41:59] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:41:59] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:41:59] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:41:59] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:41:59] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:41:59] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 8/156 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 0/317 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 156 constraints, problems are : Problem set: 0 solved, 170 unsolved in 14013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/317 variables, 146/156 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 170/326 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 326 constraints, problems are : Problem set: 0 solved, 170 unsolved in 15347 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29395ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 29396ms
Starting structural reductions in LTL mode, iteration 1 : 146/208 places, 171/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29712 ms. Remains : 146/208 places, 171/235 transitions.
[2025-06-03 02:42:23] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:42:23] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:42:23] [INFO ] Input system was already deterministic with 171 transitions.
[2025-06-03 02:42:23] [INFO ] Flatten gal took : 9 ms
[2025-06-03 02:42:23] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:42:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality7883746407699523922.gal : 2 ms
[2025-06-03 02:42:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality8336135981671999260.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/CTLCardinality7883746407699523922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8336135981671999260.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 02:42:53] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:42:53] [INFO ] Applying decomposition
[2025-06-03 02:42:53] [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/graph12049613481860097728.txt' '-o' '/tmp/graph12049613481860097728.bin' '-w' '/tmp/graph12049613481860097728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12049613481860097728.bin' '-l' '-1' '-v' '-w' '/tmp/graph12049613481860097728.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:42:53] [INFO ] Decomposing Gal with order
[2025-06-03 02:42:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:42:53] [INFO ] Removed a total of 63 redundant transitions.
[2025-06-03 02:42:53] [INFO ] Flatten gal took : 19 ms
[2025-06-03 02:42:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2025-06-03 02:42:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality14373989205045969731.gal : 3 ms
[2025-06-03 02:42:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality17509721538472986794.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/CTLCardinality14373989205045969731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17509721538472986794.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 02:43:24] [INFO ] Flatten gal took : 7 ms
[2025-06-03 02:43:24] [INFO ] Flatten gal took : 7 ms
[2025-06-03 02:43:24] [INFO ] Applying decomposition
[2025-06-03 02:43:24] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14492824899246624832.txt' '-o' '/tmp/graph14492824899246624832.bin' '-w' '/tmp/graph14492824899246624832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14492824899246624832.bin' '-l' '-1' '-v' '-w' '/tmp/graph14492824899246624832.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:43:24] [INFO ] Decomposing Gal with order
[2025-06-03 02:43:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:43:24] [INFO ] Removed a total of 76 redundant transitions.
[2025-06-03 02:43:24] [INFO ] Flatten gal took : 15 ms
[2025-06-03 02:43:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 02:43:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality15451730089637193290.gal : 3 ms
[2025-06-03 02:43:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality1760817659414858877.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/CTLCardinality15451730089637193290.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1760817659414858877.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 03:06:55] [INFO ] Applying decomposition
[2025-06-03 03:06:55] [INFO ] Flatten gal took : 230 ms
[2025-06-03 03:06:55] [INFO ] Decomposing Gal with order
[2025-06-03 03:06:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 03:06:56] [INFO ] Removed a total of 76 redundant transitions.
[2025-06-03 03:06:56] [INFO ] Flatten gal took : 372 ms
[2025-06-03 03:06:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 364 labels/synchronizations in 133 ms.
[2025-06-03 03:06:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality5181231265948004926.gal : 84 ms
[2025-06-03 03:06:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality13246887301334195327.ctl : 13 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/CTLCardinality5181231265948004926.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13246887301334195327.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.20605e+12,41.2074,664840,1226,2598,1.0917e+06,140173,302,3.31996e+06,219,1.26007e+06,0


Converting to forward existential form...Done !
original formula: AF(((AG(((((i1.u17.p227==0)||(i0.i0.i0.i0.u12.p123==1))||(i0.i0.i0.i0.i0.i0.u10.p70==0)) * EX((i0.i0.i0.i0.u12.p126==0)))) + EG((i0.i0.i0...281
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !(((((i1.u17.p227==0)||(i0.i0.i0.i0.u12.p123==1))||(i0.i0.i0.i0.i0.i0.u10.p70==0)) * E...356
Reverse transition relation is NOT exact ! Due to transitions t226, t227, i0.t18, i0.u15.t15, i0.u15.t21, i0.u15.t25, i0.u15.t28, i0.u15.t30, i0.i0.t35, i0...1233
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
(forward)formula 0,1,599.458,2782340,1,0,3.90167e+06,1.03176e+06,785,1.41641e+07,749,9.24238e+06,697131
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AF(((i0.i0.i0.i0.u12.p126==1)&&((i0.i0.u14.p196==0)||(i0.i0.i0.i0.u12.p127==1)))) + AG(!(A(EX(((i0.i0.i0.i0.i0.u11.p96==0)||(i0.i0.i0.i0...315
=> equivalent forward existential formula: [((FwdU((Init * !(!(EG(!(((i0.i0.i0.i0.u12.p126==1)&&((i0.i0.u14.p196==0)||(i0.i0.i0.i0.u12.p127==1)))))))),TRUE...670
(forward)formula 1,0,823.623,3705220,1,0,5.28889e+06,1.19484e+06,872,1.86345e+07,805,1.12162e+07,1290943
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(A(EX(EF((i0.u15.p197==1))) U AX((i0.i0.u14.p181==1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(EX(!((i0.i0.u14.p181==1))))) U (!(EX(E(TRUE U (i0.u15.p197==1)))) * !(!(EX(!((i0.i0.u14.p181...217
(forward)formula 2,0,852.301,3705220,1,0,5.28889e+06,1.19484e+06,1045,1.86345e+07,932,1.12162e+07,1546487
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(!(((i0.i0.i0.i0.i0.i0.i0.u8.p21==0)||(i0.i0.u14.p184==1))) U (EF(((!(((i0.i0.i0.i0.i0.i0.u10.p63==0)||(i0.i0.i0.u13.p166==1))||((i0.u15...502
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U ((!(((i0.i0.i0.i0.i0.i0.u10.p63==0)||(i0.i0.i0.u13.p166==1))||((i0.u15.p218==0)||(i0....1491
(forward)formula 3,1,1269.81,5231232,1,0,7.79173e+06,1.40523e+06,932,2.72365e+07,764,1.32954e+07,1714183
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2025-06-03 03:30:25] [INFO ] Flatten gal took : 31 ms
[2025-06-03 03:30:26] [INFO ] Input system was already deterministic with 235 transitions.
[2025-06-03 03:30:26] [INFO ] Transformed 208 places.
[2025-06-03 03:30:26] [INFO ] Transformed 235 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-03 03:30:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality7992489254793476879.gal : 11 ms
[2025-06-03 03:30:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality2584303258053703643.ctl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7992489254793476879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2584303258053703643.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.20605e+12,49.1751,864256,2,32374,5,3.59927e+06,6,0,1057,4.73439e+06,0


Converting to forward existential form...Done !
original formula: ((A(E((p62==1) U (p117==1)) U ((A((p154==1) U ((p3==0)||(p139==1))) + (p29==1)) + ((p31==0)||(p125==1)))) * AF(((!(A((p218==1) U (p26==0)...298
=> equivalent forward existential formula: (((([(FwdU((((FwdU(Init,!(((!((E(!(((p3==0)||(p139==1))) U (!((p154==1)) * !(((p3==0)||(p139==1))))) + EG(!(((p3...1079
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t7, t8, t9, t10, t12, t15, t18, t21, t25, t28, t30, t35, t38, t44, t46, t47, t53,...464

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="DiscoveryGPU-PT-08b"
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 DiscoveryGPU-PT-08b, 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 r058-smll-174854064500649"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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