Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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 111K 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-15b-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2023-15
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2025-00
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2025-01
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2025-02
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2025-03
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2025-04
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2025-05
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2025-06
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2025-07
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2025-08
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2025-09
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2025-10
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748956694701

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-15b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 13:18:17] [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 13:18:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 13:18:17] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2025-06-03 13:18:17] [INFO ] Transformed 436 places.
[2025-06-03 13:18:17] [INFO ] Transformed 464 transitions.
[2025-06-03 13:18:17] [INFO ] Found NUPN structural information;
[2025-06-03 13:18:17] [INFO ] Parsed PT model containing 436 places and 464 transitions and 1214 arcs in 578 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Support contains 87 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 464/464 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 406 transition count 464
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 85 place count 351 transition count 409
Iterating global reduction 1 with 55 rules applied. Total rules applied 140 place count 351 transition count 409
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 151 place count 340 transition count 398
Iterating global reduction 1 with 11 rules applied. Total rules applied 162 place count 340 transition count 398
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 171 place count 331 transition count 389
Iterating global reduction 1 with 9 rules applied. Total rules applied 180 place count 331 transition count 389
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 185 place count 326 transition count 384
Iterating global reduction 1 with 5 rules applied. Total rules applied 190 place count 326 transition count 384
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 192 place count 324 transition count 380
Iterating global reduction 1 with 2 rules applied. Total rules applied 194 place count 324 transition count 380
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 196 place count 322 transition count 378
Iterating global reduction 1 with 2 rules applied. Total rules applied 198 place count 322 transition count 378
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 200 place count 320 transition count 376
Iterating global reduction 1 with 2 rules applied. Total rules applied 202 place count 320 transition count 376
Applied a total of 202 rules in 285 ms. Remains 320 /436 variables (removed 116) and now considering 376/464 (removed 88) transitions.
// Phase 1: matrix 376 rows 320 cols
[2025-06-03 13:18:18] [INFO ] Computed 2 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:18:18] [INFO ] Implicit Places using invariants in 713 ms returned []
[2025-06-03 13:18:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:18:19] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 1429 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2025-06-03 13:18: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/319 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/320 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (OVERLAPS) 376/696 variables, 320/322 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:45] [INFO ] Deduced a trap composed of 7 places in 382 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:46] [INFO ] Deduced a trap composed of 8 places in 342 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:46] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:46] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:47] [INFO ] Deduced a trap composed of 11 places in 300 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:47] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:47] [INFO ] Deduced a trap composed of 13 places in 288 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:48] [INFO ] Deduced a trap composed of 14 places in 271 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:48] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:48] [INFO ] Deduced a trap composed of 16 places in 269 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:48] [INFO ] Deduced a trap composed of 17 places in 278 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:49] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:49] [INFO ] Deduced a trap composed of 19 places in 270 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:49] [INFO ] Deduced a trap composed of 20 places in 277 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:50] [INFO ] Deduced a trap composed of 20 places in 249 ms of which 11 ms to minimize.
SMT process timed out in 30528ms, After SMT, problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 30561ms
Starting structural reductions in LTL mode, iteration 1 : 320/436 places, 376/464 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32328 ms. Remains : 320/436 places, 376/464 transitions.
Support contains 87 out of 320 places after structural reductions.
[2025-06-03 13:18:50] [INFO ] Flatten gal took : 116 ms
[2025-06-03 13:18:50] [INFO ] Flatten gal took : 56 ms
[2025-06-03 13:18:50] [INFO ] Input system was already deterministic with 376 transitions.
Support contains 86 out of 320 places (down from 87) after GAL structural reductions.
RANDOM walk for 40000 steps (80 resets) in 2651 ms. (15 steps per ms) remains 7/70 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 174 ms. (228 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (13 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 119 ms. (333 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (12 resets) in 101 ms. (392 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 119 ms. (333 steps per ms) remains 3/4 properties
[2025-06-03 13:18:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 143/163 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 438/601 variables, 219/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:52] [INFO ] Deduced a trap along path composed of 4 places in 36 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:52] [INFO ] Deduced a trap along path composed of 4 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:52] [INFO ] Deduced a trap along path composed of 5 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:52] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:52] [INFO ] Deduced a trap along path composed of 4 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:52] [INFO ] Deduced a trap along path composed of 4 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:52] [INFO ] Deduced a trap along path composed of 4 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:52] [INFO ] Deduced a trap along path composed of 4 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:18:52] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 2 ms to minimize.
Problem AtomicPropp1 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 9/250 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 0/250 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 86/687 variables, 72/322 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/687 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 10 (OVERLAPS) 9/696 variables, 9/331 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/696 variables, 0/331 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/696 variables, 0/331 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 696/696 variables, and 331 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1224 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 9/9 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/12 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 130/142 variables, 12/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 445/587 variables, 217/232 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 1/233 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/587 variables, 8/241 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/587 variables, 0/241 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 97/684 variables, 79/320 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/684 variables, 0/320 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/696 variables, 12/332 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/696 variables, 0/332 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/696 variables, 0/332 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 696/696 variables, and 332 constraints, problems are : Problem set: 2 solved, 1 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 9/9 constraints]
After SMT, in 1961ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 70 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 13 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2025-06-03 13:18:54] [INFO ] Flatten gal took : 42 ms
[2025-06-03 13:18:54] [INFO ] Flatten gal took : 45 ms
[2025-06-03 13:18:54] [INFO ] Input system was already deterministic with 376 transitions.
Support contains 72 out of 320 places (down from 74) after GAL structural reductions.
FORMULA DiscoveryGPU-PT-15b-CTLFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 50 stabilizing places and 50 stable transitions
Graph (complete) has 620 edges and 320 vertex of which 312 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.14 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 320/320 places, 376/376 transitions.
Graph (complete) has 620 edges and 320 vertex of which 312 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 311 transition count 310
Reduce places removed 57 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 59 rules applied. Total rules applied 117 place count 254 transition count 308
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 119 place count 252 transition count 308
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 119 place count 252 transition count 268
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 199 place count 212 transition count 268
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 211 place count 200 transition count 254
Iterating global reduction 3 with 12 rules applied. Total rules applied 223 place count 200 transition count 254
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 233 place count 190 transition count 241
Iterating global reduction 3 with 10 rules applied. Total rules applied 243 place count 190 transition count 241
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 251 place count 182 transition count 231
Iterating global reduction 3 with 8 rules applied. Total rules applied 259 place count 182 transition count 231
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 264 place count 177 transition count 223
Iterating global reduction 3 with 5 rules applied. Total rules applied 269 place count 177 transition count 223
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 272 place count 174 transition count 220
Iterating global reduction 3 with 3 rules applied. Total rules applied 275 place count 174 transition count 220
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 327 place count 148 transition count 194
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 329 place count 146 transition count 191
Iterating global reduction 3 with 2 rules applied. Total rules applied 331 place count 146 transition count 191
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 333 place count 144 transition count 188
Iterating global reduction 3 with 2 rules applied. Total rules applied 335 place count 144 transition count 188
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 336 place count 143 transition count 187
Iterating global reduction 3 with 1 rules applied. Total rules applied 337 place count 143 transition count 187
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 339 place count 141 transition count 185
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 169 edges and 139 vertex of which 135 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 148 edges and 135 vertex of which 58 / 135 are part of one of the 29 SCC in 3 ms
Free SCC test removed 29 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 3 with 49 rules applied. Total rules applied 388 place count 106 transition count 135
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 462 place count 61 transition count 106
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 475 place count 48 transition count 80
Iterating global reduction 5 with 13 rules applied. Total rules applied 488 place count 48 transition count 80
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 501 place count 35 transition count 54
Iterating global reduction 5 with 13 rules applied. Total rules applied 514 place count 35 transition count 54
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 527 place count 22 transition count 28
Iterating global reduction 5 with 13 rules applied. Total rules applied 540 place count 22 transition count 28
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 553 place count 9 transition count 15
Iterating global reduction 5 with 13 rules applied. Total rules applied 566 place count 9 transition count 15
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 567 place count 9 transition count 14
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 568 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 569 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 571 place count 6 transition count 11
Applied a total of 571 rules in 197 ms. Remains 6 /320 variables (removed 314) and now considering 11/376 (removed 365) transitions.
[2025-06-03 13:18:54] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 6 cols
[2025-06-03 13:18:54] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:18:54] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-03 13:18:54] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2025-06-03 13:18:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:18:54] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:18:54] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2025-06-03 13:18:54] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2025-06-03 13:18:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/15 variables, and 6 constraints, problems are : Problem set: 0 solved, 7 unsolved in 137 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 99 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 244ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 245ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/320 places, 11/376 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 509 ms. Remains : 6/320 places, 11/376 transitions.
[2025-06-03 13:18:54] [INFO ] Flatten gal took : 1 ms
[2025-06-03 13:18:54] [INFO ] Flatten gal took : 2 ms
[2025-06-03 13:18:54] [INFO ] Input system was already deterministic with 11 transitions.
[2025-06-03 13:18:54] [INFO ] Flatten gal took : 1 ms
[2025-06-03 13:18:54] [INFO ] Flatten gal took : 1 ms
[2025-06-03 13:18:54] [INFO ] Time to serialize gal into /tmp/CTLFireability18428198532705755840.gal : 1 ms
[2025-06-03 13:18:54] [INFO ] Time to serialize properties into /tmp/CTLFireability10986393753692004058.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18428198532705755840.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10986393753692004058.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF((p378==1))
=> equivalent forward existential formula: [FwdG(Init,!((p378==1)))] = FALSE
Hit Full ! (commute/partial/dont) 8/0/3
(forward)formula 0,0,0.020717,3872,1,0,8,278,20,4,166,326,8
FORMULA DiscoveryGPU-PT-15b-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 376/376 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 288 transition count 343
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 288 transition count 343
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 76 place count 276 transition count 326
Iterating global reduction 0 with 12 rules applied. Total rules applied 88 place count 276 transition count 326
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 100 place count 264 transition count 313
Iterating global reduction 0 with 12 rules applied. Total rules applied 112 place count 264 transition count 313
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 123 place count 253 transition count 299
Iterating global reduction 0 with 11 rules applied. Total rules applied 134 place count 253 transition count 299
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 140 place count 247 transition count 291
Iterating global reduction 0 with 6 rules applied. Total rules applied 146 place count 247 transition count 291
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 151 place count 242 transition count 286
Iterating global reduction 0 with 5 rules applied. Total rules applied 156 place count 242 transition count 286
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 158 place count 240 transition count 284
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 240 transition count 284
Applied a total of 160 rules in 74 ms. Remains 240 /320 variables (removed 80) and now considering 284/376 (removed 92) transitions.
// Phase 1: matrix 284 rows 240 cols
[2025-06-03 13:18:54] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:18:55] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-03 13:18:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:18:55] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2025-06-03 13:18:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/524 variables, 240/242 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:19:09] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:19:09] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:19:10] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:19:10] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:19:10] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:19:10] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:19:11] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:19:11] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:19:11] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:19:11] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:19:11] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:19:12] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:19:12] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:19:12] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:19:12] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 15/257 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 524/524 variables, and 257 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/524 variables, 240/257 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 283/540 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/524 variables, and 540 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Starting structural reductions in LTL mode, iteration 1 : 240/320 places, 284/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60643 ms. Remains : 240/320 places, 284/376 transitions.
[2025-06-03 13:19:55] [INFO ] Flatten gal took : 28 ms
[2025-06-03 13:19:55] [INFO ] Flatten gal took : 28 ms
[2025-06-03 13:19:55] [INFO ] Input system was already deterministic with 284 transitions.
[2025-06-03 13:19:55] [INFO ] Flatten gal took : 24 ms
[2025-06-03 13:19:55] [INFO ] Flatten gal took : 31 ms
[2025-06-03 13:19:55] [INFO ] Time to serialize gal into /tmp/CTLFireability1060201448665534784.gal : 35 ms
[2025-06-03 13:19:55] [INFO ] Time to serialize properties into /tmp/CTLFireability5343199807868943923.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1060201448665534784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5343199807868943923.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 13:20:25] [INFO ] Flatten gal took : 15 ms
[2025-06-03 13:20:25] [INFO ] Applying decomposition
[2025-06-03 13:20:25] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1570966140950602615.txt' '-o' '/tmp/graph1570966140950602615.bin' '-w' '/tmp/graph1570966140950602615.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1570966140950602615.bin' '-l' '-1' '-v' '-w' '/tmp/graph1570966140950602615.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:20:25] [INFO ] Decomposing Gal with order
[2025-06-03 13:20:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:20:26] [INFO ] Removed a total of 118 redundant transitions.
[2025-06-03 13:20:26] [INFO ] Flatten gal took : 81 ms
[2025-06-03 13:20:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 13 ms.
[2025-06-03 13:20:26] [INFO ] Time to serialize gal into /tmp/CTLFireability8395310867842901307.gal : 11 ms
[2025-06-03 13:20:26] [INFO ] Time to serialize properties into /tmp/CTLFireability14812562819210360288.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/CTLFireability8395310867842901307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14812562819210360288.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 : 320/320 places, 376/376 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 288 transition count 343
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 288 transition count 343
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 76 place count 276 transition count 326
Iterating global reduction 0 with 12 rules applied. Total rules applied 88 place count 276 transition count 326
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 99 place count 265 transition count 315
Iterating global reduction 0 with 11 rules applied. Total rules applied 110 place count 265 transition count 315
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 120 place count 255 transition count 302
Iterating global reduction 0 with 10 rules applied. Total rules applied 130 place count 255 transition count 302
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 135 place count 250 transition count 295
Iterating global reduction 0 with 5 rules applied. Total rules applied 140 place count 250 transition count 295
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 145 place count 245 transition count 290
Iterating global reduction 0 with 5 rules applied. Total rules applied 150 place count 245 transition count 290
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 152 place count 243 transition count 288
Iterating global reduction 0 with 2 rules applied. Total rules applied 154 place count 243 transition count 288
Applied a total of 154 rules in 58 ms. Remains 243 /320 variables (removed 77) and now considering 288/376 (removed 88) transitions.
// Phase 1: matrix 288 rows 243 cols
[2025-06-03 13:20:56] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:20:56] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-06-03 13:20:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:20:56] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2025-06-03 13:20:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 288/531 variables, 243/245 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:12] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:12] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:12] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:13] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:13] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:13] [INFO ] Deduced a trap composed of 12 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 13:21:13] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:13] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:13] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:13] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:14] [INFO ] Deduced a trap composed of 17 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 13:21:14] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:14] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:14] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:21:14] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 15/260 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/531 variables, and 260 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 288/531 variables, 243/260 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 287/547 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 547 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Starting structural reductions in LTL mode, iteration 1 : 243/320 places, 288/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60794 ms. Remains : 243/320 places, 288/376 transitions.
[2025-06-03 13:21:57] [INFO ] Flatten gal took : 13 ms
[2025-06-03 13:21:57] [INFO ] Flatten gal took : 11 ms
[2025-06-03 13:21:57] [INFO ] Input system was already deterministic with 288 transitions.
[2025-06-03 13:21:57] [INFO ] Flatten gal took : 10 ms
[2025-06-03 13:21:57] [INFO ] Flatten gal took : 10 ms
[2025-06-03 13:21:57] [INFO ] Time to serialize gal into /tmp/CTLFireability11397880252190345938.gal : 3 ms
[2025-06-03 13:21:57] [INFO ] Time to serialize properties into /tmp/CTLFireability2427125995619853359.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/CTLFireability11397880252190345938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2427125995619853359.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 13:22:27] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:22:27] [INFO ] Applying decomposition
[2025-06-03 13:22:27] [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/graph16857170727396912803.txt' '-o' '/tmp/graph16857170727396912803.bin' '-w' '/tmp/graph16857170727396912803.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16857170727396912803.bin' '-l' '-1' '-v' '-w' '/tmp/graph16857170727396912803.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:22:27] [INFO ] Decomposing Gal with order
[2025-06-03 13:22:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:22:27] [INFO ] Removed a total of 117 redundant transitions.
[2025-06-03 13:22:27] [INFO ] Flatten gal took : 25 ms
[2025-06-03 13:22:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2025-06-03 13:22:27] [INFO ] Time to serialize gal into /tmp/CTLFireability7135911110933269907.gal : 6 ms
[2025-06-03 13:22:27] [INFO ] Time to serialize properties into /tmp/CTLFireability15459279757452894588.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/CTLFireability7135911110933269907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15459279757452894588.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 : 320/320 places, 376/376 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 290 transition count 345
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 290 transition count 345
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 279 transition count 329
Iterating global reduction 0 with 11 rules applied. Total rules applied 82 place count 279 transition count 329
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 93 place count 268 transition count 317
Iterating global reduction 0 with 11 rules applied. Total rules applied 104 place count 268 transition count 317
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 114 place count 258 transition count 305
Iterating global reduction 0 with 10 rules applied. Total rules applied 124 place count 258 transition count 305
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 129 place count 253 transition count 298
Iterating global reduction 0 with 5 rules applied. Total rules applied 134 place count 253 transition count 298
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 138 place count 249 transition count 294
Iterating global reduction 0 with 4 rules applied. Total rules applied 142 place count 249 transition count 294
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 144 place count 247 transition count 292
Iterating global reduction 0 with 2 rules applied. Total rules applied 146 place count 247 transition count 292
Applied a total of 146 rules in 54 ms. Remains 247 /320 variables (removed 73) and now considering 292/376 (removed 84) transitions.
// Phase 1: matrix 292 rows 247 cols
[2025-06-03 13:22:57] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:22:57] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-03 13:22:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:22:57] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2025-06-03 13:22:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 292/539 variables, 247/249 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:13] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:13] [INFO ] Deduced a trap composed of 8 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 13:23:13] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:13] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:13] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:13] [INFO ] Deduced a trap composed of 12 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 13:23:14] [INFO ] Deduced a trap composed of 13 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 13:23:14] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:14] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:14] [INFO ] Deduced a trap composed of 16 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 13:23:14] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:15] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:15] [INFO ] Deduced a trap composed of 19 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 13:23:15] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:23:15] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 15/264 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 539/539 variables, and 264 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 292/539 variables, 247/264 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 291/555 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 539/539 variables, and 555 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in LTL mode, iteration 1 : 247/320 places, 292/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60548 ms. Remains : 247/320 places, 292/376 transitions.
[2025-06-03 13:23:57] [INFO ] Flatten gal took : 10 ms
[2025-06-03 13:23:57] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:23:57] [INFO ] Input system was already deterministic with 292 transitions.
[2025-06-03 13:23:57] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:23:57] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:23:57] [INFO ] Time to serialize gal into /tmp/CTLFireability11448729599103756135.gal : 3 ms
[2025-06-03 13:23:57] [INFO ] Time to serialize properties into /tmp/CTLFireability13661028882858102877.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/CTLFireability11448729599103756135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13661028882858102877.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 13:24:28] [INFO ] Flatten gal took : 10 ms
[2025-06-03 13:24:28] [INFO ] Applying decomposition
[2025-06-03 13:24:28] [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/graph12015505786539417215.txt' '-o' '/tmp/graph12015505786539417215.bin' '-w' '/tmp/graph12015505786539417215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12015505786539417215.bin' '-l' '-1' '-v' '-w' '/tmp/graph12015505786539417215.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:24:28] [INFO ] Decomposing Gal with order
[2025-06-03 13:24:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:24:28] [INFO ] Removed a total of 120 redundant transitions.
[2025-06-03 13:24:28] [INFO ] Flatten gal took : 78 ms
[2025-06-03 13:24:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 8 ms.
[2025-06-03 13:24:28] [INFO ] Time to serialize gal into /tmp/CTLFireability12182638932927333574.gal : 8 ms
[2025-06-03 13:24:28] [INFO ] Time to serialize properties into /tmp/CTLFireability12914921580555863716.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/CTLFireability12182638932927333574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12914921580555863716.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 : 320/320 places, 376/376 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 289 transition count 344
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 289 transition count 344
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 278 transition count 328
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 278 transition count 328
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 95 place count 267 transition count 316
Iterating global reduction 0 with 11 rules applied. Total rules applied 106 place count 267 transition count 316
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 114 place count 259 transition count 306
Iterating global reduction 0 with 8 rules applied. Total rules applied 122 place count 259 transition count 306
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 126 place count 255 transition count 301
Iterating global reduction 0 with 4 rules applied. Total rules applied 130 place count 255 transition count 301
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 133 place count 252 transition count 298
Iterating global reduction 0 with 3 rules applied. Total rules applied 136 place count 252 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 137 place count 251 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 138 place count 251 transition count 297
Applied a total of 138 rules in 32 ms. Remains 251 /320 variables (removed 69) and now considering 297/376 (removed 79) transitions.
// Phase 1: matrix 297 rows 251 cols
[2025-06-03 13:24:58] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:24:58] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-03 13:24:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:24:59] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2025-06-03 13:24:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (OVERLAPS) 297/548 variables, 251/253 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:25:14] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:25:14] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:25:14] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:25:14] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:25:15] [INFO ] Deduced a trap composed of 11 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 13:25:15] [INFO ] Deduced a trap composed of 12 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 13:25:15] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:25:15] [INFO ] Deduced a trap composed of 14 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 13:25:15] [INFO ] Deduced a trap composed of 15 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 13:25:15] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:25:16] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:25:16] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:25:16] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:25:16] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:25:16] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 15/268 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/548 variables, and 268 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 297/548 variables, 251/268 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 296/564 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 564 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 251/320 places, 297/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60780 ms. Remains : 251/320 places, 297/376 transitions.
[2025-06-03 13:25:59] [INFO ] Flatten gal took : 14 ms
[2025-06-03 13:25:59] [INFO ] Flatten gal took : 13 ms
[2025-06-03 13:25:59] [INFO ] Input system was already deterministic with 297 transitions.
[2025-06-03 13:25:59] [INFO ] Flatten gal took : 13 ms
[2025-06-03 13:25:59] [INFO ] Flatten gal took : 13 ms
[2025-06-03 13:25:59] [INFO ] Time to serialize gal into /tmp/CTLFireability2598607645942962513.gal : 4 ms
[2025-06-03 13:25:59] [INFO ] Time to serialize properties into /tmp/CTLFireability17725755579742663571.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/CTLFireability2598607645942962513.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17725755579742663571.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 13:26:29] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:26:29] [INFO ] Applying decomposition
[2025-06-03 13:26:29] [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/graph6640059887123940138.txt' '-o' '/tmp/graph6640059887123940138.bin' '-w' '/tmp/graph6640059887123940138.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6640059887123940138.bin' '-l' '-1' '-v' '-w' '/tmp/graph6640059887123940138.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:26:29] [INFO ] Decomposing Gal with order
[2025-06-03 13:26:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:26:29] [INFO ] Removed a total of 117 redundant transitions.
[2025-06-03 13:26:29] [INFO ] Flatten gal took : 21 ms
[2025-06-03 13:26:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 4 ms.
[2025-06-03 13:26:29] [INFO ] Time to serialize gal into /tmp/CTLFireability16207151992181675401.gal : 5 ms
[2025-06-03 13:26:29] [INFO ] Time to serialize properties into /tmp/CTLFireability13400242509190481226.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/CTLFireability16207151992181675401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13400242509190481226.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 : 320/320 places, 376/376 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 290 transition count 345
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 290 transition count 345
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 279 transition count 329
Iterating global reduction 0 with 11 rules applied. Total rules applied 82 place count 279 transition count 329
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 93 place count 268 transition count 318
Iterating global reduction 0 with 11 rules applied. Total rules applied 104 place count 268 transition count 318
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 114 place count 258 transition count 305
Iterating global reduction 0 with 10 rules applied. Total rules applied 124 place count 258 transition count 305
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 129 place count 253 transition count 298
Iterating global reduction 0 with 5 rules applied. Total rules applied 134 place count 253 transition count 298
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 139 place count 248 transition count 293
Iterating global reduction 0 with 5 rules applied. Total rules applied 144 place count 248 transition count 293
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 146 place count 246 transition count 291
Iterating global reduction 0 with 2 rules applied. Total rules applied 148 place count 246 transition count 291
Applied a total of 148 rules in 40 ms. Remains 246 /320 variables (removed 74) and now considering 291/376 (removed 85) transitions.
// Phase 1: matrix 291 rows 246 cols
[2025-06-03 13:26:59] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:26:59] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-06-03 13:26:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:27:00] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2025-06-03 13:27:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 291/537 variables, 246/248 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:27:16] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:27:16] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:27:16] [INFO ] Deduced a trap composed of 9 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 13:27:17] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:27:17] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:27:17] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:27:17] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:27:17] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:27:18] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:27:18] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:27:18] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:27:18] [INFO ] Deduced a trap composed of 18 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 13:27:18] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:27:18] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:27:19] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 15/263 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 537/537 variables, and 263 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 291/537 variables, 246/263 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 290/553 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/537 variables, and 553 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 246/320 places, 291/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60830 ms. Remains : 246/320 places, 291/376 transitions.
[2025-06-03 13:28:00] [INFO ] Flatten gal took : 13 ms
[2025-06-03 13:28:00] [INFO ] Flatten gal took : 12 ms
[2025-06-03 13:28:00] [INFO ] Input system was already deterministic with 291 transitions.
[2025-06-03 13:28:00] [INFO ] Flatten gal took : 12 ms
[2025-06-03 13:28:00] [INFO ] Flatten gal took : 13 ms
[2025-06-03 13:28:00] [INFO ] Time to serialize gal into /tmp/CTLFireability17575355702030325264.gal : 5 ms
[2025-06-03 13:28:00] [INFO ] Time to serialize properties into /tmp/CTLFireability1609431961288915514.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/CTLFireability17575355702030325264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1609431961288915514.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 13:28:30] [INFO ] Flatten gal took : 7 ms
[2025-06-03 13:28:30] [INFO ] Applying decomposition
[2025-06-03 13:28:30] [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/graph3418912357911407096.txt' '-o' '/tmp/graph3418912357911407096.bin' '-w' '/tmp/graph3418912357911407096.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3418912357911407096.bin' '-l' '-1' '-v' '-w' '/tmp/graph3418912357911407096.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:28:30] [INFO ] Decomposing Gal with order
[2025-06-03 13:28:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:28:30] [INFO ] Removed a total of 118 redundant transitions.
[2025-06-03 13:28:30] [INFO ] Flatten gal took : 22 ms
[2025-06-03 13:28:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 5 ms.
[2025-06-03 13:28:30] [INFO ] Time to serialize gal into /tmp/CTLFireability3499057709286072759.gal : 6 ms
[2025-06-03 13:28:30] [INFO ] Time to serialize properties into /tmp/CTLFireability16558107039135782263.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/CTLFireability3499057709286072759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16558107039135782263.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 : 320/320 places, 376/376 transitions.
Graph (complete) has 620 edges and 320 vertex of which 312 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 311 transition count 310
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 254 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 253 transition count 309
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 117 place count 253 transition count 272
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 191 place count 216 transition count 272
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 201 place count 206 transition count 260
Iterating global reduction 3 with 10 rules applied. Total rules applied 211 place count 206 transition count 260
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 219 place count 198 transition count 250
Iterating global reduction 3 with 8 rules applied. Total rules applied 227 place count 198 transition count 250
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 232 place count 193 transition count 244
Iterating global reduction 3 with 5 rules applied. Total rules applied 237 place count 193 transition count 244
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 241 place count 189 transition count 237
Iterating global reduction 3 with 4 rules applied. Total rules applied 245 place count 189 transition count 237
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 248 place count 186 transition count 234
Iterating global reduction 3 with 3 rules applied. Total rules applied 251 place count 186 transition count 234
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 301 place count 161 transition count 209
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 303 place count 159 transition count 206
Iterating global reduction 3 with 2 rules applied. Total rules applied 305 place count 159 transition count 206
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 307 place count 157 transition count 203
Iterating global reduction 3 with 2 rules applied. Total rules applied 309 place count 157 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 310 place count 156 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 311 place count 156 transition count 202
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 312 place count 156 transition count 202
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 314 place count 154 transition count 200
Applied a total of 314 rules in 98 ms. Remains 154 /320 variables (removed 166) and now considering 200/376 (removed 176) transitions.
// Phase 1: matrix 200 rows 154 cols
[2025-06-03 13:29:00] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:29:00] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-03 13:29:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:29:01] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:29:01] [INFO ] Redundant transitions in 15 ms returned []
Running 198 sub problems to find dead transitions.
[2025-06-03 13:29:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 2/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 200/354 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/354 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 156 constraints, problems are : Problem set: 0 solved, 198 unsolved in 15823 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 2/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 200/354 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 198/354 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/354 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 354 constraints, problems are : Problem set: 0 solved, 198 unsolved in 18358 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34258ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 34259ms
Starting structural reductions in SI_CTL mode, iteration 1 : 154/320 places, 200/376 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34676 ms. Remains : 154/320 places, 200/376 transitions.
[2025-06-03 13:29:35] [INFO ] Flatten gal took : 6 ms
[2025-06-03 13:29:35] [INFO ] Flatten gal took : 5 ms
[2025-06-03 13:29:35] [INFO ] Input system was already deterministic with 200 transitions.
[2025-06-03 13:29:35] [INFO ] Flatten gal took : 7 ms
[2025-06-03 13:29:35] [INFO ] Flatten gal took : 6 ms
[2025-06-03 13:29:35] [INFO ] Time to serialize gal into /tmp/CTLFireability12426753419163723469.gal : 1 ms
[2025-06-03 13:29:35] [INFO ] Time to serialize properties into /tmp/CTLFireability18100613339068370279.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/CTLFireability12426753419163723469.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18100613339068370279.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 13:30:05] [INFO ] Flatten gal took : 5 ms
[2025-06-03 13:30:05] [INFO ] Applying decomposition
[2025-06-03 13:30:05] [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/graph2869367826937919522.txt' '-o' '/tmp/graph2869367826937919522.bin' '-w' '/tmp/graph2869367826937919522.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2869367826937919522.bin' '-l' '-1' '-v' '-w' '/tmp/graph2869367826937919522.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:30:05] [INFO ] Decomposing Gal with order
[2025-06-03 13:30:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:30:05] [INFO ] Removed a total of 111 redundant transitions.
[2025-06-03 13:30:05] [INFO ] Flatten gal took : 11 ms
[2025-06-03 13:30:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 5 ms.
[2025-06-03 13:30:05] [INFO ] Time to serialize gal into /tmp/CTLFireability4666191812940210983.gal : 3 ms
[2025-06-03 13:30:05] [INFO ] Time to serialize properties into /tmp/CTLFireability5753516655177809761.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/CTLFireability4666191812940210983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5753516655177809761.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 : 320/320 places, 376/376 transitions.
Graph (complete) has 620 edges and 320 vertex of which 312 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 311 transition count 314
Reduce places removed 53 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 58 rules applied. Total rules applied 112 place count 258 transition count 309
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 117 place count 253 transition count 309
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 117 place count 253 transition count 269
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 197 place count 213 transition count 269
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 208 place count 202 transition count 257
Iterating global reduction 3 with 11 rules applied. Total rules applied 219 place count 202 transition count 257
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 228 place count 193 transition count 245
Iterating global reduction 3 with 9 rules applied. Total rules applied 237 place count 193 transition count 245
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 245 place count 185 transition count 235
Iterating global reduction 3 with 8 rules applied. Total rules applied 253 place count 185 transition count 235
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 258 place count 180 transition count 227
Iterating global reduction 3 with 5 rules applied. Total rules applied 263 place count 180 transition count 227
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 266 place count 177 transition count 224
Iterating global reduction 3 with 3 rules applied. Total rules applied 269 place count 177 transition count 224
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 321 place count 151 transition count 198
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 323 place count 149 transition count 195
Iterating global reduction 3 with 2 rules applied. Total rules applied 325 place count 149 transition count 195
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 327 place count 147 transition count 192
Iterating global reduction 3 with 2 rules applied. Total rules applied 329 place count 147 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 330 place count 146 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 331 place count 146 transition count 191
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 332 place count 146 transition count 191
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 334 place count 144 transition count 189
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 173 edges and 142 vertex of which 138 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 140 edges and 138 vertex of which 52 / 138 are part of one of the 26 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 44 rules applied. Total rules applied 378 place count 112 transition count 144
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 4 with 71 rules applied. Total rules applied 449 place count 72 transition count 113
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 453 place count 68 transition count 113
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 465 place count 56 transition count 89
Iterating global reduction 6 with 12 rules applied. Total rules applied 477 place count 56 transition count 89
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 489 place count 44 transition count 65
Iterating global reduction 6 with 12 rules applied. Total rules applied 501 place count 44 transition count 65
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 510 place count 35 transition count 47
Iterating global reduction 6 with 9 rules applied. Total rules applied 519 place count 35 transition count 47
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 528 place count 26 transition count 38
Iterating global reduction 6 with 9 rules applied. Total rules applied 537 place count 26 transition count 38
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 538 place count 26 transition count 37
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 540 place count 25 transition count 36
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 546 place count 19 transition count 30
Applied a total of 546 rules in 78 ms. Remains 19 /320 variables (removed 301) and now considering 30/376 (removed 346) transitions.
[2025-06-03 13:30:35] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 19 cols
[2025-06-03 13:30:35] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:30:35] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-03 13:30:35] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
[2025-06-03 13:30:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:30:35] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:30:35] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-03 13:30:35] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
[2025-06-03 13:30:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 24/37 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 6/43 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/43 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/44 variables, and 19 constraints, problems are : Problem set: 0 solved, 20 unsolved in 304 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 24/37 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 6/43 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/44 variables, and 39 constraints, problems are : Problem set: 0 solved, 20 unsolved in 506 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 815ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 817ms
Starting structural reductions in SI_CTL mode, iteration 1 : 19/320 places, 30/376 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 961 ms. Remains : 19/320 places, 30/376 transitions.
[2025-06-03 13:30:36] [INFO ] Flatten gal took : 1 ms
[2025-06-03 13:30:36] [INFO ] Flatten gal took : 1 ms
[2025-06-03 13:30:36] [INFO ] Input system was already deterministic with 30 transitions.
[2025-06-03 13:30:36] [INFO ] Flatten gal took : 1 ms
[2025-06-03 13:30:36] [INFO ] Flatten gal took : 1 ms
[2025-06-03 13:30:36] [INFO ] Time to serialize gal into /tmp/CTLFireability13751143941973532246.gal : 0 ms
[2025-06-03 13:30:36] [INFO ] Time to serialize properties into /tmp/CTLFireability17004263938242863068.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/CTLFireability13751143941973532246.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17004263938242863068.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,95865,0.02056,4076,2,111,5,1399,6,0,94,1684,0


Converting to forward existential form...Done !
original formula: A((p335==1) U !((AG(((p173==1) + A((p240==1) U (p108==1)))) + E((p250!=1) U EF((p280==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((!(E(TRUE U !(((p173==1) + !((E(!((p108==1)) U (!((p240==1)) * !((p108==1)))) + EG(!((p108==1...539
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t9, t11, t22, t27, t28, t29, Intersection with reachable at each step enabled. (dest...196
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.277134,9836,1,0,317,33234,100,180,578,44068,365
FORMULA DiscoveryGPU-PT-15b-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 376/376 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 298 transition count 353
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 298 transition count 353
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 53 place count 289 transition count 342
Iterating global reduction 0 with 9 rules applied. Total rules applied 62 place count 289 transition count 342
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 70 place count 281 transition count 333
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 281 transition count 333
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 274 transition count 324
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 274 transition count 324
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 97 place count 269 transition count 317
Iterating global reduction 0 with 5 rules applied. Total rules applied 102 place count 269 transition count 317
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 106 place count 265 transition count 313
Iterating global reduction 0 with 4 rules applied. Total rules applied 110 place count 265 transition count 313
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 112 place count 263 transition count 311
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 263 transition count 311
Applied a total of 114 rules in 53 ms. Remains 263 /320 variables (removed 57) and now considering 311/376 (removed 65) transitions.
// Phase 1: matrix 311 rows 263 cols
[2025-06-03 13:30:36] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:30:37] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-06-03 13:30:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:30:37] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2025-06-03 13:30: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/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 311/574 variables, 263/265 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:30:55] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:30:55] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:30:56] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:30:56] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:30:56] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:30:56] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:30:57] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:30:57] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:30:57] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:30:57] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:30:57] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:30:58] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:30:58] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:30:58] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:30:58] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 15/280 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/574 variables, and 280 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 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, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 311/574 variables, 263/280 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 310/590 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 590 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 263/320 places, 311/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60876 ms. Remains : 263/320 places, 311/376 transitions.
[2025-06-03 13:31:37] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:31:37] [INFO ] Flatten gal took : 10 ms
[2025-06-03 13:31:37] [INFO ] Input system was already deterministic with 311 transitions.
[2025-06-03 13:31:37] [INFO ] Flatten gal took : 10 ms
[2025-06-03 13:31:37] [INFO ] Flatten gal took : 11 ms
[2025-06-03 13:31:37] [INFO ] Time to serialize gal into /tmp/CTLFireability16959428801910027413.gal : 3 ms
[2025-06-03 13:31:37] [INFO ] Time to serialize properties into /tmp/CTLFireability10812049450696276014.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/CTLFireability16959428801910027413.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10812049450696276014.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 13:32:07] [INFO ] Flatten gal took : 7 ms
[2025-06-03 13:32:07] [INFO ] Applying decomposition
[2025-06-03 13:32:07] [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/graph14881755557572671923.txt' '-o' '/tmp/graph14881755557572671923.bin' '-w' '/tmp/graph14881755557572671923.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14881755557572671923.bin' '-l' '-1' '-v' '-w' '/tmp/graph14881755557572671923.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:32:07] [INFO ] Decomposing Gal with order
[2025-06-03 13:32:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:32:08] [INFO ] Removed a total of 118 redundant transitions.
[2025-06-03 13:32:08] [INFO ] Flatten gal took : 17 ms
[2025-06-03 13:32:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 3 ms.
[2025-06-03 13:32:08] [INFO ] Time to serialize gal into /tmp/CTLFireability1077547612990231629.gal : 3 ms
[2025-06-03 13:32:08] [INFO ] Time to serialize properties into /tmp/CTLFireability16183067781325331188.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/CTLFireability1077547612990231629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16183067781325331188.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 : 320/320 places, 376/376 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 293 transition count 349
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 293 transition count 349
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 284 transition count 335
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 284 transition count 335
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 275 transition count 325
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 275 transition count 325
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 98 place count 267 transition count 316
Iterating global reduction 0 with 8 rules applied. Total rules applied 106 place count 267 transition count 316
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 265 transition count 313
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 265 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 264 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 264 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 263 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 263 transition count 311
Applied a total of 114 rules in 54 ms. Remains 263 /320 variables (removed 57) and now considering 311/376 (removed 65) transitions.
// Phase 1: matrix 311 rows 263 cols
[2025-06-03 13:32:38] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:32:38] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-06-03 13:32:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:32:38] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2025-06-03 13:32:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 311/574 variables, 263/265 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:57] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:57] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:57] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:58] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:58] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:58] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:58] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:59] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:59] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:59] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:59] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:32:59] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:00] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:00] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:33:00] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 15/280 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/574 variables, and 280 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 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, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 311/574 variables, 263/280 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 310/590 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 590 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Starting structural reductions in LTL mode, iteration 1 : 263/320 places, 311/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60788 ms. Remains : 263/320 places, 311/376 transitions.
[2025-06-03 13:33:38] [INFO ] Flatten gal took : 12 ms
[2025-06-03 13:33:38] [INFO ] Flatten gal took : 11 ms
[2025-06-03 13:33:38] [INFO ] Input system was already deterministic with 311 transitions.
[2025-06-03 13:33:38] [INFO ] Flatten gal took : 12 ms
[2025-06-03 13:33:38] [INFO ] Flatten gal took : 11 ms
[2025-06-03 13:33:38] [INFO ] Time to serialize gal into /tmp/CTLFireability12736136661230659936.gal : 2 ms
[2025-06-03 13:33:38] [INFO ] Time to serialize properties into /tmp/CTLFireability1802353997458060695.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/CTLFireability12736136661230659936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1802353997458060695.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 13:34:09] [INFO ] Flatten gal took : 7 ms
[2025-06-03 13:34:09] [INFO ] Applying decomposition
[2025-06-03 13:34:09] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6795625512148155707.txt' '-o' '/tmp/graph6795625512148155707.bin' '-w' '/tmp/graph6795625512148155707.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6795625512148155707.bin' '-l' '-1' '-v' '-w' '/tmp/graph6795625512148155707.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:34:09] [INFO ] Decomposing Gal with order
[2025-06-03 13:34:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:34:09] [INFO ] Removed a total of 123 redundant transitions.
[2025-06-03 13:34:09] [INFO ] Flatten gal took : 30 ms
[2025-06-03 13:34:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2025-06-03 13:34:09] [INFO ] Time to serialize gal into /tmp/CTLFireability2873308972010852199.gal : 4 ms
[2025-06-03 13:34:09] [INFO ] Time to serialize properties into /tmp/CTLFireability15124672755267897637.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/CTLFireability2873308972010852199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15124672755267897637.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 : 320/320 places, 376/376 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 290 transition count 345
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 290 transition count 345
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 279 transition count 330
Iterating global reduction 0 with 11 rules applied. Total rules applied 82 place count 279 transition count 330
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 93 place count 268 transition count 318
Iterating global reduction 0 with 11 rules applied. Total rules applied 104 place count 268 transition count 318
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 114 place count 258 transition count 305
Iterating global reduction 0 with 10 rules applied. Total rules applied 124 place count 258 transition count 305
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 129 place count 253 transition count 299
Iterating global reduction 0 with 5 rules applied. Total rules applied 134 place count 253 transition count 299
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 137 place count 250 transition count 296
Iterating global reduction 0 with 3 rules applied. Total rules applied 140 place count 250 transition count 296
Applied a total of 140 rules in 44 ms. Remains 250 /320 variables (removed 70) and now considering 296/376 (removed 80) transitions.
// Phase 1: matrix 296 rows 250 cols
[2025-06-03 13:34:39] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:34:39] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-03 13:34:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:34:39] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2025-06-03 13:34:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/250 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 296/546 variables, 250/252 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:55] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:55] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:56] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:56] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:56] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:56] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:57] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:57] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:57] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:57] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:57] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:58] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:58] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:58] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:34:58] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 15/267 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/546 variables, and 267 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/250 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 296/546 variables, 250/267 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 295/562 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 562 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 250/320 places, 296/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60755 ms. Remains : 250/320 places, 296/376 transitions.
[2025-06-03 13:35:39] [INFO ] Flatten gal took : 6 ms
[2025-06-03 13:35:40] [INFO ] Flatten gal took : 8 ms
[2025-06-03 13:35:40] [INFO ] Input system was already deterministic with 296 transitions.
[2025-06-03 13:35:40] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:35:40] [INFO ] Flatten gal took : 8 ms
[2025-06-03 13:35:40] [INFO ] Time to serialize gal into /tmp/CTLFireability3118602024483231043.gal : 3 ms
[2025-06-03 13:35:40] [INFO ] Time to serialize properties into /tmp/CTLFireability9285188269635774354.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/CTLFireability3118602024483231043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9285188269635774354.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 13:36:10] [INFO ] Flatten gal took : 11 ms
[2025-06-03 13:36:10] [INFO ] Applying decomposition
[2025-06-03 13:36:10] [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/graph2983780360196606747.txt' '-o' '/tmp/graph2983780360196606747.bin' '-w' '/tmp/graph2983780360196606747.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2983780360196606747.bin' '-l' '-1' '-v' '-w' '/tmp/graph2983780360196606747.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:36:10] [INFO ] Decomposing Gal with order
[2025-06-03 13:36:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:36:10] [INFO ] Removed a total of 120 redundant transitions.
[2025-06-03 13:36:10] [INFO ] Flatten gal took : 16 ms
[2025-06-03 13:36:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 3 ms.
[2025-06-03 13:36:10] [INFO ] Time to serialize gal into /tmp/CTLFireability101270493314982342.gal : 3 ms
[2025-06-03 13:36:10] [INFO ] Time to serialize properties into /tmp/CTLFireability495034172293686886.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/CTLFireability101270493314982342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability495034172293686886.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 320/320 places, 376/376 transitions.
Graph (complete) has 620 edges and 320 vertex of which 312 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 311 transition count 310
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 254 transition count 310
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 115 place count 254 transition count 272
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 191 place count 216 transition count 272
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 202 place count 205 transition count 260
Iterating global reduction 2 with 11 rules applied. Total rules applied 213 place count 205 transition count 260
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 222 place count 196 transition count 248
Iterating global reduction 2 with 9 rules applied. Total rules applied 231 place count 196 transition count 248
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 239 place count 188 transition count 238
Iterating global reduction 2 with 8 rules applied. Total rules applied 247 place count 188 transition count 238
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 252 place count 183 transition count 230
Iterating global reduction 2 with 5 rules applied. Total rules applied 257 place count 183 transition count 230
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 260 place count 180 transition count 227
Iterating global reduction 2 with 3 rules applied. Total rules applied 263 place count 180 transition count 227
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 315 place count 154 transition count 201
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 317 place count 152 transition count 198
Iterating global reduction 2 with 2 rules applied. Total rules applied 319 place count 152 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 321 place count 150 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 323 place count 150 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 324 place count 149 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 325 place count 149 transition count 194
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 327 place count 149 transition count 194
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 329 place count 147 transition count 192
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 2 with 16 rules applied. Total rules applied 345 place count 146 transition count 177
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 360 place count 131 transition count 177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 360 place count 131 transition count 176
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 362 place count 130 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 364 place count 129 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 365 place count 129 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 367 place count 128 transition count 173
Applied a total of 367 rules in 55 ms. Remains 128 /320 variables (removed 192) and now considering 173/376 (removed 203) transitions.
// Phase 1: matrix 173 rows 128 cols
[2025-06-03 13:36:40] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:36:40] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-03 13:36:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:36:40] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:36:40] [INFO ] Redundant transitions in 7 ms returned []
Running 172 sub problems to find dead transitions.
[2025-06-03 13:36:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 173/301 variables, 128/129 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 0/301 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 129 constraints, problems are : Problem set: 0 solved, 172 unsolved in 11945 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 173/301 variables, 128/129 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 172/301 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 0/301 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 301 constraints, problems are : Problem set: 0 solved, 172 unsolved in 14569 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26579ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 26580ms
Starting structural reductions in SI_CTL mode, iteration 1 : 128/320 places, 173/376 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26906 ms. Remains : 128/320 places, 173/376 transitions.
[2025-06-03 13:37:07] [INFO ] Flatten gal took : 7 ms
[2025-06-03 13:37:07] [INFO ] Flatten gal took : 7 ms
[2025-06-03 13:37:07] [INFO ] Input system was already deterministic with 173 transitions.
[2025-06-03 13:37:07] [INFO ] Flatten gal took : 6 ms
[2025-06-03 13:37:07] [INFO ] Flatten gal took : 6 ms
[2025-06-03 13:37:07] [INFO ] Time to serialize gal into /tmp/CTLFireability14586412834142579702.gal : 1 ms
[2025-06-03 13:37:07] [INFO ] Time to serialize properties into /tmp/CTLFireability16031548201331371290.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/CTLFireability14586412834142579702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16031548201331371290.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.77366e+15,29.8958,569256,2,181210,5,3.78674e+06,6,0,658,1.94692e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 13:37:37] [INFO ] Flatten gal took : 5 ms
[2025-06-03 13:37:37] [INFO ] Applying decomposition
[2025-06-03 13:37:37] [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/graph1088410705085432354.txt' '-o' '/tmp/graph1088410705085432354.bin' '-w' '/tmp/graph1088410705085432354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1088410705085432354.bin' '-l' '-1' '-v' '-w' '/tmp/graph1088410705085432354.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:37:37] [INFO ] Decomposing Gal with order
[2025-06-03 13:37:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:37:37] [INFO ] Removed a total of 89 redundant transitions.
[2025-06-03 13:37:37] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:37:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 4 ms.
[2025-06-03 13:37:37] [INFO ] Time to serialize gal into /tmp/CTLFireability6164021638945699116.gal : 3 ms
[2025-06-03 13:37:37] [INFO ] Time to serialize properties into /tmp/CTLFireability2241432312887044325.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/CTLFireability6164021638945699116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2241432312887044325.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 : 320/320 places, 376/376 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 288 transition count 343
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 288 transition count 343
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 76 place count 276 transition count 326
Iterating global reduction 0 with 12 rules applied. Total rules applied 88 place count 276 transition count 326
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 100 place count 264 transition count 313
Iterating global reduction 0 with 12 rules applied. Total rules applied 112 place count 264 transition count 313
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 123 place count 253 transition count 299
Iterating global reduction 0 with 11 rules applied. Total rules applied 134 place count 253 transition count 299
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 140 place count 247 transition count 291
Iterating global reduction 0 with 6 rules applied. Total rules applied 146 place count 247 transition count 291
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 151 place count 242 transition count 286
Iterating global reduction 0 with 5 rules applied. Total rules applied 156 place count 242 transition count 286
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 158 place count 240 transition count 284
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 240 transition count 284
Applied a total of 160 rules in 29 ms. Remains 240 /320 variables (removed 80) and now considering 284/376 (removed 92) transitions.
// Phase 1: matrix 284 rows 240 cols
[2025-06-03 13:38:07] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:38:07] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-03 13:38:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:38:07] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2025-06-03 13:38:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/524 variables, 240/242 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:23] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:23] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:23] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:23] [INFO ] Deduced a trap composed of 10 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 13:38:24] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:24] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:24] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:24] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:24] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:25] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:25] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:25] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:25] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:25] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:26] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 15/257 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 1.0)
(t3 2.0)
(t4 1.0)
(t5 18.0)
(t6 29.0)
(t7 1.0)
(t8 1.0)
(t9 1.0)
(t10 1.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 1.0)
(t19 1.0)
(t20 1.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 1.0)
(t32 1.0)
(t33 1.0)
(t34 1.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 1.0)
(t43 1.0)
(t44 1.0)
(t45 0.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 1.0)
(t56 1.0)
(t57 1.0)
(t58 1.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 1.0)
(t67 1.0)
(t68 1.0)
(t69 0.0)
(t70 0.0)
(t71 0.0)
(t72 0.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 1.0)
(t80 1.0)
(t81 1.0)
(t82 1.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 1.0)
(t91 1.0)
(t92 1.0)
(t93 1.0)
(t94 1.0)
(t95 0.0)
(t96 1.0)
(t97 1.0)
(t98 1.0)
(t99 0.0)
(t100 1.0)
(t101 0.0)
(t102 1.0)
(t103 1.0)
(t104 1.0)
(t105 1.0)
(t106 1.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 0.0)
(t111 0.0)
(t112 0.0)
(t113 0.0)
(t114 1.0)
(t115 1.0)
(t116 1.0)
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 0.0)
(t125 0.0)
(t126 0.0)
(t127 1.0)
(t128 1.0)
(t129 1.0)
(t130 1.0)
(t131 0.0)
(t132 0.0)
(t133 0.0)
(t134 0.0)
(t135 0.0)
(t136 0.0)
(t137 0.0)
(t138 1.0)
(t139 1.0)
(t140 1.0)
(t141 1.0)
(t142 1.0)
(t143 0.0)
(t144 0.0)
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 0.0)
(t149 0.0)
(t150 1.0)
(t151 1.0)
(t152 1.0)
(t153 1.0)
(t154 1.0)
(t155 0.0)
(t156 0.0)
(t157 0.0)
(t158 0.0)
(t159 0.0)
(t160 0.0)
(t161 0.0)
(t162 1.0)
(t163 1.0)
(t164 1.0)
(t165 1.0)
(t166 1.0)
(t167 0.0)
(t168 0.0)
(t169 0.0)
(t170 0.0)
(t171 0.0)
(t172 0.0)
(t173 0.0)
(t174 1.0)
(t175 1.0)
(t176 1.0)
(t177 1.0)
(t178 0.0)
(t179 0.0)
(t180 0.0)
(t181 0.0)
(t182 1.0)
(t183 0.0)
(t184 0.0)
(t185 0.0)
(t186 0.0)
(t187 0.0)
(t188 0.0)
(t189 1.0)
(t190 0.0)
(t191 0.0)
(t192 0.0)
(t193 0.0)
(t194 0.0)
(t195 0.0)
(t196 0.0)
(t197 0.0)
(t198 0.0)
(t199 0.0)
(t200 0.0)
(t201 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 524/524 variables, and 257 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/524 variables, 240/257 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 283/540 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/524 variables, and 540 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 240/320 places, 284/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60669 ms. Remains : 240/320 places, 284/376 transitions.
[2025-06-03 13:39:08] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:39:08] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:39:08] [INFO ] Input system was already deterministic with 284 transitions.
[2025-06-03 13:39:08] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:39:08] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:39:08] [INFO ] Time to serialize gal into /tmp/CTLFireability11628949820079776957.gal : 3 ms
[2025-06-03 13:39:08] [INFO ] Time to serialize properties into /tmp/CTLFireability16705106314829954208.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/CTLFireability11628949820079776957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16705106314829954208.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 13:39:38] [INFO ] Flatten gal took : 5 ms
[2025-06-03 13:39:38] [INFO ] Applying decomposition
[2025-06-03 13:39:38] [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/graph899331451178977383.txt' '-o' '/tmp/graph899331451178977383.bin' '-w' '/tmp/graph899331451178977383.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph899331451178977383.bin' '-l' '-1' '-v' '-w' '/tmp/graph899331451178977383.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:39:38] [INFO ] Decomposing Gal with order
[2025-06-03 13:39:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:39:38] [INFO ] Removed a total of 117 redundant transitions.
[2025-06-03 13:39:38] [INFO ] Flatten gal took : 15 ms
[2025-06-03 13:39:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 3 ms.
[2025-06-03 13:39:38] [INFO ] Time to serialize gal into /tmp/CTLFireability1216706675126168486.gal : 4 ms
[2025-06-03 13:39:38] [INFO ] Time to serialize properties into /tmp/CTLFireability15858256141311440701.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/CTLFireability1216706675126168486.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15858256141311440701.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 : 320/320 places, 376/376 transitions.
Graph (complete) has 620 edges and 320 vertex of which 313 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 312 transition count 311
Reduce places removed 57 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 59 rules applied. Total rules applied 117 place count 255 transition count 309
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 119 place count 253 transition count 309
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 119 place count 253 transition count 271
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 195 place count 215 transition count 271
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 207 place count 203 transition count 257
Iterating global reduction 3 with 12 rules applied. Total rules applied 219 place count 203 transition count 257
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 229 place count 193 transition count 244
Iterating global reduction 3 with 10 rules applied. Total rules applied 239 place count 193 transition count 244
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 247 place count 185 transition count 234
Iterating global reduction 3 with 8 rules applied. Total rules applied 255 place count 185 transition count 234
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 260 place count 180 transition count 226
Iterating global reduction 3 with 5 rules applied. Total rules applied 265 place count 180 transition count 226
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 268 place count 177 transition count 223
Iterating global reduction 3 with 3 rules applied. Total rules applied 271 place count 177 transition count 223
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 323 place count 151 transition count 197
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 325 place count 149 transition count 194
Iterating global reduction 3 with 2 rules applied. Total rules applied 327 place count 149 transition count 194
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 329 place count 147 transition count 191
Iterating global reduction 3 with 2 rules applied. Total rules applied 331 place count 147 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 332 place count 146 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 333 place count 146 transition count 190
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 334 place count 146 transition count 190
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 336 place count 144 transition count 188
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 17 rules applied. Total rules applied 353 place count 143 transition count 172
Reduce places removed 16 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 4 with 18 rules applied. Total rules applied 371 place count 127 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 372 place count 126 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 372 place count 126 transition count 169
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 374 place count 125 transition count 169
Applied a total of 374 rules in 65 ms. Remains 125 /320 variables (removed 195) and now considering 169/376 (removed 207) transitions.
// Phase 1: matrix 169 rows 125 cols
[2025-06-03 13:40:08] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:40:08] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-03 13:40:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:40:08] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:40:08] [INFO ] Redundant transitions in 3 ms returned []
Running 168 sub problems to find dead transitions.
[2025-06-03 13:40:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 169/294 variables, 125/126 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 0/294 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 126 constraints, problems are : Problem set: 0 solved, 168 unsolved in 11558 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 169/294 variables, 125/126 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 168/294 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 294 constraints, problems are : Problem set: 0 solved, 168 unsolved in 13967 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25594ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 25595ms
Starting structural reductions in SI_CTL mode, iteration 1 : 125/320 places, 169/376 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25965 ms. Remains : 125/320 places, 169/376 transitions.
[2025-06-03 13:40:34] [INFO ] Flatten gal took : 4 ms
[2025-06-03 13:40:34] [INFO ] Flatten gal took : 4 ms
[2025-06-03 13:40:34] [INFO ] Input system was already deterministic with 169 transitions.
[2025-06-03 13:40:34] [INFO ] Flatten gal took : 3 ms
[2025-06-03 13:40:34] [INFO ] Flatten gal took : 3 ms
[2025-06-03 13:40:34] [INFO ] Time to serialize gal into /tmp/CTLFireability6430926668593522813.gal : 1 ms
[2025-06-03 13:40:34] [INFO ] Time to serialize properties into /tmp/CTLFireability3661177147138411741.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/CTLFireability6430926668593522813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3661177147138411741.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 13:41:04] [INFO ] Flatten gal took : 3 ms
[2025-06-03 13:41:04] [INFO ] Applying decomposition
[2025-06-03 13:41:04] [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/graph3460312928007035673.txt' '-o' '/tmp/graph3460312928007035673.bin' '-w' '/tmp/graph3460312928007035673.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3460312928007035673.bin' '-l' '-1' '-v' '-w' '/tmp/graph3460312928007035673.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:41:04] [INFO ] Decomposing Gal with order
[2025-06-03 13:41:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:41:04] [INFO ] Removed a total of 88 redundant transitions.
[2025-06-03 13:41:04] [INFO ] Flatten gal took : 8 ms
[2025-06-03 13:41:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 3 ms.
[2025-06-03 13:41:04] [INFO ] Time to serialize gal into /tmp/CTLFireability7724852493919968757.gal : 1 ms
[2025-06-03 13:41:04] [INFO ] Time to serialize properties into /tmp/CTLFireability69386600252151653.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/CTLFireability7724852493919968757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability69386600252151653.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 376/376 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 290 transition count 345
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 290 transition count 345
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 72 place count 278 transition count 328
Iterating global reduction 0 with 12 rules applied. Total rules applied 84 place count 278 transition count 328
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 95 place count 267 transition count 316
Iterating global reduction 0 with 11 rules applied. Total rules applied 106 place count 267 transition count 316
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 114 place count 259 transition count 307
Iterating global reduction 0 with 8 rules applied. Total rules applied 122 place count 259 transition count 307
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 257 transition count 304
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 257 transition count 304
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 128 place count 255 transition count 302
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 255 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 131 place count 254 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 132 place count 254 transition count 301
Applied a total of 132 rules in 32 ms. Remains 254 /320 variables (removed 66) and now considering 301/376 (removed 75) transitions.
// Phase 1: matrix 301 rows 254 cols
[2025-06-03 13:41:34] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:41:34] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-03 13:41:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:41:34] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-03 13:41: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/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/254 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 301/555 variables, 254/256 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:51] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:52] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:52] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:52] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:52] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:52] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:53] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:53] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:53] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:53] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:53] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:54] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:54] [INFO ] Deduced a trap composed of 19 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 13:41:54] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:41:54] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 15/271 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 555/555 variables, and 271 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/254 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 301/555 variables, 254/271 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 300/571 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 571 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 254/320 places, 301/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60553 ms. Remains : 254/320 places, 301/376 transitions.
[2025-06-03 13:42:35] [INFO ] Flatten gal took : 11 ms
[2025-06-03 13:42:35] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:42:35] [INFO ] Input system was already deterministic with 301 transitions.
[2025-06-03 13:42:35] [INFO ] Flatten gal took : 17 ms
[2025-06-03 13:42:35] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:42:35] [INFO ] Time to serialize gal into /tmp/CTLFireability15960861568943359350.gal : 2 ms
[2025-06-03 13:42:35] [INFO ] Time to serialize properties into /tmp/CTLFireability14942507964780297727.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/CTLFireability15960861568943359350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14942507964780297727.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 13:43:05] [INFO ] Flatten gal took : 6 ms
[2025-06-03 13:43:05] [INFO ] Applying decomposition
[2025-06-03 13:43:05] [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/graph8096545779542237639.txt' '-o' '/tmp/graph8096545779542237639.bin' '-w' '/tmp/graph8096545779542237639.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8096545779542237639.bin' '-l' '-1' '-v' '-w' '/tmp/graph8096545779542237639.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:43:05] [INFO ] Decomposing Gal with order
[2025-06-03 13:43:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:43:05] [INFO ] Removed a total of 118 redundant transitions.
[2025-06-03 13:43:05] [INFO ] Flatten gal took : 12 ms
[2025-06-03 13:43:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 1 ms.
[2025-06-03 13:43:05] [INFO ] Time to serialize gal into /tmp/CTLFireability9364749675435715216.gal : 3 ms
[2025-06-03 13:43:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10589530996826951082.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/CTLFireability9364749675435715216.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10589530996826951082.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.
[2025-06-03 13:43:35] [INFO ] Flatten gal took : 8 ms
[2025-06-03 13:43:35] [INFO ] Flatten gal took : 7 ms
[2025-06-03 13:43:35] [INFO ] Applying decomposition
[2025-06-03 13:43:35] [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/graph16885915357682007983.txt' '-o' '/tmp/graph16885915357682007983.bin' '-w' '/tmp/graph16885915357682007983.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16885915357682007983.bin' '-l' '-1' '-v' '-w' '/tmp/graph16885915357682007983.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:43:35] [INFO ] Decomposing Gal with order
[2025-06-03 13:43:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:43:35] [INFO ] Removed a total of 138 redundant transitions.
[2025-06-03 13:43:35] [INFO ] Flatten gal took : 24 ms
[2025-06-03 13:43:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 2 ms.
[2025-06-03 13:43:35] [INFO ] Time to serialize gal into /tmp/CTLFireability14884144744505990119.gal : 3 ms
[2025-06-03 13:43:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4856443940999273069.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/CTLFireability14884144744505990119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4856443940999273069.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 13 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 14:12:04] [INFO ] Applying decomposition
[2025-06-03 14:12:05] [INFO ] Flatten gal took : 252 ms
[2025-06-03 14:12:05] [INFO ] Decomposing Gal with order
[2025-06-03 14:12:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 14:12:05] [INFO ] Removed a total of 139 redundant transitions.
[2025-06-03 14:12:05] [INFO ] Flatten gal took : 438 ms
[2025-06-03 14:12:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 1060 labels/synchronizations in 865 ms.
[2025-06-03 14:12:07] [INFO ] Time to serialize gal into /tmp/CTLFireability17959592262945863066.gal : 148 ms
[2025-06-03 14:12:07] [INFO ] Time to serialize properties into /tmp/CTLFireability8233740295658788539.ctl : 31 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/CTLFireability17959592262945863066.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8233740295658788539.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 13 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-15b"
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-15b, 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-174854064800762"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-15b.tgz
mv DiscoveryGPU-PT-15b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;