Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007900450.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 GPUForwardProgress-PT-20b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007900450
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 103K 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 GPUForwardProgress-PT-20b-CTLFireability-2023-12
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2023-13
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2023-14
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2023-15
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2025-00
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2025-01
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2025-02
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2025-03
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2025-04
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2025-05
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2025-06
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2025-07
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2025-08
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2025-09
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2025-10
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748964645077

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-20b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 15:30:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 15:30:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 15:30:48] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2025-06-03 15:30:48] [INFO ] Transformed 416 places.
[2025-06-03 15:30:48] [INFO ] Transformed 437 transitions.
[2025-06-03 15:30:48] [INFO ] Found NUPN structural information;
[2025-06-03 15:30:48] [INFO ] Parsed PT model containing 416 places and 437 transitions and 1077 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Support contains 90 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 437/437 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 415 transition count 437
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 384 transition count 406
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 384 transition count 406
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 71 place count 376 transition count 398
Iterating global reduction 1 with 8 rules applied. Total rules applied 79 place count 376 transition count 398
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 87 place count 376 transition count 390
Applied a total of 87 rules in 177 ms. Remains 376 /416 variables (removed 40) and now considering 390/437 (removed 47) transitions.
// Phase 1: matrix 390 rows 376 cols
[2025-06-03 15:30:48] [INFO ] Computed 21 invariants in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:30:49] [INFO ] Implicit Places using invariants in 672 ms returned []
[2025-06-03 15:30:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:30:50] [INFO ] Implicit Places using invariants and state equation in 817 ms returned []
Implicit Place search using SMT with State Equation took 1582 ms to find 0 implicit places.
Running 389 sub problems to find dead transitions.
[2025-06-03 15:30:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/375 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 390/765 variables, 375/396 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 389 unsolved
SMT process timed out in 30295ms, After SMT, problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 30344ms
Starting structural reductions in LTL mode, iteration 1 : 376/416 places, 390/437 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32159 ms. Remains : 376/416 places, 390/437 transitions.
Support contains 90 out of 376 places after structural reductions.
[2025-06-03 15:31:20] [INFO ] Flatten gal took : 109 ms
[2025-06-03 15:31:20] [INFO ] Flatten gal took : 52 ms
[2025-06-03 15:31:21] [INFO ] Input system was already deterministic with 390 transitions.
Support contains 85 out of 376 places (down from 90) after GAL structural reductions.
RANDOM walk for 40000 steps (225 resets) in 1738 ms. (23 steps per ms) remains 9/63 properties
BEST_FIRST walk for 40003 steps (24 resets) in 291 ms. (136 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 178 ms. (223 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (28 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (27 resets) in 163 ms. (243 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (22 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 144 ms. (275 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (25 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 64 ms. (615 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (27 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
[2025-06-03 15:31:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 358/375 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 390/765 variables, 375/396 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp43 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/766 variables, 1/397 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/766 variables, 0/397 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/766 variables, 0/397 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 766/766 variables, and 397 constraints, problems are : Problem set: 1 solved, 8 unsolved in 1850 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 360/375 variables, 21/21 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 390/765 variables, 375/396 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 8/404 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/765 variables, 0/404 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1/766 variables, 1/405 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/766 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/766 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 766/766 variables, and 405 constraints, problems are : Problem set: 1 solved, 8 unsolved in 1620 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3498ms problems are : Problem set: 1 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 7 properties in 1118 ms.
Support contains 2 out of 376 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 390/390 transitions.
Graph (trivial) has 323 edges and 376 vertex of which 7 / 376 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 571 edges and 370 vertex of which 346 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 185 transitions
Trivial Post-agglo rules discarded 185 transitions
Performed 185 trivial Post agglomeration. Transition count delta: 185
Iterating post reduction 0 with 187 rules applied. Total rules applied 189 place count 346 transition count 192
Reduce places removed 185 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 1 with 201 rules applied. Total rules applied 390 place count 161 transition count 176
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 395 place count 156 transition count 176
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 395 place count 156 transition count 134
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 479 place count 114 transition count 134
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 500 place count 93 transition count 113
Iterating global reduction 3 with 21 rules applied. Total rules applied 521 place count 93 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 521 place count 93 transition count 112
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 523 place count 92 transition count 112
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 647 place count 30 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 78 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 649 place count 29 transition count 49
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 651 place count 29 transition count 47
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 669 place count 11 transition count 11
Iterating global reduction 5 with 18 rules applied. Total rules applied 687 place count 11 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 691 place count 9 transition count 9
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 11 edges and 9 vertex of which 8 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 3 rules applied. Total rules applied 694 place count 8 transition count 7
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 695 place count 8 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 696 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 697 place count 6 transition count 5
Applied a total of 697 rules in 64 ms. Remains 6 /376 variables (removed 370) and now considering 5/390 (removed 385) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 6/376 places, 5/390 transitions.
RANDOM walk for 40000 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Probably explored full state space saw : 5 states, properties seen :0
Probabilistic random walk after 10 steps, saw 5 distinct states, run finished after 12 ms. (steps per millisecond=0 ) properties seen :0
Explored full state space saw : 5 states, properties seen :0
Exhaustive walk after 10 steps, saw 5 distinct states, run finished after 2 ms. (steps per millisecond=5 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2025-06-03 15:31:26] [INFO ] Flatten gal took : 25 ms
[2025-06-03 15:31:26] [INFO ] Flatten gal took : 26 ms
[2025-06-03 15:31:27] [INFO ] Input system was already deterministic with 390 transitions.
Computed a total of 72 stabilizing places and 72 stable transitions
Graph (complete) has 579 edges and 376 vertex of which 352 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.11 ms
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 390/390 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 354 transition count 368
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 354 transition count 368
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 49 place count 354 transition count 363
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 345 transition count 354
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 345 transition count 354
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 74 place count 345 transition count 347
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 344 transition count 346
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 344 transition count 346
Applied a total of 76 rules in 62 ms. Remains 344 /376 variables (removed 32) and now considering 346/390 (removed 44) transitions.
// Phase 1: matrix 346 rows 344 cols
[2025-06-03 15:31:27] [INFO ] Computed 21 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:31:27] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-03 15:31:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:31:27] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2025-06-03 15:31:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 344/376 places, 346/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60789 ms. Remains : 344/376 places, 346/390 transitions.
[2025-06-03 15:32:27] [INFO ] Flatten gal took : 38 ms
[2025-06-03 15:32:27] [INFO ] Flatten gal took : 32 ms
[2025-06-03 15:32:27] [INFO ] Input system was already deterministic with 346 transitions.
[2025-06-03 15:32:28] [INFO ] Flatten gal took : 29 ms
[2025-06-03 15:32:28] [INFO ] Flatten gal took : 27 ms
[2025-06-03 15:32:28] [INFO ] Time to serialize gal into /tmp/CTLFireability11256247347259421166.gal : 24 ms
[2025-06-03 15:32:28] [INFO ] Time to serialize properties into /tmp/CTLFireability11590236740556764163.ctl : 5 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/CTLFireability11256247347259421166.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11590236740556764163.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 15:32:58] [INFO ] Flatten gal took : 18 ms
[2025-06-03 15:32:58] [INFO ] Applying decomposition
[2025-06-03 15:32:58] [INFO ] Flatten gal took : 16 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/graph13577462172223680798.txt' '-o' '/tmp/graph13577462172223680798.bin' '-w' '/tmp/graph13577462172223680798.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13577462172223680798.bin' '-l' '-1' '-v' '-w' '/tmp/graph13577462172223680798.weights' '-q' '0' '-e' '0.001'
[2025-06-03 15:32:58] [INFO ] Decomposing Gal with order
[2025-06-03 15:32:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 15:32:58] [INFO ] Removed a total of 45 redundant transitions.
[2025-06-03 15:32:58] [INFO ] Flatten gal took : 98 ms
[2025-06-03 15:32:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-06-03 15:32:58] [INFO ] Time to serialize gal into /tmp/CTLFireability3309978357245984911.gal : 11 ms
[2025-06-03 15:32:58] [INFO ] Time to serialize properties into /tmp/CTLFireability8862102090181310656.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/CTLFireability3309978357245984911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8862102090181310656.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 : 376/376 places, 390/390 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 356 transition count 370
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 356 transition count 370
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 45 place count 356 transition count 365
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 348 transition count 357
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 348 transition count 357
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 67 place count 348 transition count 351
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 347 transition count 350
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 347 transition count 350
Applied a total of 69 rules in 66 ms. Remains 347 /376 variables (removed 29) and now considering 350/390 (removed 40) transitions.
// Phase 1: matrix 350 rows 347 cols
[2025-06-03 15:33:28] [INFO ] Computed 21 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:33:28] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-03 15:33:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:33:29] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2025-06-03 15:33:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 350/696 variables, 346/367 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/696 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (OVERLAPS) 1/697 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 349 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 697/697 variables, and 368 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 349 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 350/696 variables, 346/367 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/696 variables, 349/716 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/696 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (OVERLAPS) 1/697 variables, 1/717 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 697/697 variables, and 717 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 347/376 places, 350/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60682 ms. Remains : 347/376 places, 350/390 transitions.
[2025-06-03 15:34:29] [INFO ] Flatten gal took : 16 ms
[2025-06-03 15:34:29] [INFO ] Flatten gal took : 12 ms
[2025-06-03 15:34:29] [INFO ] Input system was already deterministic with 350 transitions.
[2025-06-03 15:34:29] [INFO ] Flatten gal took : 12 ms
[2025-06-03 15:34:29] [INFO ] Flatten gal took : 12 ms
[2025-06-03 15:34:29] [INFO ] Time to serialize gal into /tmp/CTLFireability15626740052304640651.gal : 4 ms
[2025-06-03 15:34:29] [INFO ] Time to serialize properties into /tmp/CTLFireability15241936017411517747.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/CTLFireability15626740052304640651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15241936017411517747.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 15:34:59] [INFO ] Flatten gal took : 13 ms
[2025-06-03 15:34:59] [INFO ] Applying decomposition
[2025-06-03 15:34:59] [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/graph11440835891754419772.txt' '-o' '/tmp/graph11440835891754419772.bin' '-w' '/tmp/graph11440835891754419772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11440835891754419772.bin' '-l' '-1' '-v' '-w' '/tmp/graph11440835891754419772.weights' '-q' '0' '-e' '0.001'
[2025-06-03 15:34:59] [INFO ] Decomposing Gal with order
[2025-06-03 15:34:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 15:34:59] [INFO ] Removed a total of 100 redundant transitions.
[2025-06-03 15:34:59] [INFO ] Flatten gal took : 33 ms
[2025-06-03 15:34:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-03 15:34:59] [INFO ] Time to serialize gal into /tmp/CTLFireability1009329574481938242.gal : 8 ms
[2025-06-03 15:34:59] [INFO ] Time to serialize properties into /tmp/CTLFireability476943708745619104.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/CTLFireability1009329574481938242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability476943708745619104.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.56977e+25,0.452241,16800,1033,28,25699,312,551,39313,36,753,0


Converting to forward existential form...Done !
original formula: AX((((i19.u124.p348==1)&&((i8.u54.p157==1)||(((i4.u29.p87==1)&&(((i7.u46.p134==0)||(i21.u139.p397==0))||(i21.u143.p412==0)))&&(((i6.u43.p...288
=> equivalent forward existential formula: ([(FwdU(FwdU((EY(Init) * !(((i19.u124.p348==1)&&((i8.u54.p157==1)||(((i4.u29.p87==1)&&(((i7.u46.p134==0)||(i21.u...565
Reverse transition relation is NOT exact ! Due to transitions t308, i1.t303, i1.t296, i2.t290, i2.u21.t283, i3.t276, i3.u22.t269, i4.t262, i4.t255, i5.t248...676
(forward)formula 0,0,1.08604,29856,1,0,48370,318,4176,78303,173,943,190504
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 390/390 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 358 transition count 372
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 358 transition count 372
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 358 transition count 369
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 349 transition count 360
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 349 transition count 360
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 64 place count 349 transition count 353
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 348 transition count 352
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 348 transition count 352
Applied a total of 66 rules in 31 ms. Remains 348 /376 variables (removed 28) and now considering 352/390 (removed 38) transitions.
// Phase 1: matrix 352 rows 348 cols
[2025-06-03 15:35:00] [INFO ] Computed 21 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:35:00] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-06-03 15:35:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:35:01] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 351 sub problems to find dead transitions.
[2025-06-03 15:35: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/347 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/347 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 352/699 variables, 347/368 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 351 unsolved
SMT process timed out in 30058ms, After SMT, problems are : Problem set: 0 solved, 351 unsolved
Search for dead transitions found 0 dead transitions in 30060ms
Starting structural reductions in LTL mode, iteration 1 : 348/376 places, 352/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30579 ms. Remains : 348/376 places, 352/390 transitions.
[2025-06-03 15:35:31] [INFO ] Flatten gal took : 18 ms
[2025-06-03 15:35:31] [INFO ] Flatten gal took : 16 ms
[2025-06-03 15:35:31] [INFO ] Input system was already deterministic with 352 transitions.
[2025-06-03 15:35:31] [INFO ] Flatten gal took : 16 ms
[2025-06-03 15:35:31] [INFO ] Flatten gal took : 16 ms
[2025-06-03 15:35:31] [INFO ] Time to serialize gal into /tmp/CTLFireability11409513686125821379.gal : 6 ms
[2025-06-03 15:35:31] [INFO ] Time to serialize properties into /tmp/CTLFireability13984982893840864900.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/CTLFireability11409513686125821379.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13984982893840864900.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 15:36:01] [INFO ] Flatten gal took : 9 ms
[2025-06-03 15:36:01] [INFO ] Applying decomposition
[2025-06-03 15:36:01] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4091398510416453130.txt' '-o' '/tmp/graph4091398510416453130.bin' '-w' '/tmp/graph4091398510416453130.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4091398510416453130.bin' '-l' '-1' '-v' '-w' '/tmp/graph4091398510416453130.weights' '-q' '0' '-e' '0.001'
[2025-06-03 15:36:01] [INFO ] Decomposing Gal with order
[2025-06-03 15:36:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 15:36:01] [INFO ] Removed a total of 99 redundant transitions.
[2025-06-03 15:36:01] [INFO ] Flatten gal took : 26 ms
[2025-06-03 15:36:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-03 15:36:01] [INFO ] Time to serialize gal into /tmp/CTLFireability11143341926144050462.gal : 11 ms
[2025-06-03 15:36:01] [INFO ] Time to serialize properties into /tmp/CTLFireability4230560554813178692.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/CTLFireability11143341926144050462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4230560554813178692.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.78245e+25,0.287197,12260,780,29,16758,295,625,21126,38,627,0


Converting to forward existential form...Done !
original formula: EG(EX(A(((((i21.i0.u137.p390==1)||(i21.i1.u140.p405==1))||((i20.i1.u135.p378==1)||(i0.i0.u2.p7==1)))||(((i10.i0.u72.p192==1)&&(i16.i0.u10...291
=> equivalent forward existential formula: [FwdG(Init,EX(!((E(!(!((((i2.i0.u17.p44==1)&&(i21.i1.u139.p397==1))&&((i21.i1.u142.p412==1)&&(i14.i0.u96.p265==1...553
Reverse transition relation is NOT exact ! Due to transitions t310, i1.t305, i1.i2.t298, i2.t292, i2.i1.u21.t285, i3.t278, i3.i0.t271, i4.t264, i4.i1.u29.t...767
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 1
Fast SCC detection found a local SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 390/390 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 356 transition count 370
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 356 transition count 370
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 45 place count 356 transition count 365
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 348 transition count 357
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 348 transition count 357
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 67 place count 348 transition count 351
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 347 transition count 350
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 347 transition count 350
Applied a total of 69 rules in 25 ms. Remains 347 /376 variables (removed 29) and now considering 350/390 (removed 40) transitions.
// Phase 1: matrix 350 rows 347 cols
[2025-06-03 15:36:31] [INFO ] Computed 21 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:36:31] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-03 15:36:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:36:32] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2025-06-03 15:36:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 350/696 variables, 346/367 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/696 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (OVERLAPS) 1/697 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 697/697 variables, and 368 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 349 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 350/696 variables, 346/367 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/696 variables, 349/716 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/696 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (OVERLAPS) 1/697 variables, 1/717 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 697/697 variables, and 717 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Starting structural reductions in LTL mode, iteration 1 : 347/376 places, 350/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60698 ms. Remains : 347/376 places, 350/390 transitions.
[2025-06-03 15:37:32] [INFO ] Flatten gal took : 15 ms
[2025-06-03 15:37:32] [INFO ] Flatten gal took : 14 ms
[2025-06-03 15:37:32] [INFO ] Input system was already deterministic with 350 transitions.
[2025-06-03 15:37:32] [INFO ] Flatten gal took : 14 ms
[2025-06-03 15:37:32] [INFO ] Flatten gal took : 18 ms
[2025-06-03 15:37:32] [INFO ] Time to serialize gal into /tmp/CTLFireability8352525776810779457.gal : 5 ms
[2025-06-03 15:37:32] [INFO ] Time to serialize properties into /tmp/CTLFireability10253362017615847935.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/CTLFireability8352525776810779457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10253362017615847935.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 15:38:02] [INFO ] Flatten gal took : 9 ms
[2025-06-03 15:38:02] [INFO ] Applying decomposition
[2025-06-03 15:38:02] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6662501968644265417.txt' '-o' '/tmp/graph6662501968644265417.bin' '-w' '/tmp/graph6662501968644265417.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6662501968644265417.bin' '-l' '-1' '-v' '-w' '/tmp/graph6662501968644265417.weights' '-q' '0' '-e' '0.001'
[2025-06-03 15:38:02] [INFO ] Decomposing Gal with order
[2025-06-03 15:38:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 15:38:02] [INFO ] Removed a total of 49 redundant transitions.
[2025-06-03 15:38:02] [INFO ] Flatten gal took : 25 ms
[2025-06-03 15:38:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 15:38:02] [INFO ] Time to serialize gal into /tmp/CTLFireability4965590576300357308.gal : 5 ms
[2025-06-03 15:38:02] [INFO ] Time to serialize properties into /tmp/CTLFireability276675808834485838.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/CTLFireability4965590576300357308.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability276675808834485838.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 376/376 places, 390/390 transitions.
Graph (trivial) has 321 edges and 376 vertex of which 7 / 376 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 572 edges and 370 vertex of which 346 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 182 transitions
Trivial Post-agglo rules discarded 182 transitions
Performed 182 trivial Post agglomeration. Transition count delta: 182
Iterating post reduction 0 with 182 rules applied. Total rules applied 184 place count 345 transition count 197
Reduce places removed 182 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 1 with 199 rules applied. Total rules applied 383 place count 163 transition count 180
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 390 place count 158 transition count 178
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 392 place count 156 transition count 178
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 392 place count 156 transition count 137
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 474 place count 115 transition count 137
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 494 place count 95 transition count 117
Iterating global reduction 4 with 20 rules applied. Total rules applied 514 place count 95 transition count 117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 514 place count 95 transition count 116
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 516 place count 94 transition count 116
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 600 place count 52 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 602 place count 50 transition count 72
Applied a total of 602 rules in 55 ms. Remains 50 /376 variables (removed 326) and now considering 72/390 (removed 318) transitions.
// Phase 1: matrix 72 rows 50 cols
[2025-06-03 15:38:32] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:38:32] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-03 15:38:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:38:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 15:38:33] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:38:33] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2025-06-03 15:38:33] [INFO ] Invariant cache hit.
[2025-06-03 15:38:33] [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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 71/101 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 20/121 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 1/122 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 51 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2483 ms.
Refiners :[State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 71/101 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 20/121 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 40/101 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 1/122 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 102 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2822 ms.
Refiners :[State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5314ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 5315ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/376 places, 72/390 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5480 ms. Remains : 50/376 places, 72/390 transitions.
[2025-06-03 15:38:38] [INFO ] Flatten gal took : 5 ms
[2025-06-03 15:38:38] [INFO ] Flatten gal took : 4 ms
[2025-06-03 15:38:38] [INFO ] Input system was already deterministic with 72 transitions.
[2025-06-03 15:38:38] [INFO ] Flatten gal took : 5 ms
[2025-06-03 15:38:38] [INFO ] Flatten gal took : 4 ms
[2025-06-03 15:38:38] [INFO ] Time to serialize gal into /tmp/CTLFireability3014601886363558669.gal : 1 ms
[2025-06-03 15:38:38] [INFO ] Time to serialize properties into /tmp/CTLFireability17659511770523709581.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/CTLFireability3014601886363558669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17659511770523709581.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,7.19052e+11,1.30078,35964,2,814,5,199461,6,0,272,170137,0


Converting to forward existential form...Done !
original formula: AF(E(((p157==1)&&(p408==1)) U AG((p280==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(((p157==1)&&(p408==1)) U !(E(TRUE U !((p280==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t8, t9, t12, t13, t15, t17, t19, t21, t23, t25, t27, t29, t31, t33, t36, t38, t40...285
(forward)formula 0,0,2.3921,43132,1,0,178,237575,173,79,1968,215973,159
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 390/390 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 355 transition count 369
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 355 transition count 369
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 47 place count 355 transition count 364
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 56 place count 346 transition count 355
Iterating global reduction 1 with 9 rules applied. Total rules applied 65 place count 346 transition count 355
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 72 place count 346 transition count 348
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 345 transition count 347
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 345 transition count 347
Applied a total of 74 rules in 110 ms. Remains 345 /376 variables (removed 31) and now considering 347/390 (removed 43) transitions.
// Phase 1: matrix 347 rows 345 cols
[2025-06-03 15:38:40] [INFO ] Computed 21 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:38:41] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-06-03 15:38:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:38:41] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Running 346 sub problems to find dead transitions.
[2025-06-03 15:38:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 347/691 variables, 344/365 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/691 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 346 unsolved
SMT process timed out in 30059ms, After SMT, problems are : Problem set: 0 solved, 346 unsolved
Search for dead transitions found 0 dead transitions in 30060ms
Starting structural reductions in LTL mode, iteration 1 : 345/376 places, 347/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30860 ms. Remains : 345/376 places, 347/390 transitions.
[2025-06-03 15:39:11] [INFO ] Flatten gal took : 18 ms
[2025-06-03 15:39:11] [INFO ] Flatten gal took : 13 ms
[2025-06-03 15:39:11] [INFO ] Input system was already deterministic with 347 transitions.
[2025-06-03 15:39:11] [INFO ] Flatten gal took : 14 ms
[2025-06-03 15:39:11] [INFO ] Flatten gal took : 13 ms
[2025-06-03 15:39:11] [INFO ] Time to serialize gal into /tmp/CTLFireability14281238868520935421.gal : 5 ms
[2025-06-03 15:39:11] [INFO ] Time to serialize properties into /tmp/CTLFireability10989354729961668760.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/CTLFireability14281238868520935421.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10989354729961668760.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 15:39:41] [INFO ] Flatten gal took : 8 ms
[2025-06-03 15:39:41] [INFO ] Applying decomposition
[2025-06-03 15:39:41] [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/graph11665692227733043711.txt' '-o' '/tmp/graph11665692227733043711.bin' '-w' '/tmp/graph11665692227733043711.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11665692227733043711.bin' '-l' '-1' '-v' '-w' '/tmp/graph11665692227733043711.weights' '-q' '0' '-e' '0.001'
[2025-06-03 15:39:41] [INFO ] Decomposing Gal with order
[2025-06-03 15:39:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 15:39:41] [INFO ] Removed a total of 101 redundant transitions.
[2025-06-03 15:39:41] [INFO ] Flatten gal took : 23 ms
[2025-06-03 15:39:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 15:39:41] [INFO ] Time to serialize gal into /tmp/CTLFireability11488756156858172871.gal : 4 ms
[2025-06-03 15:39:41] [INFO ] Time to serialize properties into /tmp/CTLFireability11415225360408885761.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/CTLFireability11488756156858172871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11415225360408885761.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.26934e+25,0.447824,16400,892,29,24851,300,541,37450,36,758,0


Converting to forward existential form...Done !
original formula: EX(E(EG((i10.u63.p193!=1)) U A(!((E((i14.u91.p262==1) U (((i19.u126.p356==1)&&(i21.u141.p397==1))&&(i21.u139.p412==1))) * ((((i11.u70.p20...309
=> equivalent forward existential formula: [((FwdU(EY(Init),EG((i10.u63.p193!=1))) * !(EG(!(((i7.u47.p139==1)&&(((i20.u130.p369==1)||(i14.u91.p258==1))||(i...549
Reverse transition relation is NOT exact ! Due to transitions t305, i0.t300, i0.t293, i1.t287, i1.u20.t280, i2.t273, i2.u21.t266, i4.t259, i4.u32.t252, i5....664
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 390/390 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 357 transition count 371
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 357 transition count 371
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 357 transition count 366
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 348 transition count 357
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 348 transition count 357
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 348 transition count 350
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 347 transition count 349
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 347 transition count 349
Applied a total of 70 rules in 28 ms. Remains 347 /376 variables (removed 29) and now considering 349/390 (removed 41) transitions.
// Phase 1: matrix 349 rows 347 cols
[2025-06-03 15:40:12] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:40:12] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-03 15:40:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:40:12] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2025-06-03 15:40:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 349/695 variables, 346/367 constraints. Problems are: Problem set: 0 solved, 348 unsolved
(s249 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 2.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 3.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 4.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 5.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 6.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 7.0)
(s249 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/695 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 348 unsolved
SMT process timed out in 30078ms, After SMT, problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 30080ms
Starting structural reductions in LTL mode, iteration 1 : 347/376 places, 349/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30721 ms. Remains : 347/376 places, 349/390 transitions.
[2025-06-03 15:40:42] [INFO ] Flatten gal took : 12 ms
[2025-06-03 15:40:42] [INFO ] Flatten gal took : 13 ms
[2025-06-03 15:40:42] [INFO ] Input system was already deterministic with 349 transitions.
[2025-06-03 15:40:42] [INFO ] Flatten gal took : 12 ms
[2025-06-03 15:40:42] [INFO ] Flatten gal took : 11 ms
[2025-06-03 15:40:42] [INFO ] Time to serialize gal into /tmp/CTLFireability155991958077107423.gal : 4 ms
[2025-06-03 15:40:42] [INFO ] Time to serialize properties into /tmp/CTLFireability15279679108463680470.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/CTLFireability155991958077107423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15279679108463680470.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.60887e+25,0.614228,16040,1040,29,25237,321,558,32573,36,807,0


Converting to forward existential form...Done !
original formula: AF((AX(EF((i21.u138.p388==1))) + ((i2.u10.p24==1)&&(i5.u30.p78==1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(E(TRUE U (i21.u138.p388==1))))) + ((i2.u10.p24==1)&&(i5.u30.p78==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t307, i1.t231, i1.u44.t224, i2.t303, i2.t295, i3.t288, i3.u16.t281, i4.t274, i4.u26.t267, i5....660
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 21
(forward)formula 0,1,14.2117,264360,1,0,652755,321,3820,415925,170,807,795289
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 390/390 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 355 transition count 369
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 355 transition count 369
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 355 transition count 365
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 346 transition count 356
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 346 transition count 356
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 71 place count 346 transition count 349
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 345 transition count 348
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 345 transition count 348
Applied a total of 73 rules in 28 ms. Remains 345 /376 variables (removed 31) and now considering 348/390 (removed 42) transitions.
// Phase 1: matrix 348 rows 345 cols
[2025-06-03 15:41:27] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:41:27] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-03 15:41:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:41:27] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 347 sub problems to find dead transitions.
[2025-06-03 15:41:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 348/692 variables, 344/365 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/692 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 347 unsolved
SMT process timed out in 30041ms, After SMT, problems are : Problem set: 0 solved, 347 unsolved
Search for dead transitions found 0 dead transitions in 30042ms
Starting structural reductions in LTL mode, iteration 1 : 345/376 places, 348/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30625 ms. Remains : 345/376 places, 348/390 transitions.
[2025-06-03 15:41:57] [INFO ] Flatten gal took : 11 ms
[2025-06-03 15:41:57] [INFO ] Flatten gal took : 11 ms
[2025-06-03 15:41:57] [INFO ] Input system was already deterministic with 348 transitions.
[2025-06-03 15:41:57] [INFO ] Flatten gal took : 10 ms
[2025-06-03 15:41:57] [INFO ] Flatten gal took : 10 ms
[2025-06-03 15:41:57] [INFO ] Time to serialize gal into /tmp/CTLFireability617721735021551323.gal : 7 ms
[2025-06-03 15:41:57] [INFO ] Time to serialize properties into /tmp/CTLFireability17509904182291716218.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/CTLFireability617721735021551323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17509904182291716218.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 15:42:28] [INFO ] Flatten gal took : 7 ms
[2025-06-03 15:42:28] [INFO ] Applying decomposition
[2025-06-03 15:42:28] [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/graph2203387579886113904.txt' '-o' '/tmp/graph2203387579886113904.bin' '-w' '/tmp/graph2203387579886113904.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2203387579886113904.bin' '-l' '-1' '-v' '-w' '/tmp/graph2203387579886113904.weights' '-q' '0' '-e' '0.001'
[2025-06-03 15:42:28] [INFO ] Decomposing Gal with order
[2025-06-03 15:42:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 15:42:28] [INFO ] Removed a total of 43 redundant transitions.
[2025-06-03 15:42:28] [INFO ] Flatten gal took : 18 ms
[2025-06-03 15:42:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 15:42:28] [INFO ] Time to serialize gal into /tmp/CTLFireability951020051578993818.gal : 6 ms
[2025-06-03 15:42:28] [INFO ] Time to serialize properties into /tmp/CTLFireability15319499260890450047.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/CTLFireability951020051578993818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15319499260890450047.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 : 376/376 places, 390/390 transitions.
Graph (trivial) has 312 edges and 376 vertex of which 7 / 376 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 572 edges and 370 vertex of which 346 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 177 transitions
Trivial Post-agglo rules discarded 177 transitions
Performed 177 trivial Post agglomeration. Transition count delta: 177
Iterating post reduction 0 with 177 rules applied. Total rules applied 179 place count 345 transition count 202
Reduce places removed 177 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 1 with 193 rules applied. Total rules applied 372 place count 168 transition count 186
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 377 place count 163 transition count 186
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 377 place count 163 transition count 144
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 461 place count 121 transition count 144
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 482 place count 100 transition count 123
Iterating global reduction 3 with 21 rules applied. Total rules applied 503 place count 100 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 504 place count 100 transition count 122
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 505 place count 99 transition count 121
Iterating global reduction 4 with 1 rules applied. Total rules applied 506 place count 99 transition count 121
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 588 place count 58 transition count 80
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 4 with 2 rules applied. Total rules applied 590 place count 57 transition count 79
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 592 place count 57 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 593 place count 56 transition count 78
Applied a total of 593 rules in 38 ms. Remains 56 /376 variables (removed 320) and now considering 78/390 (removed 312) transitions.
// Phase 1: matrix 78 rows 56 cols
[2025-06-03 15:42:58] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:42:58] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-03 15:42:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:42:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 15:42:58] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:42:58] [INFO ] Redundant transitions in 2 ms returned []
Running 73 sub problems to find dead transitions.
[2025-06-03 15:42:58] [INFO ] Invariant cache hit.
[2025-06-03 15:42:58] [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/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 77/128 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 5/133 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 1/134 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 57 constraints, problems are : Problem set: 0 solved, 73 unsolved in 3837 ms.
Refiners :[State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 77/128 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 5/133 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 66/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 1/134 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 130 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4384 ms.
Refiners :[State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8235ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 8235ms
Starting structural reductions in SI_CTL mode, iteration 1 : 56/376 places, 78/390 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8418 ms. Remains : 56/376 places, 78/390 transitions.
[2025-06-03 15:43:06] [INFO ] Flatten gal took : 2 ms
[2025-06-03 15:43:06] [INFO ] Flatten gal took : 2 ms
[2025-06-03 15:43:06] [INFO ] Input system was already deterministic with 78 transitions.
[2025-06-03 15:43:06] [INFO ] Flatten gal took : 2 ms
[2025-06-03 15:43:06] [INFO ] Flatten gal took : 2 ms
[2025-06-03 15:43:06] [INFO ] Time to serialize gal into /tmp/CTLFireability2260778115798781687.gal : 1 ms
[2025-06-03 15:43:06] [INFO ] Time to serialize properties into /tmp/CTLFireability12087317818882924260.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/CTLFireability2260778115798781687.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12087317818882924260.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.3966e+12,15.2736,308620,2,9179,5,1.59478e+06,6,0,301,1.45718e+06,0


Converting to forward existential form...Done !
original formula: AF(((((p22==1)&&(p50==1))&&((p397==1)&&(p412==1))) + ((p195==0) * A((p207==1) U (((p330==1)&&(p158==1))&&((p397==1)&&(p412==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(((((p22==1)&&(p50==1))&&((p397==1)&&(p412==1))) + ((p195==0) * !((E(!((((p330==1)&&(p158==1))&&((p3...320
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t5, t8, t14, t18, t19, t21, t23, t25, t27, t30, t32, t36, t39, t40, t42, t44, t46, t4...276
Detected timeout of ITS tools.
[2025-06-03 15:43:36] [INFO ] Flatten gal took : 2 ms
[2025-06-03 15:43:36] [INFO ] Applying decomposition
[2025-06-03 15:43:36] [INFO ] Flatten gal took : 2 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/graph14366858388361193937.txt' '-o' '/tmp/graph14366858388361193937.bin' '-w' '/tmp/graph14366858388361193937.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14366858388361193937.bin' '-l' '-1' '-v' '-w' '/tmp/graph14366858388361193937.weights' '-q' '0' '-e' '0.001'
[2025-06-03 15:43:36] [INFO ] Decomposing Gal with order
[2025-06-03 15:43:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 15:43:36] [INFO ] Removed a total of 58 redundant transitions.
[2025-06-03 15:43:36] [INFO ] Flatten gal took : 4 ms
[2025-06-03 15:43:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 3 ms.
[2025-06-03 15:43:36] [INFO ] Time to serialize gal into /tmp/CTLFireability7810397755873774365.gal : 1 ms
[2025-06-03 15:43:36] [INFO ] Time to serialize properties into /tmp/CTLFireability7497027592954596299.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/CTLFireability7810397755873774365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7497027592954596299.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.3966e+12,2.37519,61472,453,173,58155,1465,186,549944,37,13275,0


Converting to forward existential form...Done !
original formula: AF(((((i0.u0.p22==1)&&(u2.p50==1))&&((i15.u22.p397==1)&&(i15.u23.p412==1))) + ((i7.u11.p195==0) * A((i8.u12.p207==1) U (((u19.p330==1)&&(...212
=> equivalent forward existential formula: [FwdG(Init,!(((((i0.u0.p22==1)&&(u2.p50==1))&&((i15.u22.p397==1)&&(i15.u23.p412==1))) + ((i7.u11.p195==0) * !((E...428
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t21, t23, t25, t27, t30, t32, t36, t39, t44, t46, t49, t76, i8.t51, i8.t42, i8.t40, ...330
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 1
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 390/390 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 357 transition count 371
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 357 transition count 371
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 357 transition count 367
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 349 transition count 359
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 349 transition count 359
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 349 transition count 352
Applied a total of 65 rules in 18 ms. Remains 349 /376 variables (removed 27) and now considering 352/390 (removed 38) transitions.
// Phase 1: matrix 352 rows 349 cols
[2025-06-03 15:44:06] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:44:06] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-03 15:44:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:44:07] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
Running 351 sub problems to find dead transitions.
[2025-06-03 15:44:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 352/700 variables, 348/369 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/700 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (OVERLAPS) 1/701 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 701/701 variables, and 370 constraints, problems are : Problem set: 0 solved, 351 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 351 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 352/700 variables, 348/369 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/700 variables, 351/720 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/700 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (OVERLAPS) 1/701 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/701 variables, and 721 constraints, problems are : Problem set: 0 solved, 351 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 351 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Starting structural reductions in LTL mode, iteration 1 : 349/376 places, 352/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60714 ms. Remains : 349/376 places, 352/390 transitions.
[2025-06-03 15:45:07] [INFO ] Flatten gal took : 11 ms
[2025-06-03 15:45:07] [INFO ] Flatten gal took : 11 ms
[2025-06-03 15:45:07] [INFO ] Input system was already deterministic with 352 transitions.
[2025-06-03 15:45:07] [INFO ] Flatten gal took : 15 ms
[2025-06-03 15:45:07] [INFO ] Flatten gal took : 10 ms
[2025-06-03 15:45:07] [INFO ] Time to serialize gal into /tmp/CTLFireability4167669042583343072.gal : 3 ms
[2025-06-03 15:45:07] [INFO ] Time to serialize properties into /tmp/CTLFireability7915457568780440824.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/CTLFireability4167669042583343072.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7915457568780440824.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.47555e+25,0.250138,9956,1022,28,11166,313,601,15639,36,671,0


Converting to forward existential form...Done !
original formula: EX(AG(((i21.i1.u136.p384==1) + !(A((i0.i1.u9.p37!=1) U (i15.i0.u104.p293==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((i21.i1.u136.p384==1) + !(!((E(!((i15.i0.u104.p293==1)) U (!((i0.i1.u9.p37!=1)) * !((...227
Reverse transition relation is NOT exact ! Due to transitions t310, i0.i1.t298, i0.i1.u11.t306, i1.t291, i1.i1.u15.t284, i2.t277, i2.i0.t270, i3.t263, i3.i...781
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 0,0,17.9551,407780,1,0,711697,313,4091,797667,175,701,830359
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 390/390 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 357 transition count 371
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 357 transition count 371
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 357 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 351 transition count 360
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 351 transition count 360
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 59 place count 351 transition count 356
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 350 transition count 355
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 350 transition count 355
Applied a total of 61 rules in 25 ms. Remains 350 /376 variables (removed 26) and now considering 355/390 (removed 35) transitions.
// Phase 1: matrix 355 rows 350 cols
[2025-06-03 15:45:55] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:45:55] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-03 15:45:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:45:56] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 354 sub problems to find dead transitions.
[2025-06-03 15:45:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 355/704 variables, 349/370 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 127.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 2.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 3.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 4.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 5.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 6.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 7.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 7.0)
(s279 6.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/704 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 354 unsolved
SMT process timed out in 30046ms, After SMT, problems are : Problem set: 0 solved, 354 unsolved
Search for dead transitions found 0 dead transitions in 30047ms
Starting structural reductions in LTL mode, iteration 1 : 350/376 places, 355/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30593 ms. Remains : 350/376 places, 355/390 transitions.
[2025-06-03 15:46:26] [INFO ] Flatten gal took : 11 ms
[2025-06-03 15:46:26] [INFO ] Flatten gal took : 10 ms
[2025-06-03 15:46:26] [INFO ] Input system was already deterministic with 355 transitions.
[2025-06-03 15:46:26] [INFO ] Flatten gal took : 10 ms
[2025-06-03 15:46:26] [INFO ] Flatten gal took : 10 ms
[2025-06-03 15:46:26] [INFO ] Time to serialize gal into /tmp/CTLFireability10293570449575787072.gal : 3 ms
[2025-06-03 15:46:26] [INFO ] Time to serialize properties into /tmp/CTLFireability5564088793452677032.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/CTLFireability10293570449575787072.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5564088793452677032.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 15:46:56] [INFO ] Flatten gal took : 6 ms
[2025-06-03 15:46:56] [INFO ] Applying decomposition
[2025-06-03 15:46:56] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13286563188789047731.txt' '-o' '/tmp/graph13286563188789047731.bin' '-w' '/tmp/graph13286563188789047731.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13286563188789047731.bin' '-l' '-1' '-v' '-w' '/tmp/graph13286563188789047731.weights' '-q' '0' '-e' '0.001'
[2025-06-03 15:46:56] [INFO ] Decomposing Gal with order
[2025-06-03 15:46:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 15:46:56] [INFO ] Removed a total of 102 redundant transitions.
[2025-06-03 15:46:56] [INFO ] Flatten gal took : 18 ms
[2025-06-03 15:46:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 15:46:56] [INFO ] Time to serialize gal into /tmp/CTLFireability16845105748901495134.gal : 6 ms
[2025-06-03 15:46:56] [INFO ] Time to serialize properties into /tmp/CTLFireability7376770611416658137.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/CTLFireability16845105748901495134.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7376770611416658137.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.08005e+25,0.197185,9440,1019,28,9622,258,605,14307,36,537,0


Converting to forward existential form...Done !
original formula: E(E((i16.i1.u113.p318==1) U !((((i4.i0.u38.p94==1) * AF((i17.i0.u122.p330==1))) * (EG((i17.i1.u124.p336==1)) * !(EF((i17.i1.u124.p335==1)...220
=> equivalent forward existential formula: [(FwdU(Init,E((i16.i1.u113.p318==1) U !((((i4.i0.u38.p94==1) * !(EG(!((i17.i0.u122.p330==1))))) * (EG((i17.i1.u1...284
Reverse transition relation is NOT exact ! Due to transitions t313, i0.t308, i0.i1.u9.t301, i1.t295, i1.i2.t288, i2.t281, i2.i0.t274, i3.t267, i3.i2.t260, ...740
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,7.13553,160224,1,0,271337,289,4884,380229,183,774,376814
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 390/390 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 355 transition count 369
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 355 transition count 369
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 355 transition count 365
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 54 place count 347 transition count 357
Iterating global reduction 1 with 8 rules applied. Total rules applied 62 place count 347 transition count 357
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 69 place count 347 transition count 350
Applied a total of 69 rules in 24 ms. Remains 347 /376 variables (removed 29) and now considering 350/390 (removed 40) transitions.
// Phase 1: matrix 350 rows 347 cols
[2025-06-03 15:47:03] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:47:03] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-03 15:47:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:47:04] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2025-06-03 15:47:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 350/696 variables, 346/367 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/696 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 349 unsolved
SMT process timed out in 30042ms, After SMT, problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 30043ms
Starting structural reductions in LTL mode, iteration 1 : 347/376 places, 350/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30522 ms. Remains : 347/376 places, 350/390 transitions.
[2025-06-03 15:47:34] [INFO ] Flatten gal took : 10 ms
[2025-06-03 15:47:34] [INFO ] Flatten gal took : 10 ms
[2025-06-03 15:47:34] [INFO ] Input system was already deterministic with 350 transitions.
[2025-06-03 15:47:34] [INFO ] Flatten gal took : 10 ms
[2025-06-03 15:47:34] [INFO ] Flatten gal took : 11 ms
[2025-06-03 15:47:34] [INFO ] Time to serialize gal into /tmp/CTLFireability7836205986140757826.gal : 3 ms
[2025-06-03 15:47:34] [INFO ] Time to serialize properties into /tmp/CTLFireability3594096554790549864.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/CTLFireability7836205986140757826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3594096554790549864.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.26934e+25,0.291797,12672,811,28,17056,279,609,23093,36,677,0


Converting to forward existential form...Done !
original formula: EG(AX(((AX((i21.i1.u140.p392==0)) + A((A((i12.i0.u81.p228==1) U (i9.i0.u62.p177==1)) + (i10.i1.u66.p189!=1)) U (((((i12.i2.u80.p224==1)&&...356
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(((!(EX(!((i21.i1.u140.p392==0)))) + !((E(!((((((i12.i2.u80.p224==1)&&(i21.i0.u142.p397==1))&&(...814
Reverse transition relation is NOT exact ! Due to transitions t308, i1.t303, i1.i1.u9.t296, i2.t290, i2.i1.u20.t283, i3.t276, i3.i2.t269, i4.t262, i4.i2.t2...761
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 a local SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 376/376 places, 390/390 transitions.
Graph (trivial) has 321 edges and 376 vertex of which 7 / 376 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 572 edges and 370 vertex of which 346 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 184 rules applied. Total rules applied 186 place count 345 transition count 195
Reduce places removed 184 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 1 with 201 rules applied. Total rules applied 387 place count 161 transition count 178
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 392 place count 156 transition count 178
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 392 place count 156 transition count 135
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 478 place count 113 transition count 135
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 498 place count 93 transition count 115
Iterating global reduction 3 with 20 rules applied. Total rules applied 518 place count 93 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 519 place count 93 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 520 place count 92 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 521 place count 92 transition count 113
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 603 place count 51 transition count 72
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 4 with 2 rules applied. Total rules applied 605 place count 50 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 606 place count 49 transition count 70
Applied a total of 606 rules in 28 ms. Remains 49 /376 variables (removed 327) and now considering 70/390 (removed 320) transitions.
// Phase 1: matrix 70 rows 49 cols
[2025-06-03 15:48:34] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:48:34] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-03 15:48:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:48:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 15:48:34] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:48:34] [INFO ] Redundant transitions in 1 ms returned []
Running 68 sub problems to find dead transitions.
[2025-06-03 15:48:34] [INFO ] Invariant cache hit.
[2025-06-03 15:48:34] [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/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 69/116 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 2/118 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 1/119 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 50 constraints, problems are : Problem set: 0 solved, 68 unsolved in 3610 ms.
Refiners :[State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 69/116 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 2/118 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 67/117 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 1/119 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 118 constraints, problems are : Problem set: 0 solved, 68 unsolved in 3826 ms.
Refiners :[State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7445ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 7446ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/376 places, 70/390 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7589 ms. Remains : 49/376 places, 70/390 transitions.
[2025-06-03 15:48:42] [INFO ] Flatten gal took : 3 ms
[2025-06-03 15:48:42] [INFO ] Flatten gal took : 3 ms
[2025-06-03 15:48:42] [INFO ] Input system was already deterministic with 70 transitions.
[2025-06-03 15:48:42] [INFO ] Flatten gal took : 2 ms
[2025-06-03 15:48:42] [INFO ] Flatten gal took : 3 ms
[2025-06-03 15:48:42] [INFO ] Time to serialize gal into /tmp/CTLFireability14673753677825277303.gal : 1 ms
[2025-06-03 15:48:42] [INFO ] Time to serialize properties into /tmp/CTLFireability3585649396487467724.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/CTLFireability14673753677825277303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3585649396487467724.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,5.68733e+11,1.59507,38384,2,965,5,217833,6,0,266,182325,0


Converting to forward existential form...Done !
original formula: EG((((p188==0)||(p397==0))||(p412==0)))
=> equivalent forward existential formula: [FwdG(Init,(((p188==0)||(p397==0))||(p412==0)))] != FALSE
Hit Full ! (commute/partial/dont) 44/0/26
(forward)formula 0,1,3.05119,56980,1,0,10,288736,19,4,1472,319085,8
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 376/376 places, 390/390 transitions.
Graph (trivial) has 327 edges and 376 vertex of which 7 / 376 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 572 edges and 370 vertex of which 346 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 187 rules applied. Total rules applied 189 place count 345 transition count 192
Reduce places removed 187 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 1 with 204 rules applied. Total rules applied 393 place count 158 transition count 175
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 398 place count 153 transition count 175
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 398 place count 153 transition count 133
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 482 place count 111 transition count 133
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 502 place count 91 transition count 113
Iterating global reduction 3 with 20 rules applied. Total rules applied 522 place count 91 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 522 place count 91 transition count 112
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 524 place count 90 transition count 112
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 604 place count 50 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 605 place count 50 transition count 71
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 606 place count 49 transition count 70
Iterating global reduction 4 with 1 rules applied. Total rules applied 607 place count 49 transition count 70
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 4 with 2 rules applied. Total rules applied 609 place count 48 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 610 place count 47 transition count 68
Applied a total of 610 rules in 25 ms. Remains 47 /376 variables (removed 329) and now considering 68/390 (removed 322) transitions.
// Phase 1: matrix 68 rows 47 cols
[2025-06-03 15:48:45] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:48:45] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-03 15:48:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:48:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 15:48:45] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:48:45] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2025-06-03 15:48:45] [INFO ] Invariant cache hit.
[2025-06-03 15:48:45] [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/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 67/99 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 15/114 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/115 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 48 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2540 ms.
Refiners :[State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 67/99 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 15/114 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 28/99 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 1/115 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/115 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 100 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2858 ms.
Refiners :[State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5405ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 5405ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/376 places, 68/390 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5560 ms. Remains : 47/376 places, 68/390 transitions.
[2025-06-03 15:48:50] [INFO ] Flatten gal took : 2 ms
[2025-06-03 15:48:50] [INFO ] Flatten gal took : 2 ms
[2025-06-03 15:48:50] [INFO ] Input system was already deterministic with 68 transitions.
[2025-06-03 15:48:50] [INFO ] Flatten gal took : 2 ms
[2025-06-03 15:48:50] [INFO ] Flatten gal took : 2 ms
[2025-06-03 15:48:50] [INFO ] Time to serialize gal into /tmp/CTLFireability11538293664131338485.gal : 1 ms
[2025-06-03 15:48:50] [INFO ] Time to serialize properties into /tmp/CTLFireability5993556535441621690.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/CTLFireability11538293664131338485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5993556535441621690.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.73893e+11,1.01745,25780,2,1826,5,146559,6,0,255,93350,0


Converting to forward existential form...Done !
original formula: EG((p17==0))
=> equivalent forward existential formula: [FwdG(Init,(p17==0))] != FALSE
Hit Full ! (commute/partial/dont) 66/0/2
(forward)formula 0,1,1.47797,26036,1,0,9,146559,19,3,1371,98828,8
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 390/390 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 355 transition count 369
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 355 transition count 369
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 47 place count 355 transition count 364
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 56 place count 346 transition count 355
Iterating global reduction 1 with 9 rules applied. Total rules applied 65 place count 346 transition count 355
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 72 place count 346 transition count 348
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 345 transition count 347
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 345 transition count 347
Applied a total of 74 rules in 35 ms. Remains 345 /376 variables (removed 31) and now considering 347/390 (removed 43) transitions.
// Phase 1: matrix 347 rows 345 cols
[2025-06-03 15:48:52] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:48:52] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-03 15:48:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:48:52] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
Running 346 sub problems to find dead transitions.
[2025-06-03 15:48:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 347/691 variables, 344/365 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/691 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 346 unsolved
SMT process timed out in 30044ms, After SMT, problems are : Problem set: 0 solved, 346 unsolved
Search for dead transitions found 0 dead transitions in 30045ms
Starting structural reductions in LTL mode, iteration 1 : 345/376 places, 347/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30752 ms. Remains : 345/376 places, 347/390 transitions.
[2025-06-03 15:49:23] [INFO ] Flatten gal took : 10 ms
[2025-06-03 15:49:23] [INFO ] Flatten gal took : 11 ms
[2025-06-03 15:49:23] [INFO ] Input system was already deterministic with 347 transitions.
[2025-06-03 15:49:23] [INFO ] Flatten gal took : 10 ms
[2025-06-03 15:49:23] [INFO ] Flatten gal took : 11 ms
[2025-06-03 15:49:23] [INFO ] Time to serialize gal into /tmp/CTLFireability14406597095778465943.gal : 2 ms
[2025-06-03 15:49:23] [INFO ] Time to serialize properties into /tmp/CTLFireability11210007424531451707.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/CTLFireability14406597095778465943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11210007424531451707.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 15:49:53] [INFO ] Flatten gal took : 6 ms
[2025-06-03 15:49:53] [INFO ] Applying decomposition
[2025-06-03 15:49:53] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2892785419828184153.txt' '-o' '/tmp/graph2892785419828184153.bin' '-w' '/tmp/graph2892785419828184153.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2892785419828184153.bin' '-l' '-1' '-v' '-w' '/tmp/graph2892785419828184153.weights' '-q' '0' '-e' '0.001'
[2025-06-03 15:49:53] [INFO ] Decomposing Gal with order
[2025-06-03 15:49:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 15:49:53] [INFO ] Removed a total of 102 redundant transitions.
[2025-06-03 15:49:53] [INFO ] Flatten gal took : 16 ms
[2025-06-03 15:49:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 15:49:53] [INFO ] Time to serialize gal into /tmp/CTLFireability4513712714060439583.gal : 6 ms
[2025-06-03 15:49:53] [INFO ] Time to serialize properties into /tmp/CTLFireability18398654717289277793.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/CTLFireability4513712714060439583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18398654717289277793.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.26934e+25,0.431421,14304,803,30,20196,344,615,31323,36,990,0


Converting to forward existential form...Done !
original formula: A(AF((!(E(E((i1.i1.u21.p53==1) U (i11.i2.u87.p234==1)) U E((i3.i1.u33.p89==1) U (i1.i0.u17.p49==1)))) + EX(EX((i4.i0.u41.p109==1))))) U (...175
=> equivalent forward existential formula: [((Init * !(EG(!((i11.i2.u88.p236==1))))) * !(E(!((i11.i2.u88.p236==1)) U (!(!(EG(!((!(E(E((i1.i1.u21.p53==1) U ...298
Reverse transition relation is NOT exact ! Due to transitions t305, i0.t300, i0.i0.t293, i1.t287, i1.i1.u16.t280, i2.t273, i2.i2.t266, i3.i0.t252, i3.i0.u3...747
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 0,0,17.2839,346720,1,0,639523,349,4412,971035,181,990,663742
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 376/376 places, 390/390 transitions.
Graph (trivial) has 325 edges and 376 vertex of which 7 / 376 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 572 edges and 370 vertex of which 346 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 185 transitions
Trivial Post-agglo rules discarded 185 transitions
Performed 185 trivial Post agglomeration. Transition count delta: 185
Iterating post reduction 0 with 185 rules applied. Total rules applied 187 place count 345 transition count 194
Reduce places removed 185 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 1 with 202 rules applied. Total rules applied 389 place count 160 transition count 177
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 394 place count 155 transition count 177
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 394 place count 155 transition count 135
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 478 place count 113 transition count 135
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 498 place count 93 transition count 115
Iterating global reduction 3 with 20 rules applied. Total rules applied 518 place count 93 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 518 place count 93 transition count 114
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 520 place count 92 transition count 114
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 600 place count 52 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 601 place count 52 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 602 place count 51 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 603 place count 51 transition count 72
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 4 with 2 rules applied. Total rules applied 605 place count 50 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 606 place count 49 transition count 70
Applied a total of 606 rules in 19 ms. Remains 49 /376 variables (removed 327) and now considering 70/390 (removed 320) transitions.
// Phase 1: matrix 70 rows 49 cols
[2025-06-03 15:50:10] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:50:10] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-03 15:50:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:50:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 15:50:10] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:50:10] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2025-06-03 15:50:10] [INFO ] Invariant cache hit.
[2025-06-03 15:50:10] [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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 69/102 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 16/118 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 1/119 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 50 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2496 ms.
Refiners :[State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 69/102 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 16/118 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 30/102 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 1/119 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 103 constraints, problems are : Problem set: 0 solved, 53 unsolved in 3163 ms.
Refiners :[State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5671ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 5672ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/376 places, 70/390 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5825 ms. Remains : 49/376 places, 70/390 transitions.
[2025-06-03 15:50:16] [INFO ] Flatten gal took : 4 ms
[2025-06-03 15:50:16] [INFO ] Flatten gal took : 2 ms
[2025-06-03 15:50:16] [INFO ] Input system was already deterministic with 70 transitions.
[2025-06-03 15:50:16] [INFO ] Flatten gal took : 2 ms
[2025-06-03 15:50:16] [INFO ] Flatten gal took : 3 ms
[2025-06-03 15:50:16] [INFO ] Time to serialize gal into /tmp/CTLFireability16357022290273544255.gal : 1 ms
[2025-06-03 15:50:16] [INFO ] Time to serialize properties into /tmp/CTLFireability6251921547808905234.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/CTLFireability16357022290273544255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6251921547808905234.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.86576e+11,0.588577,13908,2,1264,5,63170,6,0,265,46726,0


Converting to forward existential form...Done !
original formula: E(AG((p18!=1)) U (p105==1))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !((p18!=1))))) * (p105==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t7, t9, t12, t14, t16, t18, t20, t22, t24, t26, t28, t30, t32, t34, t36, t39, t40...285
(forward)formula 0,0,1.28509,24448,1,0,177,139056,166,78,1721,123921,156
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-03 15:50:17] [INFO ] Flatten gal took : 7 ms
[2025-06-03 15:50:17] [INFO ] Flatten gal took : 7 ms
[2025-06-03 15:50:17] [INFO ] Applying decomposition
[2025-06-03 15:50:17] [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/graph8376264384177857513.txt' '-o' '/tmp/graph8376264384177857513.bin' '-w' '/tmp/graph8376264384177857513.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8376264384177857513.bin' '-l' '-1' '-v' '-w' '/tmp/graph8376264384177857513.weights' '-q' '0' '-e' '0.001'
[2025-06-03 15:50:17] [INFO ] Decomposing Gal with order
[2025-06-03 15:50:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 15:50:17] [INFO ] Removed a total of 101 redundant transitions.
[2025-06-03 15:50:17] [INFO ] Flatten gal took : 16 ms
[2025-06-03 15:50:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 15:50:17] [INFO ] Time to serialize gal into /tmp/CTLFireability4131545512091411678.gal : 4 ms
[2025-06-03 15:50:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12542456485341907430.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/CTLFireability4131545512091411678.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12542456485341907430.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 7 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.342e+26,0.679757,16744,1011,25,26328,302,613,36962,33,621,0


Converting to forward existential form...Done !
original formula: A(AF(AX(((!(EX((i20.u140.p357==1))) + E((i16.u121.p305==1) U (i10.u77.p196==1))) + AF((i21.u144.p369==1))))) U (i15.u113.p287==1))
=> equivalent forward existential formula: [((Init * !(EG(!((i15.u113.p287==1))))) * !(E(!((i15.u113.p287==1)) U (!(!(EG(!(!(EX(!(((!(EX((i20.u140.p357==1)...279
Reverse transition relation is NOT exact ! Due to transitions t3, t27, t348, i1.t333, i1.u10.t344, i2.t326, i2.t316, i3.t309, i3.u29.t302, i4.t296, i4.i1.i...673
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 22
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 22
(forward)formula 0,0,86.3313,1250896,1,0,2.39526e+06,302,5190,2.88366e+06,174,756,2077385
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(EX(A(((((i18.u151.p390==1)||(i22.u156.p405==1))||((i21.u146.p378==1)||(i0.u3.p7==1)))||(((i10.u75.p192==1)&&(i16.u119.p293==1))&&(i14....272
=> equivalent forward existential formula: [FwdG(Init,EX(!((E(!(!((((i2.u18.p44==1)&&(i22.u154.p397==1))&&((i22.u159.p412==1)&&(i14.i0.i0.u104.p265==1)))))...524
(forward)formula 1,1,115.022,1722868,1,0,3.30104e+06,302,5299,3.66902e+06,176,773,2768319
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(!(EX(((!((A((i12.u92.p233==1) U (i4.i0.i0.u30.p78==1)) * ((i2.u20.p47==1)||(i18.u150.p394==1)))) * AF((((i3.u27.p68==1)&&(i22.u154.p397...334
=> equivalent forward existential formula: [(FwdU(Init,!(EX(((!((!((E(!((i4.i0.i0.u30.p78==1)) U (!((i12.u92.p233==1)) * !((i4.i0.i0.u30.p78==1)))) + EG(!(...457
(forward)formula 2,1,211.386,2197544,1,0,4.00899e+06,302,2547,4.67067e+06,92,791,1488293
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(E(EG((i10.u76.p193!=1)) U A(!((E((i14.i0.i1.u102.p262==1) U (((i20.u140.p356==1)&&(i22.u154.p397==1))&&(i22.u159.p412==1))) * ((((i11....329
=> equivalent forward existential formula: [((FwdU(EY(Init),EG((i10.u76.p193!=1))) * !(EG(!(((i7.u53.p139==1)&&(((i21.u144.p369==1)||(i14.i0.i1.u102.p258==...583
(forward)formula 3,1,247.908,2197544,1,0,4.00899e+06,302,2824,4.67067e+06,93,791,2431675
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(AG(!(E((i22.u154.p406==1) U (i16.u119.p293==1)))))
=> equivalent forward existential formula: [(FwdU(FwdU(EY(Init),TRUE),(i22.u154.p406==1)) * (i16.u119.p293==1))] = FALSE
(forward)formula 4,0,248.373,2197544,1,0,4.00899e+06,361,3729,4.67067e+06,110,914,2481009
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(((((i1.u9.p22==1)&&(i2.u21.p50==1))&&((i22.u154.p397==1)&&(i22.u159.p412==1))) + ((i10.u77.p195==0) * A((i11.u81.p207==1) U (((i19.u13...231
=> equivalent forward existential formula: [FwdG(Init,!(((((i1.u9.p22==1)&&(i2.u21.p50==1))&&((i22.u154.p397==1)&&(i22.u159.p412==1))) + ((i10.u77.p195==0)...469
(forward)formula 5,0,273.672,2338088,1,0,4.46453e+06,364,3799,4.67067e+06,112,940,3040066
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(AX(((AX((i18.u152.p392==0)) + A((A((i12.u90.p228==1) U (i9.u69.p177==1)) + (i10.u73.p189!=1)) U (((((i12.u89.p224==1)&&(i22.u154.p397=...317
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(((!(EX(!((i18.u152.p392==0)))) + !((E(!((((((i12.u89.p224==1)&&(i22.u154.p397==1))&&(i22.u159....733
(forward)formula 6,1,385.613,2420648,1,0,4.6181e+06,364,2571,4.67067e+06,92,940,2433637
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1556628 ms.

BK_STOP 1748966204297

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="GPUForwardProgress-PT-20b"
export BK_EXAMINATION="CTLFireability"
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 GPUForwardProgress-PT-20b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-174867007900450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-20b.tgz
mv GPUForwardProgress-PT-20b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;