About the Execution of ITS-Tools for DiscoveryGPU-PT-11b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ???F??F??????FT? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064600698.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is DiscoveryGPU-PT-11b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064600698
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 82K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DiscoveryGPU-PT-11b-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-11b-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-11b-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-11b-CTLFireability-2023-15
FORMULA_NAME DiscoveryGPU-PT-11b-CTLFireability-2025-00
FORMULA_NAME DiscoveryGPU-PT-11b-CTLFireability-2025-01
FORMULA_NAME DiscoveryGPU-PT-11b-CTLFireability-2025-02
FORMULA_NAME DiscoveryGPU-PT-11b-CTLFireability-2025-03
FORMULA_NAME DiscoveryGPU-PT-11b-CTLFireability-2025-04
FORMULA_NAME DiscoveryGPU-PT-11b-CTLFireability-2025-05
FORMULA_NAME DiscoveryGPU-PT-11b-CTLFireability-2025-06
FORMULA_NAME DiscoveryGPU-PT-11b-CTLFireability-2025-07
FORMULA_NAME DiscoveryGPU-PT-11b-CTLFireability-2025-08
FORMULA_NAME DiscoveryGPU-PT-11b-CTLFireability-2025-09
FORMULA_NAME DiscoveryGPU-PT-11b-CTLFireability-2025-10
FORMULA_NAME DiscoveryGPU-PT-11b-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748932152881
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-11b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 06:29:15] [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 06:29:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 06:29:15] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2025-06-03 06:29:16] [INFO ] Transformed 324 places.
[2025-06-03 06:29:16] [INFO ] Transformed 344 transitions.
[2025-06-03 06:29:16] [INFO ] Found NUPN structural information;
[2025-06-03 06:29:16] [INFO ] Parsed PT model containing 324 places and 344 transitions and 898 arcs in 531 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Support contains 113 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 344/344 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 302 transition count 344
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 54 place count 270 transition count 312
Iterating global reduction 1 with 32 rules applied. Total rules applied 86 place count 270 transition count 312
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 267 transition count 309
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 267 transition count 309
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 264 transition count 306
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 264 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 263 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 263 transition count 305
Applied a total of 100 rules in 187 ms. Remains 263 /324 variables (removed 61) and now considering 305/344 (removed 39) transitions.
// Phase 1: matrix 305 rows 263 cols
[2025-06-03 06:29:16] [INFO ] Computed 2 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:29:17] [INFO ] Implicit Places using invariants in 637 ms returned []
[2025-06-03 06:29:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:29:17] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2025-06-03 06:29:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 305/568 variables, 263/265 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:35] [INFO ] Deduced a trap composed of 9 places in 340 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:35] [INFO ] Deduced a trap composed of 10 places in 281 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:35] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:35] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:36] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:36] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:36] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:36] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:36] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:37] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:37] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:37] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:37] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:37] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:38] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:38] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:38] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:38] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:38] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:38] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/568 variables, 20/285 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:39] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:39] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:39] [INFO ] Deduced a trap composed of 52 places in 278 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:40] [INFO ] Deduced a trap composed of 137 places in 263 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:40] [INFO ] Deduced a trap composed of 169 places in 258 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:40] [INFO ] Deduced a trap composed of 52 places in 236 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/568 variables, 6/291 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:29:45] [INFO ] Deduced a trap composed of 169 places in 113 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 568/568 variables, and 292 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 305/568 variables, 263/292 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/568 variables, 304/596 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 596 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60328ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60352ms
Starting structural reductions in LTL mode, iteration 1 : 263/324 places, 305/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61682 ms. Remains : 263/324 places, 305/344 transitions.
Support contains 113 out of 263 places after structural reductions.
[2025-06-03 06:30:18] [INFO ] Flatten gal took : 98 ms
[2025-06-03 06:30:18] [INFO ] Flatten gal took : 48 ms
[2025-06-03 06:30:18] [INFO ] Input system was already deterministic with 305 transitions.
RANDOM walk for 40000 steps (110 resets) in 2969 ms. (13 steps per ms) remains 6/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (15 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (16 resets) in 129 ms. (307 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (20 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (15 resets) in 75 ms. (526 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 87 ms. (454 steps per ms) remains 2/3 properties
[2025-06-03 06:30:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 114/132 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 362/494 variables, 182/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 69/563 variables, 58/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp42 is UNSAT
After SMT solving in domain Real declared 568/568 variables, and 265 constraints, problems are : Problem set: 2 solved, 0 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 472ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2025-06-03 06:30:20] [INFO ] Flatten gal took : 31 ms
[2025-06-03 06:30:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DiscoveryGPU-PT-11b-CTLFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 06:30:20] [INFO ] Flatten gal took : 31 ms
[2025-06-03 06:30:20] [INFO ] Input system was already deterministic with 305 transitions.
Support contains 108 out of 263 places (down from 111) after GAL structural reductions.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 498 edges and 263 vertex of which 251 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.10 ms
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 305/305 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 235 transition count 276
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 235 transition count 276
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 67 place count 224 transition count 264
Iterating global reduction 0 with 11 rules applied. Total rules applied 78 place count 224 transition count 264
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 88 place count 214 transition count 253
Iterating global reduction 0 with 10 rules applied. Total rules applied 98 place count 214 transition count 253
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 105 place count 207 transition count 245
Iterating global reduction 0 with 7 rules applied. Total rules applied 112 place count 207 transition count 245
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 116 place count 203 transition count 238
Iterating global reduction 0 with 4 rules applied. Total rules applied 120 place count 203 transition count 238
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 124 place count 199 transition count 234
Iterating global reduction 0 with 4 rules applied. Total rules applied 128 place count 199 transition count 234
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 131 place count 196 transition count 231
Iterating global reduction 0 with 3 rules applied. Total rules applied 134 place count 196 transition count 231
Applied a total of 134 rules in 48 ms. Remains 196 /263 variables (removed 67) and now considering 231/305 (removed 74) transitions.
// Phase 1: matrix 231 rows 196 cols
[2025-06-03 06:30:20] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:30:20] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-03 06:30:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:30:20] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2025-06-03 06:30:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 231/427 variables, 196/198 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:30:29] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:30:30] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:30:30] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:30:30] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:30:30] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:30:30] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:30:30] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:30:31] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:30:31] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:30:31] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:30:31] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 11/209 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 0/427 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 209 constraints, problems are : Problem set: 0 solved, 230 unsolved in 28583 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 231/427 variables, 196/209 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 230/439 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 0/427 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 439 constraints, problems are : Problem set: 0 solved, 230 unsolved in 29154 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57845ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 57848ms
Starting structural reductions in LTL mode, iteration 1 : 196/263 places, 231/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58321 ms. Remains : 196/263 places, 231/305 transitions.
[2025-06-03 06:31:18] [INFO ] Flatten gal took : 14 ms
[2025-06-03 06:31:18] [INFO ] Flatten gal took : 14 ms
[2025-06-03 06:31:18] [INFO ] Input system was already deterministic with 231 transitions.
[2025-06-03 06:31:18] [INFO ] Flatten gal took : 14 ms
[2025-06-03 06:31:18] [INFO ] Flatten gal took : 13 ms
[2025-06-03 06:31:18] [INFO ] Time to serialize gal into /tmp/CTLFireability1533132151181797710.gal : 8 ms
[2025-06-03 06:31:18] [INFO ] Time to serialize properties into /tmp/CTLFireability16995042226854639.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/CTLFireability1533132151181797710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16995042226854639.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 06:31:49] [INFO ] Flatten gal took : 16 ms
[2025-06-03 06:31:49] [INFO ] Applying decomposition
[2025-06-03 06:31:49] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4988465253269550607.txt' '-o' '/tmp/graph4988465253269550607.bin' '-w' '/tmp/graph4988465253269550607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4988465253269550607.bin' '-l' '-1' '-v' '-w' '/tmp/graph4988465253269550607.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:31:49] [INFO ] Decomposing Gal with order
[2025-06-03 06:31:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:31:49] [INFO ] Removed a total of 87 redundant transitions.
[2025-06-03 06:31:49] [INFO ] Flatten gal took : 73 ms
[2025-06-03 06:31:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 11 ms.
[2025-06-03 06:31:49] [INFO ] Time to serialize gal into /tmp/CTLFireability16866402638067798410.gal : 9 ms
[2025-06-03 06:31:49] [INFO ] Time to serialize properties into /tmp/CTLFireability17272399011914376866.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/CTLFireability16866402638067798410.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17272399011914376866.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 305/305 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 232 transition count 273
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 232 transition count 273
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 221 transition count 261
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 221 transition count 261
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 211 transition count 250
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 211 transition count 250
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 113 place count 202 transition count 240
Iterating global reduction 0 with 9 rules applied. Total rules applied 122 place count 202 transition count 240
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 129 place count 195 transition count 228
Iterating global reduction 0 with 7 rules applied. Total rules applied 136 place count 195 transition count 228
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 142 place count 189 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 148 place count 189 transition count 222
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 153 place count 184 transition count 217
Iterating global reduction 0 with 5 rules applied. Total rules applied 158 place count 184 transition count 217
Applied a total of 158 rules in 36 ms. Remains 184 /263 variables (removed 79) and now considering 217/305 (removed 88) transitions.
// Phase 1: matrix 217 rows 184 cols
[2025-06-03 06:32:19] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:32:19] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-06-03 06:32:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:32:19] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-03 06:32:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 217/401 variables, 184/186 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:32:28] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:32:28] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:32:29] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:32:29] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:32:29] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:32:29] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:32:29] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:32:29] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:32:30] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:32:30] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:32:30] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 11/197 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 0/401 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 197 constraints, problems are : Problem set: 0 solved, 216 unsolved in 26280 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/401 variables, 184/197 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 216/413 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/401 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 413 constraints, problems are : Problem set: 0 solved, 216 unsolved in 27104 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53460ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 53464ms
Starting structural reductions in LTL mode, iteration 1 : 184/263 places, 217/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54005 ms. Remains : 184/263 places, 217/305 transitions.
[2025-06-03 06:33:13] [INFO ] Flatten gal took : 11 ms
[2025-06-03 06:33:13] [INFO ] Flatten gal took : 10 ms
[2025-06-03 06:33:13] [INFO ] Input system was already deterministic with 217 transitions.
[2025-06-03 06:33:13] [INFO ] Flatten gal took : 10 ms
[2025-06-03 06:33:13] [INFO ] Flatten gal took : 16 ms
[2025-06-03 06:33:13] [INFO ] Time to serialize gal into /tmp/CTLFireability2773075360116458847.gal : 4 ms
[2025-06-03 06:33:13] [INFO ] Time to serialize properties into /tmp/CTLFireability10269218112701803478.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/CTLFireability2773075360116458847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10269218112701803478.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 06:33:43] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:33:43] [INFO ] Applying decomposition
[2025-06-03 06:33:43] [INFO ] Flatten gal took : 10 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/graph2128293399964496027.txt' '-o' '/tmp/graph2128293399964496027.bin' '-w' '/tmp/graph2128293399964496027.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2128293399964496027.bin' '-l' '-1' '-v' '-w' '/tmp/graph2128293399964496027.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:33:43] [INFO ] Decomposing Gal with order
[2025-06-03 06:33:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:33:43] [INFO ] Removed a total of 86 redundant transitions.
[2025-06-03 06:33:43] [INFO ] Flatten gal took : 55 ms
[2025-06-03 06:33:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 8 ms.
[2025-06-03 06:33:43] [INFO ] Time to serialize gal into /tmp/CTLFireability4853726142095650016.gal : 9 ms
[2025-06-03 06:33:43] [INFO ] Time to serialize properties into /tmp/CTLFireability11623002702398505745.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/CTLFireability4853726142095650016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11623002702398505745.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 305/305 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 237 transition count 278
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 237 transition count 278
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 227 transition count 267
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 227 transition count 267
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 218 transition count 257
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 218 transition count 257
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 98 place count 210 transition count 249
Iterating global reduction 0 with 8 rules applied. Total rules applied 106 place count 210 transition count 249
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 112 place count 204 transition count 238
Iterating global reduction 0 with 6 rules applied. Total rules applied 118 place count 204 transition count 238
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 123 place count 199 transition count 233
Iterating global reduction 0 with 5 rules applied. Total rules applied 128 place count 199 transition count 233
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 132 place count 195 transition count 229
Iterating global reduction 0 with 4 rules applied. Total rules applied 136 place count 195 transition count 229
Applied a total of 136 rules in 30 ms. Remains 195 /263 variables (removed 68) and now considering 229/305 (removed 76) transitions.
// Phase 1: matrix 229 rows 195 cols
[2025-06-03 06:34:13] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:34:13] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-03 06:34:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:34:14] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2025-06-03 06:34:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 229/424 variables, 195/197 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:24] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:24] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:24] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:25] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:25] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:25] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:25] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:25] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:25] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:26] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:26] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:26] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:26] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:26] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:26] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:26] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:27] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:27] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:27] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:27] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:27] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:27] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:28] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 27 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 220 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 229/424 variables, 195/220 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 228/448 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/424 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 448 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Starting structural reductions in LTL mode, iteration 1 : 195/263 places, 229/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60413 ms. Remains : 195/263 places, 229/305 transitions.
[2025-06-03 06:35:14] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:35:14] [INFO ] Flatten gal took : 10 ms
[2025-06-03 06:35:14] [INFO ] Input system was already deterministic with 229 transitions.
[2025-06-03 06:35:14] [INFO ] Flatten gal took : 13 ms
[2025-06-03 06:35:14] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:35:14] [INFO ] Time to serialize gal into /tmp/CTLFireability818194727409557857.gal : 2 ms
[2025-06-03 06:35:14] [INFO ] Time to serialize properties into /tmp/CTLFireability16178467182686501999.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/CTLFireability818194727409557857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16178467182686501999.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 06:35:44] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:35:44] [INFO ] Applying decomposition
[2025-06-03 06:35:44] [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/graph14856244627421235155.txt' '-o' '/tmp/graph14856244627421235155.bin' '-w' '/tmp/graph14856244627421235155.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14856244627421235155.bin' '-l' '-1' '-v' '-w' '/tmp/graph14856244627421235155.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:35:44] [INFO ] Decomposing Gal with order
[2025-06-03 06:35:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:35:44] [INFO ] Removed a total of 78 redundant transitions.
[2025-06-03 06:35:44] [INFO ] Flatten gal took : 17 ms
[2025-06-03 06:35:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 4 ms.
[2025-06-03 06:35:44] [INFO ] Time to serialize gal into /tmp/CTLFireability3980353052022641898.gal : 4 ms
[2025-06-03 06:35:44] [INFO ] Time to serialize properties into /tmp/CTLFireability5327097286565661604.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/CTLFireability3980353052022641898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5327097286565661604.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 : 263/263 places, 305/305 transitions.
Graph (complete) has 498 edges and 263 vertex of which 252 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 251 transition count 249
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 207 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 206 transition count 248
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 91 place count 206 transition count 219
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 149 place count 177 transition count 219
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 162 place count 164 transition count 205
Iterating global reduction 3 with 13 rules applied. Total rules applied 175 place count 164 transition count 205
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 183 place count 156 transition count 196
Iterating global reduction 3 with 8 rules applied. Total rules applied 191 place count 156 transition count 196
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 197 place count 150 transition count 185
Iterating global reduction 3 with 6 rules applied. Total rules applied 203 place count 150 transition count 185
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 209 place count 144 transition count 178
Iterating global reduction 3 with 6 rules applied. Total rules applied 215 place count 144 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 216 place count 143 transition count 177
Iterating global reduction 3 with 1 rules applied. Total rules applied 217 place count 143 transition count 177
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 261 place count 121 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 262 place count 120 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 263 place count 120 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 264 place count 119 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 265 place count 119 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 118 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 118 transition count 151
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 269 place count 118 transition count 151
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 271 place count 116 transition count 149
Applied a total of 271 rules in 110 ms. Remains 116 /263 variables (removed 147) and now considering 149/305 (removed 156) transitions.
// Phase 1: matrix 149 rows 116 cols
[2025-06-03 06:36:14] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:36:14] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-03 06:36:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:36:14] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:36:14] [INFO ] Redundant transitions in 5 ms returned []
Running 147 sub problems to find dead transitions.
[2025-06-03 06:36:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 2/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 149/265 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 0/265 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 118 constraints, problems are : Problem set: 0 solved, 147 unsolved in 7391 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 2/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 149/265 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 147/265 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/265 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 265 constraints, problems are : Problem set: 0 solved, 147 unsolved in 8540 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15961ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 15970ms
Starting structural reductions in SI_CTL mode, iteration 1 : 116/263 places, 149/305 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16315 ms. Remains : 116/263 places, 149/305 transitions.
[2025-06-03 06:36:30] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:36:30] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:36:31] [INFO ] Input system was already deterministic with 149 transitions.
[2025-06-03 06:36:31] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:36:31] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:36:31] [INFO ] Time to serialize gal into /tmp/CTLFireability4747033179651404013.gal : 2 ms
[2025-06-03 06:36:31] [INFO ] Time to serialize properties into /tmp/CTLFireability7379590868191317413.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/CTLFireability4747033179651404013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7379590868191317413.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.70133e+12,7.53733,165488,2,31906,5,995646,6,0,594,646427,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 06:37:01] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:37:01] [INFO ] Applying decomposition
[2025-06-03 06:37:01] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9056270274305640712.txt' '-o' '/tmp/graph9056270274305640712.bin' '-w' '/tmp/graph9056270274305640712.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9056270274305640712.bin' '-l' '-1' '-v' '-w' '/tmp/graph9056270274305640712.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:37:01] [INFO ] Decomposing Gal with order
[2025-06-03 06:37:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:37:01] [INFO ] Removed a total of 78 redundant transitions.
[2025-06-03 06:37:01] [INFO ] Flatten gal took : 12 ms
[2025-06-03 06:37:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 6 ms.
[2025-06-03 06:37:01] [INFO ] Time to serialize gal into /tmp/CTLFireability15544883967339953937.gal : 3 ms
[2025-06-03 06:37:01] [INFO ] Time to serialize properties into /tmp/CTLFireability17513726545579081089.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/CTLFireability15544883967339953937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17513726545579081089.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 305/305 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 235 transition count 276
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 235 transition count 276
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 226 transition count 267
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 226 transition count 267
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 218 transition count 258
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 218 transition count 258
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 211 transition count 250
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 211 transition count 250
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 109 place count 206 transition count 242
Iterating global reduction 0 with 5 rules applied. Total rules applied 114 place count 206 transition count 242
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 118 place count 202 transition count 238
Iterating global reduction 0 with 4 rules applied. Total rules applied 122 place count 202 transition count 238
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 125 place count 199 transition count 235
Iterating global reduction 0 with 3 rules applied. Total rules applied 128 place count 199 transition count 235
Applied a total of 128 rules in 24 ms. Remains 199 /263 variables (removed 64) and now considering 235/305 (removed 70) transitions.
// Phase 1: matrix 235 rows 199 cols
[2025-06-03 06:37:31] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:37:31] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-03 06:37:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:37:31] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2025-06-03 06:37:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 235/434 variables, 199/201 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:37:41] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:37:42] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:37:42] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:37:42] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:37:42] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:37:42] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:37:43] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:37:43] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:37:43] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:37:43] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:37:43] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 11/212 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 212 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (OVERLAPS) 235/434 variables, 199/212 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 234/446 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 446 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Starting structural reductions in LTL mode, iteration 1 : 199/263 places, 235/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60394 ms. Remains : 199/263 places, 235/305 transitions.
[2025-06-03 06:38:31] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:38:31] [INFO ] Flatten gal took : 11 ms
[2025-06-03 06:38:31] [INFO ] Input system was already deterministic with 235 transitions.
[2025-06-03 06:38:31] [INFO ] Flatten gal took : 11 ms
[2025-06-03 06:38:31] [INFO ] Flatten gal took : 17 ms
[2025-06-03 06:38:31] [INFO ] Time to serialize gal into /tmp/CTLFireability3549612562801592228.gal : 3 ms
[2025-06-03 06:38:31] [INFO ] Time to serialize properties into /tmp/CTLFireability10793063683636747311.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/CTLFireability3549612562801592228.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10793063683636747311.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 06:39:01] [INFO ] Flatten gal took : 7 ms
[2025-06-03 06:39:01] [INFO ] Applying decomposition
[2025-06-03 06:39:01] [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/graph3515651739014723774.txt' '-o' '/tmp/graph3515651739014723774.bin' '-w' '/tmp/graph3515651739014723774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3515651739014723774.bin' '-l' '-1' '-v' '-w' '/tmp/graph3515651739014723774.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:39:01] [INFO ] Decomposing Gal with order
[2025-06-03 06:39:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:39:01] [INFO ] Removed a total of 89 redundant transitions.
[2025-06-03 06:39:01] [INFO ] Flatten gal took : 18 ms
[2025-06-03 06:39:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 3 ms.
[2025-06-03 06:39:01] [INFO ] Time to serialize gal into /tmp/CTLFireability18126974171868258360.gal : 3 ms
[2025-06-03 06:39:01] [INFO ] Time to serialize properties into /tmp/CTLFireability4200245267973253561.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/CTLFireability18126974171868258360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4200245267973253561.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 305/305 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 232 transition count 273
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 232 transition count 273
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 221 transition count 261
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 221 transition count 261
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 211 transition count 250
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 211 transition count 250
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 113 place count 202 transition count 240
Iterating global reduction 0 with 9 rules applied. Total rules applied 122 place count 202 transition count 240
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 130 place count 194 transition count 226
Iterating global reduction 0 with 8 rules applied. Total rules applied 138 place count 194 transition count 226
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 145 place count 187 transition count 219
Iterating global reduction 0 with 7 rules applied. Total rules applied 152 place count 187 transition count 219
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 158 place count 181 transition count 213
Iterating global reduction 0 with 6 rules applied. Total rules applied 164 place count 181 transition count 213
Applied a total of 164 rules in 24 ms. Remains 181 /263 variables (removed 82) and now considering 213/305 (removed 92) transitions.
// Phase 1: matrix 213 rows 181 cols
[2025-06-03 06:39:31] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:39:32] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-03 06:39:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:39:32] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2025-06-03 06:39: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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 213/394 variables, 181/183 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:39:41] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:39:41] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:39:41] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:39:41] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:39:42] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:39:42] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:39:42] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:39:42] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:39:42] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:39:42] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:39:43] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 11/194 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 194 constraints, problems are : Problem set: 0 solved, 212 unsolved in 26954 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/394 variables, 181/194 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 212/406 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 406 constraints, problems are : Problem set: 0 solved, 212 unsolved in 24638 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51622ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 51623ms
Starting structural reductions in LTL mode, iteration 1 : 181/263 places, 213/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51945 ms. Remains : 181/263 places, 213/305 transitions.
[2025-06-03 06:40:23] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:40:23] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:40:23] [INFO ] Input system was already deterministic with 213 transitions.
[2025-06-03 06:40:23] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:40:23] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:40:23] [INFO ] Time to serialize gal into /tmp/CTLFireability10412666632196488632.gal : 1 ms
[2025-06-03 06:40:23] [INFO ] Time to serialize properties into /tmp/CTLFireability9438979637189497233.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/CTLFireability10412666632196488632.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9438979637189497233.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 06:40:53] [INFO ] Flatten gal took : 7 ms
[2025-06-03 06:40:53] [INFO ] Applying decomposition
[2025-06-03 06:40:53] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10371082979853725035.txt' '-o' '/tmp/graph10371082979853725035.bin' '-w' '/tmp/graph10371082979853725035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10371082979853725035.bin' '-l' '-1' '-v' '-w' '/tmp/graph10371082979853725035.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:40:53] [INFO ] Decomposing Gal with order
[2025-06-03 06:40:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:40:54] [INFO ] Removed a total of 85 redundant transitions.
[2025-06-03 06:40:54] [INFO ] Flatten gal took : 15 ms
[2025-06-03 06:40:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2025-06-03 06:40:54] [INFO ] Time to serialize gal into /tmp/CTLFireability604264742842409121.gal : 3 ms
[2025-06-03 06:40:54] [INFO ] Time to serialize properties into /tmp/CTLFireability3321052704029011120.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/CTLFireability604264742842409121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3321052704029011120.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 LTL mode, iteration 0 : 263/263 places, 305/305 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 233 transition count 274
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 233 transition count 274
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 223 transition count 264
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 223 transition count 264
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 214 transition count 254
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 214 transition count 254
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 105 place count 207 transition count 246
Iterating global reduction 0 with 7 rules applied. Total rules applied 112 place count 207 transition count 246
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 118 place count 201 transition count 236
Iterating global reduction 0 with 6 rules applied. Total rules applied 124 place count 201 transition count 236
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 129 place count 196 transition count 231
Iterating global reduction 0 with 5 rules applied. Total rules applied 134 place count 196 transition count 231
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 138 place count 192 transition count 227
Iterating global reduction 0 with 4 rules applied. Total rules applied 142 place count 192 transition count 227
Applied a total of 142 rules in 23 ms. Remains 192 /263 variables (removed 71) and now considering 227/305 (removed 78) transitions.
// Phase 1: matrix 227 rows 192 cols
[2025-06-03 06:41:24] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:41:24] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-03 06:41:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:41:24] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2025-06-03 06:41:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 227/419 variables, 192/194 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:41:33] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:41:33] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:41:34] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:41:34] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:41:34] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:41:34] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:41:34] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:41:34] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:41:35] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:41:35] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:41:35] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 11/205 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 0/419 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 205 constraints, problems are : Problem set: 0 solved, 226 unsolved in 29096 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 227/419 variables, 192/205 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 226/431 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:42:00] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/419 variables, and 432 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59149ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 59150ms
Starting structural reductions in LTL mode, iteration 1 : 192/263 places, 227/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59479 ms. Remains : 192/263 places, 227/305 transitions.
[2025-06-03 06:42:23] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:42:23] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:42:23] [INFO ] Input system was already deterministic with 227 transitions.
[2025-06-03 06:42:23] [INFO ] Flatten gal took : 7 ms
[2025-06-03 06:42:23] [INFO ] Flatten gal took : 7 ms
[2025-06-03 06:42:23] [INFO ] Time to serialize gal into /tmp/CTLFireability7667946803607771413.gal : 2 ms
[2025-06-03 06:42:23] [INFO ] Time to serialize properties into /tmp/CTLFireability6938713919678138624.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/CTLFireability7667946803607771413.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6938713919678138624.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 06:42:53] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:42:53] [INFO ] Applying decomposition
[2025-06-03 06:42:53] [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/graph9324518560328585321.txt' '-o' '/tmp/graph9324518560328585321.bin' '-w' '/tmp/graph9324518560328585321.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9324518560328585321.bin' '-l' '-1' '-v' '-w' '/tmp/graph9324518560328585321.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:42:53] [INFO ] Decomposing Gal with order
[2025-06-03 06:42:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:42:53] [INFO ] Removed a total of 87 redundant transitions.
[2025-06-03 06:42:53] [INFO ] Flatten gal took : 13 ms
[2025-06-03 06:42:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2025-06-03 06:42:53] [INFO ] Time to serialize gal into /tmp/CTLFireability13758023182748620588.gal : 3 ms
[2025-06-03 06:42:53] [INFO ] Time to serialize properties into /tmp/CTLFireability11195164915468427109.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/CTLFireability13758023182748620588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11195164915468427109.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 305/305 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 233 transition count 274
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 233 transition count 274
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 223 transition count 263
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 223 transition count 263
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 214 transition count 253
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 214 transition count 253
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 106 place count 206 transition count 244
Iterating global reduction 0 with 8 rules applied. Total rules applied 114 place count 206 transition count 244
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 122 place count 198 transition count 230
Iterating global reduction 0 with 8 rules applied. Total rules applied 130 place count 198 transition count 230
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 136 place count 192 transition count 224
Iterating global reduction 0 with 6 rules applied. Total rules applied 142 place count 192 transition count 224
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 147 place count 187 transition count 219
Iterating global reduction 0 with 5 rules applied. Total rules applied 152 place count 187 transition count 219
Applied a total of 152 rules in 22 ms. Remains 187 /263 variables (removed 76) and now considering 219/305 (removed 86) transitions.
// Phase 1: matrix 219 rows 187 cols
[2025-06-03 06:43:23] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:43:23] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-03 06:43:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:43:24] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-06-03 06:43:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/406 variables, 187/189 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:43:34] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:43:34] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:43:34] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:43:34] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:43:34] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:43:35] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:43:35] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:43:35] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:43:35] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:43:35] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:43:35] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 11/200 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/406 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 200 constraints, problems are : Problem set: 0 solved, 218 unsolved in 28510 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/406 variables, 187/200 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 218/418 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/406 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 418 constraints, problems are : Problem set: 0 solved, 218 unsolved in 26850 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55422ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 55424ms
Starting structural reductions in LTL mode, iteration 1 : 187/263 places, 219/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55804 ms. Remains : 187/263 places, 219/305 transitions.
[2025-06-03 06:44:19] [INFO ] Flatten gal took : 7 ms
[2025-06-03 06:44:19] [INFO ] Flatten gal took : 4 ms
[2025-06-03 06:44:19] [INFO ] Input system was already deterministic with 219 transitions.
[2025-06-03 06:44:19] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:44:19] [INFO ] Flatten gal took : 4 ms
[2025-06-03 06:44:19] [INFO ] Time to serialize gal into /tmp/CTLFireability18084538352910207608.gal : 1 ms
[2025-06-03 06:44:19] [INFO ] Time to serialize properties into /tmp/CTLFireability8237834216041399115.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/CTLFireability18084538352910207608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8237834216041399115.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 06:44:49] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:44:49] [INFO ] Applying decomposition
[2025-06-03 06:44:49] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1715093402669043037.txt' '-o' '/tmp/graph1715093402669043037.bin' '-w' '/tmp/graph1715093402669043037.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1715093402669043037.bin' '-l' '-1' '-v' '-w' '/tmp/graph1715093402669043037.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:44:49] [INFO ] Decomposing Gal with order
[2025-06-03 06:44:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:44:49] [INFO ] Removed a total of 85 redundant transitions.
[2025-06-03 06:44:49] [INFO ] Flatten gal took : 11 ms
[2025-06-03 06:44:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2025-06-03 06:44:49] [INFO ] Time to serialize gal into /tmp/CTLFireability7411654826995895537.gal : 2 ms
[2025-06-03 06:44:49] [INFO ] Time to serialize properties into /tmp/CTLFireability13896284374974919835.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/CTLFireability7411654826995895537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13896284374974919835.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 263/263 places, 305/305 transitions.
Graph (complete) has 498 edges and 263 vertex of which 251 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 250 transition count 249
Reduce places removed 43 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 45 rules applied. Total rules applied 89 place count 207 transition count 247
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 205 transition count 247
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 91 place count 205 transition count 218
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 149 place count 176 transition count 218
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 163 place count 162 transition count 203
Iterating global reduction 3 with 14 rules applied. Total rules applied 177 place count 162 transition count 203
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 177 place count 162 transition count 201
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 181 place count 160 transition count 201
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 190 place count 151 transition count 191
Iterating global reduction 3 with 9 rules applied. Total rules applied 199 place count 151 transition count 191
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 207 place count 143 transition count 177
Iterating global reduction 3 with 8 rules applied. Total rules applied 215 place count 143 transition count 177
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 222 place count 136 transition count 169
Iterating global reduction 3 with 7 rules applied. Total rules applied 229 place count 136 transition count 169
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 230 place count 135 transition count 168
Iterating global reduction 3 with 1 rules applied. Total rules applied 231 place count 135 transition count 168
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 275 place count 113 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 276 place count 112 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 277 place count 112 transition count 145
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 278 place count 111 transition count 143
Iterating global reduction 3 with 1 rules applied. Total rules applied 279 place count 111 transition count 143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 280 place count 110 transition count 142
Iterating global reduction 3 with 1 rules applied. Total rules applied 281 place count 110 transition count 142
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 282 place count 110 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 284 place count 108 transition count 140
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 128 edges and 106 vertex of which 102 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 104 edges and 102 vertex of which 38 / 102 are part of one of the 19 SCC in 4 ms
Free SCC test removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 3 with 35 rules applied. Total rules applied 319 place count 83 transition count 104
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 52 rules applied. Total rules applied 371 place count 52 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 373 place count 50 transition count 83
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 382 place count 41 transition count 65
Iterating global reduction 6 with 9 rules applied. Total rules applied 391 place count 41 transition count 65
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 400 place count 32 transition count 47
Iterating global reduction 6 with 9 rules applied. Total rules applied 409 place count 32 transition count 47
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 416 place count 25 transition count 33
Iterating global reduction 6 with 7 rules applied. Total rules applied 423 place count 25 transition count 33
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 430 place count 18 transition count 26
Iterating global reduction 6 with 7 rules applied. Total rules applied 437 place count 18 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 438 place count 18 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 440 place count 17 transition count 24
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 444 place count 13 transition count 20
Applied a total of 444 rules in 113 ms. Remains 13 /263 variables (removed 250) and now considering 20/305 (removed 285) transitions.
[2025-06-03 06:45:19] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 13 cols
[2025-06-03 06:45:19] [INFO ] Computed 0 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:45:20] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-03 06:45:20] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
[2025-06-03 06:45:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:45:20] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:45:20] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-03 06:45:20] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
[2025-06-03 06:45:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 4/29 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/30 variables, and 13 constraints, problems are : Problem set: 0 solved, 14 unsolved in 195 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 4/29 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/30 variables, and 27 constraints, problems are : Problem set: 0 solved, 14 unsolved in 224 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 424ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 425ms
Starting structural reductions in SI_CTL mode, iteration 1 : 13/263 places, 20/305 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 599 ms. Remains : 13/263 places, 20/305 transitions.
[2025-06-03 06:45:20] [INFO ] Flatten gal took : 1 ms
[2025-06-03 06:45:20] [INFO ] Flatten gal took : 0 ms
[2025-06-03 06:45:20] [INFO ] Input system was already deterministic with 20 transitions.
[2025-06-03 06:45:20] [INFO ] Flatten gal took : 0 ms
[2025-06-03 06:45:20] [INFO ] Flatten gal took : 1 ms
[2025-06-03 06:45:20] [INFO ] Time to serialize gal into /tmp/CTLFireability8152158416437594808.gal : 0 ms
[2025-06-03 06:45:20] [INFO ] Time to serialize properties into /tmp/CTLFireability10914901510322323843.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/CTLFireability8152158416437594808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10914901510322323843.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,4482,0.005692,3756,2,39,5,337,6,0,66,367,0
Converting to forward existential form...Done !
original formula: E(EG(AG(!(((((p130==1)||(p87==1))&&(p115==1))&&(p66==1))))) U (p88==1))
=> equivalent forward existential formula: [(FwdU(Init,EG(!(E(TRUE U !(!(((((p130==1)||(p87==1))&&(p115==1))&&(p66==1)))))))) * (p88==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t8, t18, t19, Intersection with reachable at each step enabled. (destroyed/reverse/i...181
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.049188,5548,1,0,197,10297,70,136,403,15491,200
FORMULA DiscoveryGPU-PT-11b-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 263/263 places, 305/305 transitions.
Graph (complete) has 498 edges and 263 vertex of which 251 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 250 transition count 245
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 203 transition count 245
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 95 place count 203 transition count 216
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 153 place count 174 transition count 216
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 168 place count 159 transition count 200
Iterating global reduction 2 with 15 rules applied. Total rules applied 183 place count 159 transition count 200
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 183 place count 159 transition count 199
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 185 place count 158 transition count 199
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 194 place count 149 transition count 189
Iterating global reduction 2 with 9 rules applied. Total rules applied 203 place count 149 transition count 189
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 211 place count 141 transition count 175
Iterating global reduction 2 with 8 rules applied. Total rules applied 219 place count 141 transition count 175
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 226 place count 134 transition count 167
Iterating global reduction 2 with 7 rules applied. Total rules applied 233 place count 134 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 234 place count 133 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 235 place count 133 transition count 166
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 277 place count 112 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 278 place count 111 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 279 place count 111 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 280 place count 110 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 281 place count 110 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 282 place count 109 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 283 place count 109 transition count 141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 285 place count 107 transition count 139
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 13 rules applied. Total rules applied 298 place count 106 transition count 127
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 14 rules applied. Total rules applied 312 place count 94 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 313 place count 93 transition count 125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 313 place count 93 transition count 124
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 315 place count 92 transition count 124
Applied a total of 315 rules in 43 ms. Remains 92 /263 variables (removed 171) and now considering 124/305 (removed 181) transitions.
// Phase 1: matrix 124 rows 92 cols
[2025-06-03 06:45:20] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:45:20] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-03 06:45:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:45:20] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:45:20] [INFO ] Redundant transitions in 6 ms returned []
Running 123 sub problems to find dead transitions.
[2025-06-03 06:45:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/216 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 0/216 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 93 constraints, problems are : Problem set: 0 solved, 123 unsolved in 6676 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/216 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 123/216 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/216 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 216 constraints, problems are : Problem set: 0 solved, 123 unsolved in 8075 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14800ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 14801ms
Starting structural reductions in SI_CTL mode, iteration 1 : 92/263 places, 124/305 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15093 ms. Remains : 92/263 places, 124/305 transitions.
[2025-06-03 06:45:35] [INFO ] Flatten gal took : 3 ms
[2025-06-03 06:45:35] [INFO ] Flatten gal took : 3 ms
[2025-06-03 06:45:35] [INFO ] Input system was already deterministic with 124 transitions.
[2025-06-03 06:45:35] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 792 steps (1 resets) in 9 ms. (79 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-11b-CTLFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 06:45:35] [INFO ] Flatten gal took : 3 ms
[2025-06-03 06:45:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15676499034279821125.gal : 1 ms
[2025-06-03 06:45:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11153477373043360468.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15676499034279821125.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11153477373043360468.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 305/305 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 233 transition count 274
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 233 transition count 274
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 225 transition count 265
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 225 transition count 265
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 217 transition count 256
Iterating global reduction 0 with 8 rules applied. Total rules applied 92 place count 217 transition count 256
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 97 place count 212 transition count 251
Iterating global reduction 0 with 5 rules applied. Total rules applied 102 place count 212 transition count 251
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 106 place count 208 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 110 place count 208 transition count 244
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 113 place count 205 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 116 place count 205 transition count 241
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 119 place count 202 transition count 238
Iterating global reduction 0 with 3 rules applied. Total rules applied 122 place count 202 transition count 238
Applied a total of 122 rules in 20 ms. Remains 202 /263 variables (removed 61) and now considering 238/305 (removed 67) transitions.
// Phase 1: matrix 238 rows 202 cols
[2025-06-03 06:45:35] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:45:35] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-03 06:45:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:45:36] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2025-06-03 06:45:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (OVERLAPS) 238/440 variables, 202/204 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:46] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:47] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:47] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:47] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:47] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:47] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:48] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:48] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:48] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:48] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:48] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:48] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:49] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:49] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:49] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:49] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:49] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:49] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:49] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:49] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:50] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:45:50] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 226 constraints, problems are : Problem set: 0 solved, 237 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 238/440 variables, 202/226 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 237/463 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 463 constraints, problems are : Problem set: 0 solved, 237 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 202/263 places, 238/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60498 ms. Remains : 202/263 places, 238/305 transitions.
[2025-06-03 06:46:36] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:46:36] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:46:36] [INFO ] Input system was already deterministic with 238 transitions.
[2025-06-03 06:46:36] [INFO ] Flatten gal took : 10 ms
[2025-06-03 06:46:36] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:46:36] [INFO ] Time to serialize gal into /tmp/CTLFireability12900195975793970313.gal : 2 ms
[2025-06-03 06:46:36] [INFO ] Time to serialize properties into /tmp/CTLFireability4186031817412723229.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/CTLFireability12900195975793970313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4186031817412723229.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 06:47:06] [INFO ] Flatten gal took : 6 ms
[2025-06-03 06:47:06] [INFO ] Applying decomposition
[2025-06-03 06:47:06] [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/graph15207989321047695427.txt' '-o' '/tmp/graph15207989321047695427.bin' '-w' '/tmp/graph15207989321047695427.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15207989321047695427.bin' '-l' '-1' '-v' '-w' '/tmp/graph15207989321047695427.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:47:06] [INFO ] Decomposing Gal with order
[2025-06-03 06:47:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:47:06] [INFO ] Removed a total of 91 redundant transitions.
[2025-06-03 06:47:06] [INFO ] Flatten gal took : 14 ms
[2025-06-03 06:47:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 2 ms.
[2025-06-03 06:47:06] [INFO ] Time to serialize gal into /tmp/CTLFireability5773732706591373404.gal : 3 ms
[2025-06-03 06:47:06] [INFO ] Time to serialize properties into /tmp/CTLFireability12740760974444408810.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/CTLFireability5773732706591373404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12740760974444408810.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 305/305 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 237 transition count 278
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 237 transition count 278
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 229 transition count 269
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 229 transition count 269
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 223 transition count 263
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 223 transition count 263
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 217 transition count 256
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 217 transition count 256
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 97 place count 212 transition count 247
Iterating global reduction 0 with 5 rules applied. Total rules applied 102 place count 212 transition count 247
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 107 place count 207 transition count 242
Iterating global reduction 0 with 5 rules applied. Total rules applied 112 place count 207 transition count 242
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 116 place count 203 transition count 238
Iterating global reduction 0 with 4 rules applied. Total rules applied 120 place count 203 transition count 238
Applied a total of 120 rules in 23 ms. Remains 203 /263 variables (removed 60) and now considering 238/305 (removed 67) transitions.
// Phase 1: matrix 238 rows 203 cols
[2025-06-03 06:47:36] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:47:36] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-03 06:47:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:47:36] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2025-06-03 06:47:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (OVERLAPS) 238/441 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:47:48] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:47:48] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:47:48] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:47:48] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:47:49] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:47:49] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:47:49] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:47:49] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:47:49] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:47:49] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:47:50] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 11/216 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (OVERLAPS) 0/441 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 216 constraints, problems are : Problem set: 0 solved, 237 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 238/441 variables, 203/216 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 237/453 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/441 variables, and 453 constraints, problems are : Problem set: 0 solved, 237 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Starting structural reductions in LTL mode, iteration 1 : 203/263 places, 238/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60561 ms. Remains : 203/263 places, 238/305 transitions.
[2025-06-03 06:48:37] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:48:37] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:48:37] [INFO ] Input system was already deterministic with 238 transitions.
[2025-06-03 06:48:37] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:48:37] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:48:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14321733471806878937.gal : 3 ms
[2025-06-03 06:48:37] [INFO ] Time to serialize properties into /tmp/CTLFireability788067612554442597.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/CTLFireability14321733471806878937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability788067612554442597.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 06:49:07] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:49:07] [INFO ] Applying decomposition
[2025-06-03 06:49:07] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6090535382400522812.txt' '-o' '/tmp/graph6090535382400522812.bin' '-w' '/tmp/graph6090535382400522812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6090535382400522812.bin' '-l' '-1' '-v' '-w' '/tmp/graph6090535382400522812.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:49:07] [INFO ] Decomposing Gal with order
[2025-06-03 06:49:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:49:07] [INFO ] Removed a total of 90 redundant transitions.
[2025-06-03 06:49:07] [INFO ] Flatten gal took : 16 ms
[2025-06-03 06:49:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2025-06-03 06:49:07] [INFO ] Time to serialize gal into /tmp/CTLFireability12812611665919692356.gal : 3 ms
[2025-06-03 06:49:07] [INFO ] Time to serialize properties into /tmp/CTLFireability7280888331802714548.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12812611665919692356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7280888331802714548.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 305/305 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 231 transition count 272
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 231 transition count 272
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 220 transition count 260
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 220 transition count 260
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 96 place count 210 transition count 249
Iterating global reduction 0 with 10 rules applied. Total rules applied 106 place count 210 transition count 249
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 115 place count 201 transition count 239
Iterating global reduction 0 with 9 rules applied. Total rules applied 124 place count 201 transition count 239
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 132 place count 193 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 140 place count 193 transition count 225
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 147 place count 186 transition count 218
Iterating global reduction 0 with 7 rules applied. Total rules applied 154 place count 186 transition count 218
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 160 place count 180 transition count 212
Iterating global reduction 0 with 6 rules applied. Total rules applied 166 place count 180 transition count 212
Applied a total of 166 rules in 20 ms. Remains 180 /263 variables (removed 83) and now considering 212/305 (removed 93) transitions.
// Phase 1: matrix 212 rows 180 cols
[2025-06-03 06:49:37] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:49:37] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-03 06:49:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:49:37] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2025-06-03 06:49:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 212/392 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:49:46] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:49:47] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:49:47] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:49:47] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:49:47] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:49:47] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:49:47] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:49:47] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:49:48] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:49:48] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:49:48] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 11/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 193 constraints, problems are : Problem set: 0 solved, 211 unsolved in 26388 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/392 variables, 180/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 211/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/392 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 404 constraints, problems are : Problem set: 0 solved, 211 unsolved in 29536 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55968ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 55969ms
Starting structural reductions in LTL mode, iteration 1 : 180/263 places, 212/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56298 ms. Remains : 180/263 places, 212/305 transitions.
[2025-06-03 06:50:33] [INFO ] Flatten gal took : 4 ms
[2025-06-03 06:50:33] [INFO ] Flatten gal took : 7 ms
[2025-06-03 06:50:33] [INFO ] Input system was already deterministic with 212 transitions.
[2025-06-03 06:50:33] [INFO ] Flatten gal took : 6 ms
[2025-06-03 06:50:33] [INFO ] Flatten gal took : 6 ms
[2025-06-03 06:50:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12549278090309626879.gal : 2 ms
[2025-06-03 06:50:33] [INFO ] Time to serialize properties into /tmp/CTLFireability6653259713872972010.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/CTLFireability12549278090309626879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6653259713872972010.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 06:51:03] [INFO ] Flatten gal took : 4 ms
[2025-06-03 06:51:03] [INFO ] Applying decomposition
[2025-06-03 06:51:03] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7846255965481973227.txt' '-o' '/tmp/graph7846255965481973227.bin' '-w' '/tmp/graph7846255965481973227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7846255965481973227.bin' '-l' '-1' '-v' '-w' '/tmp/graph7846255965481973227.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:51:03] [INFO ] Decomposing Gal with order
[2025-06-03 06:51:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:51:03] [INFO ] Removed a total of 86 redundant transitions.
[2025-06-03 06:51:03] [INFO ] Flatten gal took : 10 ms
[2025-06-03 06:51:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2025-06-03 06:51:03] [INFO ] Time to serialize gal into /tmp/CTLFireability2179278235692141277.gal : 3 ms
[2025-06-03 06:51:03] [INFO ] Time to serialize properties into /tmp/CTLFireability8267174251363892101.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/CTLFireability2179278235692141277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8267174251363892101.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 : 263/263 places, 305/305 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 237 transition count 279
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 237 transition count 279
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 230 transition count 272
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 230 transition count 272
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 224 transition count 265
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 224 transition count 265
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 84 place count 218 transition count 258
Iterating global reduction 0 with 6 rules applied. Total rules applied 90 place count 218 transition count 258
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 213 transition count 250
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 213 transition count 250
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 209 transition count 246
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 209 transition count 246
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 111 place count 206 transition count 243
Iterating global reduction 0 with 3 rules applied. Total rules applied 114 place count 206 transition count 243
Applied a total of 114 rules in 24 ms. Remains 206 /263 variables (removed 57) and now considering 243/305 (removed 62) transitions.
// Phase 1: matrix 243 rows 206 cols
[2025-06-03 06:51:33] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:51:33] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-03 06:51:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:51:34] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2025-06-03 06:51:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 243/449 variables, 206/208 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:51:45] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:51:46] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:51:46] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:51:46] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:51:46] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:51:46] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:51:46] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:51:46] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:51:47] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:51:47] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:51:47] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 11/219 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 449/449 variables, and 219 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 243/449 variables, 206/219 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 242/461 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 15)
(t4 1)
(t5 21)
(t6 45)
(t7 1)
(t8 1)
(t9 1)
(t10 1)
(t11 1)
(t12 0)
(t13 1)
(t14 1)
(t15 1)
(t16 0)
(t17 1)
(t18 1)
(t19 1)
(t20 1)
(t21 1)
(t22 1)
(t23 1)
(t24 0)
(t25 0)
(t26 0)
(t27 0)
(t28 0)
(t29 0)
(t30 0)
(t31 1)
(t32 1)
(t33 1)
(t34 2)
(t35 1)
(t36 1)
(t37 1)
(t38 1)
(t39 0)
(t40 0)
(t41 0)
(t42 0)
(t43 0)
(t44 0)
(t45 0)
(t46 0)
(t47 0)
(t48 0)
(t49 1)
(t50 1)
(t51 1)
(t52 1)
(t53 1)
(t54 0)
(t55 1)
(t56 1)
(t57 1)
(t58 1)
(t59 0)
(t60 1)
(t61 1)
(t62 1)
(t63 2)
(t64 0)
(t65 1)
(t66 1)
(t67 1)
(t68 1)
(t69 1)
(t70 0)
(t71 0)
(t72 0)
(t73 0)
(t74 0)
(t75 0)
(t76 0)
(t77 0)
(t78 0)
(t79 0)
(t80 1)
(t81 1)
(t82 1)
(t83 1)
(t84 1)
(t85 0)
(t86 0)
(t87 0)
(t88 0)
(t89 1)
(t90 1)
(t91 0)
(t92 1)
(t93 1)
(t94 1)
(t95 1)
(t96 1)
(t97 1)
(t98 0)
(t99 0)
(t100 0)
(t101 1)
(t102 1)
(t103 1)
(t104 2)
(t105 1)
(t106 1)
(t107 1)
(t108 1)
(t109 1)
(t110 0)
(t111 0)
(t112 0)
(t113 0)
(t114 0)
(t115 0)
(t116 1)
(t117 1)
(t118 1)
(t119 1)
(t120 1)
(t121 0)
(t122 0)
(t123 0)
(t124 0)
(t125 1)
(t126 1)
(t127 0)
(t128 1)
(t129 1)
(t130 1)
(t131 1)
(t132 1)
(t133 0)
(t134 1)
(t135 1)
(t136 1)
(t137 1)
(t138 0)
(t139 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/449 variables, and 461 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in LTL mode, iteration 1 : 206/263 places, 243/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60455 ms. Remains : 206/263 places, 243/305 transitions.
[2025-06-03 06:52:34] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:52:34] [INFO ] Flatten gal took : 9 ms
[2025-06-03 06:52:34] [INFO ] Input system was already deterministic with 243 transitions.
[2025-06-03 06:52:34] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:52:34] [INFO ] Flatten gal took : 8 ms
[2025-06-03 06:52:34] [INFO ] Time to serialize gal into /tmp/CTLFireability14012401862834269828.gal : 2 ms
[2025-06-03 06:52:34] [INFO ] Time to serialize properties into /tmp/CTLFireability4056100363606250877.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/CTLFireability14012401862834269828.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4056100363606250877.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 06:53:04] [INFO ] Flatten gal took : 5 ms
[2025-06-03 06:53:04] [INFO ] Applying decomposition
[2025-06-03 06:53:04] [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/graph5824929533023559988.txt' '-o' '/tmp/graph5824929533023559988.bin' '-w' '/tmp/graph5824929533023559988.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5824929533023559988.bin' '-l' '-1' '-v' '-w' '/tmp/graph5824929533023559988.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:53:04] [INFO ] Decomposing Gal with order
[2025-06-03 06:53:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:53:04] [INFO ] Removed a total of 90 redundant transitions.
[2025-06-03 06:53:04] [INFO ] Flatten gal took : 11 ms
[2025-06-03 06:53:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2025-06-03 06:53:04] [INFO ] Time to serialize gal into /tmp/CTLFireability6682336667850469553.gal : 3 ms
[2025-06-03 06:53:04] [INFO ] Time to serialize properties into /tmp/CTLFireability17701914362705239305.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/CTLFireability6682336667850469553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17701914362705239305.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 263/263 places, 305/305 transitions.
Graph (complete) has 498 edges and 263 vertex of which 251 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 250 transition count 245
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 203 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 202 transition count 244
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 97 place count 202 transition count 215
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 155 place count 173 transition count 215
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 169 place count 159 transition count 200
Iterating global reduction 3 with 14 rules applied. Total rules applied 183 place count 159 transition count 200
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 183 place count 159 transition count 198
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 187 place count 157 transition count 198
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 196 place count 148 transition count 188
Iterating global reduction 3 with 9 rules applied. Total rules applied 205 place count 148 transition count 188
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 213 place count 140 transition count 174
Iterating global reduction 3 with 8 rules applied. Total rules applied 221 place count 140 transition count 174
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 227 place count 134 transition count 168
Iterating global reduction 3 with 6 rules applied. Total rules applied 233 place count 134 transition count 168
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 277 place count 112 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 278 place count 111 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 279 place count 111 transition count 145
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 280 place count 110 transition count 143
Iterating global reduction 3 with 1 rules applied. Total rules applied 281 place count 110 transition count 143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 282 place count 109 transition count 142
Iterating global reduction 3 with 1 rules applied. Total rules applied 283 place count 109 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 285 place count 107 transition count 140
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 128 edges and 105 vertex of which 101 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 111 edges and 101 vertex of which 44 / 101 are part of one of the 22 SCC in 0 ms
Free SCC test removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 37 rules applied. Total rules applied 322 place count 79 transition count 102
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 378 place count 46 transition count 79
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 387 place count 37 transition count 61
Iterating global reduction 5 with 9 rules applied. Total rules applied 396 place count 37 transition count 61
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 405 place count 28 transition count 43
Iterating global reduction 5 with 9 rules applied. Total rules applied 414 place count 28 transition count 43
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 423 place count 19 transition count 25
Iterating global reduction 5 with 9 rules applied. Total rules applied 432 place count 19 transition count 25
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 441 place count 10 transition count 16
Iterating global reduction 5 with 9 rules applied. Total rules applied 450 place count 10 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 451 place count 10 transition count 15
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 452 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 453 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 455 place count 7 transition count 12
Applied a total of 455 rules in 37 ms. Remains 7 /263 variables (removed 256) and now considering 12/305 (removed 293) transitions.
[2025-06-03 06:53:34] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 7 cols
[2025-06-03 06:53:34] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:53:34] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-03 06:53:34] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2025-06-03 06:53:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:53:34] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:53:34] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-03 06:53:34] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2025-06-03 06:53:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 157 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/15 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 163 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 330ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 330ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/263 places, 12/305 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 438 ms. Remains : 7/263 places, 12/305 transitions.
[2025-06-03 06:53:34] [INFO ] Flatten gal took : 1 ms
[2025-06-03 06:53:34] [INFO ] Flatten gal took : 1 ms
[2025-06-03 06:53:34] [INFO ] Input system was already deterministic with 12 transitions.
[2025-06-03 06:53:34] [INFO ] Flatten gal took : 0 ms
[2025-06-03 06:53:34] [INFO ] Flatten gal took : 1 ms
[2025-06-03 06:53:34] [INFO ] Time to serialize gal into /tmp/CTLFireability11802098307930659840.gal : 0 ms
[2025-06-03 06:53:34] [INFO ] Time to serialize properties into /tmp/CTLFireability1718926998940017792.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/CTLFireability11802098307930659840.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1718926998940017792.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,396,0.0072,3788,2,22,5,145,6,0,34,140,0
Converting to forward existential form...Done !
original formula: EG(AG((p182==0)))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((p182==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...170
(forward)formula 0,0,0.011773,3916,1,0,27,358,48,15,195,425,32
FORMULA DiscoveryGPU-PT-11b-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-06-03 06:53:35] [INFO ] Flatten gal took : 13 ms
[2025-06-03 06:53:35] [INFO ] Flatten gal took : 16 ms
[2025-06-03 06:53:35] [INFO ] Applying decomposition
[2025-06-03 06:53:35] [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/graph3045523421212462176.txt' '-o' '/tmp/graph3045523421212462176.bin' '-w' '/tmp/graph3045523421212462176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3045523421212462176.bin' '-l' '-1' '-v' '-w' '/tmp/graph3045523421212462176.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:53:35] [INFO ] Decomposing Gal with order
[2025-06-03 06:53:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:53:35] [INFO ] Removed a total of 98 redundant transitions.
[2025-06-03 06:53:35] [INFO ] Flatten gal took : 13 ms
[2025-06-03 06:53:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 06:53:35] [INFO ] Time to serialize gal into /tmp/CTLFireability13740981429982766887.gal : 4 ms
[2025-06-03 06:53:35] [INFO ] Time to serialize properties into /tmp/CTLFireability3100869280918288299.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/CTLFireability13740981429982766887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3100869280918288299.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 12 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.88569e+16,625.78,7569668,74925,129,1.20001e+07,4933,638,3.75675e+07,62,44127,0
Converting to forward existential form...Done !
original formula: E(((E(((i4.i0.u16.p46==1)&&(i26.i1.u91.p322==1)) U AG(EX(((i10.u32.p102==1)&&(i26.i1.u91.p322==1))))) + AF(E((i5.u33.p111==1) U (i16.i0.u...384
=> equivalent forward existential formula: [((FwdU(Init,((E(((i4.i0.u16.p46==1)&&(i26.i1.u91.p322==1)) U !(E(TRUE U !(EX(((i10.u32.p102==1)&&(i26.i1.u91.p3...637
Reverse transition relation is NOT exact ! Due to transitions t282, t287, i2.u6.t192, i2.u6.t298, i2.u8.t188, i2.u8.t195, i3.i0.u10.t299, i3.i1.u5.t182, i3...1213
Detected timeout of ITS tools.
[2025-06-03 07:21:41] [INFO ] Applying decomposition
[2025-06-03 07:21:41] [INFO ] Flatten gal took : 12 ms
[2025-06-03 07:21:41] [INFO ] Decomposing Gal with order
[2025-06-03 07:21:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:21:41] [INFO ] Removed a total of 101 redundant transitions.
[2025-06-03 07:21:41] [INFO ] Flatten gal took : 20 ms
[2025-06-03 07:21:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 638 labels/synchronizations in 19 ms.
[2025-06-03 07:21:42] [INFO ] Time to serialize gal into /tmp/CTLFireability608899201482527745.gal : 4 ms
[2025-06-03 07:21:42] [INFO ] Time to serialize properties into /tmp/CTLFireability16858481804319569584.ctl : 4 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/CTLFireability608899201482527745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16858481804319569584.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 12 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="DiscoveryGPU-PT-11b"
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 DiscoveryGPU-PT-11b, 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 r058-smll-174854064600698"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-11b.tgz
mv DiscoveryGPU-PT-11b 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 '
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 ;