Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K 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 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 89K 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-12b-CTLCardinality-2023-12
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2023-13
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2023-14
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2023-15
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2025-00
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2025-01
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2025-02
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2025-03
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2025-04
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2025-05
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2025-06
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2025-07
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2025-08
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2025-09
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2025-10
FORMULA_NAME DiscoveryGPU-PT-12b-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748937436824

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-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-03 07:57:19] [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 07:57:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 07:57:19] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2025-06-03 07:57:19] [INFO ] Transformed 352 places.
[2025-06-03 07:57:19] [INFO ] Transformed 374 transitions.
[2025-06-03 07:57:19] [INFO ] Found NUPN structural information;
[2025-06-03 07:57:19] [INFO ] Parsed PT model containing 352 places and 374 transitions and 977 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Support contains 118 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 374/374 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 340 transition count 374
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 38 place count 314 transition count 348
Iterating global reduction 1 with 26 rules applied. Total rules applied 64 place count 314 transition count 348
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 310 transition count 344
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 310 transition count 344
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 307 transition count 341
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 307 transition count 341
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 306 transition count 340
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 306 transition count 340
Applied a total of 80 rules in 184 ms. Remains 306 /352 variables (removed 46) and now considering 340/374 (removed 34) transitions.
// Phase 1: matrix 340 rows 306 cols
[2025-06-03 07:57:20] [INFO ] Computed 4 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:57:21] [INFO ] Implicit Places using invariants in 673 ms returned []
[2025-06-03 07:57:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:57:21] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 1196 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2025-06-03 07:57:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 5/298 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:57:32] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:57:32] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (OVERLAPS) 340/638 variables, 298/304 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:57:45] [INFO ] Deduced a trap composed of 9 places in 285 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:57:45] [INFO ] Deduced a trap composed of 11 places in 277 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:57:46] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:57:46] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:57:46] [INFO ] Deduced a trap composed of 14 places in 262 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:57:46] [INFO ] Deduced a trap composed of 15 places in 280 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:57:47] [INFO ] Deduced a trap composed of 16 places in 256 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:57:47] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:57:47] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:57:48] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:57:48] [INFO ] Deduced a trap composed of 55 places in 212 ms of which 30 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 638/646 variables, and 315 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 298/306 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 5/298 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (OVERLAPS) 340/638 variables, 298/315 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/638 variables, 331/646 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 638/646 variables, and 646 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 298/306 constraints, PredecessorRefiner: 331/339 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60447ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60469ms
Starting structural reductions in LTL mode, iteration 1 : 306/352 places, 340/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61888 ms. Remains : 306/352 places, 340/374 transitions.
Support contains 118 out of 306 places after structural reductions.
[2025-06-03 07:58:22] [INFO ] Flatten gal took : 110 ms
[2025-06-03 07:58:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DiscoveryGPU-PT-12b-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 07:58:22] [INFO ] Flatten gal took : 55 ms
[2025-06-03 07:58:22] [INFO ] Input system was already deterministic with 340 transitions.
Support contains 90 out of 306 places (down from 118) after GAL structural reductions.
RANDOM walk for 40000 steps (102 resets) in 1833 ms. (21 steps per ms) remains 1/56 properties
BEST_FIRST walk for 18719 steps (5 resets) in 130 ms. (142 steps per ms) remains 0/1 properties
[2025-06-03 07:58:23] [INFO ] Flatten gal took : 24 ms
[2025-06-03 07:58:23] [INFO ] Flatten gal took : 25 ms
[2025-06-03 07:58:23] [INFO ] Input system was already deterministic with 340 transitions.
Computed a total of 46 stabilizing places and 46 stable transitions
Graph (complete) has 561 edges and 306 vertex of which 279 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.9 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 340/340 transitions.
Graph (complete) has 561 edges and 306 vertex of which 280 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 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 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 279 transition count 267
Reduce places removed 58 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 221 transition count 265
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 219 transition count 265
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 121 place count 219 transition count 240
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 171 place count 194 transition count 240
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 183 place count 182 transition count 228
Iterating global reduction 3 with 12 rules applied. Total rules applied 195 place count 182 transition count 228
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 195 place count 182 transition count 226
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 199 place count 180 transition count 226
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 206 place count 173 transition count 218
Iterating global reduction 3 with 7 rules applied. Total rules applied 213 place count 173 transition count 218
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 220 place count 166 transition count 210
Iterating global reduction 3 with 7 rules applied. Total rules applied 227 place count 166 transition count 210
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 233 place count 160 transition count 199
Iterating global reduction 3 with 6 rules applied. Total rules applied 239 place count 160 transition count 199
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 244 place count 155 transition count 194
Iterating global reduction 3 with 5 rules applied. Total rules applied 249 place count 155 transition count 194
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 299 place count 130 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 301 place count 128 transition count 166
Iterating global reduction 3 with 2 rules applied. Total rules applied 303 place count 128 transition count 166
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 305 place count 126 transition count 163
Iterating global reduction 3 with 2 rules applied. Total rules applied 307 place count 126 transition count 163
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 308 place count 125 transition count 162
Iterating global reduction 3 with 1 rules applied. Total rules applied 309 place count 125 transition count 162
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 311 place count 123 transition count 160
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 146 edges and 121 vertex of which 117 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 125 edges and 117 vertex of which 46 / 117 are part of one of the 23 SCC in 2 ms
Free SCC test removed 23 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 3 with 42 rules applied. Total rules applied 353 place count 94 transition count 117
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 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 63 rules applied. Total rules applied 416 place count 56 transition count 92
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 418 place count 55 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 419 place count 54 transition count 91
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 428 place count 45 transition count 73
Iterating global reduction 7 with 9 rules applied. Total rules applied 437 place count 45 transition count 73
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 446 place count 36 transition count 55
Iterating global reduction 7 with 9 rules applied. Total rules applied 455 place count 36 transition count 55
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 464 place count 27 transition count 37
Iterating global reduction 7 with 9 rules applied. Total rules applied 473 place count 27 transition count 37
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 482 place count 18 transition count 28
Iterating global reduction 7 with 9 rules applied. Total rules applied 491 place count 18 transition count 28
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 492 place count 18 transition count 27
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 493 place count 18 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 494 place count 17 transition count 26
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 497 place count 14 transition count 23
Applied a total of 497 rules in 123 ms. Remains 14 /306 variables (removed 292) and now considering 23/340 (removed 317) transitions.
[2025-06-03 07:58:23] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 14 cols
[2025-06-03 07:58:23] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:58:23] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-03 07:58:23] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2025-06-03 07:58:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:58:23] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:58:23] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2025-06-03 07:58:23] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2025-06-03 07:58:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 18/29 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 3/32 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 0/32 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/33 variables, and 14 constraints, problems are : Problem set: 0 solved, 17 unsolved in 286 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 18/29 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 3/32 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/32 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/33 variables, and 31 constraints, problems are : Problem set: 0 solved, 17 unsolved in 246 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 537ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 537ms
Starting structural reductions in SI_CTL mode, iteration 1 : 14/306 places, 23/340 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 722 ms. Remains : 14/306 places, 23/340 transitions.
[2025-06-03 07:58:24] [INFO ] Flatten gal took : 1 ms
[2025-06-03 07:58:24] [INFO ] Flatten gal took : 2 ms
[2025-06-03 07:58:24] [INFO ] Input system was already deterministic with 23 transitions.
[2025-06-03 07:58:24] [INFO ] Flatten gal took : 2 ms
[2025-06-03 07:58:24] [INFO ] Flatten gal took : 1 ms
[2025-06-03 07:58:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality1193522941119619749.gal : 1 ms
[2025-06-03 07:58:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality3644892662048453463.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1193522941119619749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3644892662048453463.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,3168,0.016692,3728,2,35,5,207,6,0,68,191,0


Converting to forward existential form...Done !
original formula: AG(EF((!(A((p125==0) U (p78==1))) + (p73==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!(!((E(!((p78==1)) U (!((p125==0)) * !((p78==1)))) + EG(!((p78==1)))))) + (p73==...170
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t8, t9, t11, t12, Intersection with reachable at each step enabled. (destroyed/rever...185
(forward)formula 0,1,0.056244,5392,1,0,246,8932,74,131,397,13989,285
FORMULA DiscoveryGPU-PT-12b-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 340/340 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 294 transition count 340
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 50 place count 256 transition count 302
Iterating global reduction 1 with 38 rules applied. Total rules applied 88 place count 256 transition count 302
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 99 place count 245 transition count 289
Iterating global reduction 1 with 11 rules applied. Total rules applied 110 place count 245 transition count 289
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 120 place count 235 transition count 278
Iterating global reduction 1 with 10 rules applied. Total rules applied 130 place count 235 transition count 278
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 139 place count 226 transition count 269
Iterating global reduction 1 with 9 rules applied. Total rules applied 148 place count 226 transition count 269
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 155 place count 219 transition count 256
Iterating global reduction 1 with 7 rules applied. Total rules applied 162 place count 219 transition count 256
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 168 place count 213 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 174 place count 213 transition count 250
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 180 place count 207 transition count 244
Iterating global reduction 1 with 6 rules applied. Total rules applied 186 place count 207 transition count 244
Applied a total of 186 rules in 40 ms. Remains 207 /306 variables (removed 99) and now considering 244/340 (removed 96) transitions.
// Phase 1: matrix 244 rows 207 cols
[2025-06-03 07:58:24] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:58:24] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-03 07:58:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:58:24] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2025-06-03 07:58:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 244/451 variables, 207/209 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:58:34] [INFO ] Deduced a trap composed of 7 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 07:58:34] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:58:34] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:58:35] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:58:35] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:58:35] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:58:35] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:58:35] [INFO ] Deduced a trap composed of 14 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 07:58:35] [INFO ] Deduced a trap composed of 15 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 07:58:36] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:58:36] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:58:36] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 12/221 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 0/451 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 221 constraints, problems are : Problem set: 0 solved, 243 unsolved in 27973 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (OVERLAPS) 244/451 variables, 207/221 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 243/464 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 0/451 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 464 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58146ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 58156ms
Starting structural reductions in LTL mode, iteration 1 : 207/306 places, 244/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58595 ms. Remains : 207/306 places, 244/340 transitions.
[2025-06-03 07:59:23] [INFO ] Flatten gal took : 18 ms
[2025-06-03 07:59:23] [INFO ] Flatten gal took : 20 ms
[2025-06-03 07:59:23] [INFO ] Input system was already deterministic with 244 transitions.
[2025-06-03 07:59:23] [INFO ] Flatten gal took : 16 ms
[2025-06-03 07:59:23] [INFO ] Flatten gal took : 23 ms
[2025-06-03 07:59:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality6849449694830149168.gal : 8 ms
[2025-06-03 07:59:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality16086009397233766400.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/CTLCardinality6849449694830149168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16086009397233766400.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 07:59:53] [INFO ] Flatten gal took : 15 ms
[2025-06-03 07:59:53] [INFO ] Applying decomposition
[2025-06-03 07:59:53] [INFO ] Flatten gal took : 13 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/graph6737171124886030654.txt' '-o' '/tmp/graph6737171124886030654.bin' '-w' '/tmp/graph6737171124886030654.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6737171124886030654.bin' '-l' '-1' '-v' '-w' '/tmp/graph6737171124886030654.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:59:53] [INFO ] Decomposing Gal with order
[2025-06-03 07:59:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:59:53] [INFO ] Removed a total of 98 redundant transitions.
[2025-06-03 07:59:53] [INFO ] Flatten gal took : 82 ms
[2025-06-03 07:59:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 11 ms.
[2025-06-03 07:59:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality8545846314911901744.gal : 8 ms
[2025-06-03 07:59:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality3425624528706521912.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/CTLCardinality8545846314911901744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3425624528706521912.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 LTL mode, iteration 0 : 306/306 places, 340/340 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 295 transition count 340
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 46 place count 260 transition count 305
Iterating global reduction 1 with 35 rules applied. Total rules applied 81 place count 260 transition count 305
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 89 place count 252 transition count 297
Iterating global reduction 1 with 8 rules applied. Total rules applied 97 place count 252 transition count 297
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 104 place count 245 transition count 289
Iterating global reduction 1 with 7 rules applied. Total rules applied 111 place count 245 transition count 289
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 117 place count 239 transition count 282
Iterating global reduction 1 with 6 rules applied. Total rules applied 123 place count 239 transition count 282
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 129 place count 233 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 135 place count 233 transition count 272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 140 place count 228 transition count 267
Iterating global reduction 1 with 5 rules applied. Total rules applied 145 place count 228 transition count 267
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 149 place count 224 transition count 263
Iterating global reduction 1 with 4 rules applied. Total rules applied 153 place count 224 transition count 263
Applied a total of 153 rules in 76 ms. Remains 224 /306 variables (removed 82) and now considering 263/340 (removed 77) transitions.
// Phase 1: matrix 263 rows 224 cols
[2025-06-03 08:00:23] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:00:23] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-06-03 08:00:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:00:24] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-03 08:00:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 263/486 variables, 223/225 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:00:34] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:00:35] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:00:35] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:00:35] [INFO ] Deduced a trap composed of 10 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 08:00:35] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:00:35] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:00:35] [INFO ] Deduced a trap composed of 13 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 08:00:36] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:00:36] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:00:36] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:00:36] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:00:36] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 12/237 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 1/487 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/487 variables, and 238 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/486 variables, 223/237 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 261/498 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 1/487 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 262 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 Int declared 487/487 variables, and 500 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in LTL mode, iteration 1 : 224/306 places, 263/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60735 ms. Remains : 224/306 places, 263/340 transitions.
[2025-06-03 08:01:24] [INFO ] Flatten gal took : 23 ms
[2025-06-03 08:01:24] [INFO ] Flatten gal took : 22 ms
[2025-06-03 08:01:24] [INFO ] Input system was already deterministic with 263 transitions.
[2025-06-03 08:01:24] [INFO ] Flatten gal took : 22 ms
[2025-06-03 08:01:24] [INFO ] Flatten gal took : 22 ms
[2025-06-03 08:01:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality11996260689089487958.gal : 4 ms
[2025-06-03 08:01:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality12480044261194830551.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/CTLCardinality11996260689089487958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12480044261194830551.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 08:01:54] [INFO ] Flatten gal took : 11 ms
[2025-06-03 08:01:54] [INFO ] Applying decomposition
[2025-06-03 08:01:54] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10239094237595142292.txt' '-o' '/tmp/graph10239094237595142292.bin' '-w' '/tmp/graph10239094237595142292.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10239094237595142292.bin' '-l' '-1' '-v' '-w' '/tmp/graph10239094237595142292.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:01:54] [INFO ] Decomposing Gal with order
[2025-06-03 08:01:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:01:54] [INFO ] Removed a total of 102 redundant transitions.
[2025-06-03 08:01:54] [INFO ] Flatten gal took : 26 ms
[2025-06-03 08:01:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 5 ms.
[2025-06-03 08:01:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality16939763394719110771.gal : 7 ms
[2025-06-03 08:01:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality3477963363964438786.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/CTLCardinality16939763394719110771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3477963363964438786.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 : 306/306 places, 340/340 transitions.
Graph (complete) has 561 edges and 306 vertex of which 279 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.2 ms
Discarding 27 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 278 transition count 265
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 119 place count 219 transition count 265
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 119 place count 219 transition count 240
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 169 place count 194 transition count 240
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 181 place count 182 transition count 228
Iterating global reduction 2 with 12 rules applied. Total rules applied 193 place count 182 transition count 228
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 193 place count 182 transition count 226
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 197 place count 180 transition count 226
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 206 place count 171 transition count 216
Iterating global reduction 2 with 9 rules applied. Total rules applied 215 place count 171 transition count 216
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 224 place count 162 transition count 206
Iterating global reduction 2 with 9 rules applied. Total rules applied 233 place count 162 transition count 206
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 241 place count 154 transition count 191
Iterating global reduction 2 with 8 rules applied. Total rules applied 249 place count 154 transition count 191
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 256 place count 147 transition count 184
Iterating global reduction 2 with 7 rules applied. Total rules applied 263 place count 147 transition count 184
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 311 place count 123 transition count 160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 313 place count 121 transition count 157
Iterating global reduction 2 with 2 rules applied. Total rules applied 315 place count 121 transition count 157
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 317 place count 119 transition count 154
Iterating global reduction 2 with 2 rules applied. Total rules applied 319 place count 119 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 320 place count 118 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 321 place count 118 transition count 153
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 322 place count 118 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 324 place count 116 transition count 151
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 13 rules applied. Total rules applied 337 place count 115 transition count 139
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 14 rules applied. Total rules applied 351 place count 103 transition count 137
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 353 place count 102 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 354 place count 101 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 354 place count 101 transition count 135
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 356 place count 100 transition count 135
Applied a total of 356 rules in 106 ms. Remains 100 /306 variables (removed 206) and now considering 135/340 (removed 205) transitions.
// Phase 1: matrix 135 rows 100 cols
[2025-06-03 08:02:24] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:02:25] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-03 08:02:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:02:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:02:25] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 08:02:25] [INFO ] Redundant transitions in 4 ms returned []
Running 123 sub problems to find dead transitions.
[2025-06-03 08:02:25] [INFO ] Invariant cache hit.
[2025-06-03 08:02:25] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 134/222 variables, 88/89 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 12/234 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 1/235 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/235 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 102 constraints, problems are : Problem set: 0 solved, 123 unsolved in 8709 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 134/222 variables, 88/89 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 123/212 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 12/234 variables, 12/224 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 1/235 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/235 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 225 constraints, problems are : Problem set: 0 solved, 123 unsolved in 9958 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18684ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 18684ms
Starting structural reductions in SI_CTL mode, iteration 1 : 100/306 places, 135/340 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19112 ms. Remains : 100/306 places, 135/340 transitions.
[2025-06-03 08:02:43] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:02:43] [INFO ] Flatten gal took : 7 ms
[2025-06-03 08:02:43] [INFO ] Input system was already deterministic with 135 transitions.
[2025-06-03 08:02:43] [INFO ] Flatten gal took : 6 ms
[2025-06-03 08:02:43] [INFO ] Flatten gal took : 7 ms
[2025-06-03 08:02:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality3777025331636146108.gal : 2 ms
[2025-06-03 08:02:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality14550590652115525656.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/CTLCardinality3777025331636146108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14550590652115525656.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44166e+12,1.57758,40644,2,11135,5,219101,6,0,514,163225,0


Converting to forward existential form...Done !
original formula: EG(((p339==0)||(p304==1)))
=> equivalent forward existential formula: [FwdG(Init,((p339==0)||(p304==1)))] != FALSE
Hit Full ! (commute/partial/dont) 119/0/16
(forward)formula 0,1,14.4025,314496,1,0,11,1.67791e+06,19,3,2457,1.38657e+06,9
FORMULA DiscoveryGPU-PT-12b-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 340/340 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 296 transition count 340
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 45 place count 261 transition count 305
Iterating global reduction 1 with 35 rules applied. Total rules applied 80 place count 261 transition count 305
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 92 place count 249 transition count 291
Iterating global reduction 1 with 12 rules applied. Total rules applied 104 place count 249 transition count 291
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 114 place count 239 transition count 280
Iterating global reduction 1 with 10 rules applied. Total rules applied 124 place count 239 transition count 280
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 134 place count 229 transition count 269
Iterating global reduction 1 with 10 rules applied. Total rules applied 144 place count 229 transition count 269
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 152 place count 221 transition count 255
Iterating global reduction 1 with 8 rules applied. Total rules applied 160 place count 221 transition count 255
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 167 place count 214 transition count 248
Iterating global reduction 1 with 7 rules applied. Total rules applied 174 place count 214 transition count 248
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 180 place count 208 transition count 242
Iterating global reduction 1 with 6 rules applied. Total rules applied 186 place count 208 transition count 242
Applied a total of 186 rules in 27 ms. Remains 208 /306 variables (removed 98) and now considering 242/340 (removed 98) transitions.
// Phase 1: matrix 242 rows 208 cols
[2025-06-03 08:02:58] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:02:58] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-03 08:02:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:02:58] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 08:02:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (OVERLAPS) 242/448 variables, 206/208 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:03:10] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:03:10] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:03:10] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:03:10] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:03:11] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:03:11] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:03:11] [INFO ] Deduced a trap composed of 13 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 08:03:11] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:03:11] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:03:11] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:03:12] [INFO ] Deduced a trap composed of 17 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 08:03:12] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 12/220 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 2/450 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/450 variables, and 222 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 242/448 variables, 206/220 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 239/459 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 2/450 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 463 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in LTL mode, iteration 1 : 208/306 places, 242/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60444 ms. Remains : 208/306 places, 242/340 transitions.
[2025-06-03 08:03:58] [INFO ] Flatten gal took : 12 ms
[2025-06-03 08:03:58] [INFO ] Flatten gal took : 12 ms
[2025-06-03 08:03:59] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-03 08:03:59] [INFO ] Flatten gal took : 13 ms
[2025-06-03 08:03:59] [INFO ] Flatten gal took : 12 ms
[2025-06-03 08:03:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality15059608799559171970.gal : 3 ms
[2025-06-03 08:03:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality14957012241799409982.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/CTLCardinality15059608799559171970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14957012241799409982.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 08:04:29] [INFO ] Flatten gal took : 8 ms
[2025-06-03 08:04:29] [INFO ] Applying decomposition
[2025-06-03 08:04:29] [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/graph17200542880621523031.txt' '-o' '/tmp/graph17200542880621523031.bin' '-w' '/tmp/graph17200542880621523031.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17200542880621523031.bin' '-l' '-1' '-v' '-w' '/tmp/graph17200542880621523031.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:04:29] [INFO ] Decomposing Gal with order
[2025-06-03 08:04:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:04:29] [INFO ] Removed a total of 93 redundant transitions.
[2025-06-03 08:04:29] [INFO ] Flatten gal took : 19 ms
[2025-06-03 08:04:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 4 ms.
[2025-06-03 08:04:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality2242273075827635060.gal : 5 ms
[2025-06-03 08:04:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality1402179076833932525.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/CTLCardinality2242273075827635060.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1402179076833932525.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 : 306/306 places, 340/340 transitions.
Graph (complete) has 561 edges and 306 vertex of which 279 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.3 ms
Discarding 27 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 278 transition count 265
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 119 place count 219 transition count 265
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 119 place count 219 transition count 240
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 169 place count 194 transition count 240
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 182 place count 181 transition count 227
Iterating global reduction 2 with 13 rules applied. Total rules applied 195 place count 181 transition count 227
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 195 place count 181 transition count 225
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 179 transition count 225
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 208 place count 170 transition count 215
Iterating global reduction 2 with 9 rules applied. Total rules applied 217 place count 170 transition count 215
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 226 place count 161 transition count 205
Iterating global reduction 2 with 9 rules applied. Total rules applied 235 place count 161 transition count 205
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 243 place count 153 transition count 190
Iterating global reduction 2 with 8 rules applied. Total rules applied 251 place count 153 transition count 190
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 258 place count 146 transition count 183
Iterating global reduction 2 with 7 rules applied. Total rules applied 265 place count 146 transition count 183
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
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 313 place count 122 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 315 place count 120 transition count 156
Iterating global reduction 2 with 2 rules applied. Total rules applied 317 place count 120 transition count 156
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 319 place count 118 transition count 153
Iterating global reduction 2 with 2 rules applied. Total rules applied 321 place count 118 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 323 place count 116 transition count 151
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 138 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 121 edges and 110 vertex of which 48 / 110 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 40 rules applied. Total rules applied 363 place count 86 transition count 110
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 423 place count 50 transition count 86
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 433 place count 40 transition count 66
Iterating global reduction 4 with 10 rules applied. Total rules applied 443 place count 40 transition count 66
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 453 place count 30 transition count 46
Iterating global reduction 4 with 10 rules applied. Total rules applied 463 place count 30 transition count 46
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 473 place count 20 transition count 26
Iterating global reduction 4 with 10 rules applied. Total rules applied 483 place count 20 transition count 26
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 493 place count 10 transition count 16
Iterating global reduction 4 with 10 rules applied. Total rules applied 503 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 504 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 505 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 506 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 508 place count 7 transition count 12
Applied a total of 508 rules in 91 ms. Remains 7 /306 variables (removed 299) and now considering 12/340 (removed 328) transitions.
[2025-06-03 08:04:59] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 7 cols
[2025-06-03 08:04:59] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:04:59] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-03 08:04:59] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2025-06-03 08:04:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:04:59] [INFO ] Implicit Places using invariants and state equation in 39 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 08:04:59] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-03 08:04:59] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2025-06-03 08:04:59] [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 130 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 180 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 313ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 314ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/306 places, 12/340 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 478 ms. Remains : 7/306 places, 12/340 transitions.
[2025-06-03 08:04:59] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:04:59] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:04:59] [INFO ] Input system was already deterministic with 12 transitions.
[2025-06-03 08:04:59] [INFO ] Flatten gal took : 0 ms
[2025-06-03 08:04:59] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:04:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality14081726736120502523.gal : 0 ms
[2025-06-03 08:04:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality4043768303676840209.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/CTLCardinality14081726736120502523.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4043768303676840209.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,468,0.003561,3788,2,23,5,154,6,0,34,152,0


Converting to forward existential form...Done !
original formula: EF(EG((p238==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p238==1))] != FALSE
Hit Full ! (commute/partial/dont) 10/0/2
(forward)formula 0,1,0.005519,3916,1,0,8,237,19,2,181,243,8
FORMULA DiscoveryGPU-PT-12b-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 340/340 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 296 transition count 340
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 43 place count 263 transition count 307
Iterating global reduction 1 with 33 rules applied. Total rules applied 76 place count 263 transition count 307
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 84 place count 255 transition count 298
Iterating global reduction 1 with 8 rules applied. Total rules applied 92 place count 255 transition count 298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 247 transition count 289
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 247 transition count 289
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 115 place count 240 transition count 281
Iterating global reduction 1 with 7 rules applied. Total rules applied 122 place count 240 transition count 281
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 129 place count 233 transition count 269
Iterating global reduction 1 with 7 rules applied. Total rules applied 136 place count 233 transition count 269
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 142 place count 227 transition count 263
Iterating global reduction 1 with 6 rules applied. Total rules applied 148 place count 227 transition count 263
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 153 place count 222 transition count 258
Iterating global reduction 1 with 5 rules applied. Total rules applied 158 place count 222 transition count 258
Applied a total of 158 rules in 41 ms. Remains 222 /306 variables (removed 84) and now considering 258/340 (removed 82) transitions.
// Phase 1: matrix 258 rows 222 cols
[2025-06-03 08:04:59] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:04:59] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-03 08:04:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:05:00] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2025-06-03 08:05:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/478 variables, 220/222 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:05:13] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:05:13] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:05:13] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:05:14] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:05:14] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:05:14] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:05:14] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:05:14] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:05:14] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:05:15] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:05:15] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:05:15] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:05:15] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 23 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 13/235 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 2/480 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/480 variables, and 237 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/478 variables, 220/235 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 255/490 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 2/480 variables, 2/492 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 494 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 222/306 places, 258/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60677 ms. Remains : 222/306 places, 258/340 transitions.
[2025-06-03 08:06:00] [INFO ] Flatten gal took : 13 ms
[2025-06-03 08:06:00] [INFO ] Flatten gal took : 13 ms
[2025-06-03 08:06:00] [INFO ] Input system was already deterministic with 258 transitions.
[2025-06-03 08:06:00] [INFO ] Flatten gal took : 12 ms
[2025-06-03 08:06:00] [INFO ] Flatten gal took : 13 ms
[2025-06-03 08:06:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality13247677323950562766.gal : 7 ms
[2025-06-03 08:06:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality13871821826034065685.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/CTLCardinality13247677323950562766.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13871821826034065685.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 08:06:30] [INFO ] Flatten gal took : 12 ms
[2025-06-03 08:06:30] [INFO ] Applying decomposition
[2025-06-03 08:06:30] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9810563878866265099.txt' '-o' '/tmp/graph9810563878866265099.bin' '-w' '/tmp/graph9810563878866265099.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9810563878866265099.bin' '-l' '-1' '-v' '-w' '/tmp/graph9810563878866265099.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:06:30] [INFO ] Decomposing Gal with order
[2025-06-03 08:06:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:06:30] [INFO ] Removed a total of 95 redundant transitions.
[2025-06-03 08:06:30] [INFO ] Flatten gal took : 17 ms
[2025-06-03 08:06:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2025-06-03 08:06:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality8354296492506810467.gal : 4 ms
[2025-06-03 08:06:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality12674943201836394565.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/CTLCardinality8354296492506810467.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12674943201836394565.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 LTL mode, iteration 0 : 306/306 places, 340/340 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 294 transition count 340
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 49 place count 257 transition count 303
Iterating global reduction 1 with 37 rules applied. Total rules applied 86 place count 257 transition count 303
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 96 place count 247 transition count 291
Iterating global reduction 1 with 10 rules applied. Total rules applied 106 place count 247 transition count 291
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 116 place count 237 transition count 280
Iterating global reduction 1 with 10 rules applied. Total rules applied 126 place count 237 transition count 280
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 135 place count 228 transition count 271
Iterating global reduction 1 with 9 rules applied. Total rules applied 144 place count 228 transition count 271
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 151 place count 221 transition count 258
Iterating global reduction 1 with 7 rules applied. Total rules applied 158 place count 221 transition count 258
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 164 place count 215 transition count 252
Iterating global reduction 1 with 6 rules applied. Total rules applied 170 place count 215 transition count 252
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 176 place count 209 transition count 246
Iterating global reduction 1 with 6 rules applied. Total rules applied 182 place count 209 transition count 246
Applied a total of 182 rules in 25 ms. Remains 209 /306 variables (removed 97) and now considering 246/340 (removed 94) transitions.
// Phase 1: matrix 246 rows 209 cols
[2025-06-03 08:07:00] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:07:00] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-03 08:07:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:07:01] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 245 sub problems to find dead transitions.
[2025-06-03 08:07:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 246/455 variables, 209/211 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:07:11] [INFO ] Deduced a trap composed of 7 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 08:07:11] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:07:12] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:07:12] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:07:12] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:07:12] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:07:12] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:07:12] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:07:13] [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 08:07:13] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:07:13] [INFO ] Deduced a trap composed of 17 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 08:07:13] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 12/223 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/455 variables, and 223 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/455 variables, 209/223 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 245/468 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (OVERLAPS) 0/455 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Int declared 455/455 variables, and 468 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in LTL mode, iteration 1 : 209/306 places, 246/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60490 ms. Remains : 209/306 places, 246/340 transitions.
[2025-06-03 08:08:01] [INFO ] Flatten gal took : 6 ms
[2025-06-03 08:08:01] [INFO ] Flatten gal took : 6 ms
[2025-06-03 08:08:01] [INFO ] Input system was already deterministic with 246 transitions.
[2025-06-03 08:08:01] [INFO ] Flatten gal took : 6 ms
[2025-06-03 08:08:01] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:08:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality14175117167829710465.gal : 1 ms
[2025-06-03 08:08:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality6209263131870857537.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/CTLCardinality14175117167829710465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6209263131870857537.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 08:08:31] [INFO ] Flatten gal took : 12 ms
[2025-06-03 08:08:31] [INFO ] Applying decomposition
[2025-06-03 08:08:31] [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/graph5679766606401372483.txt' '-o' '/tmp/graph5679766606401372483.bin' '-w' '/tmp/graph5679766606401372483.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5679766606401372483.bin' '-l' '-1' '-v' '-w' '/tmp/graph5679766606401372483.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:08:31] [INFO ] Decomposing Gal with order
[2025-06-03 08:08:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:08:31] [INFO ] Removed a total of 97 redundant transitions.
[2025-06-03 08:08:31] [INFO ] Flatten gal took : 32 ms
[2025-06-03 08:08:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2025-06-03 08:08:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality1773474160972864715.gal : 5 ms
[2025-06-03 08:08:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality14471261656533900393.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/CTLCardinality1773474160972864715.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14471261656533900393.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 : 306/306 places, 340/340 transitions.
Graph (complete) has 561 edges and 306 vertex of which 280 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 279 transition count 266
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 119 place count 220 transition count 266
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 119 place count 220 transition count 241
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 169 place count 195 transition count 241
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 181 place count 183 transition count 229
Iterating global reduction 2 with 12 rules applied. Total rules applied 193 place count 183 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 193 place count 183 transition count 227
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 197 place count 181 transition count 227
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 206 place count 172 transition count 217
Iterating global reduction 2 with 9 rules applied. Total rules applied 215 place count 172 transition count 217
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 223 place count 164 transition count 208
Iterating global reduction 2 with 8 rules applied. Total rules applied 231 place count 164 transition count 208
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 238 place count 157 transition count 195
Iterating global reduction 2 with 7 rules applied. Total rules applied 245 place count 157 transition count 195
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 251 place count 151 transition count 189
Iterating global reduction 2 with 6 rules applied. Total rules applied 257 place count 151 transition count 189
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 305 place count 127 transition count 165
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 307 place count 125 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 309 place count 125 transition count 162
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 311 place count 123 transition count 159
Iterating global reduction 2 with 2 rules applied. Total rules applied 313 place count 123 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 314 place count 122 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 315 place count 122 transition count 158
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 318 place count 122 transition count 158
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 320 place count 120 transition count 156
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 14 rules applied. Total rules applied 334 place count 119 transition count 143
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 15 rules applied. Total rules applied 349 place count 106 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 350 place count 105 transition count 141
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 352 place count 104 transition count 140
Applied a total of 352 rules in 54 ms. Remains 104 /306 variables (removed 202) and now considering 140/340 (removed 200) transitions.
// Phase 1: matrix 140 rows 104 cols
[2025-06-03 08:09:01] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:09:01] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-03 08:09:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:09:01] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 08:09:01] [INFO ] Redundant transitions in 5 ms returned []
Running 128 sub problems to find dead transitions.
[2025-06-03 08:09:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 140/232 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 12/244 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:09:05] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/244 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 106 constraints, problems are : Problem set: 0 solved, 128 unsolved in 9253 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 140/232 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 128/222 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 12/244 variables, 12/234 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/244 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 234 constraints, problems are : Problem set: 0 solved, 128 unsolved in 9466 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18733ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 18734ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/306 places, 140/340 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19006 ms. Remains : 104/306 places, 140/340 transitions.
[2025-06-03 08:09:20] [INFO ] Flatten gal took : 6 ms
[2025-06-03 08:09:20] [INFO ] Flatten gal took : 4 ms
[2025-06-03 08:09:20] [INFO ] Input system was already deterministic with 140 transitions.
[2025-06-03 08:09:20] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:09:20] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:09:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality2891561903683254419.gal : 2 ms
[2025-06-03 08:09:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality12207592254991961285.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/CTLCardinality2891561903683254419.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12207592254991961285.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.05499e+12,3.67234,85200,2,23799,5,424484,6,0,535,360780,0


Converting to forward existential form...Done !
original formula: AF(((p257==1) * EG((((p192==0)&&(p342==1)) + EG((p317==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(((p257==1) * EG((((p192==0)&&(p342==1)) + EG((p317==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t6, t7, t9, t11, t12, t14, t17, t18, t20, t22, t23, t25, t27, t28, t31, t32, t34, t36...425
Detected timeout of ITS tools.
[2025-06-03 08:09:50] [INFO ] Flatten gal took : 3 ms
[2025-06-03 08:09:50] [INFO ] Applying decomposition
[2025-06-03 08:09:50] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1977044858434413305.txt' '-o' '/tmp/graph1977044858434413305.bin' '-w' '/tmp/graph1977044858434413305.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1977044858434413305.bin' '-l' '-1' '-v' '-w' '/tmp/graph1977044858434413305.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:09:50] [INFO ] Decomposing Gal with order
[2025-06-03 08:09:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:09:50] [INFO ] Removed a total of 70 redundant transitions.
[2025-06-03 08:09:50] [INFO ] Flatten gal took : 8 ms
[2025-06-03 08:09:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 2 ms.
[2025-06-03 08:09:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality15302611123720769197.gal : 2 ms
[2025-06-03 08:09:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality11080220953862386432.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/CTLCardinality15302611123720769197.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11080220953862386432.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 : 306/306 places, 340/340 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 294 transition count 340
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 50 place count 256 transition count 302
Iterating global reduction 1 with 38 rules applied. Total rules applied 88 place count 256 transition count 302
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 100 place count 244 transition count 288
Iterating global reduction 1 with 12 rules applied. Total rules applied 112 place count 244 transition count 288
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 123 place count 233 transition count 276
Iterating global reduction 1 with 11 rules applied. Total rules applied 134 place count 233 transition count 276
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 144 place count 223 transition count 265
Iterating global reduction 1 with 10 rules applied. Total rules applied 154 place count 223 transition count 265
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 161 place count 216 transition count 253
Iterating global reduction 1 with 7 rules applied. Total rules applied 168 place count 216 transition count 253
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 174 place count 210 transition count 247
Iterating global reduction 1 with 6 rules applied. Total rules applied 180 place count 210 transition count 247
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 185 place count 205 transition count 242
Iterating global reduction 1 with 5 rules applied. Total rules applied 190 place count 205 transition count 242
Applied a total of 190 rules in 37 ms. Remains 205 /306 variables (removed 101) and now considering 242/340 (removed 98) transitions.
// Phase 1: matrix 242 rows 205 cols
[2025-06-03 08:10:20] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:10:21] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-03 08:10:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:10:21] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 08:10:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (OVERLAPS) 242/447 variables, 205/207 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:10:31] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:10:31] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:10:32] [INFO ] Deduced a trap composed of 9 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 08:10:32] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:10:32] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:10:32] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:10:32] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:10:32] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:10:33] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:10:33] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:10:33] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:10:33] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 12/219 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 0/447 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 219 constraints, problems are : Problem set: 0 solved, 241 unsolved in 27203 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 242/447 variables, 205/219 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 241/460 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/447 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 460 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57284ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 57286ms
Starting structural reductions in LTL mode, iteration 1 : 205/306 places, 242/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57820 ms. Remains : 205/306 places, 242/340 transitions.
[2025-06-03 08:11:18] [INFO ] Flatten gal took : 9 ms
[2025-06-03 08:11:18] [INFO ] Flatten gal took : 8 ms
[2025-06-03 08:11:18] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-03 08:11:18] [INFO ] Flatten gal took : 9 ms
[2025-06-03 08:11:18] [INFO ] Flatten gal took : 9 ms
[2025-06-03 08:11:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality2959631636508616392.gal : 2 ms
[2025-06-03 08:11:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality11783911696083511736.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/CTLCardinality2959631636508616392.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11783911696083511736.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 08:11:48] [INFO ] Flatten gal took : 9 ms
[2025-06-03 08:11:48] [INFO ] Applying decomposition
[2025-06-03 08:11:48] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11916393351548829377.txt' '-o' '/tmp/graph11916393351548829377.bin' '-w' '/tmp/graph11916393351548829377.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11916393351548829377.bin' '-l' '-1' '-v' '-w' '/tmp/graph11916393351548829377.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:11:48] [INFO ] Decomposing Gal with order
[2025-06-03 08:11:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:11:48] [INFO ] Removed a total of 94 redundant transitions.
[2025-06-03 08:11:48] [INFO ] Flatten gal took : 20 ms
[2025-06-03 08:11:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 4 ms.
[2025-06-03 08:11:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality15030633711895469343.gal : 4 ms
[2025-06-03 08:11:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality1192502641575636283.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/CTLCardinality15030633711895469343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1192502641575636283.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 : 306/306 places, 340/340 transitions.
Graph (complete) has 561 edges and 306 vertex of which 283 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 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 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 282 transition count 269
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 225 transition count 269
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 115 place count 225 transition count 244
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 165 place count 200 transition count 244
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 175 place count 190 transition count 234
Iterating global reduction 2 with 10 rules applied. Total rules applied 185 place count 190 transition count 234
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 185 place count 190 transition count 232
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 189 place count 188 transition count 232
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 194 place count 183 transition count 226
Iterating global reduction 2 with 5 rules applied. Total rules applied 199 place count 183 transition count 226
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 204 place count 178 transition count 221
Iterating global reduction 2 with 5 rules applied. Total rules applied 209 place count 178 transition count 221
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 213 place count 174 transition count 213
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 174 transition count 213
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 221 place count 170 transition count 209
Iterating global reduction 2 with 4 rules applied. Total rules applied 225 place count 170 transition count 209
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 273 place count 146 transition count 185
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 275 place count 144 transition count 182
Iterating global reduction 2 with 2 rules applied. Total rules applied 277 place count 144 transition count 182
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 279 place count 142 transition count 179
Iterating global reduction 2 with 2 rules applied. Total rules applied 281 place count 142 transition count 179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 282 place count 141 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 283 place count 141 transition count 178
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 284 place count 141 transition count 178
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 286 place count 139 transition count 176
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 162 edges and 137 vertex of which 133 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 136 edges and 133 vertex of which 46 / 133 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 2 with 44 rules applied. Total rules applied 330 place count 110 transition count 131
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 71 rules applied. Total rules applied 401 place count 70 transition count 100
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 407 place count 65 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 408 place count 64 transition count 99
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 415 place count 57 transition count 85
Iterating global reduction 6 with 7 rules applied. Total rules applied 422 place count 57 transition count 85
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 428 place count 51 transition count 73
Iterating global reduction 6 with 6 rules applied. Total rules applied 434 place count 51 transition count 73
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 439 place count 46 transition count 63
Iterating global reduction 6 with 5 rules applied. Total rules applied 444 place count 46 transition count 63
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 449 place count 41 transition count 58
Iterating global reduction 6 with 5 rules applied. Total rules applied 454 place count 41 transition count 58
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 455 place count 41 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 6 with 2 rules applied. Total rules applied 457 place count 40 transition count 56
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 463 place count 34 transition count 50
Applied a total of 463 rules in 53 ms. Remains 34 /306 variables (removed 272) and now considering 50/340 (removed 290) transitions.
[2025-06-03 08:12:19] [INFO ] Flow matrix only has 40 transitions (discarded 10 similar events)
// Phase 1: matrix 40 rows 34 cols
[2025-06-03 08:12:19] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:12:19] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-03 08:12:19] [INFO ] Flow matrix only has 40 transitions (discarded 10 similar events)
[2025-06-03 08:12:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:12:19] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 08:12:19] [INFO ] Redundant transitions in 1 ms returned []
Running 37 sub problems to find dead transitions.
[2025-06-03 08:12:19] [INFO ] Flow matrix only has 40 transitions (discarded 10 similar events)
[2025-06-03 08:12:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 39/64 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 9/73 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 0/73 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/74 variables, and 34 constraints, problems are : Problem set: 0 solved, 37 unsolved in 1057 ms.
Refiners :[State Equation: 34/34 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 39/64 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 35/60 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 9/73 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/74 variables, and 71 constraints, problems are : Problem set: 0 solved, 37 unsolved in 1096 ms.
Refiners :[State Equation: 34/34 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2157ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 2158ms
Starting structural reductions in SI_CTL mode, iteration 1 : 34/306 places, 50/340 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2296 ms. Remains : 34/306 places, 50/340 transitions.
[2025-06-03 08:12:21] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:12:21] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:12:21] [INFO ] Input system was already deterministic with 50 transitions.
RANDOM walk for 159 steps (2 resets) in 6 ms. (22 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-12b-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 08:12:21] [INFO ] Flatten gal took : 3 ms
[2025-06-03 08:12:21] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:12:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9489711804842816998.gal : 1 ms
[2025-06-03 08:12:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2289664730521523925.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9489711804842816998.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2289664730521523925.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 340/340 transitions.
Graph (complete) has 561 edges and 306 vertex of which 279 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.2 ms
Discarding 27 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 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 278 transition count 267
Reduce places removed 57 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 59 rules applied. Total rules applied 117 place count 221 transition count 265
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 119 place count 219 transition count 265
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 119 place count 219 transition count 240
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 169 place count 194 transition count 240
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 182 place count 181 transition count 227
Iterating global reduction 3 with 13 rules applied. Total rules applied 195 place count 181 transition count 227
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 195 place count 181 transition count 225
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 199 place count 179 transition count 225
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 208 place count 170 transition count 215
Iterating global reduction 3 with 9 rules applied. Total rules applied 217 place count 170 transition count 215
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 226 place count 161 transition count 205
Iterating global reduction 3 with 9 rules applied. Total rules applied 235 place count 161 transition count 205
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 242 place count 154 transition count 192
Iterating global reduction 3 with 7 rules applied. Total rules applied 249 place count 154 transition count 192
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 255 place count 148 transition count 186
Iterating global reduction 3 with 6 rules applied. Total rules applied 261 place count 148 transition count 186
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 3 with 48 rules applied. Total rules applied 309 place count 124 transition count 162
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 311 place count 122 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 313 place count 122 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 315 place count 120 transition count 156
Iterating global reduction 3 with 2 rules applied. Total rules applied 317 place count 120 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 318 place count 119 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 319 place count 119 transition count 155
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 320 place count 119 transition count 155
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 322 place count 117 transition count 153
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 140 edges and 115 vertex of which 111 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 120 edges and 111 vertex of which 46 / 111 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 3 with 40 rules applied. Total rules applied 362 place count 88 transition count 112
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 4 with 59 rules applied. Total rules applied 421 place count 52 transition count 89
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 430 place count 43 transition count 71
Iterating global reduction 5 with 9 rules applied. Total rules applied 439 place count 43 transition count 71
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 448 place count 34 transition count 53
Iterating global reduction 5 with 9 rules applied. Total rules applied 457 place count 34 transition count 53
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 466 place count 25 transition count 35
Iterating global reduction 5 with 9 rules applied. Total rules applied 475 place count 25 transition count 35
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 484 place count 16 transition count 26
Iterating global reduction 5 with 9 rules applied. Total rules applied 493 place count 16 transition count 26
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 494 place count 16 transition count 25
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 495 place count 16 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 496 place count 15 transition count 24
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 499 place count 12 transition count 21
Applied a total of 499 rules in 76 ms. Remains 12 /306 variables (removed 294) and now considering 21/340 (removed 319) transitions.
[2025-06-03 08:12:21] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
// Phase 1: matrix 17 rows 12 cols
[2025-06-03 08:12:21] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:12:21] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-03 08:12:21] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
[2025-06-03 08:12:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:12:21] [INFO ] Implicit Places using invariants and state equation in 36 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 08:12:21] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2025-06-03 08:12:21] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
[2025-06-03 08:12:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 3/28 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/29 variables, and 12 constraints, problems are : Problem set: 0 solved, 15 unsolved in 230 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 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, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 3/28 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/29 variables, and 27 constraints, problems are : Problem set: 0 solved, 15 unsolved in 334 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 568ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 568ms
Starting structural reductions in SI_CTL mode, iteration 1 : 12/306 places, 21/340 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 719 ms. Remains : 12/306 places, 21/340 transitions.
[2025-06-03 08:12:22] [INFO ] Flatten gal took : 0 ms
[2025-06-03 08:12:22] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:12:22] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-03 08:12:22] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:12:22] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:12:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality13323954145423870636.gal : 1 ms
[2025-06-03 08:12:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality7598669881682520652.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/CTLCardinality13323954145423870636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7598669881682520652.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,2310,0.00527,3752,2,31,5,187,6,0,58,174,0


Converting to forward existential form...Done !
original formula: AF((AG((p186==1)) + EF((p150==1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((p186==1)))) + E(TRUE U (p150==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t8, t10, t12, t20, Intersection with reachable at each step enabled. (destroyed/reve...186
(forward)formula 0,1,0.011115,4136,1,0,43,893,66,25,331,977,57
FORMULA DiscoveryGPU-PT-12b-CTLCardinality-2023-12 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 : 306/306 places, 340/340 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 294 transition count 340
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 53 place count 253 transition count 299
Iterating global reduction 1 with 41 rules applied. Total rules applied 94 place count 253 transition count 299
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 106 place count 241 transition count 285
Iterating global reduction 1 with 12 rules applied. Total rules applied 118 place count 241 transition count 285
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 129 place count 230 transition count 273
Iterating global reduction 1 with 11 rules applied. Total rules applied 140 place count 230 transition count 273
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 151 place count 219 transition count 261
Iterating global reduction 1 with 11 rules applied. Total rules applied 162 place count 219 transition count 261
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 171 place count 210 transition count 245
Iterating global reduction 1 with 9 rules applied. Total rules applied 180 place count 210 transition count 245
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 188 place count 202 transition count 237
Iterating global reduction 1 with 8 rules applied. Total rules applied 196 place count 202 transition count 237
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 203 place count 195 transition count 230
Iterating global reduction 1 with 7 rules applied. Total rules applied 210 place count 195 transition count 230
Applied a total of 210 rules in 47 ms. Remains 195 /306 variables (removed 111) and now considering 230/340 (removed 110) transitions.
// Phase 1: matrix 230 rows 195 cols
[2025-06-03 08:12:22] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:12:22] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-06-03 08:12:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:12:22] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2025-06-03 08:12:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 230/425 variables, 195/197 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:12:32] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:12:32] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:12:32] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:12:32] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:12:32] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:12:33] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:12:33] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:12:33] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:12:33] [INFO ] Deduced a trap composed of 15 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 08:12:33] [INFO ] Deduced a trap composed of 16 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 08:12:33] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:12:34] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/425 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 209 constraints, problems are : Problem set: 0 solved, 229 unsolved in 27974 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/425 variables, 195/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 229/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 438 constraints, problems are : Problem set: 0 solved, 229 unsolved in 27175 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55204ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 55205ms
Starting structural reductions in LTL mode, iteration 1 : 195/306 places, 230/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55745 ms. Remains : 195/306 places, 230/340 transitions.
[2025-06-03 08:13:17] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:13:17] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:13:17] [INFO ] Input system was already deterministic with 230 transitions.
[2025-06-03 08:13:17] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:13:17] [INFO ] Flatten gal took : 4 ms
[2025-06-03 08:13:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality3437979560712367339.gal : 2 ms
[2025-06-03 08:13:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality11701499390067698754.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/CTLCardinality3437979560712367339.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11701499390067698754.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 08:13:47] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:13:47] [INFO ] Applying decomposition
[2025-06-03 08:13:47] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2299264241672149536.txt' '-o' '/tmp/graph2299264241672149536.bin' '-w' '/tmp/graph2299264241672149536.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2299264241672149536.bin' '-l' '-1' '-v' '-w' '/tmp/graph2299264241672149536.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:13:47] [INFO ] Decomposing Gal with order
[2025-06-03 08:13:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:13:47] [INFO ] Removed a total of 93 redundant transitions.
[2025-06-03 08:13:47] [INFO ] Flatten gal took : 11 ms
[2025-06-03 08:13:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 3 ms.
[2025-06-03 08:13:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality13411795513744615117.gal : 2 ms
[2025-06-03 08:13:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality18153945810360920906.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/CTLCardinality13411795513744615117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18153945810360920906.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 : 306/306 places, 340/340 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 297 transition count 340
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 44 place count 262 transition count 305
Iterating global reduction 1 with 35 rules applied. Total rules applied 79 place count 262 transition count 305
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 90 place count 251 transition count 293
Iterating global reduction 1 with 11 rules applied. Total rules applied 101 place count 251 transition count 293
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 111 place count 241 transition count 282
Iterating global reduction 1 with 10 rules applied. Total rules applied 121 place count 241 transition count 282
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 129 place count 233 transition count 273
Iterating global reduction 1 with 8 rules applied. Total rules applied 137 place count 233 transition count 273
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 144 place count 226 transition count 261
Iterating global reduction 1 with 7 rules applied. Total rules applied 151 place count 226 transition count 261
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 157 place count 220 transition count 255
Iterating global reduction 1 with 6 rules applied. Total rules applied 163 place count 220 transition count 255
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 168 place count 215 transition count 250
Iterating global reduction 1 with 5 rules applied. Total rules applied 173 place count 215 transition count 250
Applied a total of 173 rules in 40 ms. Remains 215 /306 variables (removed 91) and now considering 250/340 (removed 90) transitions.
// Phase 1: matrix 250 rows 215 cols
[2025-06-03 08:14:18] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:14:18] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-06-03 08:14:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:14:18] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2025-06-03 08:14:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (OVERLAPS) 250/462 variables, 212/214 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:14:30] [INFO ] Deduced a trap composed of 7 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 08:14:30] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:14:30] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:14:31] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:14:31] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:14:31] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:14:31] [INFO ] Deduced a trap composed of 13 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 08:14:31] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:14:31] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:14:32] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:14:32] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:14:32] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 12/226 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 3/465 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/465 variables, and 229 constraints, problems are : Problem set: 0 solved, 249 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/462 variables, 212/226 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 246/472 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 3/465 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 249 unsolved
(s210 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/465 variables, and 478 constraints, problems are : Problem set: 0 solved, 249 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 215/306 places, 250/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60674 ms. Remains : 215/306 places, 250/340 transitions.
[2025-06-03 08:15:18] [INFO ] Flatten gal took : 9 ms
[2025-06-03 08:15:18] [INFO ] Flatten gal took : 8 ms
[2025-06-03 08:15:18] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-03 08:15:18] [INFO ] Flatten gal took : 9 ms
[2025-06-03 08:15:18] [INFO ] Flatten gal took : 9 ms
[2025-06-03 08:15:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality9467356131924517858.gal : 2 ms
[2025-06-03 08:15:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality11933562845474326627.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/CTLCardinality9467356131924517858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11933562845474326627.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 08:15:48] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:15:48] [INFO ] Applying decomposition
[2025-06-03 08:15:48] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17872946176014948685.txt' '-o' '/tmp/graph17872946176014948685.bin' '-w' '/tmp/graph17872946176014948685.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17872946176014948685.bin' '-l' '-1' '-v' '-w' '/tmp/graph17872946176014948685.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:15:48] [INFO ] Decomposing Gal with order
[2025-06-03 08:15:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:15:48] [INFO ] Removed a total of 94 redundant transitions.
[2025-06-03 08:15:48] [INFO ] Flatten gal took : 12 ms
[2025-06-03 08:15:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 2 ms.
[2025-06-03 08:15:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality12102362060387464733.gal : 2 ms
[2025-06-03 08:15:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality12884235982157847933.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/CTLCardinality12102362060387464733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12884235982157847933.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 : 306/306 places, 340/340 transitions.
Graph (complete) has 561 edges and 306 vertex of which 279 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 278 transition count 264
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 121 place count 218 transition count 264
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 121 place count 218 transition count 239
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 171 place count 193 transition count 239
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 184 place count 180 transition count 226
Iterating global reduction 2 with 13 rules applied. Total rules applied 197 place count 180 transition count 226
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 197 place count 180 transition count 224
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 201 place count 178 transition count 224
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 210 place count 169 transition count 214
Iterating global reduction 2 with 9 rules applied. Total rules applied 219 place count 169 transition count 214
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 228 place count 160 transition count 204
Iterating global reduction 2 with 9 rules applied. Total rules applied 237 place count 160 transition count 204
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 245 place count 152 transition count 189
Iterating global reduction 2 with 8 rules applied. Total rules applied 253 place count 152 transition count 189
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 260 place count 145 transition count 182
Iterating global reduction 2 with 7 rules applied. Total rules applied 267 place count 145 transition count 182
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 313 place count 122 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 315 place count 120 transition count 156
Iterating global reduction 2 with 2 rules applied. Total rules applied 317 place count 120 transition count 156
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 319 place count 118 transition count 153
Iterating global reduction 2 with 2 rules applied. Total rules applied 321 place count 118 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 322 place count 117 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 323 place count 117 transition count 152
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 325 place count 115 transition count 150
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 137 edges and 113 vertex of which 109 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 119 edges and 109 vertex of which 48 / 109 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 40 rules applied. Total rules applied 365 place count 85 transition count 109
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 425 place count 49 transition count 85
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 436 place count 38 transition count 63
Iterating global reduction 4 with 11 rules applied. Total rules applied 447 place count 38 transition count 63
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 458 place count 27 transition count 41
Iterating global reduction 4 with 11 rules applied. Total rules applied 469 place count 27 transition count 41
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 480 place count 16 transition count 19
Iterating global reduction 4 with 11 rules applied. Total rules applied 491 place count 16 transition count 19
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 501 place count 6 transition count 9
Iterating global reduction 4 with 10 rules applied. Total rules applied 511 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 512 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 513 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 514 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 515 place count 4 transition count 6
Applied a total of 515 rules in 44 ms. Remains 4 /306 variables (removed 302) and now considering 6/340 (removed 334) transitions.
[2025-06-03 08:16:19] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2025-06-03 08:16:19] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:16:19] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-03 08:16:19] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2025-06-03 08:16:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:16:19] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 08:16:19] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:16:19] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2025-06-03 08:16:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 69 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 47 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 130ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 131ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/306 places, 6/340 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 228 ms. Remains : 4/306 places, 6/340 transitions.
[2025-06-03 08:16:19] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:16:19] [INFO ] Flatten gal took : 0 ms
[2025-06-03 08:16:19] [INFO ] Input system was already deterministic with 6 transitions.
[2025-06-03 08:16:19] [INFO ] Flatten gal took : 0 ms
[2025-06-03 08:16:19] [INFO ] Flatten gal took : 0 ms
[2025-06-03 08:16:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality2214934432248283068.gal : 0 ms
[2025-06-03 08:16:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality6218779148471841548.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/CTLCardinality2214934432248283068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6218779148471841548.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,247,0.00647,3660,2,19,5,162,6,0,21,164,0


Converting to forward existential form...Done !
original formula: AF((p199==1))
=> equivalent forward existential formula: [FwdG(Init,!((p199==1)))] = FALSE
Hit Full ! (commute/partial/dont) 4/0/2
(forward)formula 0,0,0.00935,3916,1,0,9,244,20,3,120,279,8
FORMULA DiscoveryGPU-PT-12b-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-06-03 08:16:19] [INFO ] Flatten gal took : 7 ms
[2025-06-03 08:16:19] [INFO ] Flatten gal took : 7 ms
[2025-06-03 08:16:19] [INFO ] Applying decomposition
[2025-06-03 08:16: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/graph13794272373630575678.txt' '-o' '/tmp/graph13794272373630575678.bin' '-w' '/tmp/graph13794272373630575678.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13794272373630575678.bin' '-l' '-1' '-v' '-w' '/tmp/graph13794272373630575678.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:16:19] [INFO ] Decomposing Gal with order
[2025-06-03 08:16:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:16:19] [INFO ] Removed a total of 107 redundant transitions.
[2025-06-03 08:16:19] [INFO ] Flatten gal took : 17 ms
[2025-06-03 08:16:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 08:16:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality10675887172067006303.gal : 5 ms
[2025-06-03 08:16:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality6970179233307816753.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/CTLCardinality10675887172067006303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6970179233307816753.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 9 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 08:42:41] [INFO ] Applying decomposition
[2025-06-03 08:42:41] [INFO ] Flatten gal took : 200 ms
[2025-06-03 08:42:42] [INFO ] Decomposing Gal with order
[2025-06-03 08:42:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:42:42] [INFO ] Removed a total of 108 redundant transitions.
[2025-06-03 08:42:42] [INFO ] Flatten gal took : 449 ms
[2025-06-03 08:42:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 745 labels/synchronizations in 663 ms.
[2025-06-03 08:42:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality8119876194143384846.gal : 85 ms
[2025-06-03 08:42:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality9940334279431616330.ctl : 19 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/CTLCardinality8119876194143384846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9940334279431616330.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 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.72443e+17,369.454,5187256,1956,4433,8.43537e+06,1.28329e+06,487,2.72862e+07,296,7.42443e+06,0


Converting to forward existential form...Done !
original formula: (EF((((i0.i0.i0.i0.i0.i0.i0.u17.p153==0)||(i0.i0.i0.i0.i0.i0.i0.i0.u16.p144==1))&&(i0.i0.i0.i0.i0.i0.i0.u17.p169==1))) + AX(((EG((((i0.i0...530
=> equivalent forward existential formula: ([((EY((Init * !(E(TRUE U (((i0.i0.i0.i0.i0.i0.i0.u17.p153==0)||(i0.i0.i0.i0.i0.i0.i0.i0.u16.p144==1))&&(i0.i0.i...752
Reverse transition relation is NOT exact ! Due to transitions t250, t255, t310, t312, i0.u23.t23, i0.u23.t25, i0.u23.t27, i0.u23.t29, i0.i0.t34, i0.i0.t41,...1865
Using saturation style SCC detection
Using 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,859.703,5718128,1,0,8.43537e+06,2.55876e+06,1306,3.1715e+07,1052,1.49537e+07,834803
FORMULA DiscoveryGPU-PT-12b-CTLCardinality-2025-01 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-12b"
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-12b, 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-174854064700713"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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