Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r136-tall-171631132800514.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is DiscoveryGPU-PT-15b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132800514
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 02:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 02:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 02:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 111K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-15b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716384298159

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-15b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 13:24:59] [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]
[2024-05-22 13:24:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:24:59] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-22 13:24:59] [INFO ] Transformed 436 places.
[2024-05-22 13:24:59] [INFO ] Transformed 464 transitions.
[2024-05-22 13:24:59] [INFO ] Found NUPN structural information;
[2024-05-22 13:24:59] [INFO ] Parsed PT model containing 436 places and 464 transitions and 1214 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 92 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 464/464 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 406 transition count 464
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 91 place count 345 transition count 403
Iterating global reduction 1 with 61 rules applied. Total rules applied 152 place count 345 transition count 403
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 163 place count 334 transition count 392
Iterating global reduction 1 with 11 rules applied. Total rules applied 174 place count 334 transition count 392
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 182 place count 326 transition count 384
Iterating global reduction 1 with 8 rules applied. Total rules applied 190 place count 326 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 196 place count 320 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 202 place count 320 transition count 378
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 205 place count 317 transition count 372
Iterating global reduction 1 with 3 rules applied. Total rules applied 208 place count 317 transition count 372
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 211 place count 314 transition count 369
Iterating global reduction 1 with 3 rules applied. Total rules applied 214 place count 314 transition count 369
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 215 place count 313 transition count 368
Iterating global reduction 1 with 1 rules applied. Total rules applied 216 place count 313 transition count 368
Applied a total of 216 rules in 157 ms. Remains 313 /436 variables (removed 123) and now considering 368/464 (removed 96) transitions.
// Phase 1: matrix 368 rows 313 cols
[2024-05-22 13:24:59] [INFO ] Computed 2 invariants in 20 ms
[2024-05-22 13:25:00] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-22 13:25:00] [INFO ] Invariant cache hit.
[2024-05-22 13:25:00] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2024-05-22 13:25:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/313 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (OVERLAPS) 368/681 variables, 313/315 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-22 13:25:09] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 22 ms to minimize.
[2024-05-22 13:25:09] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 3 ms to minimize.
[2024-05-22 13:25:09] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
[2024-05-22 13:25:09] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-22 13:25:09] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 3 ms to minimize.
[2024-05-22 13:25:09] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-22 13:25:09] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 3 ms to minimize.
[2024-05-22 13:25:09] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 3 ms to minimize.
[2024-05-22 13:25:10] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-22 13:25:10] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-22 13:25:10] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-22 13:25:10] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-22 13:25:10] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-22 13:25:10] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-22 13:25:10] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-22 13:25:10] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-22 13:25:10] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-22 13:25:10] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-05-22 13:25:10] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-22 13:25:11] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/681 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-22 13:25:11] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2024-05-22 13:25:11] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-22 13:25:11] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/681 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/681 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 0/681 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 367 unsolved
No progress, stopping.
After SMT solving in domain Real declared 681/681 variables, and 338 constraints, problems are : Problem set: 0 solved, 367 unsolved in 23428 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/313 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 368/681 variables, 313/338 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/681 variables, 367/705 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/681 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 0/681 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 367 unsolved
No progress, stopping.
After SMT solving in domain Int declared 681/681 variables, and 705 constraints, problems are : Problem set: 0 solved, 367 unsolved in 24543 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 23/23 constraints]
After SMT, in 48243ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 48265ms
Starting structural reductions in LTL mode, iteration 1 : 313/436 places, 368/464 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48982 ms. Remains : 313/436 places, 368/464 transitions.
Support contains 92 out of 313 places after structural reductions.
[2024-05-22 13:25:48] [INFO ] Flatten gal took : 50 ms
[2024-05-22 13:25:48] [INFO ] Flatten gal took : 22 ms
[2024-05-22 13:25:48] [INFO ] Input system was already deterministic with 368 transitions.
Support contains 91 out of 313 places (down from 92) after GAL structural reductions.
RANDOM walk for 40000 steps (80 resets) in 2215 ms. (18 steps per ms) remains 6/76 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 81 ms. (487 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (11 resets) in 85 ms. (465 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 194 ms. (205 steps per ms) remains 3/4 properties
[2024-05-22 13:25:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 130/145 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 5 (OVERLAPS) 439/584 variables, 214/231 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 0/231 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 87/671 variables, 74/305 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/671 variables, 0/305 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 9 (OVERLAPS) 10/681 variables, 10/315 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/681 variables, 0/315 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/681 variables, 0/315 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 681/681 variables, and 315 constraints, problems are : Problem set: 2 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/11 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/137 variables, 11/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 1/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 441/578 variables, 214/228 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 0/228 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 91/669 variables, 76/304 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/304 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/681 variables, 12/316 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-22 13:25:50] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-22 13:25:50] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
Problem AtomicPropp45 is UNSAT
After SMT solving in domain Int declared 681/681 variables, and 318 constraints, problems are : Problem set: 3 solved, 0 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 551ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-22 13:25:50] [INFO ] Flatten gal took : 16 ms
[2024-05-22 13:25:50] [INFO ] Flatten gal took : 17 ms
[2024-05-22 13:25:50] [INFO ] Input system was already deterministic with 368 transitions.
Computed a total of 52 stabilizing places and 52 stable transitions
Graph (complete) has 613 edges and 313 vertex of which 309 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 368/368 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 288 transition count 343
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 288 transition count 343
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 282 transition count 336
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 282 transition count 336
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 276 transition count 328
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 276 transition count 328
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 80 place count 270 transition count 319
Iterating global reduction 0 with 6 rules applied. Total rules applied 86 place count 270 transition count 319
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 265 transition count 314
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 265 transition count 314
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 262 transition count 311
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 262 transition count 311
Applied a total of 102 rules in 45 ms. Remains 262 /313 variables (removed 51) and now considering 311/368 (removed 57) transitions.
// Phase 1: matrix 311 rows 262 cols
[2024-05-22 13:25:50] [INFO ] Computed 2 invariants in 5 ms
[2024-05-22 13:25:50] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 13:25:50] [INFO ] Invariant cache hit.
[2024-05-22 13:25:50] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2024-05-22 13:25:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 311/573 variables, 262/264 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-22 13:25:57] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2024-05-22 13:25:57] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-22 13:25:57] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-22 13:25:57] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-05-22 13:25:57] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-22 13:25:57] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-22 13:25:57] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-22 13:25:57] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 3 ms to minimize.
[2024-05-22 13:25:57] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-22 13:25:57] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 5 ms to minimize.
[2024-05-22 13:25:58] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-22 13:25:58] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-22 13:25:58] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-22 13:25:58] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-05-22 13:25:58] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-22 13:25:58] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-22 13:25:58] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:25:58] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-22 13:25:58] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-22 13:25:58] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-22 13:25:58] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-22 13:25:59] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-22 13:25:59] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-22 13:25:59] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-22 13:25:59] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-22 13:25:59] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-22 13:25:59] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-22 13:25:59] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 8/292 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 0/573 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 292 constraints, problems are : Problem set: 0 solved, 310 unsolved in 17759 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 311/573 variables, 262/292 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 310/602 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 0/573 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Int declared 573/573 variables, and 602 constraints, problems are : Problem set: 0 solved, 310 unsolved in 19111 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 28/28 constraints]
After SMT, in 37003ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 37007ms
Starting structural reductions in LTL mode, iteration 1 : 262/313 places, 311/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37299 ms. Remains : 262/313 places, 311/368 transitions.
[2024-05-22 13:26:27] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:26:27] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:26:27] [INFO ] Input system was already deterministic with 311 transitions.
[2024-05-22 13:26:28] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:26:28] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:26:28] [INFO ] Time to serialize gal into /tmp/CTLFireability15783149729005427389.gal : 6 ms
[2024-05-22 13:26:28] [INFO ] Time to serialize properties into /tmp/CTLFireability9948715021762941347.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15783149729005427389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9948715021762941347.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-22 13:26:58] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:26:58] [INFO ] Applying decomposition
[2024-05-22 13:26:58] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11270535442941758710.txt' '-o' '/tmp/graph11270535442941758710.bin' '-w' '/tmp/graph11270535442941758710.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11270535442941758710.bin' '-l' '-1' '-v' '-w' '/tmp/graph11270535442941758710.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:26:58] [INFO ] Decomposing Gal with order
[2024-05-22 13:26:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:26:58] [INFO ] Removed a total of 122 redundant transitions.
[2024-05-22 13:26:58] [INFO ] Flatten gal took : 51 ms
[2024-05-22 13:26:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 7 ms.
[2024-05-22 13:26:58] [INFO ] Time to serialize gal into /tmp/CTLFireability7040377722766759880.gal : 6 ms
[2024-05-22 13:26:58] [INFO ] Time to serialize properties into /tmp/CTLFireability9266345252014731737.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7040377722766759880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9266345252014731737.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 368/368 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 285 transition count 338
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 285 transition count 338
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 67 place count 274 transition count 325
Iterating global reduction 0 with 11 rules applied. Total rules applied 78 place count 274 transition count 325
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 89 place count 263 transition count 312
Iterating global reduction 0 with 11 rules applied. Total rules applied 100 place count 263 transition count 312
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 109 place count 254 transition count 299
Iterating global reduction 0 with 9 rules applied. Total rules applied 118 place count 254 transition count 299
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 125 place count 247 transition count 291
Iterating global reduction 0 with 7 rules applied. Total rules applied 132 place count 247 transition count 291
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 136 place count 243 transition count 287
Iterating global reduction 0 with 4 rules applied. Total rules applied 140 place count 243 transition count 287
Applied a total of 140 rules in 32 ms. Remains 243 /313 variables (removed 70) and now considering 287/368 (removed 81) transitions.
// Phase 1: matrix 287 rows 243 cols
[2024-05-22 13:27:28] [INFO ] Computed 2 invariants in 7 ms
[2024-05-22 13:27:28] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-22 13:27:28] [INFO ] Invariant cache hit.
[2024-05-22 13:27:28] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-05-22 13:27:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (OVERLAPS) 287/530 variables, 243/245 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-22 13:27:34] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 5 ms to minimize.
[2024-05-22 13:27:34] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 6 ms to minimize.
[2024-05-22 13:27:34] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-05-22 13:27:34] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-22 13:27:34] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-22 13:27:34] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-22 13:27:34] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-22 13:27:34] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-22 13:27:34] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-22 13:27:34] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-22 13:27:34] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-22 13:27:34] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-22 13:27:34] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-22 13:27:35] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-22 13:27:35] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-22 13:27:35] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-22 13:27:35] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-22 13:27:35] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-22 13:27:35] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-22 13:27:35] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-22 13:27:35] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-22 13:27:35] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-22 13:27:35] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-22 13:27:35] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-22 13:27:36] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-22 13:27:36] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/530 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 271 constraints, problems are : Problem set: 0 solved, 286 unsolved in 15157 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/530 variables, 243/271 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 286/557 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/530 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/530 variables, and 557 constraints, problems are : Problem set: 0 solved, 286 unsolved in 15971 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 26/26 constraints]
After SMT, in 31240ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 31244ms
Starting structural reductions in LTL mode, iteration 1 : 243/313 places, 287/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31496 ms. Remains : 243/313 places, 287/368 transitions.
[2024-05-22 13:27:59] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:27:59] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:27:59] [INFO ] Input system was already deterministic with 287 transitions.
[2024-05-22 13:27:59] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:27:59] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:27:59] [INFO ] Time to serialize gal into /tmp/CTLFireability17007609403488308353.gal : 2 ms
[2024-05-22 13:27:59] [INFO ] Time to serialize properties into /tmp/CTLFireability16528419371256649641.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17007609403488308353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16528419371256649641.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-22 13:28:30] [INFO ] Flatten gal took : 20 ms
[2024-05-22 13:28:30] [INFO ] Applying decomposition
[2024-05-22 13:28:30] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4530137765600476552.txt' '-o' '/tmp/graph4530137765600476552.bin' '-w' '/tmp/graph4530137765600476552.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4530137765600476552.bin' '-l' '-1' '-v' '-w' '/tmp/graph4530137765600476552.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:28:30] [INFO ] Decomposing Gal with order
[2024-05-22 13:28:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:28:30] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-22 13:28:30] [INFO ] Flatten gal took : 45 ms
[2024-05-22 13:28:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 3 ms.
[2024-05-22 13:28:30] [INFO ] Time to serialize gal into /tmp/CTLFireability12375379337346173772.gal : 13 ms
[2024-05-22 13:28:30] [INFO ] Time to serialize properties into /tmp/CTLFireability11846316931049325711.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12375379337346173772.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11846316931049325711.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 368/368 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 294 transition count 347
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 294 transition count 347
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 286 transition count 337
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 286 transition count 337
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 278 transition count 328
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 278 transition count 328
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 273 transition count 322
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 273 transition count 322
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 270 transition count 318
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 270 transition count 318
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 268 transition count 316
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 268 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 267 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 267 transition count 315
Applied a total of 92 rules in 27 ms. Remains 267 /313 variables (removed 46) and now considering 315/368 (removed 53) transitions.
// Phase 1: matrix 315 rows 267 cols
[2024-05-22 13:29:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 13:29:00] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-22 13:29:00] [INFO ] Invariant cache hit.
[2024-05-22 13:29:00] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 314 sub problems to find dead transitions.
[2024-05-22 13:29:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (OVERLAPS) 315/582 variables, 267/269 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-05-22 13:29:07] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 3 ms to minimize.
[2024-05-22 13:29:07] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-05-22 13:29:07] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2024-05-22 13:29:07] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-22 13:29:07] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-22 13:29:07] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-05-22 13:29:08] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2024-05-22 13:29:08] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-22 13:29:08] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-22 13:29:08] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-22 13:29:08] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-22 13:29:08] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2024-05-22 13:29:08] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-22 13:29:08] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-05-22 13:29:08] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-22 13:29:08] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-05-22 13:29:09] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2024-05-22 13:29:09] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-22 13:29:09] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-22 13:29:09] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 20/289 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-05-22 13:29:09] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-22 13:29:09] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-22 13:29:09] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (OVERLAPS) 0/582 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 292 constraints, problems are : Problem set: 0 solved, 314 unsolved in 18593 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/582 variables, 267/292 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 314/606 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (OVERLAPS) 0/582 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 606 constraints, problems are : Problem set: 0 solved, 314 unsolved in 18984 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 23/23 constraints]
After SMT, in 37748ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 37752ms
Starting structural reductions in LTL mode, iteration 1 : 267/313 places, 315/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38083 ms. Remains : 267/313 places, 315/368 transitions.
[2024-05-22 13:29:38] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:29:38] [INFO ] Flatten gal took : 9 ms
[2024-05-22 13:29:38] [INFO ] Input system was already deterministic with 315 transitions.
[2024-05-22 13:29:38] [INFO ] Flatten gal took : 28 ms
[2024-05-22 13:29:38] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:29:38] [INFO ] Time to serialize gal into /tmp/CTLFireability7992353744137751431.gal : 18 ms
[2024-05-22 13:29:38] [INFO ] Time to serialize properties into /tmp/CTLFireability6420137026057736233.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7992353744137751431.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6420137026057736233.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-22 13:30:08] [INFO ] Flatten gal took : 18 ms
[2024-05-22 13:30:08] [INFO ] Applying decomposition
[2024-05-22 13:30:08] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1875994282300615577.txt' '-o' '/tmp/graph1875994282300615577.bin' '-w' '/tmp/graph1875994282300615577.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1875994282300615577.bin' '-l' '-1' '-v' '-w' '/tmp/graph1875994282300615577.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:30:08] [INFO ] Decomposing Gal with order
[2024-05-22 13:30:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:30:08] [INFO ] Removed a total of 124 redundant transitions.
[2024-05-22 13:30:08] [INFO ] Flatten gal took : 23 ms
[2024-05-22 13:30:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2024-05-22 13:30:08] [INFO ] Time to serialize gal into /tmp/CTLFireability7682956618879170931.gal : 19 ms
[2024-05-22 13:30:08] [INFO ] Time to serialize properties into /tmp/CTLFireability11317339416188638876.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7682956618879170931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11317339416188638876.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 368/368 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 284 transition count 337
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 284 transition count 337
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 273 transition count 324
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 273 transition count 324
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 91 place count 262 transition count 311
Iterating global reduction 0 with 11 rules applied. Total rules applied 102 place count 262 transition count 311
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 110 place count 254 transition count 300
Iterating global reduction 0 with 8 rules applied. Total rules applied 118 place count 254 transition count 300
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 124 place count 248 transition count 293
Iterating global reduction 0 with 6 rules applied. Total rules applied 130 place count 248 transition count 293
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 134 place count 244 transition count 289
Iterating global reduction 0 with 4 rules applied. Total rules applied 138 place count 244 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 139 place count 243 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 140 place count 243 transition count 288
Applied a total of 140 rules in 23 ms. Remains 243 /313 variables (removed 70) and now considering 288/368 (removed 80) transitions.
// Phase 1: matrix 288 rows 243 cols
[2024-05-22 13:30:38] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 13:30:38] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-22 13:30:38] [INFO ] Invariant cache hit.
[2024-05-22 13:30:39] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2024-05-22 13:30:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 288/531 variables, 243/245 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-05-22 13:30:44] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-22 13:30:44] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-22 13:30:44] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-22 13:30:44] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-22 13:30:44] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-05-22 13:30:44] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-22 13:30:45] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-22 13:30:45] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-22 13:30:45] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-22 13:30:45] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-22 13:30:45] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-22 13:30:45] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-22 13:30:45] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-22 13:30:45] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:30:45] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-22 13:30:45] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:30:45] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-22 13:30:45] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-22 13:30:45] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-22 13:30:46] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-05-22 13:30:46] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-22 13:30:46] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-22 13:30:46] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-22 13:30:46] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-22 13:30:46] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:30:46] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-22 13:30:46] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 13:30:46] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 8/273 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 273 constraints, problems are : Problem set: 0 solved, 287 unsolved in 15271 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 288/531 variables, 243/273 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 287/560 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 560 constraints, problems are : Problem set: 0 solved, 287 unsolved in 16552 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 28/28 constraints]
After SMT, in 31931ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 31939ms
Starting structural reductions in LTL mode, iteration 1 : 243/313 places, 288/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32199 ms. Remains : 243/313 places, 288/368 transitions.
[2024-05-22 13:31:11] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:31:11] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:31:11] [INFO ] Input system was already deterministic with 288 transitions.
[2024-05-22 13:31:11] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:31:11] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:31:11] [INFO ] Time to serialize gal into /tmp/CTLFireability11413407519628129459.gal : 1 ms
[2024-05-22 13:31:11] [INFO ] Time to serialize properties into /tmp/CTLFireability17844100982397147470.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11413407519628129459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17844100982397147470.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-22 13:31:41] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:31:41] [INFO ] Applying decomposition
[2024-05-22 13:31:41] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2619857861049418364.txt' '-o' '/tmp/graph2619857861049418364.bin' '-w' '/tmp/graph2619857861049418364.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2619857861049418364.bin' '-l' '-1' '-v' '-w' '/tmp/graph2619857861049418364.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:31:41] [INFO ] Decomposing Gal with order
[2024-05-22 13:31:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:31:41] [INFO ] Removed a total of 117 redundant transitions.
[2024-05-22 13:31:41] [INFO ] Flatten gal took : 26 ms
[2024-05-22 13:31:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 4 ms.
[2024-05-22 13:31:41] [INFO ] Time to serialize gal into /tmp/CTLFireability5635232209161038926.gal : 3 ms
[2024-05-22 13:31:41] [INFO ] Time to serialize properties into /tmp/CTLFireability8237891452373466779.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5635232209161038926.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8237891452373466779.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 313/313 places, 368/368 transitions.
Graph (complete) has 613 edges and 313 vertex of which 309 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 308 transition count 314
Reduce places removed 49 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 54 rules applied. Total rules applied 104 place count 259 transition count 309
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 109 place count 254 transition count 309
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 109 place count 254 transition count 271
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 185 place count 216 transition count 271
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 196 place count 205 transition count 258
Iterating global reduction 3 with 11 rules applied. Total rules applied 207 place count 205 transition count 258
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 215 place count 197 transition count 249
Iterating global reduction 3 with 8 rules applied. Total rules applied 223 place count 197 transition count 249
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 229 place count 191 transition count 240
Iterating global reduction 3 with 6 rules applied. Total rules applied 235 place count 191 transition count 240
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 240 place count 186 transition count 233
Iterating global reduction 3 with 5 rules applied. Total rules applied 245 place count 186 transition count 233
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 247 place count 184 transition count 231
Iterating global reduction 3 with 2 rules applied. Total rules applied 249 place count 184 transition count 231
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 293 place count 162 transition count 209
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 295 place count 160 transition count 206
Iterating global reduction 3 with 2 rules applied. Total rules applied 297 place count 160 transition count 206
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 299 place count 158 transition count 203
Iterating global reduction 3 with 2 rules applied. Total rules applied 301 place count 158 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 302 place count 157 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 303 place count 157 transition count 202
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 306 place count 157 transition count 202
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 308 place count 155 transition count 200
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 3 with 18 rules applied. Total rules applied 326 place count 154 transition count 183
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 21 rules applied. Total rules applied 347 place count 137 transition count 179
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 349 place count 135 transition count 179
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 349 place count 135 transition count 177
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 353 place count 133 transition count 177
Applied a total of 353 rules in 76 ms. Remains 133 /313 variables (removed 180) and now considering 177/368 (removed 191) transitions.
// Phase 1: matrix 177 rows 133 cols
[2024-05-22 13:32:11] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 13:32:11] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 13:32:11] [INFO ] Invariant cache hit.
[2024-05-22 13:32:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 13:32:11] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-22 13:32:11] [INFO ] Redundant transitions in 5 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-22 13:32:11] [INFO ] Invariant cache hit.
[2024-05-22 13:32:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 177/309 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 1/310 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/310 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 135 constraints, problems are : Problem set: 0 solved, 175 unsolved in 4776 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 177/309 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 175/309 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 1/310 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 310 constraints, problems are : Problem set: 0 solved, 175 unsolved in 6110 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
After SMT, in 10995ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 10997ms
Starting structural reductions in SI_CTL mode, iteration 1 : 133/313 places, 177/368 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11243 ms. Remains : 133/313 places, 177/368 transitions.
[2024-05-22 13:32:22] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:32:22] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:32:22] [INFO ] Input system was already deterministic with 177 transitions.
[2024-05-22 13:32:22] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:32:22] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:32:22] [INFO ] Time to serialize gal into /tmp/CTLFireability14144743668207804010.gal : 1 ms
[2024-05-22 13:32:22] [INFO ] Time to serialize properties into /tmp/CTLFireability13899464559838636581.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14144743668207804010.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13899464559838636581.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.14941e+15,5.78091,138820,2,16266,5,868289,6,0,688,508789,0


Converting to forward existential form...Done !
original formula: A(EG(!((((p412==1)||(p162==1)) * A(((p21==1)&&(p427==1)) U (p10==1))))) U EF((((EF((p215==1)) * E(((p42==1)||(p108==1)) U AG((p367==1))))...196
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (((E(TRUE U (p215==1)) * E(((p42==1)||(p108==1)) U !(E(TRUE U !((p367==1)))))) * ((p14...596
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t10, t12, t16, t21, t23, t27, t29, t33, t35, t39, t42, t46, t52, t58, t60, t64, t69, ...321
Detected timeout of ITS tools.
[2024-05-22 13:32:52] [INFO ] Flatten gal took : 12 ms
[2024-05-22 13:32:52] [INFO ] Applying decomposition
[2024-05-22 13:32:52] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18029096231622283565.txt' '-o' '/tmp/graph18029096231622283565.bin' '-w' '/tmp/graph18029096231622283565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18029096231622283565.bin' '-l' '-1' '-v' '-w' '/tmp/graph18029096231622283565.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:32:52] [INFO ] Decomposing Gal with order
[2024-05-22 13:32:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:32:52] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-22 13:32:52] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:32:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 3 ms.
[2024-05-22 13:32:52] [INFO ] Time to serialize gal into /tmp/CTLFireability618456178458107174.gal : 2 ms
[2024-05-22 13:32:52] [INFO ] Time to serialize properties into /tmp/CTLFireability17838399538061603920.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability618456178458107174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17838399538061603920.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 368/368 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 284 transition count 337
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 284 transition count 337
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 273 transition count 324
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 273 transition count 324
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 91 place count 262 transition count 311
Iterating global reduction 0 with 11 rules applied. Total rules applied 102 place count 262 transition count 311
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 253 transition count 298
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 253 transition count 298
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 127 place count 246 transition count 290
Iterating global reduction 0 with 7 rules applied. Total rules applied 134 place count 246 transition count 290
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 139 place count 241 transition count 285
Iterating global reduction 0 with 5 rules applied. Total rules applied 144 place count 241 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 145 place count 240 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 146 place count 240 transition count 284
Applied a total of 146 rules in 18 ms. Remains 240 /313 variables (removed 73) and now considering 284/368 (removed 84) transitions.
// Phase 1: matrix 284 rows 240 cols
[2024-05-22 13:33:22] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 13:33:22] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-22 13:33:22] [INFO ] Invariant cache hit.
[2024-05-22 13:33:23] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-22 13:33:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/524 variables, 240/242 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-22 13:33:28] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-05-22 13:33:28] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-22 13:33:28] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-22 13:33:28] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-22 13:33:28] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-22 13:33:28] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-22 13:33:28] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-22 13:33:28] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:33:28] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:33:29] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-22 13:33:29] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-22 13:33:29] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-22 13:33:29] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:33:29] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-22 13:33:29] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-05-22 13:33:29] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:33:29] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-05-22 13:33:29] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:33:29] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-22 13:33:29] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-22 13:33:29] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-22 13:33:30] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-22 13:33:30] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-22 13:33:30] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 266 constraints, problems are : Problem set: 0 solved, 283 unsolved in 14882 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/524 variables, 240/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 283/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 524/524 variables, and 549 constraints, problems are : Problem set: 0 solved, 283 unsolved in 16540 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 24/24 constraints]
After SMT, in 31551ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 31559ms
Starting structural reductions in LTL mode, iteration 1 : 240/313 places, 284/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31812 ms. Remains : 240/313 places, 284/368 transitions.
[2024-05-22 13:33:54] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:33:54] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:33:54] [INFO ] Input system was already deterministic with 284 transitions.
[2024-05-22 13:33:54] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:33:54] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:33:54] [INFO ] Time to serialize gal into /tmp/CTLFireability635200996349547340.gal : 2 ms
[2024-05-22 13:33:54] [INFO ] Time to serialize properties into /tmp/CTLFireability15698701765618416544.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability635200996349547340.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15698701765618416544.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-22 13:34:24] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:34:24] [INFO ] Applying decomposition
[2024-05-22 13:34:24] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10292080599737056892.txt' '-o' '/tmp/graph10292080599737056892.bin' '-w' '/tmp/graph10292080599737056892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10292080599737056892.bin' '-l' '-1' '-v' '-w' '/tmp/graph10292080599737056892.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:34:24] [INFO ] Decomposing Gal with order
[2024-05-22 13:34:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:34:24] [INFO ] Removed a total of 117 redundant transitions.
[2024-05-22 13:34:24] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:34:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 2 ms.
[2024-05-22 13:34:24] [INFO ] Time to serialize gal into /tmp/CTLFireability5680538459810911843.gal : 3 ms
[2024-05-22 13:34:24] [INFO ] Time to serialize properties into /tmp/CTLFireability14759781233149436161.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5680538459810911843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14759781233149436161.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 368/368 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 284 transition count 337
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 284 transition count 337
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 273 transition count 324
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 273 transition count 324
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 91 place count 262 transition count 311
Iterating global reduction 0 with 11 rules applied. Total rules applied 102 place count 262 transition count 311
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 253 transition count 298
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 253 transition count 298
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 126 place count 247 transition count 291
Iterating global reduction 0 with 6 rules applied. Total rules applied 132 place count 247 transition count 291
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 136 place count 243 transition count 287
Iterating global reduction 0 with 4 rules applied. Total rules applied 140 place count 243 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 242 transition count 286
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 242 transition count 286
Applied a total of 142 rules in 18 ms. Remains 242 /313 variables (removed 71) and now considering 286/368 (removed 82) transitions.
// Phase 1: matrix 286 rows 242 cols
[2024-05-22 13:34:54] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 13:34:54] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-22 13:34:54] [INFO ] Invariant cache hit.
[2024-05-22 13:34:55] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2024-05-22 13:34:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/242 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 286/528 variables, 242/244 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-22 13:35:00] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-05-22 13:35:00] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:35:00] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:35:00] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-22 13:35:00] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-22 13:35:00] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-22 13:35:00] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-22 13:35:00] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-22 13:35:01] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-22 13:35:01] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:35:01] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:35:01] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-22 13:35:01] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 ms to minimize.
[2024-05-22 13:35:01] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-22 13:35:01] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:35:01] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-22 13:35:01] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:35:01] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:35:01] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:35:01] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-22 13:35:01] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-22 13:35:02] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-22 13:35:02] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:35:02] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-22 13:35:02] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 5/269 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 0/528 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 269 constraints, problems are : Problem set: 0 solved, 285 unsolved in 14928 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/242 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/528 variables, 242/269 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 285/554 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 0/528 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 554 constraints, problems are : Problem set: 0 solved, 285 unsolved in 16317 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 25/25 constraints]
After SMT, in 31363ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 31367ms
Starting structural reductions in LTL mode, iteration 1 : 242/313 places, 286/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31628 ms. Remains : 242/313 places, 286/368 transitions.
[2024-05-22 13:35:26] [INFO ] Flatten gal took : 9 ms
[2024-05-22 13:35:26] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:35:26] [INFO ] Input system was already deterministic with 286 transitions.
[2024-05-22 13:35:26] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:35:26] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:35:26] [INFO ] Time to serialize gal into /tmp/CTLFireability6864209074289592415.gal : 2 ms
[2024-05-22 13:35:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17203783287015947984.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6864209074289592415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17203783287015947984.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-22 13:35:56] [INFO ] Flatten gal took : 9 ms
[2024-05-22 13:35:56] [INFO ] Applying decomposition
[2024-05-22 13:35:56] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10211488719146881245.txt' '-o' '/tmp/graph10211488719146881245.bin' '-w' '/tmp/graph10211488719146881245.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10211488719146881245.bin' '-l' '-1' '-v' '-w' '/tmp/graph10211488719146881245.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:35:56] [INFO ] Decomposing Gal with order
[2024-05-22 13:35:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:35:56] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-22 13:35:56] [INFO ] Flatten gal took : 35 ms
[2024-05-22 13:35:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 2 ms.
[2024-05-22 13:35:56] [INFO ] Time to serialize gal into /tmp/CTLFireability3540629761451869924.gal : 4 ms
[2024-05-22 13:35:56] [INFO ] Time to serialize properties into /tmp/CTLFireability2117733852908276471.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3540629761451869924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2117733852908276471.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 368/368 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 284 transition count 337
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 284 transition count 337
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 273 transition count 324
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 273 transition count 324
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 90 place count 263 transition count 312
Iterating global reduction 0 with 10 rules applied. Total rules applied 100 place count 263 transition count 312
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 108 place count 255 transition count 301
Iterating global reduction 0 with 8 rules applied. Total rules applied 116 place count 255 transition count 301
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 122 place count 249 transition count 294
Iterating global reduction 0 with 6 rules applied. Total rules applied 128 place count 249 transition count 294
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 132 place count 245 transition count 290
Iterating global reduction 0 with 4 rules applied. Total rules applied 136 place count 245 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 137 place count 244 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 138 place count 244 transition count 289
Applied a total of 138 rules in 22 ms. Remains 244 /313 variables (removed 69) and now considering 289/368 (removed 79) transitions.
// Phase 1: matrix 289 rows 244 cols
[2024-05-22 13:36:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 13:36:26] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 13:36:26] [INFO ] Invariant cache hit.
[2024-05-22 13:36:27] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2024-05-22 13:36:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 289/533 variables, 244/246 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 13:36:32] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-22 13:36:32] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-22 13:36:32] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-22 13:36:32] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:36:32] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-22 13:36:32] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-22 13:36:32] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-22 13:36:33] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-22 13:36:33] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-22 13:36:33] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:36:33] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-22 13:36:33] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:36:33] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-22 13:36:33] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-05-22 13:36:33] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-22 13:36:33] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:36:33] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-22 13:36:33] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-22 13:36:33] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-22 13:36:33] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 13:36:34] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-22 13:36:34] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:36:34] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-22 13:36:34] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-22 13:36:34] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-22 13:36:34] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-22 13:36:34] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:36:34] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-22 13:36:34] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 9/275 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 0/533 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 533/533 variables, and 275 constraints, problems are : Problem set: 0 solved, 288 unsolved in 15417 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/533 variables, 244/275 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 288/563 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 0/533 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Int declared 533/533 variables, and 563 constraints, problems are : Problem set: 0 solved, 288 unsolved in 16696 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 29/29 constraints]
After SMT, in 32234ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 32236ms
Starting structural reductions in LTL mode, iteration 1 : 244/313 places, 289/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32521 ms. Remains : 244/313 places, 289/368 transitions.
[2024-05-22 13:36:59] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:36:59] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:36:59] [INFO ] Input system was already deterministic with 289 transitions.
[2024-05-22 13:36:59] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:36:59] [INFO ] Flatten gal took : 18 ms
[2024-05-22 13:36:59] [INFO ] Time to serialize gal into /tmp/CTLFireability13760578520205803731.gal : 17 ms
[2024-05-22 13:36:59] [INFO ] Time to serialize properties into /tmp/CTLFireability6113209093774357580.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13760578520205803731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6113209093774357580.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-22 13:37:29] [INFO ] Flatten gal took : 9 ms
[2024-05-22 13:37:29] [INFO ] Applying decomposition
[2024-05-22 13:37:29] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11704059814752883330.txt' '-o' '/tmp/graph11704059814752883330.bin' '-w' '/tmp/graph11704059814752883330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11704059814752883330.bin' '-l' '-1' '-v' '-w' '/tmp/graph11704059814752883330.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:37:29] [INFO ] Decomposing Gal with order
[2024-05-22 13:37:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:37:29] [INFO ] Removed a total of 119 redundant transitions.
[2024-05-22 13:37:29] [INFO ] Flatten gal took : 39 ms
[2024-05-22 13:37:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 2 ms.
[2024-05-22 13:37:29] [INFO ] Time to serialize gal into /tmp/CTLFireability15317218145407548994.gal : 3 ms
[2024-05-22 13:37:29] [INFO ] Time to serialize properties into /tmp/CTLFireability5776035702428047972.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15317218145407548994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5776035702428047972.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 368/368 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 284 transition count 337
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 284 transition count 337
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 68 place count 274 transition count 326
Iterating global reduction 0 with 10 rules applied. Total rules applied 78 place count 274 transition count 326
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 88 place count 264 transition count 314
Iterating global reduction 0 with 10 rules applied. Total rules applied 98 place count 264 transition count 314
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 106 place count 256 transition count 302
Iterating global reduction 0 with 8 rules applied. Total rules applied 114 place count 256 transition count 302
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 121 place count 249 transition count 294
Iterating global reduction 0 with 7 rules applied. Total rules applied 128 place count 249 transition count 294
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 133 place count 244 transition count 289
Iterating global reduction 0 with 5 rules applied. Total rules applied 138 place count 244 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 139 place count 243 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 140 place count 243 transition count 288
Applied a total of 140 rules in 47 ms. Remains 243 /313 variables (removed 70) and now considering 288/368 (removed 80) transitions.
// Phase 1: matrix 288 rows 243 cols
[2024-05-22 13:37:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 13:37:59] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-22 13:37:59] [INFO ] Invariant cache hit.
[2024-05-22 13:38:00] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2024-05-22 13:38:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 288/531 variables, 243/245 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-05-22 13:38:05] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2024-05-22 13:38:05] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-22 13:38:05] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-22 13:38:05] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 2 ms to minimize.
[2024-05-22 13:38:05] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-05-22 13:38:05] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-22 13:38:05] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-22 13:38:05] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-05-22 13:38:06] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-22 13:38:06] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-22 13:38:06] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2024-05-22 13:38:06] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:38:06] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-22 13:38:06] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-22 13:38:06] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-05-22 13:38:06] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-22 13:38:06] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-22 13:38:06] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-22 13:38:06] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-22 13:38:06] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-05-22 13:38:07] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-22 13:38:07] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 3 ms to minimize.
[2024-05-22 13:38:07] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-22 13:38:07] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-05-22 13:38:07] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-22 13:38:07] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-22 13:38:07] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-22 13:38:07] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-22 13:38:07] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 9/274 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 274 constraints, problems are : Problem set: 0 solved, 287 unsolved in 15582 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 288/531 variables, 243/274 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 287/561 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 287 unsolved in 16241 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 29/29 constraints]
After SMT, in 31937ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 31941ms
Starting structural reductions in LTL mode, iteration 1 : 243/313 places, 288/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32335 ms. Remains : 243/313 places, 288/368 transitions.
[2024-05-22 13:38:32] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:38:32] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:38:32] [INFO ] Input system was already deterministic with 288 transitions.
[2024-05-22 13:38:32] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:38:32] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:38:32] [INFO ] Time to serialize gal into /tmp/CTLFireability13863253846301159516.gal : 3 ms
[2024-05-22 13:38:32] [INFO ] Time to serialize properties into /tmp/CTLFireability17731213148461459805.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13863253846301159516.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17731213148461459805.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-22 13:39:02] [INFO ] Flatten gal took : 10 ms
[2024-05-22 13:39:02] [INFO ] Applying decomposition
[2024-05-22 13:39:02] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10900914811684584672.txt' '-o' '/tmp/graph10900914811684584672.bin' '-w' '/tmp/graph10900914811684584672.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10900914811684584672.bin' '-l' '-1' '-v' '-w' '/tmp/graph10900914811684584672.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:39:02] [INFO ] Decomposing Gal with order
[2024-05-22 13:39:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:39:02] [INFO ] Removed a total of 117 redundant transitions.
[2024-05-22 13:39:02] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:39:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 18 ms.
[2024-05-22 13:39:02] [INFO ] Time to serialize gal into /tmp/CTLFireability2119344704016890820.gal : 3 ms
[2024-05-22 13:39:02] [INFO ] Time to serialize properties into /tmp/CTLFireability9790095056687937978.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2119344704016890820.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9790095056687937978.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 313/313 places, 368/368 transitions.
Graph (complete) has 613 edges and 313 vertex of which 310 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 309 transition count 311
Reduce places removed 53 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 55 rules applied. Total rules applied 109 place count 256 transition count 309
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 111 place count 254 transition count 309
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 111 place count 254 transition count 271
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 187 place count 216 transition count 271
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 197 place count 206 transition count 259
Iterating global reduction 3 with 10 rules applied. Total rules applied 207 place count 206 transition count 259
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 215 place count 198 transition count 250
Iterating global reduction 3 with 8 rules applied. Total rules applied 223 place count 198 transition count 250
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 228 place count 193 transition count 243
Iterating global reduction 3 with 5 rules applied. Total rules applied 233 place count 193 transition count 243
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 236 place count 190 transition count 239
Iterating global reduction 3 with 3 rules applied. Total rules applied 239 place count 190 transition count 239
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 240 place count 189 transition count 238
Iterating global reduction 3 with 1 rules applied. Total rules applied 241 place count 189 transition count 238
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 287 place count 166 transition count 215
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 289 place count 164 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 291 place count 164 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 293 place count 162 transition count 209
Iterating global reduction 3 with 2 rules applied. Total rules applied 295 place count 162 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 296 place count 161 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 297 place count 161 transition count 208
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 300 place count 161 transition count 208
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 302 place count 159 transition count 206
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 240 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Graph (trivial) has 144 edges and 157 vertex of which 56 / 157 are part of one of the 28 SCC in 3 ms
Free SCC test removed 28 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 3 with 17 rules applied. Total rules applied 319 place count 129 transition count 191
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 43 rules applied. Total rules applied 362 place count 115 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 363 place count 114 transition count 162
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 15 Pre rules applied. Total rules applied 363 place count 114 transition count 147
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 393 place count 99 transition count 147
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 402 place count 90 transition count 129
Iterating global reduction 6 with 9 rules applied. Total rules applied 411 place count 90 transition count 129
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 419 place count 82 transition count 113
Iterating global reduction 6 with 8 rules applied. Total rules applied 427 place count 82 transition count 113
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 435 place count 74 transition count 105
Iterating global reduction 6 with 8 rules applied. Total rules applied 443 place count 74 transition count 105
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 451 place count 66 transition count 89
Iterating global reduction 6 with 8 rules applied. Total rules applied 459 place count 66 transition count 89
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 467 place count 58 transition count 81
Iterating global reduction 6 with 8 rules applied. Total rules applied 475 place count 58 transition count 81
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 481 place count 55 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 483 place count 54 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 485 place count 52 transition count 75
Applied a total of 485 rules in 125 ms. Remains 52 /313 variables (removed 261) and now considering 75/368 (removed 293) transitions.
[2024-05-22 13:39:32] [INFO ] Flow matrix only has 65 transitions (discarded 10 similar events)
// Phase 1: matrix 65 rows 52 cols
[2024-05-22 13:39:32] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 13:39:32] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 13:39:32] [INFO ] Flow matrix only has 65 transitions (discarded 10 similar events)
[2024-05-22 13:39:32] [INFO ] Invariant cache hit.
[2024-05-22 13:39:32] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-22 13:39:32] [INFO ] Redundant transitions in 1 ms returned []
Running 67 sub problems to find dead transitions.
[2024-05-22 13:39:32] [INFO ] Flow matrix only has 65 transitions (discarded 10 similar events)
[2024-05-22 13:39:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 64/112 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 4/116 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/117 variables, and 53 constraints, problems are : Problem set: 0 solved, 67 unsolved in 816 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 64/112 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 58/107 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 4/116 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/116 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/117 variables, and 120 constraints, problems are : Problem set: 0 solved, 67 unsolved in 918 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 1779ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 1780ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/313 places, 75/368 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1993 ms. Remains : 52/313 places, 75/368 transitions.
[2024-05-22 13:39:34] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:39:34] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:39:34] [INFO ] Input system was already deterministic with 75 transitions.
[2024-05-22 13:39:34] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:39:34] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:39:34] [INFO ] Time to serialize gal into /tmp/CTLFireability4861471183483682999.gal : 1 ms
[2024-05-22 13:39:34] [INFO ] Time to serialize properties into /tmp/CTLFireability6990570592144052461.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4861471183483682999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6990570592144052461.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.07284e+09,1.70272,56000,2,8784,5,206689,6,0,262,346184,0


Converting to forward existential form...Done !
original formula: (!(A(!((A((p380==1) U (p96==1)) * AF((p9==1)))) U ((EF((p314==1)) * ((p153==1)||((p104==1)&&(p434==1)))) * ((p324==1)&&(p189==1))))) + AF...196
=> equivalent forward existential formula: [FwdG((Init * !(!(!((E(!(((E(TRUE U (p314==1)) * ((p153==1)||((p104==1)&&(p434==1)))) * ((p324==1)&&(p189==1))))...526
Reverse transition relation is NOT exact ! Due to transitions t2, t10, t15, t16, t20, t32, t34, t48, t49, t52, t54, t55, t59, t60, t61, t62, t64, t66, t68,...259
Detected timeout of ITS tools.
[2024-05-22 13:40:04] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:40:04] [INFO ] Applying decomposition
[2024-05-22 13:40:04] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16585686167292588261.txt' '-o' '/tmp/graph16585686167292588261.bin' '-w' '/tmp/graph16585686167292588261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16585686167292588261.bin' '-l' '-1' '-v' '-w' '/tmp/graph16585686167292588261.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:40:04] [INFO ] Decomposing Gal with order
[2024-05-22 13:40:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:40:04] [INFO ] Removed a total of 22 redundant transitions.
[2024-05-22 13:40:04] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:40:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-22 13:40:04] [INFO ] Time to serialize gal into /tmp/CTLFireability6353092769958452018.gal : 0 ms
[2024-05-22 13:40:04] [INFO ] Time to serialize properties into /tmp/CTLFireability3120006406267703510.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6353092769958452018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3120006406267703510.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,6.07284e+09,4.86303,132344,1542,217,219981,67678,184,818089,44,272431,0


Converting to forward existential form...Done !
original formula: (!(A(!((A((i6.u18.p380==1) U (u10.p96==1)) * AF((i2.u0.p9==1)))) U ((EF((i5.u16.p314==1)) * ((i4.u11.p153==1)||((i3.u8.p104==1)&&(i8.u20....266
=> equivalent forward existential formula: [FwdG((Init * !(!(!((E(!(((E(TRUE U (i5.u16.p314==1)) * ((i4.u11.p153==1)||((i3.u8.p104==1)&&(i8.u20.p434==1))))...686
Reverse transition relation is NOT exact ! Due to transitions t49, t54, t55, i0.u2.t20, i0.u3.t59, i3.u7.t32, i3.u9.t62, i4.u11.t10, i4.u12.t64, i5.u16.t68...357
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 368/368 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 284 transition count 337
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 284 transition count 337
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 273 transition count 324
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 273 transition count 324
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 91 place count 262 transition count 311
Iterating global reduction 0 with 11 rules applied. Total rules applied 102 place count 262 transition count 311
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 253 transition count 298
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 253 transition count 298
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 127 place count 246 transition count 290
Iterating global reduction 0 with 7 rules applied. Total rules applied 134 place count 246 transition count 290
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 139 place count 241 transition count 285
Iterating global reduction 0 with 5 rules applied. Total rules applied 144 place count 241 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 145 place count 240 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 146 place count 240 transition count 284
Applied a total of 146 rules in 16 ms. Remains 240 /313 variables (removed 73) and now considering 284/368 (removed 84) transitions.
// Phase 1: matrix 284 rows 240 cols
[2024-05-22 13:40:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 13:40:34] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 13:40:34] [INFO ] Invariant cache hit.
[2024-05-22 13:40:34] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-22 13:40:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/524 variables, 240/242 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-22 13:40:39] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-22 13:40:40] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-22 13:40:40] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2024-05-22 13:40:40] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-22 13:40:40] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-22 13:40:40] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-22 13:40:40] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:40:40] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-22 13:40:40] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-22 13:40:40] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-22 13:40:40] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 3 ms to minimize.
[2024-05-22 13:40:41] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-22 13:40:41] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-22 13:40:41] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-05-22 13:40:41] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-22 13:40:41] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-22 13:40:41] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-22 13:40:41] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-22 13:40:41] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 4 ms to minimize.
[2024-05-22 13:40:41] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-22 13:40:41] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-22 13:40:42] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-22 13:40:42] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-05-22 13:40:42] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 266 constraints, problems are : Problem set: 0 solved, 283 unsolved in 15024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/524 variables, 240/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 283/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 524/524 variables, and 549 constraints, problems are : Problem set: 0 solved, 283 unsolved in 16242 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 24/24 constraints]
After SMT, in 31389ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 31393ms
Starting structural reductions in LTL mode, iteration 1 : 240/313 places, 284/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31660 ms. Remains : 240/313 places, 284/368 transitions.
[2024-05-22 13:41:06] [INFO ] Flatten gal took : 9 ms
[2024-05-22 13:41:06] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:41:06] [INFO ] Input system was already deterministic with 284 transitions.
[2024-05-22 13:41:06] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:41:06] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:41:06] [INFO ] Time to serialize gal into /tmp/CTLFireability9070391229561032939.gal : 2 ms
[2024-05-22 13:41:06] [INFO ] Time to serialize properties into /tmp/CTLFireability11509022270322938282.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9070391229561032939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11509022270322938282.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-22 13:41:36] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:41:36] [INFO ] Applying decomposition
[2024-05-22 13:41:36] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17046429860016243958.txt' '-o' '/tmp/graph17046429860016243958.bin' '-w' '/tmp/graph17046429860016243958.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17046429860016243958.bin' '-l' '-1' '-v' '-w' '/tmp/graph17046429860016243958.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:41:36] [INFO ] Decomposing Gal with order
[2024-05-22 13:41:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:41:36] [INFO ] Removed a total of 117 redundant transitions.
[2024-05-22 13:41:36] [INFO ] Flatten gal took : 12 ms
[2024-05-22 13:41:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 3 ms.
[2024-05-22 13:41:36] [INFO ] Time to serialize gal into /tmp/CTLFireability5399945455071001673.gal : 2 ms
[2024-05-22 13:41:36] [INFO ] Time to serialize properties into /tmp/CTLFireability10920536537712765327.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5399945455071001673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10920536537712765327.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 313/313 places, 368/368 transitions.
Graph (complete) has 613 edges and 313 vertex of which 309 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 308 transition count 309
Reduce places removed 54 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 56 rules applied. Total rules applied 111 place count 254 transition count 307
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 252 transition count 307
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 113 place count 252 transition count 268
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 191 place count 213 transition count 268
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 202 place count 202 transition count 255
Iterating global reduction 3 with 11 rules applied. Total rules applied 213 place count 202 transition count 255
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 221 place count 194 transition count 247
Iterating global reduction 3 with 8 rules applied. Total rules applied 229 place count 194 transition count 247
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 235 place count 188 transition count 238
Iterating global reduction 3 with 6 rules applied. Total rules applied 241 place count 188 transition count 238
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 245 place count 184 transition count 232
Iterating global reduction 3 with 4 rules applied. Total rules applied 249 place count 184 transition count 232
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 251 place count 182 transition count 230
Iterating global reduction 3 with 2 rules applied. Total rules applied 253 place count 182 transition count 230
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 305 place count 156 transition count 204
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 307 place count 154 transition count 201
Iterating global reduction 3 with 2 rules applied. Total rules applied 309 place count 154 transition count 201
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 311 place count 152 transition count 198
Iterating global reduction 3 with 2 rules applied. Total rules applied 313 place count 152 transition count 198
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 314 place count 151 transition count 197
Iterating global reduction 3 with 1 rules applied. Total rules applied 315 place count 151 transition count 197
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 316 place count 151 transition count 197
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 318 place count 149 transition count 195
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 220 edges and 148 vertex of which 147 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Graph (trivial) has 146 edges and 147 vertex of which 58 / 147 are part of one of the 29 SCC in 1 ms
Free SCC test removed 29 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 3 with 17 rules applied. Total rules applied 335 place count 118 transition count 180
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 44 rules applied. Total rules applied 379 place count 104 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 380 place count 103 transition count 150
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 380 place count 103 transition count 136
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 408 place count 89 transition count 136
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 418 place count 79 transition count 116
Iterating global reduction 6 with 10 rules applied. Total rules applied 428 place count 79 transition count 116
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 437 place count 70 transition count 98
Iterating global reduction 6 with 9 rules applied. Total rules applied 446 place count 70 transition count 98
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 455 place count 61 transition count 89
Iterating global reduction 6 with 9 rules applied. Total rules applied 464 place count 61 transition count 89
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 473 place count 52 transition count 71
Iterating global reduction 6 with 9 rules applied. Total rules applied 482 place count 52 transition count 71
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 491 place count 43 transition count 62
Iterating global reduction 6 with 9 rules applied. Total rules applied 500 place count 43 transition count 62
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 506 place count 37 transition count 56
Applied a total of 506 rules in 108 ms. Remains 37 /313 variables (removed 276) and now considering 56/368 (removed 312) transitions.
[2024-05-22 13:42:06] [INFO ] Flow matrix only has 47 transitions (discarded 9 similar events)
// Phase 1: matrix 47 rows 37 cols
[2024-05-22 13:42:06] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 13:42:06] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-22 13:42:06] [INFO ] Flow matrix only has 47 transitions (discarded 9 similar events)
[2024-05-22 13:42:06] [INFO ] Invariant cache hit.
[2024-05-22 13:42:06] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-22 13:42:06] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2024-05-22 13:42:06] [INFO ] Flow matrix only has 47 transitions (discarded 9 similar events)
[2024-05-22 13:42:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 46/77 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 6/83 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/83 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/84 variables, and 38 constraints, problems are : Problem set: 0 solved, 43 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 46/77 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 43/75 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 6/83 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/83 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/84 variables, and 81 constraints, problems are : Problem set: 0 solved, 43 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 900ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 901ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/313 places, 56/368 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1161 ms. Remains : 37/313 places, 56/368 transitions.
[2024-05-22 13:42:07] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:42:07] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:42:07] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-22 13:42:07] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:42:07] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:42:07] [INFO ] Time to serialize gal into /tmp/CTLFireability13651597994980588160.gal : 1 ms
[2024-05-22 13:42:07] [INFO ] Time to serialize properties into /tmp/CTLFireability6676853411539642399.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13651597994980588160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6676853411539642399.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.7419e+08,0.189878,10036,2,867,5,33654,6,0,182,42978,0


Converting to forward existential form...Done !
original formula: EG(EF((((!(A((p115==1) U (p261==1))) + EG((p186==0))) + ((p295==0)||(p434==0))) + (p54==0))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((!(!((E(!((p261==1)) U (!((p115==1)) * !((p261==1)))) + EG(!((p261==1)))))) + EG((p186==0)...207
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t16, t17, t18, t20, t23, t29, t41, t43, t44, t45, t46, t47, t48, t50, t52, t54,...254
(forward)formula 0,1,5.86315,162936,1,0,1660,758935,143,763,1292,1.34079e+06,1835
FORMULA DiscoveryGPU-PT-15b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 313/313 places, 368/368 transitions.
Graph (complete) has 613 edges and 313 vertex of which 309 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 308 transition count 307
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 252 transition count 307
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 113 place count 252 transition count 269
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 189 place count 214 transition count 269
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 200 place count 203 transition count 256
Iterating global reduction 2 with 11 rules applied. Total rules applied 211 place count 203 transition count 256
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 220 place count 194 transition count 246
Iterating global reduction 2 with 9 rules applied. Total rules applied 229 place count 194 transition count 246
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 235 place count 188 transition count 238
Iterating global reduction 2 with 6 rules applied. Total rules applied 241 place count 188 transition count 238
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 246 place count 183 transition count 230
Iterating global reduction 2 with 5 rules applied. Total rules applied 251 place count 183 transition count 230
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 254 place count 180 transition count 227
Iterating global reduction 2 with 3 rules applied. Total rules applied 257 place count 180 transition count 227
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 309 place count 154 transition count 201
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 311 place count 152 transition count 198
Iterating global reduction 2 with 2 rules applied. Total rules applied 313 place count 152 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 315 place count 150 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 317 place count 150 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 318 place count 149 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 319 place count 149 transition count 194
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 321 place count 149 transition count 194
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 323 place count 147 transition count 192
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 2 with 16 rules applied. Total rules applied 339 place count 146 transition count 177
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 354 place count 131 transition count 177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 354 place count 131 transition count 176
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 356 place count 130 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 358 place count 129 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 359 place count 129 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 361 place count 128 transition count 173
Applied a total of 361 rules in 76 ms. Remains 128 /313 variables (removed 185) and now considering 173/368 (removed 195) transitions.
// Phase 1: matrix 173 rows 128 cols
[2024-05-22 13:42:13] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 13:42:13] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-22 13:42:13] [INFO ] Invariant cache hit.
[2024-05-22 13:42:13] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-22 13:42:13] [INFO ] Redundant transitions in 4 ms returned []
Running 172 sub problems to find dead transitions.
[2024-05-22 13:42:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 173/301 variables, 128/129 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 0/301 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 129 constraints, problems are : Problem set: 0 solved, 172 unsolved in 3138 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 173/301 variables, 128/129 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 172/301 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 0/301 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 301 constraints, problems are : Problem set: 0 solved, 172 unsolved in 4001 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints]
After SMT, in 7241ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 7242ms
Starting structural reductions in SI_CTL mode, iteration 1 : 128/313 places, 173/368 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7526 ms. Remains : 128/313 places, 173/368 transitions.
[2024-05-22 13:42:20] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:42:20] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:42:20] [INFO ] Input system was already deterministic with 173 transitions.
[2024-05-22 13:42:20] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:42:20] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:42:20] [INFO ] Time to serialize gal into /tmp/CTLFireability4566185738868093095.gal : 2 ms
[2024-05-22 13:42:20] [INFO ] Time to serialize properties into /tmp/CTLFireability12777064679617912226.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4566185738868093095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12777064679617912226.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 13:42:50] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:42:50] [INFO ] Applying decomposition
[2024-05-22 13:42:50] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14683908139082944310.txt' '-o' '/tmp/graph14683908139082944310.bin' '-w' '/tmp/graph14683908139082944310.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14683908139082944310.bin' '-l' '-1' '-v' '-w' '/tmp/graph14683908139082944310.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:42:51] [INFO ] Decomposing Gal with order
[2024-05-22 13:42:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:42:51] [INFO ] Removed a total of 89 redundant transitions.
[2024-05-22 13:42:51] [INFO ] Flatten gal took : 18 ms
[2024-05-22 13:42:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 2 ms.
[2024-05-22 13:42:51] [INFO ] Time to serialize gal into /tmp/CTLFireability3590202801977650523.gal : 2 ms
[2024-05-22 13:42:51] [INFO ] Time to serialize properties into /tmp/CTLFireability9272985001187680140.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3590202801977650523.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9272985001187680140.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 368/368 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 284 transition count 337
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 284 transition count 337
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 273 transition count 324
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 273 transition count 324
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 91 place count 262 transition count 311
Iterating global reduction 0 with 11 rules applied. Total rules applied 102 place count 262 transition count 311
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 253 transition count 298
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 253 transition count 298
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 127 place count 246 transition count 290
Iterating global reduction 0 with 7 rules applied. Total rules applied 134 place count 246 transition count 290
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 139 place count 241 transition count 285
Iterating global reduction 0 with 5 rules applied. Total rules applied 144 place count 241 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 145 place count 240 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 146 place count 240 transition count 284
Applied a total of 146 rules in 13 ms. Remains 240 /313 variables (removed 73) and now considering 284/368 (removed 84) transitions.
// Phase 1: matrix 284 rows 240 cols
[2024-05-22 13:43:21] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 13:43:21] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-22 13:43:21] [INFO ] Invariant cache hit.
[2024-05-22 13:43:21] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-22 13:43:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/524 variables, 240/242 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-22 13:43:26] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-05-22 13:43:26] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-22 13:43:26] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2024-05-22 13:43:26] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-05-22 13:43:26] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-22 13:43:27] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-22 13:43:27] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-22 13:43:27] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-22 13:43:27] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-22 13:43:27] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-05-22 13:43:27] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-22 13:43:27] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2024-05-22 13:43:27] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-05-22 13:43:27] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-22 13:43:27] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-22 13:43:27] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-22 13:43:28] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-22 13:43:28] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-22 13:43:28] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-22 13:43:28] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-22 13:43:28] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-05-22 13:43:28] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-05-22 13:43:28] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-22 13:43:28] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 266 constraints, problems are : Problem set: 0 solved, 283 unsolved in 15102 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/524 variables, 240/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 283/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 524/524 variables, and 549 constraints, problems are : Problem set: 0 solved, 283 unsolved in 16112 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 24/24 constraints]
After SMT, in 31335ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 31337ms
Starting structural reductions in LTL mode, iteration 1 : 240/313 places, 284/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31658 ms. Remains : 240/313 places, 284/368 transitions.
[2024-05-22 13:43:52] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:43:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:43:52] [INFO ] Input system was already deterministic with 284 transitions.
[2024-05-22 13:43:52] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:43:52] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:43:52] [INFO ] Time to serialize gal into /tmp/CTLFireability7323067974860220572.gal : 1 ms
[2024-05-22 13:43:52] [INFO ] Time to serialize properties into /tmp/CTLFireability14010285885985898263.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7323067974860220572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14010285885985898263.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-22 13:44:22] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:44:22] [INFO ] Applying decomposition
[2024-05-22 13:44:22] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12705811207501628598.txt' '-o' '/tmp/graph12705811207501628598.bin' '-w' '/tmp/graph12705811207501628598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12705811207501628598.bin' '-l' '-1' '-v' '-w' '/tmp/graph12705811207501628598.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:44:22] [INFO ] Decomposing Gal with order
[2024-05-22 13:44:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:44:22] [INFO ] Removed a total of 117 redundant transitions.
[2024-05-22 13:44:22] [INFO ] Flatten gal took : 27 ms
[2024-05-22 13:44:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 2 ms.
[2024-05-22 13:44:22] [INFO ] Time to serialize gal into /tmp/CTLFireability4136971273146861685.gal : 5 ms
[2024-05-22 13:44:22] [INFO ] Time to serialize properties into /tmp/CTLFireability5122796591805476588.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4136971273146861685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5122796591805476588.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 313/313 places, 368/368 transitions.
Graph (complete) has 613 edges and 313 vertex of which 310 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 309 transition count 308
Reduce places removed 56 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 253 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 252 transition count 307
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 115 place count 252 transition count 268
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 193 place count 213 transition count 268
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 205 place count 201 transition count 254
Iterating global reduction 3 with 12 rules applied. Total rules applied 217 place count 201 transition count 254
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 226 place count 192 transition count 244
Iterating global reduction 3 with 9 rules applied. Total rules applied 235 place count 192 transition count 244
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 242 place count 185 transition count 234
Iterating global reduction 3 with 7 rules applied. Total rules applied 249 place count 185 transition count 234
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 255 place count 179 transition count 225
Iterating global reduction 3 with 6 rules applied. Total rules applied 261 place count 179 transition count 225
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 264 place count 176 transition count 222
Iterating global reduction 3 with 3 rules applied. Total rules applied 267 place count 176 transition count 222
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 317 place count 151 transition count 197
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 319 place count 149 transition count 194
Iterating global reduction 3 with 2 rules applied. Total rules applied 321 place count 149 transition count 194
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 323 place count 147 transition count 191
Iterating global reduction 3 with 2 rules applied. Total rules applied 325 place count 147 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 326 place count 146 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 327 place count 146 transition count 190
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 328 place count 146 transition count 190
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 330 place count 144 transition count 188
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 17 rules applied. Total rules applied 347 place count 143 transition count 172
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 18 rules applied. Total rules applied 365 place count 127 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 366 place count 126 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 126 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 125 transition count 169
Applied a total of 368 rules in 46 ms. Remains 125 /313 variables (removed 188) and now considering 169/368 (removed 199) transitions.
// Phase 1: matrix 169 rows 125 cols
[2024-05-22 13:44:53] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 13:44:53] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 13:44:53] [INFO ] Invariant cache hit.
[2024-05-22 13:44:53] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-22 13:44:53] [INFO ] Redundant transitions in 1 ms returned []
Running 168 sub problems to find dead transitions.
[2024-05-22 13:44:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 169/294 variables, 125/126 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 0/294 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 126 constraints, problems are : Problem set: 0 solved, 168 unsolved in 2937 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 169/294 variables, 125/126 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 168/294 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 294 constraints, problems are : Problem set: 0 solved, 168 unsolved in 3836 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
After SMT, in 6904ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 6906ms
Starting structural reductions in SI_CTL mode, iteration 1 : 125/313 places, 169/368 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7099 ms. Remains : 125/313 places, 169/368 transitions.
[2024-05-22 13:45:00] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:45:00] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:45:00] [INFO ] Input system was already deterministic with 169 transitions.
[2024-05-22 13:45:00] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:45:00] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:45:00] [INFO ] Time to serialize gal into /tmp/CTLFireability12048582903842062861.gal : 2 ms
[2024-05-22 13:45:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13568543334137347261.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12048582903842062861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13568543334137347261.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-22 13:45:30] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:45:30] [INFO ] Applying decomposition
[2024-05-22 13:45:30] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17995009139722152846.txt' '-o' '/tmp/graph17995009139722152846.bin' '-w' '/tmp/graph17995009139722152846.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17995009139722152846.bin' '-l' '-1' '-v' '-w' '/tmp/graph17995009139722152846.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:45:30] [INFO ] Decomposing Gal with order
[2024-05-22 13:45:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:45:30] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-22 13:45:30] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:45:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 6 ms.
[2024-05-22 13:45:30] [INFO ] Time to serialize gal into /tmp/CTLFireability4172688113895784947.gal : 5 ms
[2024-05-22 13:45:30] [INFO ] Time to serialize properties into /tmp/CTLFireability533883077511748551.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4172688113895784947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability533883077511748551.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.33194e+15,26.9564,881012,22290,71,1.21821e+06,1276,310,8.28442e+06,43,14095,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 368/368 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 288 transition count 342
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 288 transition count 342
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 279 transition count 331
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 279 transition count 331
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 270 transition count 321
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 270 transition count 321
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 94 place count 262 transition count 309
Iterating global reduction 0 with 8 rules applied. Total rules applied 102 place count 262 transition count 309
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 107 place count 257 transition count 304
Iterating global reduction 0 with 5 rules applied. Total rules applied 112 place count 257 transition count 304
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 115 place count 254 transition count 301
Iterating global reduction 0 with 3 rules applied. Total rules applied 118 place count 254 transition count 301
Applied a total of 118 rules in 13 ms. Remains 254 /313 variables (removed 59) and now considering 301/368 (removed 67) transitions.
// Phase 1: matrix 301 rows 254 cols
[2024-05-22 13:46:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 13:46:00] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-22 13:46:00] [INFO ] Invariant cache hit.
[2024-05-22 13:46:00] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-22 13:46:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/254 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 301/555 variables, 254/256 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-22 13:46:06] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-22 13:46:06] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2024-05-22 13:46:06] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-22 13:46:06] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2024-05-22 13:46:06] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-22 13:46:06] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2024-05-22 13:46:07] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-22 13:46:07] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-22 13:46:07] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-22 13:46:07] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-05-22 13:46:07] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-05-22 13:46:07] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-22 13:46:07] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 1 ms to minimize.
[2024-05-22 13:46:07] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-22 13:46:07] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-05-22 13:46:08] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-22 13:46:08] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-22 13:46:08] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-05-22 13:46:08] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 19/275 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 275 constraints, problems are : Problem set: 0 solved, 300 unsolved in 16212 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/254 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 301/555 variables, 254/275 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 300/575 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/555 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 575 constraints, problems are : Problem set: 0 solved, 300 unsolved in 16739 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 19/19 constraints]
After SMT, in 33056ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 33060ms
Starting structural reductions in LTL mode, iteration 1 : 254/313 places, 301/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33363 ms. Remains : 254/313 places, 301/368 transitions.
[2024-05-22 13:46:33] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:46:33] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:46:33] [INFO ] Input system was already deterministic with 301 transitions.
[2024-05-22 13:46:33] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:46:33] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:46:33] [INFO ] Time to serialize gal into /tmp/CTLFireability10472465924293841775.gal : 1 ms
[2024-05-22 13:46:33] [INFO ] Time to serialize properties into /tmp/CTLFireability5549754303090469260.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10472465924293841775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5549754303090469260.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-22 13:47:03] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:47:03] [INFO ] Applying decomposition
[2024-05-22 13:47:03] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2356320341780133015.txt' '-o' '/tmp/graph2356320341780133015.bin' '-w' '/tmp/graph2356320341780133015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2356320341780133015.bin' '-l' '-1' '-v' '-w' '/tmp/graph2356320341780133015.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:47:03] [INFO ] Decomposing Gal with order
[2024-05-22 13:47:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:47:03] [INFO ] Removed a total of 117 redundant transitions.
[2024-05-22 13:47:03] [INFO ] Flatten gal took : 22 ms
[2024-05-22 13:47:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2 ms.
[2024-05-22 13:47:03] [INFO ] Time to serialize gal into /tmp/CTLFireability3535285156311773072.gal : 2 ms
[2024-05-22 13:47:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7228714591993762233.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3535285156311773072.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7228714591993762233.ctl'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 13:55:21] [INFO ] Applying decomposition
[2024-05-22 13:55:21] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:55:21] [INFO ] Decomposing Gal with order
[2024-05-22 13:55:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:55:21] [INFO ] Removed a total of 140 redundant transitions.
[2024-05-22 13:55:21] [INFO ] Flatten gal took : 20 ms
[2024-05-22 13:55:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 1034 labels/synchronizations in 19 ms.
[2024-05-22 13:55:22] [INFO ] Time to serialize gal into /tmp/CTLFireability68435941240848440.gal : 3 ms
[2024-05-22 13:55:22] [INFO ] Time to serialize properties into /tmp/CTLFireability10613261108016958111.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability68435941240848440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10613261108016958111.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 14:13:09] [INFO ] Flatten gal took : 16 ms
[2024-05-22 14:13:09] [INFO ] Input system was already deterministic with 368 transitions.
[2024-05-22 14:13:09] [INFO ] Transformed 313 places.
[2024-05-22 14:13:09] [INFO ] Transformed 368 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 14:13:09] [INFO ] Time to serialize gal into /tmp/CTLFireability11509457708051728772.gal : 2 ms
[2024-05-22 14:13:09] [INFO ] Time to serialize properties into /tmp/CTLFireability10877347356375884974.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11509457708051728772.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10877347356375884974.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 3560069 ms.

BK_STOP 1716387859498

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-15b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-15b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631132800514"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;