Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 75K 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-10b-CTLCardinality-2023-12
FORMULA_NAME DiscoveryGPU-PT-10b-CTLCardinality-2023-13
FORMULA_NAME DiscoveryGPU-PT-10b-CTLCardinality-2023-14
FORMULA_NAME DiscoveryGPU-PT-10b-CTLCardinality-2023-15
FORMULA_NAME DiscoveryGPU-PT-10b-CTLCardinality-2025-00
FORMULA_NAME DiscoveryGPU-PT-10b-CTLCardinality-2025-01
FORMULA_NAME DiscoveryGPU-PT-10b-CTLCardinality-2025-02
FORMULA_NAME DiscoveryGPU-PT-10b-CTLCardinality-2025-03
FORMULA_NAME DiscoveryGPU-PT-10b-CTLCardinality-2025-04
FORMULA_NAME DiscoveryGPU-PT-10b-CTLCardinality-2025-05
FORMULA_NAME DiscoveryGPU-PT-10b-CTLCardinality-2025-06
FORMULA_NAME DiscoveryGPU-PT-10b-CTLCardinality-2025-07
FORMULA_NAME DiscoveryGPU-PT-10b-CTLCardinality-2025-08
FORMULA_NAME DiscoveryGPU-PT-10b-CTLCardinality-2025-09
FORMULA_NAME DiscoveryGPU-PT-10b-CTLCardinality-2025-10
FORMULA_NAME DiscoveryGPU-PT-10b-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748927510010

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-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-03 05:11:52] [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 05:11:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 05:11:53] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2025-06-03 05:11:53] [INFO ] Transformed 296 places.
[2025-06-03 05:11:53] [INFO ] Transformed 314 transitions.
[2025-06-03 05:11:53] [INFO ] Found NUPN structural information;
[2025-06-03 05:11:53] [INFO ] Parsed PT model containing 296 places and 314 transitions and 819 arcs in 429 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 39 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-10b-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 96 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 314/314 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 282 transition count 314
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 37 place count 259 transition count 291
Iterating global reduction 1 with 23 rules applied. Total rules applied 60 place count 259 transition count 291
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 257 transition count 289
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 257 transition count 289
Applied a total of 64 rules in 144 ms. Remains 257 /296 variables (removed 39) and now considering 289/314 (removed 25) transitions.
// Phase 1: matrix 289 rows 257 cols
[2025-06-03 05:11:53] [INFO ] Computed 2 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:11:54] [INFO ] Implicit Places using invariants in 610 ms returned []
[2025-06-03 05:11:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:11:54] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2025-06-03 05:11: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/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 289/540 variables, 251/253 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:12] [INFO ] Deduced a trap composed of 7 places in 310 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:12] [INFO ] Deduced a trap composed of 8 places in 292 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:12] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:12] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:13] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:13] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:13] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:13] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:13] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:14] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:14] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:14] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:14] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:14] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:15] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:15] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:15] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:15] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:15] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:12:15] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 20/273 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/546 variables, and 273 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 251/257 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/540 variables, 251/273 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 282/555 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 6/546 variables, 6/561 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 6/567 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 567 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60433ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 60482ms
Starting structural reductions in LTL mode, iteration 1 : 257/296 places, 289/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61973 ms. Remains : 257/296 places, 289/314 transitions.
Support contains 96 out of 257 places after structural reductions.
[2025-06-03 05:12:55] [INFO ] Flatten gal took : 102 ms
[2025-06-03 05:12:55] [INFO ] Flatten gal took : 50 ms
[2025-06-03 05:12:56] [INFO ] Input system was already deterministic with 289 transitions.
Support contains 86 out of 257 places (down from 96) after GAL structural reductions.
RANDOM walk for 40000 steps (122 resets) in 2218 ms. (18 steps per ms) remains 1/53 properties
BEST_FIRST walk for 35436 steps (16 resets) in 191 ms. (184 steps per ms) remains 0/1 properties
[2025-06-03 05:12:56] [INFO ] Flatten gal took : 21 ms
[2025-06-03 05:12:56] [INFO ] Flatten gal took : 22 ms
[2025-06-03 05:12:57] [INFO ] Input system was already deterministic with 289 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 474 edges and 257 vertex of which 236 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 289/289 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 251 transition count 289
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 34 place count 223 transition count 261
Iterating global reduction 1 with 28 rules applied. Total rules applied 62 place count 223 transition count 261
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 69 place count 216 transition count 254
Iterating global reduction 1 with 7 rules applied. Total rules applied 76 place count 216 transition count 254
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 83 place count 209 transition count 247
Iterating global reduction 1 with 7 rules applied. Total rules applied 90 place count 209 transition count 247
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 97 place count 202 transition count 240
Iterating global reduction 1 with 7 rules applied. Total rules applied 104 place count 202 transition count 240
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 111 place count 195 transition count 226
Iterating global reduction 1 with 7 rules applied. Total rules applied 118 place count 195 transition count 226
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 188 transition count 219
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 188 transition count 219
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 139 place count 181 transition count 212
Iterating global reduction 1 with 7 rules applied. Total rules applied 146 place count 181 transition count 212
Applied a total of 146 rules in 37 ms. Remains 181 /257 variables (removed 76) and now considering 212/289 (removed 77) transitions.
// Phase 1: matrix 212 rows 181 cols
[2025-06-03 05:12:57] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:12:57] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-03 05:12:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:12:57] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2025-06-03 05:12:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 212/393 variables, 181/183 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:13:06] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:13:06] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:13:06] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:13:07] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:13:07] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:13:07] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:13:07] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:13:07] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:13:08] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:13:08] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 10/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/393 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 193 constraints, problems are : Problem set: 0 solved, 211 unsolved in 26809 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/393 variables, 181/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 211/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/393 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 404 constraints, problems are : Problem set: 0 solved, 211 unsolved in 28226 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55111ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 55114ms
Starting structural reductions in LTL mode, iteration 1 : 181/257 places, 212/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55486 ms. Remains : 181/257 places, 212/289 transitions.
[2025-06-03 05:13:52] [INFO ] Flatten gal took : 29 ms
[2025-06-03 05:13:52] [INFO ] Flatten gal took : 23 ms
[2025-06-03 05:13:52] [INFO ] Input system was already deterministic with 212 transitions.
[2025-06-03 05:13:52] [INFO ] Flatten gal took : 22 ms
[2025-06-03 05:13:52] [INFO ] Flatten gal took : 19 ms
[2025-06-03 05:13:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality4573758964982885874.gal : 9 ms
[2025-06-03 05:13:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality18050922371925558771.ctl : 6 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/CTLCardinality4573758964982885874.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18050922371925558771.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 05:14:22] [INFO ] Flatten gal took : 11 ms
[2025-06-03 05:14:22] [INFO ] Applying decomposition
[2025-06-03 05:14:22] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14539119971950341468.txt' '-o' '/tmp/graph14539119971950341468.bin' '-w' '/tmp/graph14539119971950341468.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14539119971950341468.bin' '-l' '-1' '-v' '-w' '/tmp/graph14539119971950341468.weights' '-q' '0' '-e' '0.001'
[2025-06-03 05:14:23] [INFO ] Decomposing Gal with order
[2025-06-03 05:14:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 05:14:23] [INFO ] Removed a total of 82 redundant transitions.
[2025-06-03 05:14:23] [INFO ] Flatten gal took : 110 ms
[2025-06-03 05:14:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 15 ms.
[2025-06-03 05:14:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality6840419038184185238.gal : 13 ms
[2025-06-03 05:14:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality12751747908338422974.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/CTLCardinality6840419038184185238.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12751747908338422974.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 : 257/257 places, 289/289 transitions.
Graph (complete) has 474 edges and 257 vertex of which 237 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 236 transition count 231
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 193 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 192 transition count 230
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 89 place count 192 transition count 206
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 137 place count 168 transition count 206
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 146 place count 159 transition count 197
Iterating global reduction 3 with 9 rules applied. Total rules applied 155 place count 159 transition count 197
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 162 place count 152 transition count 190
Iterating global reduction 3 with 7 rules applied. Total rules applied 169 place count 152 transition count 190
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 176 place count 145 transition count 181
Iterating global reduction 3 with 7 rules applied. Total rules applied 183 place count 145 transition count 181
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 189 place count 139 transition count 171
Iterating global reduction 3 with 6 rules applied. Total rules applied 195 place count 139 transition count 171
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 199 place count 135 transition count 167
Iterating global reduction 3 with 4 rules applied. Total rules applied 203 place count 135 transition count 167
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 249 place count 112 transition count 144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 250 place count 111 transition count 143
Iterating global reduction 3 with 1 rules applied. Total rules applied 251 place count 111 transition count 143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 252 place count 110 transition count 141
Iterating global reduction 3 with 1 rules applied. Total rules applied 253 place count 110 transition count 141
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 254 place count 109 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 255 place count 109 transition count 140
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 258 place count 109 transition count 140
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 260 place count 107 transition count 138
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 126 edges and 105 vertex of which 101 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 101 edges and 101 vertex of which 32 / 101 are part of one of the 16 SCC in 2 ms
Free SCC test removed 16 places
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 3 with 35 rules applied. Total rules applied 295 place count 85 transition count 102
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 49 rules applied. Total rules applied 344 place count 54 transition count 84
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 53 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 347 place count 52 transition count 83
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 354 place count 45 transition count 69
Iterating global reduction 7 with 7 rules applied. Total rules applied 361 place count 45 transition count 69
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 367 place count 39 transition count 57
Iterating global reduction 7 with 6 rules applied. Total rules applied 373 place count 39 transition count 57
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 376 place count 36 transition count 51
Iterating global reduction 7 with 3 rules applied. Total rules applied 379 place count 36 transition count 51
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 382 place count 33 transition count 48
Iterating global reduction 7 with 3 rules applied. Total rules applied 385 place count 33 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 386 place count 33 transition count 47
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 388 place count 32 transition count 46
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 7 with 7 rules applied. Total rules applied 395 place count 25 transition count 39
Applied a total of 395 rules in 129 ms. Remains 25 /257 variables (removed 232) and now considering 39/289 (removed 250) transitions.
[2025-06-03 05:14:53] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
// Phase 1: matrix 33 rows 25 cols
[2025-06-03 05:14:53] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:14:53] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-03 05:14:53] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
[2025-06-03 05:14:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:14:53] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 05:14:53] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2025-06-03 05:14:53] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
[2025-06-03 05:14:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 32/50 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 7/57 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 0/57 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/58 variables, and 25 constraints, problems are : Problem set: 0 solved, 26 unsolved in 647 ms.
Refiners :[State Equation: 25/25 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 32/50 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 7/57 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/57 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/58 variables, and 51 constraints, problems are : Problem set: 0 solved, 26 unsolved in 617 ms.
Refiners :[State Equation: 25/25 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1270ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 1270ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/257 places, 39/289 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1471 ms. Remains : 25/257 places, 39/289 transitions.
[2025-06-03 05:14:54] [INFO ] Flatten gal took : 3 ms
[2025-06-03 05:14:54] [INFO ] Flatten gal took : 4 ms
[2025-06-03 05:14:54] [INFO ] Input system was already deterministic with 39 transitions.
[2025-06-03 05:14:54] [INFO ] Flatten gal took : 2 ms
[2025-06-03 05:14:54] [INFO ] Flatten gal took : 3 ms
[2025-06-03 05:14:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality13448212103268237110.gal : 4 ms
[2025-06-03 05:14:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality3829262922157794445.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/CTLCardinality13448212103268237110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3829262922157794445.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,193200,0.01335,3948,2,118,5,782,6,0,124,803,0


Converting to forward existential form...Done !
original formula: AG(EF(((EF(((p104==0)||(p38==1))) + (p168==0)) + ((p69==0)&&((p175==0)||(p254==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((E(TRUE U ((p104==0)||(p38==1))) + (p168==0)) + ((p69==0)&&((p175==0)||(p254==1)...170
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t10, t14, t19, t20, t34, t36, t37, t38, Intersection with reachable at each step ena...208
(forward)formula 0,1,0.045799,4844,1,0,66,5083,94,38,659,4806,84
FORMULA DiscoveryGPU-PT-10b-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 289/289 transitions.
Graph (complete) has 474 edges and 257 vertex of which 239 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 238 transition count 229
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 192 transition count 229
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 93 place count 192 transition count 204
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 143 place count 167 transition count 204
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 152 place count 158 transition count 195
Iterating global reduction 2 with 9 rules applied. Total rules applied 161 place count 158 transition count 195
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 168 place count 151 transition count 188
Iterating global reduction 2 with 7 rules applied. Total rules applied 175 place count 151 transition count 188
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 182 place count 144 transition count 178
Iterating global reduction 2 with 7 rules applied. Total rules applied 189 place count 144 transition count 178
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 196 place count 137 transition count 167
Iterating global reduction 2 with 7 rules applied. Total rules applied 203 place count 137 transition count 167
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 207 place count 133 transition count 163
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 133 transition count 163
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 259 place count 109 transition count 139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 260 place count 108 transition count 138
Iterating global reduction 2 with 1 rules applied. Total rules applied 261 place count 108 transition count 138
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 262 place count 107 transition count 136
Iterating global reduction 2 with 1 rules applied. Total rules applied 263 place count 107 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 264 place count 106 transition count 135
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 106 transition count 135
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 267 place count 106 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 269 place count 104 transition count 133
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 122 edges and 102 vertex of which 98 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 105 edges and 98 vertex of which 38 / 98 are part of one of the 19 SCC in 1 ms
Free SCC test removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 2 with 34 rules applied. Total rules applied 303 place count 79 transition count 98
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 52 rules applied. Total rules applied 355 place count 49 transition count 76
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 358 place count 47 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 359 place count 46 transition count 75
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 367 place count 38 transition count 59
Iterating global reduction 6 with 8 rules applied. Total rules applied 375 place count 38 transition count 59
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 382 place count 31 transition count 45
Iterating global reduction 6 with 7 rules applied. Total rules applied 389 place count 31 transition count 45
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 395 place count 25 transition count 33
Iterating global reduction 6 with 6 rules applied. Total rules applied 401 place count 25 transition count 33
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 407 place count 19 transition count 27
Iterating global reduction 6 with 6 rules applied. Total rules applied 413 place count 19 transition count 27
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 414 place count 19 transition count 26
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 416 place count 18 transition count 25
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 420 place count 14 transition count 21
Applied a total of 420 rules in 111 ms. Remains 14 /257 variables (removed 243) and now considering 21/289 (removed 268) transitions.
[2025-06-03 05:14:54] [INFO ] Flow matrix only has 16 transitions (discarded 5 similar events)
// Phase 1: matrix 16 rows 14 cols
[2025-06-03 05:14:54] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:14:55] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-03 05:14:55] [INFO ] Flow matrix only has 16 transitions (discarded 5 similar events)
[2025-06-03 05:14:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:14:55] [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 05:14:55] [INFO ] Redundant transitions in 1 ms returned []
Running 13 sub problems to find dead transitions.
[2025-06-03 05:14:55] [INFO ] Flow matrix only has 16 transitions (discarded 5 similar events)
[2025-06-03 05:14:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 15/24 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 5/29 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 0/29 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/30 variables, and 14 constraints, problems are : Problem set: 0 solved, 13 unsolved in 264 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 15/24 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 5/29 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/30 variables, and 27 constraints, problems are : Problem set: 0 solved, 13 unsolved in 289 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 558ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 558ms
Starting structural reductions in SI_CTL mode, iteration 1 : 14/257 places, 21/289 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 747 ms. Remains : 14/257 places, 21/289 transitions.
[2025-06-03 05:14:55] [INFO ] Flatten gal took : 2 ms
[2025-06-03 05:14:55] [INFO ] Flatten gal took : 2 ms
[2025-06-03 05:14:55] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-03 05:14:55] [INFO ] Flatten gal took : 2 ms
[2025-06-03 05:14:55] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:14:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality3316042373339218473.gal : 1 ms
[2025-06-03 05:14:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality8081715107234414847.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/CTLCardinality3316042373339218473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8081715107234414847.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4752,0.007209,3760,2,38,5,304,6,0,64,325,0


Converting to forward existential form...Done !
original formula: A((p59==1) U !(EF(!(EG(((p82==0)||(p203==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(EG(((p82==0)||(p203==1)))))))))) * !(E(!(!(E(TRUE U !(EG(((p82==0)||(p203==1))))))...232
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t9, t18, t20, Intersection with reachable at each step enabled. (destroyed/reverse/i...181
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.086928,6192,1,0,231,11914,71,127,395,16661,255
FORMULA DiscoveryGPU-PT-10b-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 289/289 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 251 transition count 289
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 38 place count 219 transition count 257
Iterating global reduction 1 with 32 rules applied. Total rules applied 70 place count 219 transition count 257
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 77 place count 212 transition count 250
Iterating global reduction 1 with 7 rules applied. Total rules applied 84 place count 212 transition count 250
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 91 place count 205 transition count 243
Iterating global reduction 1 with 7 rules applied. Total rules applied 98 place count 205 transition count 243
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 105 place count 198 transition count 235
Iterating global reduction 1 with 7 rules applied. Total rules applied 112 place count 198 transition count 235
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 119 place count 191 transition count 222
Iterating global reduction 1 with 7 rules applied. Total rules applied 126 place count 191 transition count 222
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 132 place count 185 transition count 216
Iterating global reduction 1 with 6 rules applied. Total rules applied 138 place count 185 transition count 216
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 143 place count 180 transition count 211
Iterating global reduction 1 with 5 rules applied. Total rules applied 148 place count 180 transition count 211
Applied a total of 148 rules in 37 ms. Remains 180 /257 variables (removed 77) and now considering 211/289 (removed 78) transitions.
// Phase 1: matrix 211 rows 180 cols
[2025-06-03 05:14:55] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:14:55] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-03 05:14:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:14:56] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2025-06-03 05:14:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 211/391 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:15:05] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:15:05] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:15:05] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:15:05] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:15:06] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:15:06] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:15:06] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:15:06] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:15:06] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:15:06] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 10/192 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 0/391 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 192 constraints, problems are : Problem set: 0 solved, 210 unsolved in 26032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/391 variables, 180/192 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 210/402 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 0/391 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 402 constraints, problems are : Problem set: 0 solved, 210 unsolved in 23968 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50094ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 50096ms
Starting structural reductions in LTL mode, iteration 1 : 180/257 places, 211/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50598 ms. Remains : 180/257 places, 211/289 transitions.
[2025-06-03 05:15:46] [INFO ] Flatten gal took : 9 ms
[2025-06-03 05:15:46] [INFO ] Flatten gal took : 9 ms
[2025-06-03 05:15:46] [INFO ] Input system was already deterministic with 211 transitions.
[2025-06-03 05:15:46] [INFO ] Flatten gal took : 8 ms
[2025-06-03 05:15:46] [INFO ] Flatten gal took : 9 ms
[2025-06-03 05:15:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality13037862627898154604.gal : 3 ms
[2025-06-03 05:15:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality17169808623788565830.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/CTLCardinality13037862627898154604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17169808623788565830.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 289/289 transitions.
Graph (complete) has 474 edges and 257 vertex of which 236 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Discarding 21 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 235 transition count 226
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 188 transition count 226
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 95 place count 188 transition count 202
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 143 place count 164 transition count 202
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 153 place count 154 transition count 192
Iterating global reduction 2 with 10 rules applied. Total rules applied 163 place count 154 transition count 192
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 171 place count 146 transition count 184
Iterating global reduction 2 with 8 rules applied. Total rules applied 179 place count 146 transition count 184
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 187 place count 138 transition count 173
Iterating global reduction 2 with 8 rules applied. Total rules applied 195 place count 138 transition count 173
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 203 place count 130 transition count 160
Iterating global reduction 2 with 8 rules applied. Total rules applied 211 place count 130 transition count 160
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 216 place count 125 transition count 155
Iterating global reduction 2 with 5 rules applied. Total rules applied 221 place count 125 transition count 155
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 267 place count 102 transition count 132
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 101 transition count 131
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 101 transition count 131
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 270 place count 100 transition count 129
Iterating global reduction 2 with 1 rules applied. Total rules applied 271 place count 100 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 272 place count 99 transition count 128
Iterating global reduction 2 with 1 rules applied. Total rules applied 273 place count 99 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 275 place count 97 transition count 126
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 115 edges and 95 vertex of which 91 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 99 edges and 91 vertex of which 40 / 91 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 2 with 34 rules applied. Total rules applied 309 place count 71 transition count 91
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 50 rules applied. Total rules applied 359 place count 41 transition count 71
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 368 place count 32 transition count 53
Iterating global reduction 4 with 9 rules applied. Total rules applied 377 place count 32 transition count 53
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 386 place count 23 transition count 35
Iterating global reduction 4 with 9 rules applied. Total rules applied 395 place count 23 transition count 35
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 404 place count 14 transition count 17
Iterating global reduction 4 with 9 rules applied. Total rules applied 413 place count 14 transition count 17
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 421 place count 6 transition count 9
Iterating global reduction 4 with 8 rules applied. Total rules applied 429 place count 6 transition count 9
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 430 place count 6 transition count 8
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 431 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 432 place count 5 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 433 place count 4 transition count 6
Applied a total of 433 rules in 45 ms. Remains 4 /257 variables (removed 253) and now considering 6/289 (removed 283) transitions.
[2025-06-03 05:16:46] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2025-06-03 05:16:46] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:16:46] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-03 05:16:46] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2025-06-03 05:16:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:16:46] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 05:16:46] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 05:16:46] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2025-06-03 05:16:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 65 ms.
Refiners :[State Equation: 4/4 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 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/8 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 57 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 126ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/257 places, 6/289 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 217 ms. Remains : 4/257 places, 6/289 transitions.
[2025-06-03 05:16:47] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:16:47] [INFO ] Flatten gal took : 0 ms
[2025-06-03 05:16:47] [INFO ] Input system was already deterministic with 6 transitions.
[2025-06-03 05:16:47] [INFO ] Flatten gal took : 0 ms
[2025-06-03 05:16:47] [INFO ] Flatten gal took : 0 ms
[2025-06-03 05:16:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality13397396319037331702.gal : 0 ms
[2025-06-03 05:16:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality1971556344731891501.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/CTLCardinality13397396319037331702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1971556344731891501.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,176,0.003675,3660,2,17,5,138,6,0,21,138,0


Converting to forward existential form...Done !
original formula: AF((p171==1))
=> equivalent forward existential formula: [FwdG(Init,!((p171==1)))] = FALSE
Hit Full ! (commute/partial/dont) 4/0/2
(forward)formula 0,0,0.005581,3916,1,0,9,216,20,3,116,243,8
FORMULA DiscoveryGPU-PT-10b-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 289/289 transitions.
Graph (complete) has 474 edges and 257 vertex of which 236 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Discarding 21 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 235 transition count 227
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 189 transition count 227
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 93 place count 189 transition count 202
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 143 place count 164 transition count 202
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 153 place count 154 transition count 192
Iterating global reduction 2 with 10 rules applied. Total rules applied 163 place count 154 transition count 192
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 171 place count 146 transition count 184
Iterating global reduction 2 with 8 rules applied. Total rules applied 179 place count 146 transition count 184
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 187 place count 138 transition count 173
Iterating global reduction 2 with 8 rules applied. Total rules applied 195 place count 138 transition count 173
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 203 place count 130 transition count 160
Iterating global reduction 2 with 8 rules applied. Total rules applied 211 place count 130 transition count 160
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 215 place count 126 transition count 156
Iterating global reduction 2 with 4 rules applied. Total rules applied 219 place count 126 transition count 156
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 265 place count 103 transition count 133
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 266 place count 102 transition count 132
Iterating global reduction 2 with 1 rules applied. Total rules applied 267 place count 102 transition count 132
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 101 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 101 transition count 130
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 270 place count 100 transition count 129
Iterating global reduction 2 with 1 rules applied. Total rules applied 271 place count 100 transition count 129
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 273 place count 98 transition count 127
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 116 edges and 96 vertex of which 92 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 101 edges and 92 vertex of which 40 / 92 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 2 with 34 rules applied. Total rules applied 307 place count 72 transition count 92
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 50 rules applied. Total rules applied 357 place count 42 transition count 72
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 365 place count 34 transition count 56
Iterating global reduction 4 with 8 rules applied. Total rules applied 373 place count 34 transition count 56
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 381 place count 26 transition count 40
Iterating global reduction 4 with 8 rules applied. Total rules applied 389 place count 26 transition count 40
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 397 place count 18 transition count 24
Iterating global reduction 4 with 8 rules applied. Total rules applied 405 place count 18 transition count 24
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 413 place count 10 transition count 16
Iterating global reduction 4 with 8 rules applied. Total rules applied 421 place count 10 transition count 16
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 422 place count 10 transition count 15
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 423 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 424 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 426 place count 7 transition count 12
Applied a total of 426 rules in 67 ms. Remains 7 /257 variables (removed 250) and now considering 12/289 (removed 277) transitions.
[2025-06-03 05:16:47] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 7 cols
[2025-06-03 05:16:47] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:16:47] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-03 05:16:47] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2025-06-03 05:16:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:16:47] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 05:16:47] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-03 05:16:47] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2025-06-03 05:16:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 161 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/15 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 157 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 324ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/257 places, 12/289 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 503 ms. Remains : 7/257 places, 12/289 transitions.
[2025-06-03 05:16:47] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:16:47] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:16:47] [INFO ] Input system was already deterministic with 12 transitions.
[2025-06-03 05:16:47] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:16:47] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:16:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality4713808044837770821.gal : 1 ms
[2025-06-03 05:16:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality348985712865844949.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/CTLCardinality4713808044837770821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality348985712865844949.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,330,0.005338,3788,2,21,5,135,6,0,34,129,0


Converting to forward existential form...Done !
original formula: EG(EF((p182==0)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p182==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t11, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...171
(forward)formula 0,1,0.011207,3916,1,0,28,379,45,18,205,473,38
FORMULA DiscoveryGPU-PT-10b-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 289/289 transitions.
Graph (complete) has 474 edges and 257 vertex of which 237 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 236 transition count 228
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 190 transition count 228
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 93 place count 190 transition count 203
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 143 place count 165 transition count 203
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 153 place count 155 transition count 193
Iterating global reduction 2 with 10 rules applied. Total rules applied 163 place count 155 transition count 193
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 171 place count 147 transition count 185
Iterating global reduction 2 with 8 rules applied. Total rules applied 179 place count 147 transition count 185
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 187 place count 139 transition count 174
Iterating global reduction 2 with 8 rules applied. Total rules applied 195 place count 139 transition count 174
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 202 place count 132 transition count 163
Iterating global reduction 2 with 7 rules applied. Total rules applied 209 place count 132 transition count 163
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 213 place count 128 transition count 159
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 128 transition count 159
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 263 place count 105 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 264 place count 104 transition count 135
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 104 transition count 135
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 266 place count 103 transition count 133
Iterating global reduction 2 with 1 rules applied. Total rules applied 267 place count 103 transition count 133
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 102 transition count 132
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 102 transition count 132
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 271 place count 102 transition count 132
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 273 place count 100 transition count 130
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 119 edges and 98 vertex of which 94 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 102 edges and 94 vertex of which 40 / 94 are part of one of the 20 SCC in 1 ms
Free SCC test removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 2 with 33 rules applied. Total rules applied 306 place count 74 transition count 96
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 49 rules applied. Total rules applied 355 place count 45 transition count 76
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 363 place count 37 transition count 60
Iterating global reduction 4 with 8 rules applied. Total rules applied 371 place count 37 transition count 60
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 378 place count 30 transition count 46
Iterating global reduction 4 with 7 rules applied. Total rules applied 385 place count 30 transition count 46
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 392 place count 23 transition count 32
Iterating global reduction 4 with 7 rules applied. Total rules applied 399 place count 23 transition count 32
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 406 place count 16 transition count 25
Iterating global reduction 4 with 7 rules applied. Total rules applied 413 place count 16 transition count 25
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 414 place count 16 transition count 24
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 415 place count 16 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 416 place count 15 transition count 23
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 419 place count 12 transition count 20
Applied a total of 419 rules in 63 ms. Remains 12 /257 variables (removed 245) and now considering 20/289 (removed 269) transitions.
[2025-06-03 05:16:47] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
// Phase 1: matrix 16 rows 12 cols
[2025-06-03 05:16:47] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:16:47] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-03 05:16:47] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
[2025-06-03 05:16:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:16:47] [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 05:16:47] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-03 05:16:47] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
[2025-06-03 05:16:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 15/24 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 3/27 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/28 variables, and 12 constraints, problems are : Problem set: 0 solved, 14 unsolved in 296 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 15/24 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 3/27 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/28 variables, and 26 constraints, problems are : Problem set: 0 solved, 14 unsolved in 322 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 624ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 624ms
Starting structural reductions in SI_CTL mode, iteration 1 : 12/257 places, 20/289 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 766 ms. Remains : 12/257 places, 20/289 transitions.
[2025-06-03 05:16:48] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:16:48] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:16:48] [INFO ] Input system was already deterministic with 20 transitions.
[2025-06-03 05:16:48] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:16:48] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:16:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality8703785445981832496.gal : 0 ms
[2025-06-03 05:16:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality1087843792996141832.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/CTLCardinality8703785445981832496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1087843792996141832.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1638,0.008062,3752,2,30,5,289,6,0,58,327,0


Converting to forward existential form...Done !
original formula: AF(E((p229==1) U (p190==1)))
=> equivalent forward existential formula: [FwdG(Init,!(E((p229==1) U (p190==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t9, t10, t18, t19, Intersection with reachable at each step enabled. (destroyed/reve...186
(forward)formula 0,0,0.033432,4392,1,0,105,3049,61,82,314,5016,118
FORMULA DiscoveryGPU-PT-10b-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 289/289 transitions.
Graph (complete) has 474 edges and 257 vertex of which 236 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Discarding 21 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 235 transition count 228
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 190 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 189 transition count 227
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 93 place count 189 transition count 203
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 141 place count 165 transition count 203
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 151 place count 155 transition count 193
Iterating global reduction 3 with 10 rules applied. Total rules applied 161 place count 155 transition count 193
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 169 place count 147 transition count 185
Iterating global reduction 3 with 8 rules applied. Total rules applied 177 place count 147 transition count 185
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 185 place count 139 transition count 174
Iterating global reduction 3 with 8 rules applied. Total rules applied 193 place count 139 transition count 174
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 201 place count 131 transition count 161
Iterating global reduction 3 with 8 rules applied. Total rules applied 209 place count 131 transition count 161
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 214 place count 126 transition count 156
Iterating global reduction 3 with 5 rules applied. Total rules applied 219 place count 126 transition count 156
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 263 place count 104 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 264 place count 103 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 265 place count 103 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 102 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 102 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 268 place count 101 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 101 transition count 130
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 271 place count 99 transition count 128
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 119 edges and 97 vertex of which 93 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 97 edges and 93 vertex of which 38 / 93 are part of one of the 19 SCC in 0 ms
Free SCC test removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 3 with 33 rules applied. Total rules applied 304 place count 74 transition count 94
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 49 rules applied. Total rules applied 353 place count 45 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 354 place count 44 transition count 74
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 362 place count 36 transition count 58
Iterating global reduction 6 with 8 rules applied. Total rules applied 370 place count 36 transition count 58
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 377 place count 29 transition count 44
Iterating global reduction 6 with 7 rules applied. Total rules applied 384 place count 29 transition count 44
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 391 place count 22 transition count 30
Iterating global reduction 6 with 7 rules applied. Total rules applied 398 place count 22 transition count 30
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 405 place count 15 transition count 23
Iterating global reduction 6 with 7 rules applied. Total rules applied 412 place count 15 transition count 23
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 414 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 6 with 1 rules applied. Total rules applied 415 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 6 with 1 rules applied. Total rules applied 416 place count 14 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 417 place count 13 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 418 place count 12 transition count 19
Applied a total of 418 rules in 60 ms. Remains 12 /257 variables (removed 245) and now considering 19/289 (removed 270) transitions.
[2025-06-03 05:16:48] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 12 cols
[2025-06-03 05:16:48] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:16:48] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-03 05:16:48] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2025-06-03 05:16:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:16:48] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 05:16:48] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-03 05:16:48] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2025-06-03 05:16:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 15/24 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 3/27 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/28 variables, and 12 constraints, problems are : Problem set: 0 solved, 14 unsolved in 283 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 15/24 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 3/27 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/28 variables, and 26 constraints, problems are : Problem set: 0 solved, 14 unsolved in 323 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 610ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 610ms
Starting structural reductions in SI_CTL mode, iteration 1 : 12/257 places, 19/289 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 738 ms. Remains : 12/257 places, 19/289 transitions.
[2025-06-03 05:16:49] [INFO ] Flatten gal took : 2 ms
[2025-06-03 05:16:49] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:16:49] [INFO ] Input system was already deterministic with 19 transitions.
[2025-06-03 05:16:49] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:16:49] [INFO ] Flatten gal took : 2 ms
[2025-06-03 05:16:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality16168666803518414623.gal : 0 ms
[2025-06-03 05:16:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality4350471766882563931.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/CTLCardinality16168666803518414623.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4350471766882563931.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,1551,0.010207,3880,2,62,5,579,6,0,60,751,0


Converting to forward existential form...Done !
original formula: AG((!(E((p76==1) U (p64==1))) + (p106==0)))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((p106==0))),(p76==1)) * (p64==1))] = FALSE
Hit Full ! (commute/partial/dont) 16/0/3
(forward)formula 0,0,0.012512,4136,1,0,12,579,17,3,119,751,5
FORMULA DiscoveryGPU-PT-10b-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 289/289 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 252 transition count 289
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 32 place count 225 transition count 262
Iterating global reduction 1 with 27 rules applied. Total rules applied 59 place count 225 transition count 262
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 66 place count 218 transition count 255
Iterating global reduction 1 with 7 rules applied. Total rules applied 73 place count 218 transition count 255
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 80 place count 211 transition count 248
Iterating global reduction 1 with 7 rules applied. Total rules applied 87 place count 211 transition count 248
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 94 place count 204 transition count 240
Iterating global reduction 1 with 7 rules applied. Total rules applied 101 place count 204 transition count 240
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 107 place count 198 transition count 229
Iterating global reduction 1 with 6 rules applied. Total rules applied 113 place count 198 transition count 229
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 118 place count 193 transition count 224
Iterating global reduction 1 with 5 rules applied. Total rules applied 123 place count 193 transition count 224
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 127 place count 189 transition count 220
Iterating global reduction 1 with 4 rules applied. Total rules applied 131 place count 189 transition count 220
Applied a total of 131 rules in 28 ms. Remains 189 /257 variables (removed 68) and now considering 220/289 (removed 69) transitions.
// Phase 1: matrix 220 rows 189 cols
[2025-06-03 05:16:49] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:16:49] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-03 05:16:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:16:49] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-06-03 05:16:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 220/408 variables, 188/190 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:16:59] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:16:59] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:16:59] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:16:59] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:17:00] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:17:00] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:17:00] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:17:00] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:17:00] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:17:01] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:17:01] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:17:01] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:17:01] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:17:01] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:17:01] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:17:01] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:17:01] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:17:02] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:17:02] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:17:02] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 1/409 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 3.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 409/409 variables, and 211 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/408 variables, 188/210 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 218/428 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 1/409 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/409 variables, and 430 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Starting structural reductions in LTL mode, iteration 1 : 189/257 places, 220/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60667 ms. Remains : 189/257 places, 220/289 transitions.
[2025-06-03 05:17:49] [INFO ] Flatten gal took : 14 ms
[2025-06-03 05:17:49] [INFO ] Flatten gal took : 13 ms
[2025-06-03 05:17:49] [INFO ] Input system was already deterministic with 220 transitions.
[2025-06-03 05:17:49] [INFO ] Flatten gal took : 13 ms
[2025-06-03 05:17:49] [INFO ] Flatten gal took : 11 ms
[2025-06-03 05:17:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality13827354196295145351.gal : 4 ms
[2025-06-03 05:17:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality5036673147546570048.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/CTLCardinality13827354196295145351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5036673147546570048.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 05:18:19] [INFO ] Flatten gal took : 8 ms
[2025-06-03 05:18:19] [INFO ] Applying decomposition
[2025-06-03 05:18:19] [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/graph9926411099219231153.txt' '-o' '/tmp/graph9926411099219231153.bin' '-w' '/tmp/graph9926411099219231153.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9926411099219231153.bin' '-l' '-1' '-v' '-w' '/tmp/graph9926411099219231153.weights' '-q' '0' '-e' '0.001'
[2025-06-03 05:18:20] [INFO ] Decomposing Gal with order
[2025-06-03 05:18:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 05:18:20] [INFO ] Removed a total of 81 redundant transitions.
[2025-06-03 05:18:20] [INFO ] Flatten gal took : 24 ms
[2025-06-03 05:18:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 6 ms.
[2025-06-03 05:18:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality12798675950286430.gal : 8 ms
[2025-06-03 05:18:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality9834128017385854214.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/CTLCardinality12798675950286430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9834128017385854214.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 289/289 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 252 transition count 289
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 35 place count 222 transition count 259
Iterating global reduction 1 with 30 rules applied. Total rules applied 65 place count 222 transition count 259
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 74 place count 213 transition count 250
Iterating global reduction 1 with 9 rules applied. Total rules applied 83 place count 213 transition count 250
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 92 place count 204 transition count 241
Iterating global reduction 1 with 9 rules applied. Total rules applied 101 place count 204 transition count 241
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 110 place count 195 transition count 231
Iterating global reduction 1 with 9 rules applied. Total rules applied 119 place count 195 transition count 231
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 128 place count 186 transition count 214
Iterating global reduction 1 with 9 rules applied. Total rules applied 137 place count 186 transition count 214
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 144 place count 179 transition count 207
Iterating global reduction 1 with 7 rules applied. Total rules applied 151 place count 179 transition count 207
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 158 place count 172 transition count 200
Iterating global reduction 1 with 7 rules applied. Total rules applied 165 place count 172 transition count 200
Applied a total of 165 rules in 24 ms. Remains 172 /257 variables (removed 85) and now considering 200/289 (removed 89) transitions.
// Phase 1: matrix 200 rows 172 cols
[2025-06-03 05:18:50] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:18:50] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-03 05:18:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:18:50] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2025-06-03 05:18: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/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (OVERLAPS) 200/371 variables, 171/173 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:18:58] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:18:58] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:18:59] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:18:59] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:18:59] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:18:59] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:18:59] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:18:59] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:19:00] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:19:00] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 10/183 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 1/372 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/372 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 184 constraints, problems are : Problem set: 0 solved, 199 unsolved in 28730 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/371 variables, 171/183 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 198/381 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 1/372 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (OVERLAPS) 0/372 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 383 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58783ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 58785ms
Starting structural reductions in LTL mode, iteration 1 : 172/257 places, 200/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59112 ms. Remains : 172/257 places, 200/289 transitions.
[2025-06-03 05:19:49] [INFO ] Flatten gal took : 12 ms
[2025-06-03 05:19:49] [INFO ] Flatten gal took : 10 ms
[2025-06-03 05:19:49] [INFO ] Input system was already deterministic with 200 transitions.
[2025-06-03 05:19:49] [INFO ] Flatten gal took : 11 ms
[2025-06-03 05:19:49] [INFO ] Flatten gal took : 10 ms
[2025-06-03 05:19:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality7534761528907888705.gal : 3 ms
[2025-06-03 05:19:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality13036957937713345302.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/CTLCardinality7534761528907888705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13036957937713345302.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 05:20:19] [INFO ] Flatten gal took : 7 ms
[2025-06-03 05:20:19] [INFO ] Applying decomposition
[2025-06-03 05:20:19] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13430743615411480480.txt' '-o' '/tmp/graph13430743615411480480.bin' '-w' '/tmp/graph13430743615411480480.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13430743615411480480.bin' '-l' '-1' '-v' '-w' '/tmp/graph13430743615411480480.weights' '-q' '0' '-e' '0.001'
[2025-06-03 05:20:19] [INFO ] Decomposing Gal with order
[2025-06-03 05:20:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 05:20:19] [INFO ] Removed a total of 74 redundant transitions.
[2025-06-03 05:20:19] [INFO ] Flatten gal took : 14 ms
[2025-06-03 05:20:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2025-06-03 05:20:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality12647733103638104312.gal : 3 ms
[2025-06-03 05:20:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality13174656462046067862.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/CTLCardinality12647733103638104312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13174656462046067862.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 : 257/257 places, 289/289 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 252 transition count 289
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 34 place count 223 transition count 260
Iterating global reduction 1 with 29 rules applied. Total rules applied 63 place count 223 transition count 260
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 71 place count 215 transition count 252
Iterating global reduction 1 with 8 rules applied. Total rules applied 79 place count 215 transition count 252
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 87 place count 207 transition count 244
Iterating global reduction 1 with 8 rules applied. Total rules applied 95 place count 207 transition count 244
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 103 place count 199 transition count 235
Iterating global reduction 1 with 8 rules applied. Total rules applied 111 place count 199 transition count 235
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 118 place count 192 transition count 222
Iterating global reduction 1 with 7 rules applied. Total rules applied 125 place count 192 transition count 222
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 132 place count 185 transition count 215
Iterating global reduction 1 with 7 rules applied. Total rules applied 139 place count 185 transition count 215
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 145 place count 179 transition count 209
Iterating global reduction 1 with 6 rules applied. Total rules applied 151 place count 179 transition count 209
Applied a total of 151 rules in 18 ms. Remains 179 /257 variables (removed 78) and now considering 209/289 (removed 80) transitions.
// Phase 1: matrix 209 rows 179 cols
[2025-06-03 05:20:49] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:20:49] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-03 05:20:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:20:49] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-06-03 05:20:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (OVERLAPS) 209/387 variables, 178/180 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:20:58] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:20:59] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:20:59] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:20:59] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:20:59] [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 05:20:59] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:20:59] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:21:00] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:21:00] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:21:00] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 10/190 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 1/388 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/388 variables, and 191 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/387 variables, 178/190 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 207/397 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 1/388 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 399 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in LTL mode, iteration 1 : 179/257 places, 209/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60386 ms. Remains : 179/257 places, 209/289 transitions.
[2025-06-03 05:21:49] [INFO ] Flatten gal took : 8 ms
[2025-06-03 05:21:49] [INFO ] Flatten gal took : 8 ms
[2025-06-03 05:21:49] [INFO ] Input system was already deterministic with 209 transitions.
[2025-06-03 05:21:50] [INFO ] Flatten gal took : 10 ms
[2025-06-03 05:21:50] [INFO ] Flatten gal took : 8 ms
[2025-06-03 05:21:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality18132924240075266312.gal : 1 ms
[2025-06-03 05:21:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality18345428570806689943.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/CTLCardinality18132924240075266312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18345428570806689943.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 05:22:20] [INFO ] Flatten gal took : 6 ms
[2025-06-03 05:22:20] [INFO ] Applying decomposition
[2025-06-03 05:22:20] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16379453757233913399.txt' '-o' '/tmp/graph16379453757233913399.bin' '-w' '/tmp/graph16379453757233913399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16379453757233913399.bin' '-l' '-1' '-v' '-w' '/tmp/graph16379453757233913399.weights' '-q' '0' '-e' '0.001'
[2025-06-03 05:22:20] [INFO ] Decomposing Gal with order
[2025-06-03 05:22:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 05:22:20] [INFO ] Removed a total of 79 redundant transitions.
[2025-06-03 05:22:20] [INFO ] Flatten gal took : 14 ms
[2025-06-03 05:22:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 2 ms.
[2025-06-03 05:22:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality3928124218804631334.gal : 3 ms
[2025-06-03 05:22:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality5930925910579063772.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/CTLCardinality3928124218804631334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5930925910579063772.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 : 257/257 places, 289/289 transitions.
Graph (complete) has 474 edges and 257 vertex of which 240 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 239 transition count 234
Reduce places removed 41 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 46 rules applied. Total rules applied 88 place count 198 transition count 229
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 93 place count 193 transition count 229
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 93 place count 193 transition count 204
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 143 place count 168 transition count 204
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 151 place count 160 transition count 196
Iterating global reduction 3 with 8 rules applied. Total rules applied 159 place count 160 transition count 196
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 165 place count 154 transition count 190
Iterating global reduction 3 with 6 rules applied. Total rules applied 171 place count 154 transition count 190
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 176 place count 149 transition count 183
Iterating global reduction 3 with 5 rules applied. Total rules applied 181 place count 149 transition count 183
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 186 place count 144 transition count 175
Iterating global reduction 3 with 5 rules applied. Total rules applied 191 place count 144 transition count 175
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 194 place count 141 transition count 172
Iterating global reduction 3 with 3 rules applied. Total rules applied 197 place count 141 transition count 172
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 237 place count 121 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 238 place count 120 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 239 place count 120 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 240 place count 119 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 241 place count 119 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 242 place count 118 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 243 place count 118 transition count 148
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 246 place count 118 transition count 148
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 248 place count 116 transition count 146
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 141 edges and 114 vertex of which 110 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 102 edges and 110 vertex of which 34 / 110 are part of one of the 17 SCC in 1 ms
Free SCC test removed 17 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 3 with 31 rules applied. Total rules applied 279 place count 93 transition count 114
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 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 47 rules applied. Total rules applied 326 place count 66 transition count 94
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 330 place count 64 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 332 place count 62 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 332 place count 62 transition count 91
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 334 place count 61 transition count 91
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 339 place count 56 transition count 81
Iterating global reduction 7 with 5 rules applied. Total rules applied 344 place count 56 transition count 81
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 348 place count 52 transition count 73
Iterating global reduction 7 with 4 rules applied. Total rules applied 352 place count 52 transition count 73
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 356 place count 48 transition count 65
Iterating global reduction 7 with 4 rules applied. Total rules applied 360 place count 48 transition count 65
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 364 place count 44 transition count 61
Iterating global reduction 7 with 4 rules applied. Total rules applied 368 place count 44 transition count 61
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 376 place count 40 transition count 57
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 378 place count 39 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 380 place count 39 transition count 54
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 381 place count 39 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 382 place count 38 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 383 place count 37 transition count 52
Applied a total of 383 rules in 42 ms. Remains 37 /257 variables (removed 220) and now considering 52/289 (removed 237) transitions.
[2025-06-03 05:22:50] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
// Phase 1: matrix 45 rows 37 cols
[2025-06-03 05:22:50] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:22:50] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-03 05:22:50] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
[2025-06-03 05:22:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:22:50] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 05:22:50] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2025-06-03 05:22:50] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
[2025-06-03 05:22: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/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 44/76 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 5/81 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 0/81 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/82 variables, and 37 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1471 ms.
Refiners :[State Equation: 37/37 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 44/76 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 37/69 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 5/81 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/82 variables, and 84 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1490 ms.
Refiners :[State Equation: 37/37 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2965ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 2966ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/257 places, 52/289 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3086 ms. Remains : 37/257 places, 52/289 transitions.
[2025-06-03 05:22:53] [INFO ] Flatten gal took : 2 ms
[2025-06-03 05:22:53] [INFO ] Flatten gal took : 2 ms
[2025-06-03 05:22:53] [INFO ] Input system was already deterministic with 52 transitions.
[2025-06-03 05:22:53] [INFO ] Flatten gal took : 2 ms
[2025-06-03 05:22:53] [INFO ] Flatten gal took : 2 ms
[2025-06-03 05:22:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality16557536484167869293.gal : 1 ms
[2025-06-03 05:22:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality16381900790291509701.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/CTLCardinality16557536484167869293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16381900790291509701.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,408336,0.010166,3932,2,97,5,594,6,0,180,580,0


Converting to forward existential form...Done !
original formula: E(((p18==0)||(p12==1)) U (E((((p5==1) * AG(((p257==0)||(p153==1)))) * AF(((p130==0)||(p33==1)))) U ((p159==0)||(p132==1))) * AF((EF((p56=...174
=> equivalent forward existential formula: [((FwdU(Init,((p18==0)||(p12==1))) * E((((p5==1) * !(E(TRUE U !(((p257==0)||(p153==1)))))) * !(EG(!(((p130==0)||...250
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t11, t16, t17, t25, t43, t46, t48, Intersection with reachable at each step enabled....202
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 48/0/4
(forward)formula 0,1,0.202775,10844,1,0,357,37732,146,230,1164,60647,391
FORMULA DiscoveryGPU-PT-10b-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 289/289 transitions.
Graph (complete) has 474 edges and 257 vertex of which 236 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Discarding 21 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 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 235 transition count 229
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 191 transition count 229
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 89 place count 191 transition count 204
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 139 place count 166 transition count 204
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 150 place count 155 transition count 193
Iterating global reduction 2 with 11 rules applied. Total rules applied 161 place count 155 transition count 193
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 169 place count 147 transition count 185
Iterating global reduction 2 with 8 rules applied. Total rules applied 177 place count 147 transition count 185
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 185 place count 139 transition count 174
Iterating global reduction 2 with 8 rules applied. Total rules applied 193 place count 139 transition count 174
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 201 place count 131 transition count 161
Iterating global reduction 2 with 8 rules applied. Total rules applied 209 place count 131 transition count 161
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 213 place count 127 transition count 157
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 127 transition count 157
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 259 place count 106 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 260 place count 105 transition count 135
Iterating global reduction 2 with 1 rules applied. Total rules applied 261 place count 105 transition count 135
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 262 place count 104 transition count 133
Iterating global reduction 2 with 1 rules applied. Total rules applied 263 place count 104 transition count 133
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 264 place count 103 transition count 132
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 103 transition count 132
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 266 place count 103 transition count 132
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 268 place count 101 transition count 130
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 119 edges and 99 vertex of which 95 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 96 edges and 95 vertex of which 38 / 95 are part of one of the 19 SCC in 0 ms
Free SCC test removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 2 with 30 rules applied. Total rules applied 298 place count 76 transition count 99
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 46 rules applied. Total rules applied 344 place count 50 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 345 place count 49 transition count 79
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 353 place count 41 transition count 63
Iterating global reduction 5 with 8 rules applied. Total rules applied 361 place count 41 transition count 63
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 367 place count 35 transition count 51
Iterating global reduction 5 with 6 rules applied. Total rules applied 373 place count 35 transition count 51
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 378 place count 30 transition count 41
Iterating global reduction 5 with 5 rules applied. Total rules applied 383 place count 30 transition count 41
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 387 place count 26 transition count 37
Iterating global reduction 5 with 4 rules applied. Total rules applied 391 place count 26 transition count 37
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 392 place count 26 transition count 36
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 394 place count 25 transition count 35
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 399 place count 20 transition count 30
Applied a total of 399 rules in 56 ms. Remains 20 /257 variables (removed 237) and now considering 30/289 (removed 259) transitions.
[2025-06-03 05:22:53] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
// Phase 1: matrix 24 rows 20 cols
[2025-06-03 05:22:53] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:22:53] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-03 05:22:53] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2025-06-03 05:22:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:22:53] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 05:22:53] [INFO ] Redundant transitions in 1 ms returned []
Running 19 sub problems to find dead transitions.
[2025-06-03 05:22:53] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2025-06-03 05:22:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 23/37 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 6/43 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/44 variables, and 20 constraints, problems are : Problem set: 0 solved, 19 unsolved in 437 ms.
Refiners :[State Equation: 20/20 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 23/37 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 6/43 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/44 variables, and 39 constraints, problems are : Problem set: 0 solved, 19 unsolved in 477 ms.
Refiners :[State Equation: 20/20 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 916ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 916ms
Starting structural reductions in SI_CTL mode, iteration 1 : 20/257 places, 30/289 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1057 ms. Remains : 20/257 places, 30/289 transitions.
[2025-06-03 05:22:54] [INFO ] Flatten gal took : 2 ms
[2025-06-03 05:22:54] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:22:54] [INFO ] Input system was already deterministic with 30 transitions.
[2025-06-03 05:22:54] [INFO ] Flatten gal took : 2 ms
[2025-06-03 05:22:54] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:22:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality17742863625864899091.gal : 0 ms
[2025-06-03 05:22:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality18164495636322540768.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/CTLCardinality17742863625864899091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18164495636322540768.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,47130,0.007872,3820,2,116,5,561,6,0,96,628,0


Converting to forward existential form...Done !
original formula: EG(EF((((AG((p101==1)) + (p185==0)) + ((p84==0)||(p224==1))) + (p269==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((!(E(TRUE U !((p101==1)))) + (p185==0)) + ((p84==0)||(p224==1))) + (p269==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t8, t13, t23, t26, t27, t28, t29, Intersection with reachable at each step enabled. ...201
(forward)formula 0,1,0.031914,4972,1,0,63,5570,82,36,568,5984,76
FORMULA DiscoveryGPU-PT-10b-CTLCardinality-2023-13 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 : 257/257 places, 289/289 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 252 transition count 289
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 34 place count 223 transition count 260
Iterating global reduction 1 with 29 rules applied. Total rules applied 63 place count 223 transition count 260
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 218 transition count 255
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 218 transition count 255
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 78 place count 213 transition count 250
Iterating global reduction 1 with 5 rules applied. Total rules applied 83 place count 213 transition count 250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 87 place count 209 transition count 245
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 209 transition count 245
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 95 place count 205 transition count 238
Iterating global reduction 1 with 4 rules applied. Total rules applied 99 place count 205 transition count 238
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 102 place count 202 transition count 235
Iterating global reduction 1 with 3 rules applied. Total rules applied 105 place count 202 transition count 235
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 200 transition count 233
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 200 transition count 233
Applied a total of 109 rules in 31 ms. Remains 200 /257 variables (removed 57) and now considering 233/289 (removed 56) transitions.
// Phase 1: matrix 233 rows 200 cols
[2025-06-03 05:22:54] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:22:54] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-03 05:22:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:22:55] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2025-06-03 05:22:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 233/432 variables, 199/201 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:05] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:06] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:06] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:06] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:06] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:06] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:07] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:07] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:07] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:07] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 1/433 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/433 variables, and 212 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 233/432 variables, 199/211 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 231/442 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 1/433 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/433 variables, and 444 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in LTL mode, iteration 1 : 200/257 places, 233/289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60538 ms. Remains : 200/257 places, 233/289 transitions.
[2025-06-03 05:23:55] [INFO ] Flatten gal took : 12 ms
[2025-06-03 05:23:55] [INFO ] Flatten gal took : 11 ms
[2025-06-03 05:23:55] [INFO ] Input system was already deterministic with 233 transitions.
[2025-06-03 05:23:55] [INFO ] Flatten gal took : 18 ms
[2025-06-03 05:23:55] [INFO ] Flatten gal took : 10 ms
[2025-06-03 05:23:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality8444318055217337133.gal : 2 ms
[2025-06-03 05:23:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality14087419169837726225.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/CTLCardinality8444318055217337133.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14087419169837726225.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 05:24:25] [INFO ] Flatten gal took : 6 ms
[2025-06-03 05:24:25] [INFO ] Applying decomposition
[2025-06-03 05:24:25] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3875831333298018394.txt' '-o' '/tmp/graph3875831333298018394.bin' '-w' '/tmp/graph3875831333298018394.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3875831333298018394.bin' '-l' '-1' '-v' '-w' '/tmp/graph3875831333298018394.weights' '-q' '0' '-e' '0.001'
[2025-06-03 05:24:25] [INFO ] Decomposing Gal with order
[2025-06-03 05:24:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 05:24:25] [INFO ] Removed a total of 89 redundant transitions.
[2025-06-03 05:24:25] [INFO ] Flatten gal took : 13 ms
[2025-06-03 05:24:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2025-06-03 05:24:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality16376326459776707248.gal : 3 ms
[2025-06-03 05:24:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality15404175750145872590.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/CTLCardinality16376326459776707248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15404175750145872590.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 SI_CTL mode, iteration 0 : 257/257 places, 289/289 transitions.
Graph (complete) has 474 edges and 257 vertex of which 236 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 235 transition count 226
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 188 transition count 226
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 95 place count 188 transition count 201
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 145 place count 163 transition count 201
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 155 place count 153 transition count 191
Iterating global reduction 2 with 10 rules applied. Total rules applied 165 place count 153 transition count 191
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 172 place count 146 transition count 184
Iterating global reduction 2 with 7 rules applied. Total rules applied 179 place count 146 transition count 184
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 186 place count 139 transition count 174
Iterating global reduction 2 with 7 rules applied. Total rules applied 193 place count 139 transition count 174
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 200 place count 132 transition count 163
Iterating global reduction 2 with 7 rules applied. Total rules applied 207 place count 132 transition count 163
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 211 place count 128 transition count 159
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 128 transition count 159
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 261 place count 105 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 262 place count 104 transition count 135
Iterating global reduction 2 with 1 rules applied. Total rules applied 263 place count 104 transition count 135
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 264 place count 103 transition count 133
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 103 transition count 133
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 266 place count 102 transition count 132
Iterating global reduction 2 with 1 rules applied. Total rules applied 267 place count 102 transition count 132
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 269 place count 100 transition count 130
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 119 edges and 98 vertex of which 94 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 103 edges and 94 vertex of which 40 / 94 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
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 2 with 35 rules applied. Total rules applied 304 place count 74 transition count 94
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 355 place count 43 transition count 74
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 363 place count 35 transition count 58
Iterating global reduction 4 with 8 rules applied. Total rules applied 371 place count 35 transition count 58
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 379 place count 27 transition count 42
Iterating global reduction 4 with 8 rules applied. Total rules applied 387 place count 27 transition count 42
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 395 place count 19 transition count 26
Iterating global reduction 4 with 8 rules applied. Total rules applied 403 place count 19 transition count 26
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 411 place count 11 transition count 18
Iterating global reduction 4 with 8 rules applied. Total rules applied 419 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 420 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 421 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 422 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 424 place count 8 transition count 14
Applied a total of 424 rules in 29 ms. Remains 8 /257 variables (removed 249) and now considering 14/289 (removed 275) transitions.
[2025-06-03 05:24:55] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2025-06-03 05:24:55] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:24:55] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-03 05:24:55] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2025-06-03 05:24:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:24:55] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 05:24:55] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2025-06-03 05:24:55] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2025-06-03 05:24:55] [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 151 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 187 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 344ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 346ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/257 places, 14/289 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 476 ms. Remains : 8/257 places, 14/289 transitions.
[2025-06-03 05:24:55] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:24:55] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:24:55] [INFO ] Input system was already deterministic with 14 transitions.
[2025-06-03 05:24:55] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:24:55] [INFO ] Flatten gal took : 0 ms
[2025-06-03 05:24:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality7787806255226635283.gal : 1 ms
[2025-06-03 05:24:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality16231442137657285770.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/CTLCardinality7787806255226635283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16231442137657285770.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,385,0.005072,3788,2,23,5,145,6,0,39,138,0


Converting to forward existential form...Done !
original formula: AF((p152==1))
=> equivalent forward existential formula: [FwdG(Init,!((p152==1)))] = FALSE
Hit Full ! (commute/partial/dont) 12/0/2
(forward)formula 0,0,0.007522,3916,1,0,8,291,20,4,198,309,8
FORMULA DiscoveryGPU-PT-10b-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-06-03 05:24:55] [INFO ] Flatten gal took : 10 ms
[2025-06-03 05:24:55] [INFO ] Flatten gal took : 10 ms
[2025-06-03 05:24:55] [INFO ] Applying decomposition
[2025-06-03 05:24:56] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12468205457347893093.txt' '-o' '/tmp/graph12468205457347893093.bin' '-w' '/tmp/graph12468205457347893093.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12468205457347893093.bin' '-l' '-1' '-v' '-w' '/tmp/graph12468205457347893093.weights' '-q' '0' '-e' '0.001'
[2025-06-03 05:24:56] [INFO ] Decomposing Gal with order
[2025-06-03 05:24:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 05:24:56] [INFO ] Removed a total of 90 redundant transitions.
[2025-06-03 05:24:56] [INFO ] Flatten gal took : 24 ms
[2025-06-03 05:24:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 05:24:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality8124220172262239468.gal : 5 ms
[2025-06-03 05:24:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality5170153452430526487.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/CTLCardinality8124220172262239468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5170153452430526487.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 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,8.84221e+14,23.0785,558708,13861,53,882948,2862,600,2.98866e+06,61,26412,0


Converting to forward existential form...Done !
original formula: EG(EX((((i16.i1.u56.p186==0) * EF((i16.i0.u57.p178==0))) + ((((i24.u85.p267==0)&&(i3.u12.p11==0))&&((i0.i2.u2.p4==0)&&(i18.i1.u70.p212==1...189
=> equivalent forward existential formula: [FwdG(Init,EX((((i16.i1.u56.p186==0) * E(TRUE U (i16.i0.u57.p178==0))) + ((((i24.u85.p267==0)&&(i3.u12.p11==0))&...244
Reverse transition relation is NOT exact ! Due to transitions t270, t272, u92.t5, u92.t6, i2.i0.u5.t181, i2.i1.u10.t281, i3.u12.t183, i4.i0.u16.t161, i4.i1...830
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Detected timeout of ITS tools.
[2025-06-03 05:49:17] [INFO ] Applying decomposition
[2025-06-03 05:49:17] [INFO ] Flatten gal took : 7 ms
[2025-06-03 05:49:17] [INFO ] Decomposing Gal with order
[2025-06-03 05:49:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 05:49:17] [INFO ] Removed a total of 90 redundant transitions.
[2025-06-03 05:49:17] [INFO ] Flatten gal took : 15 ms
[2025-06-03 05:49:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 561 labels/synchronizations in 16 ms.
[2025-06-03 05:49:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality17905869057055814916.gal : 2 ms
[2025-06-03 05:49:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality15097523750410282649.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17905869057055814916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15097523750410282649.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 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,8.84221e+14,17.3975,351084,600,1483,501466,167520,323,1.43954e+06,235,1.31876e+06,0


Converting to forward existential form...Done !
original formula: EG(EX((((i0.i0.i0.i0.u16.p186==0) * EF((i0.i0.i0.i0.u16.p178==0))) + ((((i0.u19.p267==0)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.p11==0))&&((i0....239
=> equivalent forward existential formula: [FwdG(Init,EX((((i0.i0.i0.i0.u16.p186==0) * E(TRUE U (i0.i0.i0.i0.u16.p178==0))) + ((((i0.u19.p267==0)&&(i0.i0.i...294
Reverse transition relation is NOT exact ! Due to transitions t272, i0.t13, i0.u19.t22, i0.u19.t24, i0.u19.t26, i0.i0.u18.t39, i0.i0.u18.t40, i0.i0.u18.t42...1317
Using 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,1293.04,3311156,1,0,2.79309e+06,5.96631e+06,678,8.12642e+06,662,2.1816e+07,282565
FORMULA DiscoveryGPU-PT-10b-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

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