Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339200090.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 Champagne-PT-H07T2O, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339200090
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.0K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 11:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 11:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 08:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Jun 6 08:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 6 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 6 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 193K Jun 5 20:08 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 Champagne-PT-H07T2O-CTLFireability-2025-00
FORMULA_NAME Champagne-PT-H07T2O-CTLFireability-2025-01
FORMULA_NAME Champagne-PT-H07T2O-CTLFireability-2025-02
FORMULA_NAME Champagne-PT-H07T2O-CTLFireability-2025-03
FORMULA_NAME Champagne-PT-H07T2O-CTLFireability-2025-04
FORMULA_NAME Champagne-PT-H07T2O-CTLFireability-2025-05
FORMULA_NAME Champagne-PT-H07T2O-CTLFireability-2025-06
FORMULA_NAME Champagne-PT-H07T2O-CTLFireability-2025-07
FORMULA_NAME Champagne-PT-H07T2O-CTLFireability-2025-08
FORMULA_NAME Champagne-PT-H07T2O-CTLFireability-2025-09
FORMULA_NAME Champagne-PT-H07T2O-CTLFireability-2025-10
FORMULA_NAME Champagne-PT-H07T2O-CTLFireability-2025-11
FORMULA_NAME Champagne-PT-H07T2O-CTLFireability-2025-12
FORMULA_NAME Champagne-PT-H07T2O-CTLFireability-2025-13
FORMULA_NAME Champagne-PT-H07T2O-CTLFireability-2025-14
FORMULA_NAME Champagne-PT-H07T2O-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749324562792

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H07T2O
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-07 19:29:23] [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-07 19:29:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 19:29:24] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2025-06-07 19:29:24] [INFO ] Transformed 1025 places.
[2025-06-07 19:29:24] [INFO ] Transformed 1282 transitions.
[2025-06-07 19:29:24] [INFO ] Found NUPN structural information;
[2025-06-07 19:29:24] [INFO ] Parsed PT model containing 1025 places and 1282 transitions and 3014 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 116 out of 1025 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1025/1025 places, 1282/1282 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 865 transition count 1122
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 865 transition count 1122
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 417 place count 768 transition count 1025
Iterating global reduction 0 with 97 rules applied. Total rules applied 514 place count 768 transition count 1025
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 568 place count 714 transition count 971
Iterating global reduction 0 with 54 rules applied. Total rules applied 622 place count 714 transition count 971
Applied a total of 622 rules in 211 ms. Remains 714 /1025 variables (removed 311) and now considering 971/1282 (removed 311) transitions.
// Phase 1: matrix 971 rows 714 cols
[2025-06-07 19:29:24] [INFO ] Computed 27 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:29:24] [INFO ] Implicit Places using invariants in 388 ms returned []
[2025-06-07 19:29:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:29:25] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
Running 970 sub problems to find dead transitions.
[2025-06-07 19:29:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/713 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (OVERLAPS) 1/714 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 970 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:29:55] [INFO ] Deduced a trap composed of 52 places in 468 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:29:55] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:29:55] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:29:55] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 15 ms to minimize.
SMT process timed out in 30326ms, After SMT, problems are : Problem set: 0 solved, 970 unsolved
Search for dead transitions found 0 dead transitions in 30351ms
Starting structural reductions in LTL mode, iteration 1 : 714/1025 places, 971/1282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31467 ms. Remains : 714/1025 places, 971/1282 transitions.
Support contains 116 out of 714 places after structural reductions.
[2025-06-07 19:29:55] [INFO ] Flatten gal took : 76 ms
[2025-06-07 19:29:56] [INFO ] Flatten gal took : 41 ms
[2025-06-07 19:29:56] [INFO ] Input system was already deterministic with 971 transitions.
RANDOM walk for 40000 steps (55 resets) in 1802 ms. (22 steps per ms) remains 13/85 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 12/12 properties
[2025-06-07 19:29:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 444/470 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 244/714 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/714 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 971/1685 variables, 714/741 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1685 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/1685 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 741 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 714/714 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 444/470 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 244/714 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/714 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 971/1685 variables, 714/741 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1685 variables, 12/753 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1685 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:29:59] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 11 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/1685 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:30:00] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 19 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1685 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1685 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/1685 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 755 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4120 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 714/714 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5206ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 7 properties in 5208 ms.
Support contains 11 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 971/971 transitions.
Graph (trivial) has 735 edges and 714 vertex of which 413 / 714 are part of one of the 26 SCC in 3 ms
Free SCC test removed 387 places
Drop transitions (Empty/Sink Transition effects.) removed 454 transitions
Reduce isomorphic transitions removed 454 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 327 transition count 410
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 147 rules applied. Total rules applied 255 place count 220 transition count 370
Reduce places removed 19 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 22 rules applied. Total rules applied 277 place count 201 transition count 367
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 282 place count 198 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 283 place count 197 transition count 365
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 283 place count 197 transition count 360
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 293 place count 192 transition count 360
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 321 place count 164 transition count 312
Iterating global reduction 5 with 28 rules applied. Total rules applied 349 place count 164 transition count 312
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 356 place count 164 transition count 305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 356 place count 164 transition count 304
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 358 place count 163 transition count 304
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 360 place count 161 transition count 296
Iterating global reduction 6 with 2 rules applied. Total rules applied 362 place count 161 transition count 296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 364 place count 161 transition count 294
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 7 with 110 rules applied. Total rules applied 474 place count 106 transition count 239
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 482 place count 98 transition count 197
Iterating global reduction 7 with 8 rules applied. Total rules applied 490 place count 98 transition count 197
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 498 place count 98 transition count 189
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 508 place count 93 transition count 210
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 526 place count 93 transition count 192
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 527 place count 92 transition count 184
Iterating global reduction 9 with 1 rules applied. Total rules applied 528 place count 92 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 529 place count 92 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 536 place count 92 transition count 176
Free-agglomeration rule applied 43 times.
Iterating global reduction 10 with 43 rules applied. Total rules applied 579 place count 92 transition count 133
Reduce places removed 43 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 10 with 107 rules applied. Total rules applied 686 place count 49 transition count 69
Ensure Unique test removed 1 places
Iterating post reduction 11 with 1 rules applied. Total rules applied 687 place count 48 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 691 place count 48 transition count 65
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 692 place count 48 transition count 65
Applied a total of 692 rules in 91 ms. Remains 48 /714 variables (removed 666) and now considering 65/971 (removed 906) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 48/714 places, 65/971 transitions.
RANDOM walk for 30748 steps (7 resets) in 452 ms. (67 steps per ms) remains 0/5 properties
[2025-06-07 19:30:07] [INFO ] Flatten gal took : 43 ms
[2025-06-07 19:30:07] [INFO ] Flatten gal took : 33 ms
[2025-06-07 19:30:07] [INFO ] Input system was already deterministic with 971 transitions.
Computed a total of 40 stabilizing places and 40 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 714/714 places, 971/971 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 663 transition count 920
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 663 transition count 920
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 128 place count 637 transition count 894
Iterating global reduction 0 with 26 rules applied. Total rules applied 154 place count 637 transition count 894
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 163 place count 628 transition count 885
Iterating global reduction 0 with 9 rules applied. Total rules applied 172 place count 628 transition count 885
Applied a total of 172 rules in 93 ms. Remains 628 /714 variables (removed 86) and now considering 885/971 (removed 86) transitions.
// Phase 1: matrix 885 rows 628 cols
[2025-06-07 19:30:08] [INFO ] Computed 27 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:30:08] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-07 19:30:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:30:08] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Running 884 sub problems to find dead transitions.
[2025-06-07 19:30: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/627 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 884 unsolved
At refinement iteration 1 (OVERLAPS) 1/628 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 884 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 628/1513 variables, and 27 constraints, problems are : Problem set: 0 solved, 884 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/628 constraints, PredecessorRefiner: 884/884 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 884 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/627 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 884 unsolved
At refinement iteration 1 (OVERLAPS) 1/628 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 884 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 Int declared 628/1513 variables, and 27 constraints, problems are : Problem set: 0 solved, 884 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/628 constraints, PredecessorRefiner: 0/884 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60171ms problems are : Problem set: 0 solved, 884 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Starting structural reductions in LTL mode, iteration 1 : 628/714 places, 885/971 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60761 ms. Remains : 628/714 places, 885/971 transitions.
[2025-06-07 19:31:08] [INFO ] Flatten gal took : 26 ms
[2025-06-07 19:31:08] [INFO ] Flatten gal took : 25 ms
[2025-06-07 19:31:08] [INFO ] Input system was already deterministic with 885 transitions.
[2025-06-07 19:31:08] [INFO ] Flatten gal took : 22 ms
[2025-06-07 19:31:08] [INFO ] Flatten gal took : 19 ms
[2025-06-07 19:31:08] [INFO ] Time to serialize gal into /tmp/CTLFireability4103501804911866142.gal : 19 ms
[2025-06-07 19:31:08] [INFO ] Time to serialize properties into /tmp/CTLFireability8816266510310892672.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/CTLFireability4103501804911866142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8816266510310892672.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-07 19:31:38] [INFO ] Flatten gal took : 19 ms
[2025-06-07 19:31:38] [INFO ] Applying decomposition
[2025-06-07 19:31:38] [INFO ] Flatten gal took : 20 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/graph17001406448494747021.txt' '-o' '/tmp/graph17001406448494747021.bin' '-w' '/tmp/graph17001406448494747021.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17001406448494747021.bin' '-l' '-1' '-v' '-w' '/tmp/graph17001406448494747021.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:31:39] [INFO ] Decomposing Gal with order
[2025-06-07 19:31:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:31:39] [INFO ] Removed a total of 543 redundant transitions.
[2025-06-07 19:31:39] [INFO ] Flatten gal took : 81 ms
[2025-06-07 19:31:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 13 ms.
[2025-06-07 19:31:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13650296868424029852.gal : 10 ms
[2025-06-07 19:31:39] [INFO ] Time to serialize properties into /tmp/CTLFireability10241194792152391570.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/CTLFireability13650296868424029852.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10241194792152391570.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.52559e+36,0.829697,39180,8468,21,52313,455,941,131333,50,877,0


Converting to forward existential form...Done !
original formula: ((!(E(!(AG(AX((i8.u69.p274==1)))) U ((EF(((i21.u182.p772==1)||(i1.i1.i0.u8.p25==1))) + (i11.u100.p399!=1)) * AX(A((i4.u39.p152==1) U (i19...375
=> equivalent forward existential formula: ([(FwdU((Init * !((!(E(!(!(E(TRUE U !(!(EX(!((i8.u69.p274==1)))))))) U ((E(TRUE U ((i21.u182.p772==1)||(i1.i1.i0...953
Reverse transition relation is NOT exact ! Due to transitions t8, t57, t106, t180, t280, t379, t507, i1.i0.i1.t661, i2.t637, i3.t612, i4.t587, i5.t562, i6....466
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 714/714 places, 971/971 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 666 transition count 923
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 666 transition count 923
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 122 place count 640 transition count 897
Iterating global reduction 0 with 26 rules applied. Total rules applied 148 place count 640 transition count 897
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 158 place count 630 transition count 887
Iterating global reduction 0 with 10 rules applied. Total rules applied 168 place count 630 transition count 887
Applied a total of 168 rules in 48 ms. Remains 630 /714 variables (removed 84) and now considering 887/971 (removed 84) transitions.
// Phase 1: matrix 887 rows 630 cols
[2025-06-07 19:32:09] [INFO ] Computed 27 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:32:09] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-07 19:32:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:32:09] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 886 sub problems to find dead transitions.
[2025-06-07 19:32:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 1 (OVERLAPS) 1/630 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 886 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:32:34] [INFO ] Deduced a trap composed of 119 places in 109 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/1517 variables, and 28 constraints, problems are : Problem set: 0 solved, 886 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 886/886 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 886 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 1 (OVERLAPS) 1/630 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/630 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 4 (OVERLAPS) 887/1517 variables, 630/658 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1517 variables, 886/1544 constraints. Problems are: Problem set: 0 solved, 886 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1517/1517 variables, and 1544 constraints, problems are : Problem set: 0 solved, 886 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 886/886 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 886 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 630/714 places, 887/971 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60713 ms. Remains : 630/714 places, 887/971 transitions.
[2025-06-07 19:33:10] [INFO ] Flatten gal took : 16 ms
[2025-06-07 19:33:10] [INFO ] Flatten gal took : 28 ms
[2025-06-07 19:33:10] [INFO ] Input system was already deterministic with 887 transitions.
[2025-06-07 19:33:10] [INFO ] Flatten gal took : 17 ms
[2025-06-07 19:33:10] [INFO ] Flatten gal took : 17 ms
[2025-06-07 19:33:10] [INFO ] Time to serialize gal into /tmp/CTLFireability14363421170007527165.gal : 4 ms
[2025-06-07 19:33:10] [INFO ] Time to serialize properties into /tmp/CTLFireability1988202850742984827.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/CTLFireability14363421170007527165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1988202850742984827.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-07 19:33:40] [INFO ] Flatten gal took : 18 ms
[2025-06-07 19:33:40] [INFO ] Applying decomposition
[2025-06-07 19:33:40] [INFO ] Flatten gal took : 17 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/graph10112867158585220907.txt' '-o' '/tmp/graph10112867158585220907.bin' '-w' '/tmp/graph10112867158585220907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10112867158585220907.bin' '-l' '-1' '-v' '-w' '/tmp/graph10112867158585220907.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:33:40] [INFO ] Decomposing Gal with order
[2025-06-07 19:33:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:33:40] [INFO ] Removed a total of 547 redundant transitions.
[2025-06-07 19:33:40] [INFO ] Flatten gal took : 37 ms
[2025-06-07 19:33:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 9 ms.
[2025-06-07 19:33:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12656375875796863838.gal : 6 ms
[2025-06-07 19:33:40] [INFO ] Time to serialize properties into /tmp/CTLFireability14477127508508760765.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/CTLFireability12656375875796863838.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14477127508508760765.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.76521e+36,1.1464,53912,12618,21,63644,506,993,204768,53,974,0


Converting to forward existential form...Done !
original formula: !(E(AF(((A((i22.u199.p832!=1) U ((i21.i0.i0.u183.p768==1)&&(i4.i0.i0.u40.p161==1))) * AX((i10.u95.p370==1))) * (((i18.u160.p665==1)||(i10...247
=> equivalent forward existential formula: ([(FwdU(Init,!(EG(!(((!((E(!(((i21.i0.i0.u183.p768==1)&&(i4.i0.i0.u40.p161==1))) U (!((i22.u199.p832!=1)) * !(((...763
Reverse transition relation is NOT exact ! Due to transitions t8, t57, t106, t182, t307, t381, t508, i0.t664, i1.t640, i2.t615, i3.t590, i4.i1.i1.t564, i5....528
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 714/714 places, 971/971 transitions.
Graph (trivial) has 750 edges and 714 vertex of which 435 / 714 are part of one of the 27 SCC in 5 ms
Free SCC test removed 408 places
Ensure Unique test removed 452 transitions
Reduce isomorphic transitions removed 452 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 305 transition count 415
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 146 rules applied. Total rules applied 250 place count 202 transition count 372
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 271 place count 182 transition count 371
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 274 place count 181 transition count 369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 275 place count 180 transition count 369
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 275 place count 180 transition count 368
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 277 place count 179 transition count 368
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 305 place count 151 transition count 320
Iterating global reduction 5 with 28 rules applied. Total rules applied 333 place count 151 transition count 320
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 340 place count 151 transition count 313
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 343 place count 148 transition count 300
Iterating global reduction 6 with 3 rules applied. Total rules applied 346 place count 148 transition count 300
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 349 place count 148 transition count 297
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 7 with 108 rules applied. Total rules applied 457 place count 94 transition count 243
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 466 place count 85 transition count 197
Iterating global reduction 7 with 9 rules applied. Total rules applied 475 place count 85 transition count 197
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 484 place count 85 transition count 188
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 486 place count 83 transition count 186
Applied a total of 486 rules in 146 ms. Remains 83 /714 variables (removed 631) and now considering 186/971 (removed 785) transitions.
[2025-06-07 19:34:10] [INFO ] Flow matrix only has 89 transitions (discarded 97 similar events)
// Phase 1: matrix 89 rows 83 cols
[2025-06-07 19:34:10] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:34:10] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-07 19:34:10] [INFO ] Flow matrix only has 89 transitions (discarded 97 similar events)
[2025-06-07 19:34:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:34:11] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:34:11] [INFO ] Redundant transitions in 5 ms returned []
Running 111 sub problems to find dead transitions.
[2025-06-07 19:34:11] [INFO ] Flow matrix only has 89 transitions (discarded 97 similar events)
[2025-06-07 19:34:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/83 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 88/171 variables, 83/110 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 0/171 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/172 variables, and 110 constraints, problems are : Problem set: 0 solved, 111 unsolved in 2661 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/83 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 88/171 variables, 83/110 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 111/221 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/171 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/172 variables, and 221 constraints, problems are : Problem set: 0 solved, 111 unsolved in 2762 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5445ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 5445ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/714 places, 186/971 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6059 ms. Remains : 83/714 places, 186/971 transitions.
[2025-06-07 19:34:16] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:34:16] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:34:16] [INFO ] Input system was already deterministic with 186 transitions.
[2025-06-07 19:34:16] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:34:16] [INFO ] Flatten gal took : 5 ms
[2025-06-07 19:34:16] [INFO ] Time to serialize gal into /tmp/CTLFireability17669838662147708929.gal : 1 ms
[2025-06-07 19:34:16] [INFO ] Time to serialize properties into /tmp/CTLFireability13435009827052681261.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/CTLFireability17669838662147708929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13435009827052681261.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,2.18195e+12,0.0387,4892,2,140,5,1889,6,0,494,985,0


Converting to forward existential form...Done !
original formula: EG((((p448==0)&&(p432==0)) * AG(((p446==0)||(p530==0)))))
=> equivalent forward existential formula: [FwdG(Init,(((p448==0)&&(p432==0)) * !(E(TRUE U !(((p446==0)||(p530==0)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.177838,6812,1,0,12,18051,22,5,2396,10212,8
FORMULA Champagne-PT-H07T2O-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 714/714 places, 971/971 transitions.
Graph (trivial) has 755 edges and 714 vertex of which 434 / 714 are part of one of the 27 SCC in 1 ms
Free SCC test removed 407 places
Ensure Unique test removed 450 transitions
Reduce isomorphic transitions removed 450 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 306 transition count 413
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 154 rules applied. Total rules applied 262 place count 199 transition count 366
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 285 place count 177 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 286 place count 176 transition count 365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 286 place count 176 transition count 364
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 288 place count 175 transition count 364
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 319 place count 144 transition count 313
Iterating global reduction 4 with 31 rules applied. Total rules applied 350 place count 144 transition count 313
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 357 place count 144 transition count 306
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 360 place count 141 transition count 293
Iterating global reduction 5 with 3 rules applied. Total rules applied 363 place count 141 transition count 293
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 366 place count 141 transition count 290
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 106 rules applied. Total rules applied 472 place count 88 transition count 237
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 482 place count 78 transition count 184
Iterating global reduction 6 with 10 rules applied. Total rules applied 492 place count 78 transition count 184
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 502 place count 78 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 503 place count 78 transition count 173
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 505 place count 76 transition count 171
Applied a total of 505 rules in 120 ms. Remains 76 /714 variables (removed 638) and now considering 171/971 (removed 800) transitions.
[2025-06-07 19:34:17] [INFO ] Flow matrix only has 72 transitions (discarded 99 similar events)
// Phase 1: matrix 72 rows 76 cols
[2025-06-07 19:34:17] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:34:17] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-07 19:34:17] [INFO ] Flow matrix only has 72 transitions (discarded 99 similar events)
[2025-06-07 19:34:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:34:17] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:34:17] [INFO ] Redundant transitions in 6 ms returned []
Running 96 sub problems to find dead transitions.
[2025-06-07 19:34:17] [INFO ] Flow matrix only has 72 transitions (discarded 99 similar events)
[2025-06-07 19:34:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 2/76 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 71/147 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/147 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/148 variables, and 103 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1953 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 2/76 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 71/147 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 96/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/148 variables, and 199 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2111 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4093ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4093ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/714 places, 171/971 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4405 ms. Remains : 76/714 places, 171/971 transitions.
[2025-06-07 19:34:21] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:34:21] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:34:21] [INFO ] Input system was already deterministic with 171 transitions.
RANDOM walk for 221 steps (2 resets) in 9 ms. (22 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H07T2O-CTLFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 19:34:21] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:34:21] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:34:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality615894667608918226.gal : 1 ms
[2025-06-07 19:34:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8275976042800877548.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality615894667608918226.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8275976042800877548.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 714/714 places, 971/971 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 662 transition count 919
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 662 transition count 919
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 132 place count 634 transition count 891
Iterating global reduction 0 with 28 rules applied. Total rules applied 160 place count 634 transition count 891
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 169 place count 625 transition count 882
Iterating global reduction 0 with 9 rules applied. Total rules applied 178 place count 625 transition count 882
Applied a total of 178 rules in 55 ms. Remains 625 /714 variables (removed 89) and now considering 882/971 (removed 89) transitions.
// Phase 1: matrix 882 rows 625 cols
[2025-06-07 19:34:21] [INFO ] Computed 27 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:34:21] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-07 19:34:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:34:21] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Running 881 sub problems to find dead transitions.
[2025-06-07 19:34:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 1 (OVERLAPS) 1/625 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 881 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 timeout
0.0)
(s2 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/1507 variables, and 27 constraints, problems are : Problem set: 0 solved, 881 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/625 constraints, PredecessorRefiner: 881/881 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 881 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 1 (OVERLAPS) 1/625 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 881 unsolved
SMT process timed out in 60167ms, After SMT, problems are : Problem set: 0 solved, 881 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Starting structural reductions in LTL mode, iteration 1 : 625/714 places, 882/971 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60749 ms. Remains : 625/714 places, 882/971 transitions.
[2025-06-07 19:35:22] [INFO ] Flatten gal took : 14 ms
[2025-06-07 19:35:22] [INFO ] Flatten gal took : 22 ms
[2025-06-07 19:35:22] [INFO ] Input system was already deterministic with 882 transitions.
[2025-06-07 19:35:22] [INFO ] Flatten gal took : 14 ms
[2025-06-07 19:35:22] [INFO ] Flatten gal took : 15 ms
[2025-06-07 19:35:22] [INFO ] Time to serialize gal into /tmp/CTLFireability11112205461744619415.gal : 3 ms
[2025-06-07 19:35:22] [INFO ] Time to serialize properties into /tmp/CTLFireability9908666119290618368.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/CTLFireability11112205461744619415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9908666119290618368.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-07 19:35:52] [INFO ] Flatten gal took : 14 ms
[2025-06-07 19:35:52] [INFO ] Applying decomposition
[2025-06-07 19:35:52] [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/graph5858047018457197060.txt' '-o' '/tmp/graph5858047018457197060.bin' '-w' '/tmp/graph5858047018457197060.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5858047018457197060.bin' '-l' '-1' '-v' '-w' '/tmp/graph5858047018457197060.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:35:52] [INFO ] Decomposing Gal with order
[2025-06-07 19:35:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:35:52] [INFO ] Removed a total of 545 redundant transitions.
[2025-06-07 19:35:52] [INFO ] Flatten gal took : 32 ms
[2025-06-07 19:35:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 6 ms.
[2025-06-07 19:35:52] [INFO ] Time to serialize gal into /tmp/CTLFireability7513382247285752148.gal : 5 ms
[2025-06-07 19:35:52] [INFO ] Time to serialize properties into /tmp/CTLFireability9419127351570430621.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/CTLFireability7513382247285752148.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9419127351570430621.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21474e+36,0.788669,39004,8460,20,52137,404,889,130806,50,744,0


Converting to forward existential form...Done !
original formula: (EX(AG(EX((((i9.u91.p379==0)||(i16.u135.p578==0))||(i23.u204.p864==0))))) + EG(AF(AG(((i18.u153.p652==0)||(i11.u102.p428==0))))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !(EX((((i9.u91.p379==0)||(i16.u135.p578==0))||(i23.u204.p864==0)))))))] != FALSE + [Fwd...240
Reverse transition relation is NOT exact ! Due to transitions t8, t57, t106, t181, t282, t381, i0.t659, i1.t635, i2.t610, i3.t585, i4.t560, i5.t535, i6.t51...443
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 714/714 places, 971/971 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 660 transition count 917
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 660 transition count 917
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 135 place count 633 transition count 890
Iterating global reduction 0 with 27 rules applied. Total rules applied 162 place count 633 transition count 890
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 623 transition count 880
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 623 transition count 880
Applied a total of 182 rules in 52 ms. Remains 623 /714 variables (removed 91) and now considering 880/971 (removed 91) transitions.
// Phase 1: matrix 880 rows 623 cols
[2025-06-07 19:36:22] [INFO ] Computed 27 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:36:22] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-06-07 19:36:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:36:23] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
Running 879 sub problems to find dead transitions.
[2025-06-07 19:36:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 1 (OVERLAPS) 1/623 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 879 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 623/1503 variables, and 27 constraints, problems are : Problem set: 0 solved, 879 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 879/879 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 879 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 1 (OVERLAPS) 1/623 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 3 (OVERLAPS) 880/1503 variables, 623/650 constraints. Problems are: Problem set: 0 solved, 879 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1503/1503 variables, and 1529 constraints, problems are : Problem set: 0 solved, 879 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 623/623 constraints, PredecessorRefiner: 879/879 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 879 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 623/714 places, 880/971 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60831 ms. Remains : 623/714 places, 880/971 transitions.
[2025-06-07 19:37:23] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:37:23] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:37:23] [INFO ] Input system was already deterministic with 880 transitions.
[2025-06-07 19:37:23] [INFO ] Flatten gal took : 15 ms
[2025-06-07 19:37:23] [INFO ] Flatten gal took : 17 ms
[2025-06-07 19:37:23] [INFO ] Time to serialize gal into /tmp/CTLFireability9525897650202881480.gal : 3 ms
[2025-06-07 19:37:23] [INFO ] Time to serialize properties into /tmp/CTLFireability8170784943091113027.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/CTLFireability9525897650202881480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8170784943091113027.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-07 19:37:53] [INFO ] Flatten gal took : 17 ms
[2025-06-07 19:37:53] [INFO ] Applying decomposition
[2025-06-07 19:37:53] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14411397130906726145.txt' '-o' '/tmp/graph14411397130906726145.bin' '-w' '/tmp/graph14411397130906726145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14411397130906726145.bin' '-l' '-1' '-v' '-w' '/tmp/graph14411397130906726145.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:37:53] [INFO ] Decomposing Gal with order
[2025-06-07 19:37:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:37:53] [INFO ] Removed a total of 538 redundant transitions.
[2025-06-07 19:37:53] [INFO ] Flatten gal took : 29 ms
[2025-06-07 19:37:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 5 ms.
[2025-06-07 19:37:53] [INFO ] Time to serialize gal into /tmp/CTLFireability10845601401992818450.gal : 5 ms
[2025-06-07 19:37:53] [INFO ] Time to serialize properties into /tmp/CTLFireability10270100910175978034.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/CTLFireability10845601401992818450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10270100910175978034.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.03416e+36,1.05918,52776,12446,20,57923,398,870,203453,46,717,0


Converting to forward existential form...Done !
original formula: EX((AX(AG(EX((i11.u97.p400==0)))) + EF((i24.i1.i1.u208.p881==1))))
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!(!(E(TRUE U !(EX((i11.u97.p400==0)))))))))] != FALSE + [(FwdU(EY(Init),TRUE) * (i24.i1.i1.u2...178
Reverse transition relation is NOT exact ! Due to transitions t6, t55, t106, t180, t279, t378, t503, i0.t657, i1.t633, i2.t608, i3.t583, i4.t558, i5.t533, ...472
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 714/714 places, 971/971 transitions.
Graph (trivial) has 739 edges and 714 vertex of which 410 / 714 are part of one of the 27 SCC in 3 ms
Free SCC test removed 383 places
Ensure Unique test removed 422 transitions
Reduce isomorphic transitions removed 422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 330 transition count 437
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 158 rules applied. Total rules applied 270 place count 219 transition count 390
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 293 place count 197 transition count 389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 294 place count 196 transition count 389
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 294 place count 196 transition count 384
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 304 place count 191 transition count 384
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 332 place count 163 transition count 339
Iterating global reduction 4 with 28 rules applied. Total rules applied 360 place count 163 transition count 339
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 367 place count 163 transition count 332
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 370 place count 160 transition count 319
Iterating global reduction 5 with 3 rules applied. Total rules applied 373 place count 160 transition count 319
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 376 place count 160 transition count 316
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 6 with 112 rules applied. Total rules applied 488 place count 104 transition count 260
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 494 place count 98 transition count 230
Iterating global reduction 6 with 6 rules applied. Total rules applied 500 place count 98 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 506 place count 98 transition count 224
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 508 place count 96 transition count 222
Applied a total of 508 rules in 42 ms. Remains 96 /714 variables (removed 618) and now considering 222/971 (removed 749) transitions.
[2025-06-07 19:38:23] [INFO ] Flow matrix only has 113 transitions (discarded 109 similar events)
// Phase 1: matrix 113 rows 96 cols
[2025-06-07 19:38:23] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:38:24] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-06-07 19:38:24] [INFO ] Flow matrix only has 113 transitions (discarded 109 similar events)
[2025-06-07 19:38:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:38:24] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:38:24] [INFO ] Redundant transitions in 2 ms returned []
Running 150 sub problems to find dead transitions.
[2025-06-07 19:38:24] [INFO ] Flow matrix only has 113 transitions (discarded 109 similar events)
[2025-06-07 19:38:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 5/96 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 112/208 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/209 variables, and 123 constraints, problems are : Problem set: 0 solved, 150 unsolved in 4056 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 5/96 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 112/208 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 150/273 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/209 variables, and 273 constraints, problems are : Problem set: 0 solved, 150 unsolved in 3930 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7999ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 8000ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/714 places, 222/971 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8317 ms. Remains : 96/714 places, 222/971 transitions.
[2025-06-07 19:38:32] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:38:32] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:38:32] [INFO ] Input system was already deterministic with 222 transitions.
[2025-06-07 19:38:32] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:38:32] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:38:32] [INFO ] Time to serialize gal into /tmp/CTLFireability14655719121319395950.gal : 1 ms
[2025-06-07 19:38:32] [INFO ] Time to serialize properties into /tmp/CTLFireability16813263593559195928.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/CTLFireability14655719121319395950.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16813263593559195928.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,4.9498e+13,0.035519,5124,2,166,5,2063,6,0,582,1046,0


Converting to forward existential form...Done !
original formula: AG(((p432==0) + (EG((((p430==0)||(p531==0)) + ((p742==0) + !(A((p454==1) U (p464==1)))))) * ((p152==0)||(p278==0)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !((p432==0))) * !(EG((((p430==0)||(p531==0)) + ((p742==0) + !(!((E(!((p464==1)) U (!((p454...289
(forward)formula 0,0,0.037055,5380,1,0,11,2063,11,4,596,1046,2
FORMULA Champagne-PT-H07T2O-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 714/714 places, 971/971 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 665 transition count 922
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 665 transition count 922
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 122 place count 641 transition count 898
Iterating global reduction 0 with 24 rules applied. Total rules applied 146 place count 641 transition count 898
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 155 place count 632 transition count 889
Iterating global reduction 0 with 9 rules applied. Total rules applied 164 place count 632 transition count 889
Applied a total of 164 rules in 53 ms. Remains 632 /714 variables (removed 82) and now considering 889/971 (removed 82) transitions.
// Phase 1: matrix 889 rows 632 cols
[2025-06-07 19:38:32] [INFO ] Computed 27 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:38:32] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-07 19:38:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:38:32] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Running 888 sub problems to find dead transitions.
[2025-06-07 19:38:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/631 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (OVERLAPS) 1/632 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/1521 variables, and 27 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/632 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 888 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/631 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (OVERLAPS) 1/632 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 888 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 Int declared 632/1521 variables, and 27 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/632 constraints, PredecessorRefiner: 0/888 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 888 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in LTL mode, iteration 1 : 632/714 places, 889/971 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60757 ms. Remains : 632/714 places, 889/971 transitions.
[2025-06-07 19:39:33] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:39:33] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:39:33] [INFO ] Input system was already deterministic with 889 transitions.
[2025-06-07 19:39:33] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:39:33] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:39:33] [INFO ] Time to serialize gal into /tmp/CTLFireability18365215099818873033.gal : 3 ms
[2025-06-07 19:39:33] [INFO ] Time to serialize properties into /tmp/CTLFireability112275448900163885.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/CTLFireability18365215099818873033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability112275448900163885.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-07 19:40:03] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:40:03] [INFO ] Applying decomposition
[2025-06-07 19:40:03] [INFO ] Flatten gal took : 19 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/graph2691778307542360478.txt' '-o' '/tmp/graph2691778307542360478.bin' '-w' '/tmp/graph2691778307542360478.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2691778307542360478.bin' '-l' '-1' '-v' '-w' '/tmp/graph2691778307542360478.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:40:03] [INFO ] Decomposing Gal with order
[2025-06-07 19:40:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:40:03] [INFO ] Removed a total of 530 redundant transitions.
[2025-06-07 19:40:03] [INFO ] Flatten gal took : 41 ms
[2025-06-07 19:40:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 5 ms.
[2025-06-07 19:40:03] [INFO ] Time to serialize gal into /tmp/CTLFireability5249107108891491399.gal : 14 ms
[2025-06-07 19:40:03] [INFO ] Time to serialize properties into /tmp/CTLFireability5987559994573999459.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/CTLFireability5249107108891491399.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5987559994573999459.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.99937e+36,1.99558,68312,8593,20,58590,466,1025,485997,54,869,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 714/714 places, 971/971 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 665 transition count 922
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 665 transition count 922
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 124 place count 639 transition count 896
Iterating global reduction 0 with 26 rules applied. Total rules applied 150 place count 639 transition count 896
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 159 place count 630 transition count 887
Iterating global reduction 0 with 9 rules applied. Total rules applied 168 place count 630 transition count 887
Applied a total of 168 rules in 47 ms. Remains 630 /714 variables (removed 84) and now considering 887/971 (removed 84) transitions.
// Phase 1: matrix 887 rows 630 cols
[2025-06-07 19:40:33] [INFO ] Computed 27 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:40:33] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-07 19:40:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:40:34] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Running 886 sub problems to find dead transitions.
[2025-06-07 19:40: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/629 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 1 (OVERLAPS) 1/630 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 886 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/1517 variables, and 27 constraints, problems are : Problem set: 0 solved, 886 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 886/886 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 886 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 1 (OVERLAPS) 1/630 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 886 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/1517 variables, and 27 constraints, problems are : Problem set: 0 solved, 886 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 0/886 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 886 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Starting structural reductions in LTL mode, iteration 1 : 630/714 places, 887/971 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60714 ms. Remains : 630/714 places, 887/971 transitions.
[2025-06-07 19:41:34] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:41:34] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:41:34] [INFO ] Input system was already deterministic with 887 transitions.
[2025-06-07 19:41:34] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:41:34] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:41:34] [INFO ] Time to serialize gal into /tmp/CTLFireability16869190183991749003.gal : 3 ms
[2025-06-07 19:41:34] [INFO ] Time to serialize properties into /tmp/CTLFireability6888226173923399281.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/CTLFireability16869190183991749003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6888226173923399281.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-07 19:42:04] [INFO ] Flatten gal took : 15 ms
[2025-06-07 19:42:04] [INFO ] Applying decomposition
[2025-06-07 19:42:04] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1493907065637722010.txt' '-o' '/tmp/graph1493907065637722010.bin' '-w' '/tmp/graph1493907065637722010.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1493907065637722010.bin' '-l' '-1' '-v' '-w' '/tmp/graph1493907065637722010.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:42:04] [INFO ] Decomposing Gal with order
[2025-06-07 19:42:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:42:04] [INFO ] Removed a total of 548 redundant transitions.
[2025-06-07 19:42:04] [INFO ] Flatten gal took : 27 ms
[2025-06-07 19:42:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2025-06-07 19:42:04] [INFO ] Time to serialize gal into /tmp/CTLFireability6395916627486681598.gal : 5 ms
[2025-06-07 19:42:04] [INFO ] Time to serialize properties into /tmp/CTLFireability4613285138192578330.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/CTLFireability6395916627486681598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4613285138192578330.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.76457e+36,2.62793,68856,8621,26,59093,467,971,486004,52,898,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 714/714 places, 971/971 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 667 transition count 924
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 667 transition count 924
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 119 place count 642 transition count 899
Iterating global reduction 0 with 25 rules applied. Total rules applied 144 place count 642 transition count 899
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 152 place count 634 transition count 891
Iterating global reduction 0 with 8 rules applied. Total rules applied 160 place count 634 transition count 891
Applied a total of 160 rules in 79 ms. Remains 634 /714 variables (removed 80) and now considering 891/971 (removed 80) transitions.
// Phase 1: matrix 891 rows 634 cols
[2025-06-07 19:42:34] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:42:34] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-06-07 19:42:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:42:35] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Running 890 sub problems to find dead transitions.
[2025-06-07 19:42: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/633 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (OVERLAPS) 1/634 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:02] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:02] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:03] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:04] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 634/1525 variables, and 31 constraints, problems are : Problem set: 0 solved, 890 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/634 constraints, PredecessorRefiner: 890/890 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 890 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (OVERLAPS) 1/634 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/634 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:20] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/634 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 634/1525 variables, and 32 constraints, problems are : Problem set: 0 solved, 890 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/634 constraints, PredecessorRefiner: 0/890 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 890 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 634/714 places, 891/971 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60773 ms. Remains : 634/714 places, 891/971 transitions.
[2025-06-07 19:43:35] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:43:35] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:43:35] [INFO ] Input system was already deterministic with 891 transitions.
[2025-06-07 19:43:35] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:43:35] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:43:35] [INFO ] Time to serialize gal into /tmp/CTLFireability16477800563250460851.gal : 3 ms
[2025-06-07 19:43:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7523192804589388337.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/CTLFireability16477800563250460851.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7523192804589388337.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-07 19:44:05] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:44:05] [INFO ] Applying decomposition
[2025-06-07 19:44:05] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8780770865069325875.txt' '-o' '/tmp/graph8780770865069325875.bin' '-w' '/tmp/graph8780770865069325875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8780770865069325875.bin' '-l' '-1' '-v' '-w' '/tmp/graph8780770865069325875.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:44:05] [INFO ] Decomposing Gal with order
[2025-06-07 19:44:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:44:05] [INFO ] Removed a total of 532 redundant transitions.
[2025-06-07 19:44:05] [INFO ] Flatten gal took : 43 ms
[2025-06-07 19:44:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 7 ms.
[2025-06-07 19:44:05] [INFO ] Time to serialize gal into /tmp/CTLFireability9787290953383027239.gal : 8 ms
[2025-06-07 19:44:05] [INFO ] Time to serialize properties into /tmp/CTLFireability14192750340288788917.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/CTLFireability9787290953383027239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14192750340288788917.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.25147e+36,1.13734,53808,12581,21,61704,478,1013,206641,57,964,0


Converting to forward existential form...Done !
original formula: (EG(((i4.u42.p167==1) + E(EG(EF((i10.i1.i0.u92.p363==1))) U !((((i14.u130.p498==1)&&(i1.i0.i0.u17.p62==1)) + E((i10.i0.i0.u87.p380==1) U ...512
=> equivalent forward existential formula: ([(Init * !(EG(((i4.u42.p167==1) + E(EG(E(TRUE U (i10.i1.i0.u92.p363==1))) U !((((i14.u130.p498==1)&&(i1.i0.i0.u...739
Reverse transition relation is NOT exact ! Due to transitions t10, t59, t108, t133, t183, t235, t284, t409, t462, t511, t638, i0.t668, i1.i1.i1.t643, i2.t6...564
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 714/714 places, 971/971 transitions.
Graph (trivial) has 749 edges and 714 vertex of which 436 / 714 are part of one of the 28 SCC in 3 ms
Free SCC test removed 408 places
Ensure Unique test removed 449 transitions
Reduce isomorphic transitions removed 449 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 305 transition count 419
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 149 rules applied. Total rules applied 252 place count 203 transition count 372
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 275 place count 181 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 276 place count 180 transition count 371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 276 place count 180 transition count 370
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 278 place count 179 transition count 370
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 307 place count 150 transition count 321
Iterating global reduction 4 with 29 rules applied. Total rules applied 336 place count 150 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 343 place count 150 transition count 314
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 346 place count 147 transition count 301
Iterating global reduction 5 with 3 rules applied. Total rules applied 349 place count 147 transition count 301
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 352 place count 147 transition count 298
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 106 rules applied. Total rules applied 458 place count 94 transition count 245
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 468 place count 84 transition count 192
Iterating global reduction 6 with 10 rules applied. Total rules applied 478 place count 84 transition count 192
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 488 place count 84 transition count 182
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 490 place count 82 transition count 180
Applied a total of 490 rules in 44 ms. Remains 82 /714 variables (removed 632) and now considering 180/971 (removed 791) transitions.
[2025-06-07 19:44:35] [INFO ] Flow matrix only has 85 transitions (discarded 95 similar events)
// Phase 1: matrix 85 rows 82 cols
[2025-06-07 19:44:35] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:44:35] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-07 19:44:35] [INFO ] Flow matrix only has 85 transitions (discarded 95 similar events)
[2025-06-07 19:44:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:44:35] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:44:35] [INFO ] Redundant transitions in 1 ms returned []
Running 103 sub problems to find dead transitions.
[2025-06-07 19:44:35] [INFO ] Flow matrix only has 85 transitions (discarded 95 similar events)
[2025-06-07 19:44: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/80 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 2/82 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 84/166 variables, 82/109 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 0/166 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/167 variables, and 109 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2375 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 2/82 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 84/166 variables, 82/109 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 103/212 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/166 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/167 variables, and 212 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2524 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4926ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 4926ms
Starting structural reductions in SI_CTL mode, iteration 1 : 82/714 places, 180/971 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5139 ms. Remains : 82/714 places, 180/971 transitions.
[2025-06-07 19:44:40] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:44:40] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:44:40] [INFO ] Input system was already deterministic with 180 transitions.
[2025-06-07 19:44:40] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:44:40] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:44:40] [INFO ] Time to serialize gal into /tmp/CTLFireability13297210677745199642.gal : 1 ms
[2025-06-07 19:44:40] [INFO ] Time to serialize properties into /tmp/CTLFireability12380381171691887336.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/CTLFireability13297210677745199642.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12380381171691887336.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,4.46308e+12,0.036226,4872,2,138,5,2836,6,0,483,1831,0


Converting to forward existential form...Done !
original formula: AG((EF(EG((p89==0))) + AF(((!(A((p272==1) U (p220==1))) * (p100==1)) * (p201==1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(E(TRUE U EG((p89==0))))),!(((!(!((E(!((p220==1)) U (!((p272==1)) * !((p220==1)))) + E...210
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 178/0/2
Hit Full ! (commute/partial/dont) 178/0/2
Hit Full ! (commute/partial/dont) 178/0/2
(forward)formula 0,1,0.119339,7048,1,0,19,17477,42,10,2447,12046,20
FORMULA Champagne-PT-H07T2O-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 714/714 places, 971/971 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 661 transition count 918
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 661 transition count 918
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 134 place count 633 transition count 890
Iterating global reduction 0 with 28 rules applied. Total rules applied 162 place count 633 transition count 890
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 171 place count 624 transition count 881
Iterating global reduction 0 with 9 rules applied. Total rules applied 180 place count 624 transition count 881
Applied a total of 180 rules in 44 ms. Remains 624 /714 variables (removed 90) and now considering 881/971 (removed 90) transitions.
// Phase 1: matrix 881 rows 624 cols
[2025-06-07 19:44:41] [INFO ] Computed 27 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:44:41] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-07 19:44:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:44:41] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 880 sub problems to find dead transitions.
[2025-06-07 19:44:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (OVERLAPS) 1/624 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1505 variables, and 27 constraints, problems are : Problem set: 0 solved, 880 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 880/880 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 880 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (OVERLAPS) 1/624 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 3 (OVERLAPS) 881/1505 variables, 624/651 constraints. Problems are: Problem set: 0 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/1505 variables, and 1531 constraints, problems are : Problem set: 0 solved, 880 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 624/624 constraints, PredecessorRefiner: 880/880 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 880 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in LTL mode, iteration 1 : 624/714 places, 881/971 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60690 ms. Remains : 624/714 places, 881/971 transitions.
[2025-06-07 19:45:41] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:45:41] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:45:41] [INFO ] Input system was already deterministic with 881 transitions.
[2025-06-07 19:45:41] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:45:41] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:45:41] [INFO ] Time to serialize gal into /tmp/CTLFireability2349546078465921866.gal : 2 ms
[2025-06-07 19:45:41] [INFO ] Time to serialize properties into /tmp/CTLFireability12341357400842941539.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/CTLFireability2349546078465921866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12341357400842941539.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-07 19:46:11] [INFO ] Flatten gal took : 15 ms
[2025-06-07 19:46:11] [INFO ] Applying decomposition
[2025-06-07 19:46:11] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11250513174259062018.txt' '-o' '/tmp/graph11250513174259062018.bin' '-w' '/tmp/graph11250513174259062018.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11250513174259062018.bin' '-l' '-1' '-v' '-w' '/tmp/graph11250513174259062018.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:46:11] [INFO ] Decomposing Gal with order
[2025-06-07 19:46:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:46:11] [INFO ] Removed a total of 535 redundant transitions.
[2025-06-07 19:46:11] [INFO ] Flatten gal took : 26 ms
[2025-06-07 19:46:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2025-06-07 19:46:11] [INFO ] Time to serialize gal into /tmp/CTLFireability18166622764993129814.gal : 5 ms
[2025-06-07 19:46:11] [INFO ] Time to serialize properties into /tmp/CTLFireability10585962742891251597.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/CTLFireability18166622764993129814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10585962742891251597.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.10737e+36,1.02535,52004,12409,20,57109,400,858,202559,48,728,0


Converting to forward existential form...Done !
original formula: AG(EX((((i11.u102.p416==0)||(i16.u138.p578==0)) + EG(!(A((i9.i0.i0.u86.p343==1) U (i9.i1.i0.u81.p326==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((((i11.u102.p416==0)||(i16.u138.p578==0)) + EG(!(!((E(!((i9.i1.i0.u81.p326==1)) U (!((i...255
Reverse transition relation is NOT exact ! Due to transitions t7, t56, t105, t179, t278, t377, t504, i0.t658, i1.t634, i2.t609, i3.t584, i4.t559, i5.t534, ...461
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 714/714 places, 971/971 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 661 transition count 918
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 661 transition count 918
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 134 place count 633 transition count 890
Iterating global reduction 0 with 28 rules applied. Total rules applied 162 place count 633 transition count 890
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 171 place count 624 transition count 881
Iterating global reduction 0 with 9 rules applied. Total rules applied 180 place count 624 transition count 881
Applied a total of 180 rules in 45 ms. Remains 624 /714 variables (removed 90) and now considering 881/971 (removed 90) transitions.
// Phase 1: matrix 881 rows 624 cols
[2025-06-07 19:46:42] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:46:42] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-06-07 19:46:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:46:42] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 880 sub problems to find dead transitions.
[2025-06-07 19:46:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (OVERLAPS) 1/624 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 880 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 624/1505 variables, and 27 constraints, problems are : Problem set: 0 solved, 880 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 880/880 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 880 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (OVERLAPS) 1/624 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 880 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 624/1505 variables, and 27 constraints, problems are : Problem set: 0 solved, 880 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 0/880 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 880 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 624/714 places, 881/971 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60697 ms. Remains : 624/714 places, 881/971 transitions.
[2025-06-07 19:47:42] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:47:42] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:47:42] [INFO ] Input system was already deterministic with 881 transitions.
[2025-06-07 19:47:42] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:47:42] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:47:42] [INFO ] Time to serialize gal into /tmp/CTLFireability14742496664563599203.gal : 3 ms
[2025-06-07 19:47:42] [INFO ] Time to serialize properties into /tmp/CTLFireability13666471917630270399.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/CTLFireability14742496664563599203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13666471917630270399.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-07 19:48:12] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:48:12] [INFO ] Applying decomposition
[2025-06-07 19:48:12] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16342825321120023247.txt' '-o' '/tmp/graph16342825321120023247.bin' '-w' '/tmp/graph16342825321120023247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16342825321120023247.bin' '-l' '-1' '-v' '-w' '/tmp/graph16342825321120023247.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:48:12] [INFO ] Decomposing Gal with order
[2025-06-07 19:48:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:48:13] [INFO ] Removed a total of 549 redundant transitions.
[2025-06-07 19:48:13] [INFO ] Flatten gal took : 24 ms
[2025-06-07 19:48:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2025-06-07 19:48:13] [INFO ] Time to serialize gal into /tmp/CTLFireability12985455988471350876.gal : 4 ms
[2025-06-07 19:48:13] [INFO ] Time to serialize properties into /tmp/CTLFireability4146936226906318015.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/CTLFireability12985455988471350876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4146936226906318015.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.11839e+36,1.13463,53432,12253,20,60649,424,892,197937,46,816,0


Converting to forward existential form...Done !
original formula: EG(AG(((EF(((i8.u76.p305==1)&&(i13.u113.p467==1))) + EX(((i5.u41.p163==1)&&(i25.u225.p941==1)))) + AG((i16.i1.i1.u139.p589==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((E(TRUE U ((i8.u76.p305==1)&&(i13.u113.p467==1))) + EX(((i5.u41.p163==1)&&(i25.u225.p94...221
Reverse transition relation is NOT exact ! Due to transitions t6, t55, t107, t181, t280, t380, i1.t658, i2.t634, i3.t609, i4.t584, i5.t559, i6.t534, i7.t50...456
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 714/714 places, 971/971 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 660 transition count 917
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 660 transition count 917
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 137 place count 631 transition count 888
Iterating global reduction 0 with 29 rules applied. Total rules applied 166 place count 631 transition count 888
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 176 place count 621 transition count 878
Iterating global reduction 0 with 10 rules applied. Total rules applied 186 place count 621 transition count 878
Applied a total of 186 rules in 49 ms. Remains 621 /714 variables (removed 93) and now considering 878/971 (removed 93) transitions.
// Phase 1: matrix 878 rows 621 cols
[2025-06-07 19:48:43] [INFO ] Computed 27 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:48:43] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-07 19:48:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:48:43] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 877 sub problems to find dead transitions.
[2025-06-07 19:48:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (OVERLAPS) 1/621 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:49:05] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:49:06] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:49:06] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:49:07] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:49:07] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:49:08] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:49:08] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:49:09] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:49:10] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:49:10] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:49:12] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1499 variables, and 38 constraints, problems are : Problem set: 0 solved, 877 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 877/877 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (OVERLAPS) 1/621 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 4 (OVERLAPS) 878/1499 variables, 621/659 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1499 variables, 877/1536 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1499/1499 variables, and 1536 constraints, problems are : Problem set: 0 solved, 877 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 621/621 constraints, PredecessorRefiner: 877/877 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 877 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 621/714 places, 878/971 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60665 ms. Remains : 621/714 places, 878/971 transitions.
[2025-06-07 19:49:43] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:49:43] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:49:43] [INFO ] Input system was already deterministic with 878 transitions.
[2025-06-07 19:49:43] [INFO ] Flatten gal took : 11 ms
[2025-06-07 19:49:43] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:49:43] [INFO ] Time to serialize gal into /tmp/CTLFireability17147017665463052554.gal : 2 ms
[2025-06-07 19:49:43] [INFO ] Time to serialize properties into /tmp/CTLFireability6419929092587681293.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/CTLFireability17147017665463052554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6419929092587681293.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-07 19:50:13] [INFO ] Flatten gal took : 15 ms
[2025-06-07 19:50:13] [INFO ] Applying decomposition
[2025-06-07 19:50:13] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph203637744355314104.txt' '-o' '/tmp/graph203637744355314104.bin' '-w' '/tmp/graph203637744355314104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph203637744355314104.bin' '-l' '-1' '-v' '-w' '/tmp/graph203637744355314104.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:50:13] [INFO ] Decomposing Gal with order
[2025-06-07 19:50:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:50:14] [INFO ] Removed a total of 546 redundant transitions.
[2025-06-07 19:50:14] [INFO ] Flatten gal took : 23 ms
[2025-06-07 19:50:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 5 ms.
[2025-06-07 19:50:14] [INFO ] Time to serialize gal into /tmp/CTLFireability6430593607740210579.gal : 5 ms
[2025-06-07 19:50:14] [INFO ] Time to serialize properties into /tmp/CTLFireability223085477723329947.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/CTLFireability6430593607740210579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability223085477723329947.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.86373e+36,0.830896,38276,8327,21,48952,494,871,130823,49,945,0


Converting to forward existential form...Done !
original formula: E(AX(!(AG(((((i11.i2.u99.p416==1)&&(i25.i2.u221.p947==1))&&(i26.i1.u227.p970==1))||(!((i15.i0.u132.p568==1)&&(i20.i2.u171.p742==1))))))) ...183
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(EX(!(!(!(E(TRUE U !(((((i11.i2.u99.p416==1)&&(i25.i2.u221.p947==1))&&(i26.i1.u227.p970==1))||(...245
Reverse transition relation is NOT exact ! Due to transitions t6, t56, t105, t130, t179, t229, t278, t328, t377, t452, t626, i1.i2.t655, i2.i2.t631, i3.i2....556
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 714/714 places, 971/971 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 662 transition count 919
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 662 transition count 919
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 130 place count 636 transition count 893
Iterating global reduction 0 with 26 rules applied. Total rules applied 156 place count 636 transition count 893
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 165 place count 627 transition count 884
Iterating global reduction 0 with 9 rules applied. Total rules applied 174 place count 627 transition count 884
Applied a total of 174 rules in 47 ms. Remains 627 /714 variables (removed 87) and now considering 884/971 (removed 87) transitions.
// Phase 1: matrix 884 rows 627 cols
[2025-06-07 19:50:44] [INFO ] Computed 27 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:50:44] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-07 19:50:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:50:44] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 883 sub problems to find dead transitions.
[2025-06-07 19:50:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 883 unsolved
At refinement iteration 1 (OVERLAPS) 1/627 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 883 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/1511 variables, and 27 constraints, problems are : Problem set: 0 solved, 883 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/627 constraints, PredecessorRefiner: 883/883 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 883 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 883 unsolved
At refinement iteration 1 (OVERLAPS) 1/627 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 883 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 883 unsolved
At refinement iteration 3 (OVERLAPS) 884/1511 variables, 627/654 constraints. Problems are: Problem set: 0 solved, 883 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/1511 variables, and 1537 constraints, problems are : Problem set: 0 solved, 883 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 627/627 constraints, PredecessorRefiner: 883/883 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 883 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LTL mode, iteration 1 : 627/714 places, 884/971 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60718 ms. Remains : 627/714 places, 884/971 transitions.
[2025-06-07 19:51:44] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:51:44] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:51:44] [INFO ] Input system was already deterministic with 884 transitions.
[2025-06-07 19:51:44] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:51:44] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:51:44] [INFO ] Time to serialize gal into /tmp/CTLFireability15165969790480198995.gal : 3 ms
[2025-06-07 19:51:44] [INFO ] Time to serialize properties into /tmp/CTLFireability9518262299608242217.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/CTLFireability15165969790480198995.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9518262299608242217.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-07 19:52:15] [INFO ] Flatten gal took : 19 ms
[2025-06-07 19:52:15] [INFO ] Applying decomposition
[2025-06-07 19:52:15] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2247072847176533536.txt' '-o' '/tmp/graph2247072847176533536.bin' '-w' '/tmp/graph2247072847176533536.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2247072847176533536.bin' '-l' '-1' '-v' '-w' '/tmp/graph2247072847176533536.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:52:15] [INFO ] Decomposing Gal with order
[2025-06-07 19:52:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:52:15] [INFO ] Removed a total of 536 redundant transitions.
[2025-06-07 19:52:15] [INFO ] Flatten gal took : 26 ms
[2025-06-07 19:52:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 4 ms.
[2025-06-07 19:52:15] [INFO ] Time to serialize gal into /tmp/CTLFireability9208864022918232707.gal : 4 ms
[2025-06-07 19:52:15] [INFO ] Time to serialize properties into /tmp/CTLFireability17566888733546891730.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/CTLFireability9208864022918232707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17566888733546891730.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41182e+36,0.907593,41592,8911,20,56081,458,894,135397,49,843,0


Converting to forward existential form...Done !
original formula: AF((A((i25.u223.p936==1) U (i3.u31.p115==1)) * ((AF((A((i1.u10.p24==1) U (i16.u141.p584==1)) + AG(((i16.u145.p605==1)&&(i18.u159.p668==1)...238
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!((i3.u31.p115==1)) U (!((i25.u223.p936==1)) * !((i3.u31.p115==1)))) + EG(!((i3.u31.p115==1))...433
Reverse transition relation is NOT exact ! Due to transitions t6, t55, t104, t178, t277, t381, i1.t659, i2.t635, i3.t610, i4.t585, i5.t560, i6.t535, i7.t51...449
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 714/714 places, 971/971 transitions.
Graph (trivial) has 738 edges and 714 vertex of which 409 / 714 are part of one of the 26 SCC in 2 ms
Free SCC test removed 383 places
Ensure Unique test removed 424 transitions
Reduce isomorphic transitions removed 424 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 330 transition count 436
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 156 rules applied. Total rules applied 267 place count 220 transition count 390
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 24 rules applied. Total rules applied 291 place count 198 transition count 388
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 293 place count 196 transition count 388
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 293 place count 196 transition count 382
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 305 place count 190 transition count 382
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 331 place count 164 transition count 343
Iterating global reduction 4 with 26 rules applied. Total rules applied 357 place count 164 transition count 343
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 362 place count 164 transition count 338
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 5 with 110 rules applied. Total rules applied 472 place count 109 transition count 283
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 481 place count 100 transition count 234
Iterating global reduction 5 with 9 rules applied. Total rules applied 490 place count 100 transition count 234
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 498 place count 100 transition count 226
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 500 place count 98 transition count 224
Applied a total of 500 rules in 32 ms. Remains 98 /714 variables (removed 616) and now considering 224/971 (removed 747) transitions.
[2025-06-07 19:52:45] [INFO ] Flow matrix only has 120 transitions (discarded 104 similar events)
// Phase 1: matrix 120 rows 98 cols
[2025-06-07 19:52:45] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:52:45] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-07 19:52:45] [INFO ] Flow matrix only has 120 transitions (discarded 104 similar events)
[2025-06-07 19:52:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:52:45] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:52:45] [INFO ] Redundant transitions in 2 ms returned []
Running 148 sub problems to find dead transitions.
[2025-06-07 19:52:45] [INFO ] Flow matrix only has 120 transitions (discarded 104 similar events)
[2025-06-07 19:52:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 4/98 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 119/217 variables, 98/125 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/217 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/218 variables, and 125 constraints, problems are : Problem set: 0 solved, 148 unsolved in 3948 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 4/98 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 119/217 variables, 98/125 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 148/273 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 0/217 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/218 variables, and 273 constraints, problems are : Problem set: 0 solved, 148 unsolved in 4037 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7999ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 8000ms
Starting structural reductions in SI_CTL mode, iteration 1 : 98/714 places, 224/971 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8176 ms. Remains : 98/714 places, 224/971 transitions.
[2025-06-07 19:52:53] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:52:53] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:52:53] [INFO ] Input system was already deterministic with 224 transitions.
[2025-06-07 19:52:53] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:52:53] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:52:53] [INFO ] Time to serialize gal into /tmp/CTLFireability4187330227982085722.gal : 1 ms
[2025-06-07 19:52:53] [INFO ] Time to serialize properties into /tmp/CTLFireability3975412962534459796.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/CTLFireability4187330227982085722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3975412962534459796.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12495e+14,0.037805,5132,2,170,5,2235,6,0,593,1215,0


Converting to forward existential form...Done !
original formula: AF(EG(((((p806==0)||(p158==0)) + (((p568==1)&&(p656==1)) + (EF((p780==0)) * EF((p794==0))))) + ((p884==1) * AG(((p605==0)||(p705==0))))))...156
=> equivalent forward existential formula: [FwdG(Init,!(EG(((((p806==0)||(p158==0)) + (((p568==1)&&(p656==1)) + (E(TRUE U (p780==0)) * E(TRUE U (p794==0)))...225
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.149396,8332,1,0,17,25900,27,9,2864,16261,19
FORMULA Champagne-PT-H07T2O-CTLFireability-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-07 19:52:53] [INFO ] Flatten gal took : 15 ms
[2025-06-07 19:52:53] [INFO ] Flatten gal took : 14 ms
[2025-06-07 19:52:53] [INFO ] Applying decomposition
[2025-06-07 19:52:53] [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/graph4203418779691702027.txt' '-o' '/tmp/graph4203418779691702027.bin' '-w' '/tmp/graph4203418779691702027.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4203418779691702027.bin' '-l' '-1' '-v' '-w' '/tmp/graph4203418779691702027.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:52:53] [INFO ] Decomposing Gal with order
[2025-06-07 19:52:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:52:53] [INFO ] Removed a total of 536 redundant transitions.
[2025-06-07 19:52:53] [INFO ] Flatten gal took : 29 ms
[2025-06-07 19:52:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 4 ms.
[2025-06-07 19:52:53] [INFO ] Time to serialize gal into /tmp/CTLFireability9893759828474712183.gal : 6 ms
[2025-06-07 19:52:53] [INFO ] Time to serialize properties into /tmp/CTLFireability14083274077023652732.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/CTLFireability9893759828474712183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14083274077023652732.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 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.05243e+37,1.23296,49124,9816,21,75311,640,1303,153083,50,1456,0


Converting to forward existential form...Done !
original formula: ((!(E(!(AG(AX((i8.i0.i1.u81.p274==1)))) U ((EF(((i21.u217.p772==1)||(i0.u9.p25==1))) + (i11.u117.p399!=1)) * AX(A((i3.u43.p152==1) U (i19...375
=> equivalent forward existential formula: ([(FwdU((Init * !((!(E(!(!(E(TRUE U !(!(EX(!((i8.i0.i1.u81.p274==1)))))))) U ((E(TRUE U ((i21.u217.p772==1)||(i0...953
Reverse transition relation is NOT exact ! Due to transitions t27, t79, t133, t159, t216, t271, t352, t380, t465, t634, i0.t746, i0.t742, i1.t720, i2.i1.i0...900
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Detected timeout of ITS tools.
[2025-06-07 20:20:43] [INFO ] Applying decomposition
[2025-06-07 20:20:43] [INFO ] Flatten gal took : 20 ms
[2025-06-07 20:20:43] [INFO ] Decomposing Gal with order
[2025-06-07 20:20:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:20:43] [INFO ] Removed a total of 307 redundant transitions.
[2025-06-07 20:20:43] [INFO ] Flatten gal took : 21 ms
[2025-06-07 20:20:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 5 ms.
[2025-06-07 20:20:43] [INFO ] Time to serialize gal into /tmp/CTLFireability2352277200563398079.gal : 3 ms
[2025-06-07 20:20:43] [INFO ] Time to serialize properties into /tmp/CTLFireability6572390014591799103.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/CTLFireability2352277200563398079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6572390014591799103.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 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.05243e+37,0.238067,12412,641,802,10849,5766,657,25893,516,22671,0


Converting to forward existential form...Done !
original formula: ((!(E(!(AG(AX((i1.i0.i0.i0.i0.u19.p274==1)))) U ((EF(((i1.i1.i1.i1.i0.i0.u43.p772==1)||(i0.i0.i0.i0.i0.i0.u7.p25==1))) + (i1.i0.i0.u22.p3...496
=> equivalent forward existential formula: ([(FwdU((Init * !((!(E(!(!(E(TRUE U !(!(EX(!((i1.i0.i0.i0.i0.u19.p274==1)))))))) U ((E(TRUE U ((i1.i1.i1.i1.i0.i...1221
Reverse transition relation is NOT exact ! Due to transitions i0.u13.t579, i0.u13.t583, i0.i0.u12.t606, i0.i0.u12.t612, i0.i0.i0.t634, i0.i0.i0.u11.t638, i...1623

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="Champagne-PT-H07T2O"
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 Champagne-PT-H07T2O, 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 r254-tall-174931339200090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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